{"id":"https://openalex.org/W2083323175","doi":"https://doi.org/10.1137/11085178x","title":"Distributed Verification and Hardness of Distributed Approximation","display_name":"Distributed Verification and Hardness of Distributed Approximation","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2083323175","doi":"https://doi.org/10.1137/11085178x","mag":"2083323175"},"language":"en","primary_location":{"id":"doi:10.1137/11085178x","doi":"https://doi.org/10.1137/11085178x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/11085178x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["ccf-a","cwts-core","dongbi-a","jufo-3","norway-2","poland-200","russia-white-list-1"],"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"volume":null,"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://dr.ntu.edu.sg/bitstream/10356/98003/1/100.%20Distributed%20verification%20and%20hardness%20of.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5113577071","display_name":"Atish Das Sarma","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4210150719","display_name":"eBay (United States)","ror":"https://ror.org/05cnabr44","country_code":"US","type":"company","lineage":["https://openalex.org/I4210150719"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Atish Das Sarma","raw_affiliation_strings":["eBay Research Labs, eBay Inc., San Jose, CA 95125"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"eBay Research Labs, eBay Inc., San Jose, CA 95125","institution_ids":["https://openalex.org/I4210150719"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089872124","display_name":"Stephan Holzer","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]},{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]},{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]},{"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":["CH","IL","SG","US"],"is_corresponding":false,"raw_author_name":"Stephan Holzer","raw_affiliation_strings":["Computer Distributed Computing Group, ETH Zurich, CH-8092 Zurich, Switzerland","Department of Computer Science and Applied Mathematics, The Weizmann Institute of Science, Rehovot, 76100 Israel","Department of Computer Science, Brown University, Providence, RI 02912","Division of Mathematical Sciences, Nanyang Technological University, Singapore 637371, and"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Distributed Computing Group, ETH Zurich, CH-8092 Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]},{"raw_affiliation_string":"Department of Computer Science and Applied Mathematics, The Weizmann Institute of Science, Rehovot, 76100 Israel","institution_ids":["https://openalex.org/I53964585"]},{"raw_affiliation_string":"Department of Computer Science, Brown University, Providence, RI 02912","institution_ids":["https://openalex.org/I27804330"]},{"raw_affiliation_string":"Division of Mathematical Sciences, Nanyang Technological University, Singapore 637371, and","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035241967","display_name":"Liah Kor","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]},{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]},{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]},{"id":"https://openalex.org/I4210094115","display_name":"Laboratoire d'Informatique Algorithmique: Fondements et Applications","ror":"https://ror.org/00pbqgm18","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I204730241","https://openalex.org/I40434647","https://openalex.org/I4210094115","https://openalex.org/I4210124654","https://openalex.org/I4210159245","https://openalex.org/I48825208"]},{"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":["CH","FR","IL","SG","US"],"is_corresponding":false,"raw_author_name":"Liah Kor","raw_affiliation_strings":["CNRS and LIAFA, Univ. Paris 7, Paris, France","Computer Distributed Computing Group, ETH Zurich, CH-8092 Zurich, Switzerland","Department of Computer Science and Applied Mathematics, The Weizmann Institute of Science, Rehovot, 76100 Israel","Department of Computer Science, Brown University, Providence, RI 02912","Division of Mathematical Sciences, Nanyang Technological University, Singapore 637371, and"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CNRS and LIAFA, Univ. Paris 7, Paris, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210094115"]},{"raw_affiliation_string":"Computer Distributed Computing Group, ETH Zurich, CH-8092 Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]},{"raw_affiliation_string":"Department of Computer Science and Applied Mathematics, The Weizmann Institute of Science, Rehovot, 76100 Israel","institution_ids":["https://openalex.org/I53964585"]},{"raw_affiliation_string":"Department of Computer Science, Brown University, Providence, RI 02912","institution_ids":["https://openalex.org/I27804330"]},{"raw_affiliation_string":"Division of Mathematical Sciences, Nanyang Technological University, Singapore 637371, and","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040995971","display_name":"Amos Korman","orcid":"https://orcid.org/0000-0001-8652-9228","observed_orcids":["https://orcid.org/0000-0001-8652-9228"]},"institutions":[{"id":"https://openalex.org/I129774422","display_name":"University of Vienna","ror":"https://ror.org/03prydq77","country_code":"AT","type":"education","lineage":["https://openalex.org/I129774422"]},{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]},{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["AT","SG","US"],"is_corresponding":false,"raw_author_name":"Amos Korman","raw_affiliation_strings":["Georgia Institute of Tech-nology","Nanyang Technological University, Singapore","Theory and Applications of Algorithms Research Group, University of Vienna, 1090-Vienna, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgia Institute of Tech-nology","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"Nanyang Technological University, Singapore","institution_ids":["https://openalex.org/I172675005"]},{"raw_affiliation_string":"Theory and Applications of Algorithms Research Group, University of Vienna, 1090-Vienna, Austria","institution_ids":["https://openalex.org/I129774422"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074369690","display_name":"Danupon Nanongkai","orcid":"https://orcid.org/0000-0003-4468-2675","observed_orcids":["https://orcid.org/0000-0003-4468-2675"]},"institutions":[{"id":"https://openalex.org/I129774422","display_name":"University of Vienna","ror":"https://ror.org/03prydq77","country_code":"AT","type":"education","lineage":["https://openalex.org/I129774422"]},{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]},{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["AT","SG","US"],"is_corresponding":false,"raw_author_name":"Danupon Nanongkai","raw_affiliation_strings":["Georgia Institute of Tech-nology","Nanyang Technological University, Singapore","Theory and Applications of Algorithms Research Group, University of Vienna, 1090-Vienna, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgia Institute of Tech-nology","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"Nanyang Technological University, Singapore","institution_ids":["https://openalex.org/I172675005"]},{"raw_affiliation_string":"Theory and Applications of Algorithms Research Group, University of Vienna, 1090-Vienna, Austria","institution_ids":["https://openalex.org/I129774422"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089574654","display_name":"Gopal Pandurangan","orcid":"https://orcid.org/0000-0001-5833-6592","observed_orcids":["https://orcid.org/0000-0001-5833-6592"]},"institutions":[{"id":"https://openalex.org/I129774422","display_name":"University of Vienna","ror":"https://ror.org/03prydq77","country_code":"AT","type":"education","lineage":["https://openalex.org/I129774422"]},{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]},{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["AT","SG","US"],"is_corresponding":false,"raw_author_name":"Gopal Pandurangan","raw_affiliation_strings":["Georgia Institute of Tech-nology","Nanyang Technological University, Singapore","Theory and Applications of Algorithms Research Group, University of Vienna, 1090-Vienna, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgia Institute of Tech-nology","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"Nanyang Technological University, Singapore","institution_ids":["https://openalex.org/I172675005"]},{"raw_affiliation_string":"Theory and Applications of Algorithms Research Group, University of Vienna, 1090-Vienna, Austria","institution_ids":["https://openalex.org/I129774422"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056419022","display_name":"David Peleg","orcid":"https://orcid.org/0000-0003-1590-0506","observed_orcids":["https://orcid.org/0000-0003-1590-0506"]},"institutions":[{"id":"https://openalex.org/I129774422","display_name":"University of Vienna","ror":"https://ror.org/03prydq77","country_code":"AT","type":"education","lineage":["https://openalex.org/I129774422"]},{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]},{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["AT","SG","US"],"is_corresponding":false,"raw_author_name":"David Peleg","raw_affiliation_strings":["Georgia Institute of Tech-nology","Nanyang Technological University, Singapore","Theory and Applications of Algorithms Research Group, University of Vienna, 1090-Vienna, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgia Institute of Tech-nology","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"Nanyang Technological University, Singapore","institution_ids":["https://openalex.org/I172675005"]},{"raw_affiliation_string":"Theory and Applications of Algorithms Research Group, University of Vienna, 1090-Vienna, Austria","institution_ids":["https://openalex.org/I129774422"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078339613","display_name":"Roger P. Wattenhofer","orcid":"https://orcid.org/0000-0002-6339-3134","observed_orcids":["https://orcid.org/0000-0002-6339-3134"]},"institutions":[{"id":"https://openalex.org/I129774422","display_name":"University of Vienna","ror":"https://ror.org/03prydq77","country_code":"AT","type":"education","lineage":["https://openalex.org/I129774422"]},{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]},{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["AT","SG","US"],"is_corresponding":false,"raw_author_name":"Roger Wattenhofer","raw_affiliation_strings":["Georgia Institute of Tech-nology","Nanyang Technological University, Singapore","Theory and Applications of Algorithms Research Group, University of Vienna, 1090-Vienna, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgia Institute of Tech-nology","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"Nanyang Technological University, Singapore","institution_ids":["https://openalex.org/I172675005"]},{"raw_affiliation_string":"Theory and Applications of Algorithms Research Group, University of Vienna, 1090-Vienna, Austria","institution_ids":["https://openalex.org/I129774422"]}]}],"institutions":[],"countries_distinct_count":6,"institutions_distinct_count":9,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":15.951,"has_fulltext":true,"cited_by_count":210,"citation_normalized_percentile":{"value":0.9942888,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"41","issue":"5","first_page":"1235","last_page":"1265"},"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.9994999766349792,"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.9994999766349792,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.0,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.0,"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/distributed-verification","display_name":"distributed verification","score":0.9959999918937683},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"hardness of approximation","score":0.7559999823570251},{"id":"https://openalex.org/keywords/time-complexity-lower-bounds","display_name":"time complexity lower bounds","score":0.7250000238418579},{"id":"https://openalex.org/keywords/distributed-approximation","display_name":"distributed approximation","score":0.5490000247955322},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"minimum spanning tree","score":0.7940000295639038},{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.9179999828338623},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"minimum cut","score":0.9919999837875366},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"communication complexity","score":0.9449999928474426},{"id":"https://openalex.org/keywords/distributed-algorithms","display_name":"distributed algorithms","score":0.3720000088214874},{"id":"https://openalex.org/keywords/round-complexity","display_name":"round complexity","score":0.4659999907016754}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6508314609527588},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.6410967707633972},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5949974060058594},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5415241718292236},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5374681353569031},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5371758341789246},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5275575518608093},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5001771450042725},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4920503497123718},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.44442206621170044},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4265124201774597},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4199278652667999},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.41861197352409363},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4057462513446808},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33139902353286743},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.18220245838165283},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.18040159344673157},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/11085178x","doi":"https://doi.org/10.1137/11085178x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/11085178x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["ccf-a","cwts-core","dongbi-a","jufo-3","norway-2","poland-200","russia-white-list-1"],"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:dr.ntu.edu.sg:10356/98003","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/10220/10914","pdf_url":"https://dr.ntu.edu.sg/bitstream/10356/98003/1/100.%20Distributed%20verification%20and%20hardness%20of.pdf","source":{"id":"https://openalex.org/S4306402609","display_name":"DR-NTU (Nanyang Technological University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I172675005","host_organization_name":"Nanyang Technological University","host_organization_lineage":["https://openalex.org/I172675005"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Journal Article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.710.6046","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.710.6046","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.liafa.univ-paris-diderot.fr/%7Epandit/dist-verification-STOC.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.754.3453","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.754.3453","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1011.3049.pdf","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:dr.ntu.edu.sg:10356/98003","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/10220/10914","pdf_url":"https://dr.ntu.edu.sg/bitstream/10356/98003/1/100.%20Distributed%20verification%20and%20hardness%20of.pdf","source":{"id":"https://openalex.org/S4306402609","display_name":"DR-NTU (Nanyang Technological University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I172675005","host_organization_name":"Nanyang Technological University","host_organization_lineage":["https://openalex.org/I172675005"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Journal Article"},"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G383181037","display_name":null,"funder_award_id":"M58110000","funder_id":"https://openalex.org/F4320320766","funder_display_name":"Nanyang Technological University"},{"id":"https://openalex.org/G5269744458","display_name":"Efficient Distributed Approximation Algorithms","funder_award_id":"1023166","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320313934","display_name":"Institut national de recherche en informatique et en automatique (INRIA)","ror":"https://ror.org/02kvxyf05"},{"id":"https://openalex.org/F4320320766","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302"},{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"},{"id":"https://openalex.org/F4320320950","display_name":"United States-Israel Binational Science Foundation","ror":"https://ror.org/00j8z2m73"},{"id":"https://openalex.org/F4320322724","display_name":"Ministry of Education, India","ror":"https://ror.org/048xjjh50"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2083323175.pdf","grobid_xml":"https://content.openalex.org/works/W2083323175.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W1534484868","https://openalex.org/W1965996575","https://openalex.org/W1975832752","https://openalex.org/W1980223785","https://openalex.org/W1984090926","https://openalex.org/W1987669032","https://openalex.org/W2015819397","https://openalex.org/W2023425290","https://openalex.org/W2023658462","https://openalex.org/W2030982625","https://openalex.org/W2032607682","https://openalex.org/W2054910423","https://openalex.org/W2070486524","https://openalex.org/W2095409339","https://openalex.org/W2100061495","https://openalex.org/W2107917944","https://openalex.org/W2151757686","https://openalex.org/W2163097371","https://openalex.org/W2174446922","https://openalex.org/W3138832177"],"related_works":["https://openalex.org/W2367195720","https://openalex.org/W1968497507","https://openalex.org/W1998126097","https://openalex.org/W1980288485","https://openalex.org/W2009976792","https://openalex.org/W2004321562","https://openalex.org/W3184075718","https://openalex.org/W328736688","https://openalex.org/W2995411114","https://openalex.org/W2404561224"],"abstract_inverted_index":{"We":[0,34,72,141],"study":[1,109],"the":[2,59,62,67,95,120,156,181,211,231,272,302],"verification":[3,78,91,112,125],"problem":[4],"in":[5,32,79,148,300],"distributed":[6,85,100,111,124,159,191,262,292,309],"networks,":[7],"stated":[8],"as":[9,94,132,228,230],"follows.":[10],"Let":[11],"$H$":[12,40,65],"be":[13,260,298],"a":[14,17,48,80,84,107],"subgraph":[15],"of":[16,23,61,90,97,99,110,123,145,158,177,204,214,217,238,305,311],"network":[18],"$G$":[19,24],"where":[20],"each":[21],"vertex":[22],"knows":[25,57],"which":[26,294],"edges":[27],"incident":[28],"on":[29,119,155],"it":[30,46,52],"are":[31,180],"$H$.":[33],"would":[35,73],"like":[36,74],"to":[37,75,297],"verify":[38],"whether":[39,64],"has":[41,66],"some":[42],"properties,":[43],"e.g.,":[44],"if":[45,51],"is":[47,53,92,268],"tree":[49,169],"or":[50,70],"connected":[54,135],"(every":[55],"node":[56],"at":[58],"end":[60],"process":[63],"specified":[68],"property":[69],"not).":[71],"perform":[76],"this":[77,103],"decentralized":[81],"fashion":[82],"via":[83],"algorithm.":[86],"The":[87],"time":[88,122,152,303],"complexity":[89,290,304],"measured":[93],"number":[96],"rounds":[98],"communication.":[101],"In":[102],"paper":[104],"we":[105],"initiate":[106],"systematic":[108],"and":[113,137,173,189,193,208,240,244,291,307],"give":[114],"almost":[115],"tight":[116],"lower":[117,153,184,202,232,281],"bounds":[118,154,185],"running":[121],"algorithms":[126],"for":[127,161,186,234,265,276],"many":[128,162,312],"fundamental":[129],"problems":[130,165],"such":[131],"connectivity,":[133],"spanning":[134,168],"subgraph,":[136],"$s$-$t$":[138],"cut":[139],"verification.":[140],"then":[142],"show":[143,284],"applications":[144],"these":[146,178],"results":[147,179],"deriving":[149],"strong":[150],"unconditional":[151,201],"hardness":[157,213],"approximation":[160,215,263,278],"classical":[163],"optimization":[164],"including":[166],"minimum":[167,174],"(MST),":[170],"shortest":[171],"paths,":[172],"cut.":[175],"Many":[176],"first":[182],"nontrivial":[183],"both":[187],"exact":[188,274,306],"approximate":[190,308],"computation,":[192],"they":[194],"resolve":[195],"previous":[196,212],"open":[197],"questions.":[198],"Moreover,":[199],"our":[200],"bound":[203,216,233,282],"approximating":[205],"MST":[206,236,266],"subsumes":[207],"improves":[209],"upon":[210],"Elkin":[218],"[M.":[219],"Elkin,":[220],"SIAM":[221,247],"J.":[222,248],"Comput.,":[223,249],"36":[224],"(2006),":[225],"pp.":[226,252],"433--456]":[227],"well":[229],"(exact)":[235],"computation":[237,310],"Peleg":[239,243],"Rubinovich":[241],"[D.":[242],"V.":[245],"Rubinovich,":[246],"30":[250],"(2000),":[251],"1427--1442].":[253],"Our":[254,280],"result":[255],"implies":[256],"that":[257,267],"there":[258],"can":[259],"no":[261],"algorithm":[264,275],"significantly":[269],"faster":[270],"than":[271],"current":[273],"any":[277],"factor.":[279],"proofs":[283],"an":[285],"interesting":[286],"connection":[287],"between":[288],"communication":[289],"computing":[293],"turns":[295],"out":[296],"useful":[299],"establishing":[301],"problems.":[313]},"counts_by_year":[{"year":2026,"cited_by_count":6},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":11},{"year":2022,"cited_by_count":11},{"year":2021,"cited_by_count":21},{"year":2020,"cited_by_count":25},{"year":2019,"cited_by_count":16},{"year":2018,"cited_by_count":20},{"year":2017,"cited_by_count":16},{"year":2016,"cited_by_count":20},{"year":2015,"cited_by_count":16},{"year":2014,"cited_by_count":14},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":7}],"updated_date":"2026-10-12T09:40:04.860316","created_date":"2025-10-10T00:00:00"}