{"id":"https://openalex.org/W2107282727","doi":"https://doi.org/10.1145/2484239.2484262","title":"Efficient distributed source detection with limited bandwidth","display_name":"Efficient distributed source detection with limited bandwidth","publication_year":2013,"publication_date":"2013-07-16","ids":{"openalex":"https://openalex.org/W2107282727","doi":"https://doi.org/10.1145/2484239.2484262","mag":"2107282727"},"language":"en","primary_location":{"id":"doi:10.1145/2484239.2484262","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2484239.2484262","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2013 ACM symposium on Principles of distributed computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006005471","display_name":"Christoph Lenzen","orcid":"https://orcid.org/0000-0002-3290-0674"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Christoph Lenzen","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA","Massachusetts Institute of Technology; ,; Cambridge MA USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Massachusetts Institute of Technology; ,; Cambridge MA USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056419022","display_name":"David Peleg","orcid":"https://orcid.org/0000-0003-1590-0506"},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"David Peleg","raw_affiliation_strings":["Weizmann Institute of Science, Rehovot, Israel"],"affiliations":[{"raw_affiliation_string":"Weizmann Institute of Science, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5006005471"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":8.8764,"has_fulltext":false,"cited_by_count":76,"citation_normalized_percentile":{"value":0.98291572,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"375","last_page":"382"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/lexicographical-order","display_name":"Lexicographical order","score":0.7350070476531982},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7029434442520142},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5742796063423157},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5358983278274536},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.485157310962677},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4683489203453064},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43990641832351685},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4247778058052063},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32273855805397034},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.10498091578483582}],"concepts":[{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.7350070476531982},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7029434442520142},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5742796063423157},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5358983278274536},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.485157310962677},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4683489203453064},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43990641832351685},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4247778058052063},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32273855805397034},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.10498091578483582},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2484239.2484262","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2484239.2484262","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2013 ACM symposium on Principles of distributed computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.375.4765","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.375.4765","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://groups.csail.mit.edu/tds/papers/Lenzen/LP13efficient.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.686.1134","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.686.1134","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.mpi-inf.mpg.de/%7Eclenzen/pubs/LP13efficient.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W147275194","https://openalex.org/W1564010364","https://openalex.org/W1568961751","https://openalex.org/W1582638066","https://openalex.org/W1606169264","https://openalex.org/W1917184511","https://openalex.org/W1987669032","https://openalex.org/W1988067232","https://openalex.org/W2020965855","https://openalex.org/W2033698604","https://openalex.org/W2034680223","https://openalex.org/W2042333226","https://openalex.org/W2045446569","https://openalex.org/W2048098617","https://openalex.org/W2052504823","https://openalex.org/W2061073017","https://openalex.org/W2099237198","https://openalex.org/W2112702616","https://openalex.org/W2118483642","https://openalex.org/W2118775860","https://openalex.org/W2124284012","https://openalex.org/W2156047991","https://openalex.org/W2157760787","https://openalex.org/W2221370457","https://openalex.org/W3098618783","https://openalex.org/W4214510568","https://openalex.org/W7014275985"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1993634787","https://openalex.org/W3125614403","https://openalex.org/W4400317913","https://openalex.org/W2476923378","https://openalex.org/W2486717996","https://openalex.org/W2775050868","https://openalex.org/W2897343264","https://openalex.org/W4289376717","https://openalex.org/W1985727224"],"abstract_inverted_index":{"Given":[0],"a":[1,6,108,125],"simple":[2],"graph":[3],"G=(V,E)":[4],"and":[5,121],"set":[7],"of":[8,26,57,62,86,98,119],"sources":[9],"S":[10,105],"\u2286":[11],"V,":[12],"denote":[13],"for":[14,60],"each":[15,48,101],"node":[16,49,136],"\u03bd":[17],"\u03b5":[18],"V":[19],"by":[20],"L\u03bd(\u221e)":[21,58,72],"the":[22,41,53,95,116],"lexicographically":[23],"ordered":[24],"list":[25],"distance/source":[27],"pairs":[28],"(d(s,v),s),":[29],"where":[30],"s":[31,103],"\u2208":[32,37,71,104],"S.":[33],"For":[34,93],"integers":[35],"d,k":[36],"N\u222a{\u221e},":[38],"we":[39],"consider":[40],"source":[42,102],"detection,":[43],"or":[44,67],"(S,d,k)-detection":[45],"task,":[46],"requiring":[47],"v":[50],"to":[51,80,106],"learn":[52],"first":[54],"k":[55,132],"entries":[56,69],"(if":[59],"all":[61,68],"them":[63],"d(s,v)":[64,75],"\u2264":[65,76],"d)":[66],"(d(s,v),s)":[70],"satisfying":[73],"that":[74],"d":[77],"(otherwise).":[78],"Solutions":[79],"this":[81],"problem":[82],"provide":[83],"natural":[84],"generalizations":[85],"concurrent":[87],"breadth-first":[88],"search":[89],"(BFS)":[90],"tree":[91,111,128],"constructions.":[92],"example,":[94],"special":[96,117],"case":[97,118],"k=\u221e":[99],"requires":[100,123],"build":[107],"complete":[109],"BFS":[110,127],"rooted":[112],"at":[113,130],"s,":[114],"whereas":[115],"d=\u221e":[120],"S=V":[122],"constructing":[124],"partial":[126],"comprising":[129],"least":[131],"nodes":[133],"from":[134],"every":[135],"in":[137],"V.":[138]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":15},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":11},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":6}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}
