{"id":"https://openalex.org/W2036123557","doi":"https://doi.org/10.1145/2462356.2492436","title":"On the 2-sum embedding conjecture","display_name":"On the 2-sum embedding conjecture","publication_year":2013,"publication_date":"2013-06-17","ids":{"openalex":"https://openalex.org/W2036123557","doi":"https://doi.org/10.1145/2462356.2492436","mag":"2036123557"},"language":"en","primary_location":{"id":"doi:10.1145/2462356.2492436","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2462356.2492436","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-ninth annual symposium on Computational geometry","raw_type":"proceedings-article"},"type":"conference-paper","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/A5021177674","display_name":"James R. Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"James R. Lee","raw_affiliation_strings":["University of Washington, Seattle, WA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Washington, Seattle, WA, USA","institution_ids":["https://openalex.org/I201448701"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089582982","display_name":"Daniel E. Poore","orcid":null},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel E. Poore","raw_affiliation_strings":["University of Washington, Seattle, WA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Washington, Seattle, WA, USA","institution_ids":["https://openalex.org/I201448701"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I201448701"],"apc_list":null,"apc_paid":null,"fwci":0.2723,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.44986877,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"197","last_page":"206"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9926000237464905,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.7382957339286804},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.703740119934082},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6931691765785217},{"id":"https://openalex.org/keywords/lipschitz-continuity","display_name":"Lipschitz continuity","score":0.6841787099838257},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.6239371299743652},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.550261378288269},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5419491529464722},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.5136929750442505},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5043524503707886},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.4682534635066986},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.46432676911354065},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.44803568720817566},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.24185854196548462},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.18608710169792175},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.12307566404342651},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06912058591842651}],"concepts":[{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.7382957339286804},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.703740119934082},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6931691765785217},{"id":"https://openalex.org/C22324862","wikidata":"https://www.wikidata.org/wiki/Q652707","display_name":"Lipschitz continuity","level":2,"score":0.6841787099838257},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.6239371299743652},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.550261378288269},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5419491529464722},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.5136929750442505},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5043524503707886},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4682534635066986},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.46432676911354065},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.44803568720817566},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.24185854196548462},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.18608710169792175},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.12307566404342651},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06912058591842651},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2462356.2492436","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2462356.2492436","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-ninth annual symposium on Computational geometry","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.4099999964237213}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W48861618","https://openalex.org/W1902724346","https://openalex.org/W1971339801","https://openalex.org/W2002531683","https://openalex.org/W2007806267","https://openalex.org/W2017713020","https://openalex.org/W2063491776","https://openalex.org/W2076164610","https://openalex.org/W2098492709","https://openalex.org/W2102797665","https://openalex.org/W2107881198","https://openalex.org/W2120013535","https://openalex.org/W2141793995","https://openalex.org/W2146728909","https://openalex.org/W2150148016","https://openalex.org/W2176446742","https://openalex.org/W2952158803","https://openalex.org/W4213060883"],"related_works":["https://openalex.org/W3185235544","https://openalex.org/W4297791327","https://openalex.org/W2897842840","https://openalex.org/W2911623553","https://openalex.org/W2397777611","https://openalex.org/W1502031429","https://openalex.org/W2318923278","https://openalex.org/W2417585376","https://openalex.org/W1994157709","https://openalex.org/W2797811993"],"abstract_inverted_index":{"The":[0,43],"2-sum":[1],"embedding":[2,24],"conjecture":[3],"(Lee-Sidiropoulos,":[4],"FOCS":[5],"2009)":[6],"states":[7],"that":[8],"all":[9],"the":[10,31,36,64],"shortest-path":[11],"metrics":[12],"supported":[13],"on":[14],"a":[15,21,59],"family":[16],"of":[17,38,51,67,70],"graphs":[18,71],"F":[19,39],"admit":[20,72],"uniformly":[22],"bi-Lipschitz":[23],"into":[25],"L1":[26],"if":[27,30],"and":[28,55],"only":[29],"same":[32],"property":[33],"holds":[34],"for":[35],"closure":[37],"under":[40],"edge":[41],"sums.":[42],"problem":[44],"has":[45],"an":[46,73],"equivalent":[47],"formulation":[48],"in":[49,62],"terms":[50],"multi-commodity":[52,75],"flow/cut":[53],"gaps":[54],"appears":[56],"to":[57],"be":[58],"fundamental":[60],"step":[61],"resolving":[63],"well-studied":[65],"question":[66],"which":[68],"families":[69],"approximate":[74],"max-flow/min-cut":[76],"theorem.":[77]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}