{"id":"https://openalex.org/W7220935724","doi":"https://doi.org/10.48550/arxiv.2610.10108","title":"The Multiple Unicast Conjecture is False","display_name":"The Multiple Unicast Conjecture is False","publication_year":2026,"publication_date":"2026-10-07","ids":{"openalex":"https://openalex.org/W7220935724","doi":"https://doi.org/10.48550/arxiv.2610.10108"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2610.10108","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.10108","pdf_url":"https://arxiv.org/pdf/2610.10108","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2610.10108","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042816355","display_name":"Mark Braverman","orcid":"https://orcid.org/0000-0003-1276-6081","observed_orcids":["https://orcid.org/0000-0003-1276-6081"]},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Braverman, Mark","raw_affiliation_strings":["Princeton University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025271123","display_name":"Zhongtian He","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"He, Zhongtian","raw_affiliation_strings":["Princeton University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.7271000146865845,"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.7271000146865845,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.24879999458789825,"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/T11130","display_name":"Coding theory and cryptography","score":0.0019000000320374966,"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/network-coding","display_name":"network coding","score":0.8949999809265137},{"id":"https://openalex.org/keywords/multi-commodity-flow","display_name":"multicommodity flow","score":0.9390000104904175},{"id":"https://openalex.org/keywords/linear-network-codes","display_name":"linear network codes","score":0.8550000190734863},{"id":"https://openalex.org/keywords/finite-fields","display_name":"finite fields","score":0.6759999990463257},{"id":"https://openalex.org/keywords/projective-geometry","display_name":"projective geometry","score":0.7200000286102295},{"id":"https://openalex.org/keywords/bipartite-graphs","display_name":"bipartite graphs","score":0.8880000114440918},{"id":"https://openalex.org/keywords/error-correcting-codes","display_name":"error-correcting codes","score":0.8429999947547913},{"id":"https://openalex.org/keywords/edge-orientation","display_name":"edge orientation","score":0.5860000252723694}],"concepts":[{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.7002000212669373},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6255999803543091},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.614300012588501},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5828999876976013},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.5692999958992004},{"id":"https://openalex.org/C11704745","wikidata":"https://www.wikidata.org/wiki/Q918337","display_name":"Unicast","level":3,"score":0.5626000165939331},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5496000051498413},{"id":"https://openalex.org/C85847156","wikidata":"https://www.wikidata.org/wiki/Q59015987","display_name":"Verifiable secret sharing","level":3,"score":0.46880000829696655},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46540001034736633},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44339999556541443},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.38679999113082886},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.367000013589859},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3569999933242798},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.32019999623298645},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.3034000098705292},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3021000027656555},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.29089999198913574},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.28040000796318054},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.27709999680519104},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.2669999897480011},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.2624000012874603},{"id":"https://openalex.org/C94284585","wikidata":"https://www.wikidata.org/wiki/Q228184","display_name":"Random oracle","level":4,"score":0.26170000433921814},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.25619998574256897},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.25459998846054077},{"id":"https://openalex.org/C140031139","wikidata":"https://www.wikidata.org/wiki/Q79897","display_name":"Morse code","level":2,"score":0.2502000033855438}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2610.10108","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.10108","pdf_url":"https://arxiv.org/pdf/2610.10108","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},{"id":"doi:10.48550/arxiv.2610.10108","doi":"https://doi.org/10.48550/arxiv.2610.10108","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2610.10108","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2610.10108","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.10108","pdf_url":"https://arxiv.org/pdf/2610.10108","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7220935724.pdf","grobid_xml":"https://content.openalex.org/works/W7220935724.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7201876233","https://openalex.org/W2767454305","https://openalex.org/W7099305401","https://openalex.org/W1978601678","https://openalex.org/W2184311183","https://openalex.org/W7101032332","https://openalex.org/W2062185918","https://openalex.org/W148846283","https://openalex.org/W7128633577","https://openalex.org/W7220975269"],"abstract_inverted_index":{"The":[0,41],"undirected":[1,76],"multiple-unicast":[2,77],"conjecture":[3,19],"[LL04]":[4],"asserts":[5],"that":[6],"network":[7,25,94],"coding":[8,50,80,95],"offers":[9],"no":[10],"throughput":[11],"advantage":[12],"over":[13,27],"multicommodity":[14,58],"flow.":[15],"We":[16,87],"refute":[17],"this":[18,71,142],"by":[20],"constructing":[21],"a":[22,30,73,90,127,132,145],"deterministic":[23],"linear":[24],"code":[26,118,147],"$\\mathbb{F}_9$":[28],"on":[29,97,112,131],"182-vertex":[31],"bipartite":[32],"subgraph":[33],"of":[34,39,75,93,108,120,135],"the":[35,67,113],"point-line":[36],"incidence":[37],"graph":[38,115],"$\\mathrm{PG}(2,9)$.":[40],"construction":[42,104],"supports":[43],"$157$":[44],"independent":[45,109],"unicast":[46],"sessions":[47],"at":[48,52,63],"common":[49,61],"rate":[51,62],"least":[53],"$1$,":[54],"while":[55],"every":[56],"fractional":[57],"flow":[59],"has":[60],"most":[64],"$147/157$.":[65],"By":[66],"amplification":[68],"theorem":[69],"of~[BGS17],":[70],"yields":[72],"family":[74],"instances":[78],"with":[79],"gap":[81],"$\u03a9((\\log":[82],"n)^\\varepsilon)$":[83],"for":[84],"some":[85],"$\\varepsilon>0$.":[86],"also":[88],"introduce":[89],"nondeterministic":[91,128],"model":[92],"based":[96,130],"locally":[98],"verifiable":[99],"certificates,":[100],"which":[101],"guides":[102],"our":[103],"and":[105,116,139,152],"may":[106],"be":[107],"interest.":[110],"Building":[111],"high-girth":[114],"error-correcting":[117],"framework":[119],"[BH25],":[121],"we":[122],"use":[123],"GPT-6":[124],"to":[125],"find":[126],"counterexample":[129],"new":[133],"choice":[134],"Reed--Solomon":[136],"local":[137,153],"codes,":[138],"then":[140],"convert":[141],"example":[143],"into":[144],"causal":[146],"using":[148],"an":[149],"edge":[150],"orientation":[151],"search.":[154]},"counts_by_year":[{"year":2026,"cited_by_count":5}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2026-10-09T00:00:00"}