{"id":"https://openalex.org/W7223124394","doi":"https://doi.org/10.48550/arxiv.2610.27025","title":"A Geometric Principle for Path Selection in Directed Acyclic Graphs","display_name":"A Geometric Principle for Path Selection in Directed Acyclic Graphs","publication_year":2026,"publication_date":"2026-10-19","ids":{"openalex":"https://openalex.org/W7223124394","doi":"https://doi.org/10.48550/arxiv.2610.27025"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2610.27025","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.27025","pdf_url":"https://arxiv.org/pdf/2610.27025","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.27025","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5159145801","display_name":"Haya AlMuhanna","orcid":"https://orcid.org/0009-0004-2564-0140","observed_orcids":["https://orcid.org/0009-0004-2564-0140"]},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"AlMuhanna, Haya","raw_affiliation_strings":[". Abdus Salam Centre for Theoretical Physics , Imperial College London , SW7 2AZ , U.K",". Centre for Complexity Science , Imperial College London , SW7 2AZ , U.K"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":". Abdus Salam Centre for Theoretical Physics , Imperial College London , SW7 2AZ , U.K","institution_ids":["https://openalex.org/I47508984"]},{"raw_affiliation_string":". Centre for Complexity Science , Imperial College London , SW7 2AZ , U.K","institution_ids":["https://openalex.org/I47508984"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017807232","display_name":"Tim Evans","orcid":"https://orcid.org/0000-0003-3501-6486","observed_orcids":["https://orcid.org/0000-0003-3501-6486"]},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Evans, Tim S.","raw_affiliation_strings":[". Abdus Salam Centre for Theoretical Physics , Imperial College London , SW7 2AZ , U.K",". Centre for Complexity Science , Imperial College London , SW7 2AZ , U.K"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":". Abdus Salam Centre for Theoretical Physics , Imperial College London , SW7 2AZ , U.K","institution_ids":["https://openalex.org/I47508984"]},{"raw_affiliation_string":". Centre for Complexity Science , Imperial College London , SW7 2AZ , U.K","institution_ids":["https://openalex.org/I47508984"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I47508984"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"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.2232999950647354,"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.2232999950647354,"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/T11415","display_name":"Noncommutative and Quantum Gravity Theories","score":0.07410000264644623,"subfield":{"id":"https://openalex.org/subfields/3106","display_name":"Nuclear and High Energy Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.07190000265836716,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/directed-acyclic-graphs","display_name":"directed acyclic graphs","score":0.9710000157356262},{"id":"https://openalex.org/keywords/path-choice","display_name":"path selection","score":0.9819999933242798},{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.8059999942779541},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"longest path","score":0.9829999804496765},{"id":"https://openalex.org/keywords/geodesics","display_name":"geodesics","score":0.7300000190734863},{"id":"https://openalex.org/keywords/latent-space-geometry","display_name":"latent space geometry","score":0.7799999713897705}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8026000261306763},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.6947000026702881},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6944000124931335},{"id":"https://openalex.org/C165818556","wikidata":"https://www.wikidata.org/wiki/Q213488","display_name":"Geodesic","level":2,"score":0.5892999768257141},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5666999816894531},{"id":"https://openalex.org/C2778355321","wikidata":"https://www.wikidata.org/wiki/Q17079427","display_name":"Identity (music)","level":2,"score":0.5360999703407288},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5248000025749207},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5241000056266785},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4810999929904938},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47699999809265137},{"id":"https://openalex.org/C180645754","wikidata":"https://www.wikidata.org/wiki/Q474715","display_name":"Partially ordered set","level":2,"score":0.4016000032424927},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.38989999890327454},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3808000087738037},{"id":"https://openalex.org/C2985459651","wikidata":"https://www.wikidata.org/wiki/Q474715","display_name":"Ordered set","level":2,"score":0.3370000123977661},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.33379998803138733},{"id":"https://openalex.org/C182964748","wikidata":"https://www.wikidata.org/wiki/Q208216","display_name":"Triangle inequality","level":2,"score":0.3285999894142151},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.3215000033378601},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.26809999346733093}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2610.27025","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.27025","pdf_url":"https://arxiv.org/pdf/2610.27025","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.27025","doi":"https://doi.org/10.48550/arxiv.2610.27025","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2610.27025","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.27025","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.27025","pdf_url":"https://arxiv.org/pdf/2610.27025","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/W7223124394.pdf","grobid_xml":"https://content.openalex.org/works/W7223124394.grobid-xml"},"referenced_works_count":4,"referenced_works":["https://openalex.org/W2096613784","https://openalex.org/W4416603472","https://openalex.org/W4417448536","https://openalex.org/W7223023228"],"related_works":["https://openalex.org/W7098791888","https://openalex.org/W1998132631","https://openalex.org/W3072861727","https://openalex.org/W2112149344","https://openalex.org/W2017062872","https://openalex.org/W1539737574","https://openalex.org/W1999065981","https://openalex.org/W2188452531","https://openalex.org/W2748991007","https://openalex.org/W4401307098"],"abstract_inverted_index":{"There":[0],"are":[1],"many":[2],"types":[3],"of":[4,8,26,35,54],"path":[5,27],"between":[6],"nodes":[7],"a":[9,52,60],"Directed":[10],"acyclic":[11],"graph":[12],"(DAG),":[13],"including":[14],"the":[15,24,33,36,41,66,70,77,85,90,94,98],"shortest":[16,91],"and":[17],"longest":[18],"paths.":[19],"Here,":[20],"we":[21,48],"ask":[22],"whether":[23,65],"choice":[25],"used":[28],"in":[29,39,58],"any":[30],"analysis":[31],"reflects":[32],"geometry":[34],"latent":[37],"space":[38],"which":[40,59],"DAG":[42],"is":[43],"embedded.":[44],"To":[45],"do":[46],"this":[47],"define":[49],"L_p-cube":[50],"spacetimes,":[51],"family":[53],"continuous":[55],"ordered":[56,67,71,79,86,100],"spaces":[57],"single":[61],"parameter":[62],"p":[63],"determines":[64],"distance":[68],"satisfies":[69],"triangle":[72,80,87],"identity":[73,81,88],"when":[74,82],"p>1,":[75],"or":[76],"reverse":[78],"01,":[83],"where":[84],"holds,":[89],"paths":[92],"provide":[93],"closest":[95],"approximation":[96],"to":[97],"continuum":[99],"geodesic":[101],"while":[102],"for":[103],"0":[104]},"counts_by_year":[],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2026-10-22T00:00:00"}