{"doi":"10.1007/bfb0015422","title":"Optimal information delivery","abstract":null,"journal":"Lecture Notes in Computer Science","year":1995,"id":40110,"datarank":1.0058955985244744,"base_score":2.5649493574615367,"endowment":2.5649493574615367,"self_citation_contribution":0.38474240361923057,"citation_network_contribution":0.6211531949052438,"self_endowment_contribution":0.38474240361923057,"citer_contribution":0.6211531949052438,"corpus_percentile":null,"corpus_rank":null,"citation_count":12,"citer_count":12,"citers_with_citation_signal":8,"citers_with_endowment":8,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":195437,"name":"Srinivas Ramanathan","orcid":null,"position":1,"is_corresponding":false},{"id":195438,"name":"P. Venkat Rangan","orcid":null,"position":2,"is_corresponding":false},{"id":195436,"name":"Christos H. Papadimitriou","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":2.5649493574615367,"endowment":2.5649493574615367,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"18998881","pmcid":null,"openalex_id":"https://openalex.org/W1583496057","authors":[],"funders":[],"total_grants":0,"fwci":0.5218,"citation_percentile":0.65451745,"influential_citations":1,"citation_trend":[{"year":2012,"count":2},{"year":2013,"count":1},{"year":2014,"count":1},{"year":2015,"count":2},{"year":2021,"count":2},{"year":2022,"count":1}],"oa_status":"closed","license":null,"oa_locations":[{"url":"http://link.springer.com/content/pdf/10.1007/BFb0015422","host_type":"publisher"},{"url":"https://doi.org/10.1007/bfb0015422","host_type":"book series"}],"fields_of_study":["Caching and Content Delivery","Peer-to-Peer Network Technologies","Complexity and Algorithms in Graphs","Mathematics","Computer Science"],"mesh_terms":[],"keywords":["Computer science","sort","Heuristic","Steiner tree problem","Mathematical optimization","Time complexity","Class (philosophy)","Tree (set theory)","Product (mathematics)","Graph","Theoretical computer science","Algorithm","Mathematics","Artificial intelligence","Combinatorics"],"sdg_mappings":[],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-12T01:28:09.554725Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}