{"id":"https://openalex.org/W7225098978","doi":"https://doi.org/10.1137/24m1708954","title":"Path-Reporting Distance Oracles with Logarithmic Stretch and Size \\({O}\\)(\\({n}\\) \\({\\log \\log }\\) \\({n}\\))","display_name":"Path-Reporting Distance Oracles with Logarithmic Stretch and Size \\({O}\\)(\\({n}\\) \\({\\log \\log }\\) \\({n}\\))","publication_year":2026,"publication_date":"2026-11-02","ids":{"openalex":"https://openalex.org/W7225098978","doi":"https://doi.org/10.1137/24m1708954"},"language":"en","primary_location":{"id":"doi:10.1137/24m1708954","doi":"https://doi.org/10.1137/24m1708954","is_oa":false,"landing_page_url":"https://doi.org/10.1137/24m1708954","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5140276353","display_name":"Michael Elkin","orcid":"https://orcid.org/0000-0003-2034-812X","observed_orcids":["https://orcid.org/0000-0003-2034-812X"]},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Michael Elkin","raw_affiliation_strings":["Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, 84105 Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, 84105 Israel","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018191858","display_name":"Idan Ben Shabat","orcid":"https://orcid.org/0000-0002-6779-9633","observed_orcids":["https://orcid.org/0000-0002-6779-9633"]},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Idan Shabat","raw_affiliation_strings":["Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, 84105 Israel"],"raw_orcid":"https://orcid.org/0000-0002-6779-9633","affiliations":[{"raw_affiliation_string":"Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, 84105 Israel","institution_ids":["https://openalex.org/I124227911"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I124227911"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.86221885,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"55","issue":"6","first_page":"1229","last_page":"1292"},"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.9961000084877014,"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.9961000084877014,"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/T11269","display_name":"Algorithms and Data Compression","score":0.0017999999690800905,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.0006000000284984708,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/distance-oracles","display_name":"distance oracles","score":0.6800000071525574},{"id":"https://openalex.org/keywords/shortest-path-approximation","display_name":"shortest path approximation","score":0.5649999976158142},{"id":"https://openalex.org/keywords/stretching","display_name":"stretching","score":0.5249999761581421},{"id":"https://openalex.org/keywords/undirected-graphs","display_name":"undirected graphs","score":0.7839999794960022},{"id":"https://openalex.org/keywords/graph-data-structures","display_name":"graph data structures","score":0.3580000102519989}],"concepts":[{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.7092000246047974},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6438000202178955},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5340999960899353},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5205000042915344},{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.5080000162124634},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.45210000872612},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.43869999051094055},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40880000591278076},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.40849998593330383},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.352400004863739},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.34459999203681946},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.30709999799728394},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.30390000343322754},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3018999993801117},{"id":"https://openalex.org/C2780297707","wikidata":"https://www.wikidata.org/wiki/Q4895393","display_name":"Landmark","level":2,"score":0.2897999882698059},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.2874999940395355},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.28299999237060547},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.2782000005245209},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.26489999890327454}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/24m1708954","doi":"https://doi.org/10.1137/24m1708954","is_oa":false,"landing_page_url":"https://doi.org/10.1137/24m1708954","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"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":61,"referenced_works":["https://openalex.org/W326304601","https://openalex.org/W331362054","https://openalex.org/W1564010364","https://openalex.org/W1623319572","https://openalex.org/W1795575766","https://openalex.org/W1987719024","https://openalex.org/W1988067232","https://openalex.org/W1994717376","https://openalex.org/W2002296715","https://openalex.org/W2006570180","https://openalex.org/W2014255080","https://openalex.org/W2027697499","https://openalex.org/W2033607935","https://openalex.org/W2037489203","https://openalex.org/W2044124294","https://openalex.org/W2049500052","https://openalex.org/W2061507472","https://openalex.org/W2066582699","https://openalex.org/W2069572385","https://openalex.org/W2083534148","https://openalex.org/W2085630237","https://openalex.org/W2089028720","https://openalex.org/W2091208704","https://openalex.org/W2093455937","https://openalex.org/W2096304547","https://openalex.org/W2106759055","https://openalex.org/W2114493937","https://openalex.org/W2120096103","https://openalex.org/W2147391892","https://openalex.org/W2149100736","https://openalex.org/W2151021662","https://openalex.org/W2158860088","https://openalex.org/W2211624051","https://openalex.org/W2278710066","https://openalex.org/W2293001982","https://openalex.org/W2405795094","https://openalex.org/W2562627112","https://openalex.org/W2618199688","https://openalex.org/W2739606148","https://openalex.org/W2766479655","https://openalex.org/W2809995963","https://openalex.org/W2900806478","https://openalex.org/W2951064515","https://openalex.org/W2951886322","https://openalex.org/W2951926403","https://openalex.org/W2952050889","https://openalex.org/W2963983736","https://openalex.org/W3114496010","https://openalex.org/W3174348403","https://openalex.org/W3201916240","https://openalex.org/W4214935068","https://openalex.org/W4239159750","https://openalex.org/W4239180782","https://openalex.org/W4285014828","https://openalex.org/W4286500901","https://openalex.org/W4309531744","https://openalex.org/W4313227620","https://openalex.org/W4390098128","https://openalex.org/W4390098297","https://openalex.org/W4398796844","https://openalex.org/W4407354281"],"related_works":["https://openalex.org/W4398796844","https://openalex.org/W6948011784","https://openalex.org/W4298662567","https://openalex.org/W1795575766","https://openalex.org/W7163868032","https://openalex.org/W2401613505","https://openalex.org/W2184665585","https://openalex.org/W4309531744","https://openalex.org/W4415251411","https://openalex.org/W7223763142"],"abstract_inverted_index":{"Abstract.":[0],"Given":[1],"an":[2,39,85],"[Formula:":[3,8,14,28,35,40,44,50,54,59,63,66,70,88,94,146,149,153,162,167,172,175,179,183,229,243,286,289,293,321,325,331,335,339,348,356,361,366,370,373,377,381,388,392,398,421,464,468,474,480,484,492,497,501,506],"see":[4,9,15,29,36,41,45,47,51,55,60,64,67,71,89,95,147,150,154,163,168,173,176,180,184,230,244,287,290,294,322,326,332,336,340,349,357,362,367,371,374,378,382,389,393,399,422,465,469,475,481,485,493,498,502,507],"text]-vertex":[5],"undirected":[6],"graph":[7,473],"text],":[10,16,65,68,148,151,174,177,181,185,231,288,291,323,327,341,350,363,368,372,375,383,390,394,423,466,470],"and":[11,69,112,152,178,191,202,209,292,309,328,351,376,395,413,415,418,434,436,471,477,524],"a":[12,17,23,33,103,250,259,317,478,491],"parameter":[13],"path-reporting":[18,308],"distance":[19,80,93,105,255,311,450],"oracle":[20,81,160,385],"(PRDO)":[21],"is":[22,101,161,235,344,355],"data":[24],"structure":[25],"of":[26,91,116,124,132,158,242,253,266,276,411,416,432,437,448,483,532],"size":[27,157,320,343,387],"text]":[30,37,48,52,56,72,90,96,164,337,476,482,486,499,503],"that":[31,82,461],"given":[32],"query":[34,329,353,396],"returns":[38,84],"text]-approximate":[42,494],"shortest":[43],"text]-[Formula:":[46],"path":[49],"in":[53,188,258,284,303,406,455],"within":[57],"time":[58,330,354,397],"text].":[61,155,169,245,295,333,358,379,400,508],"Here":[62],"are":[73,443,512],"arbitrary":[74],"(hopefully":[75],"slowly":[76],"growing)":[77],"functions.":[78],"A":[79,107],"only":[83],"approximate":[86,449,519],"estimate":[87],"the":[92,98,117,133,239,247,267,305,409,429,516],"between":[97,307],"queried":[99],"vertices":[100],"called":[102],"non-path-reporting":[104,254,310],"oracle.":[106],"landmark":[108],"PRDO":[109,318],"[M.":[110,189],"Thorup":[111,433],"U.":[113],"Zwick,":[114],"Proceedings":[115,131,265],"33":[118],"rd":[119,527],"ACM":[120,194,271],"Symposium":[121,138,208,273,529],"on":[122,139,211,272,274,441,445,530],"Theory":[123,275],"Computing,":[125,277],"2001,":[126],"pp.":[127,143,282,537],"183\u2013192;":[128],"C.":[129],"Wulff-Nilsen,":[130],"24":[134],"th":[135,206,269],"Annual":[136,270,528],"ACM-SIAM":[137],"Discrete":[140],"Algorithms,":[141,196],"2013,":[142],"539\u2013549]":[144],"has":[145,386],"The":[156],"this":[159,297,456],"for":[165,182,338,360,462,496],"all":[166],"PRDOs":[170,410,442],"with":[171,319,500],"were":[186],"devised":[187],"Elkin":[190,412],"S.":[192],"Pettie,":[193],"Trans.":[195],"12":[197],"(2016),":[198],"50;":[199],"O.":[200],"Neiman":[201,417],"I.":[203],"Shabat,":[204],"19":[205],"Scandinavian":[207],"Workshops":[210],"Algorithm":[212],"Theory,":[213],"Schloss":[214],"Dagstuhl\u2013Leibniz-Zentrum":[215],"f\u00fcr":[216],"Informatik,":[217],"Dagstuhl,":[218],"Germany,":[219],"2024,":[220],"36].":[221],"These":[222,401,509],"oracles":[223,256],"can":[224],"be":[225],"much":[226],"sparser":[227,514],"than":[228,238,515],"but":[232],"their":[233],"stretch":[234,324,391,407],"polynomially":[236],"larger":[237],"optimal":[240],"bound":[241],"On":[246],"other":[248],"hand,":[249],"long":[251],"line":[252],"culminated":[257],"celebrated":[260],"result":[261],"by":[262],"Chechik":[263],"[":[264],"47":[268],"ACM,":[278],"New":[279],"York,":[280],"2015,":[281],"1\u201310],":[283],"which":[285,452],"In":[296,313],"paper":[298],"we":[299,315,364,453,459],"make":[300],"dramatic":[301],"progress":[302],"bridging":[304],"gap":[306],"oracles.":[312],"particular,":[314],"devise":[316,454],"As":[334],"its":[342,352],"always":[345],"at":[346],"most":[347],"Moreover,":[359],"have":[365],"i.e.,":[369],"For":[380,420],"our":[384,424],"trade-offs":[402,425],"exhibit":[403],"polynomial":[404],"improvement":[405],"over":[408],"Pettie":[414],"Shabat.":[419],"also":[426],"strictly":[427],"improve":[428],"long-standing":[430],"bounds":[431],"Zwick":[435],"Wulff-Nilsen.":[438],"Our":[439],"results":[440],"based":[444],"novel":[446],"constructions":[447],"preservers,":[451],"paper.":[457],"Specifically,":[458],"show":[460],"any":[463,467,472],"collection":[479],"vertex":[487],"pairs,":[488],"there":[489],"exists":[490],"preserver":[495],"edges,":[504],"where":[505],"new":[510],"preservers":[511,520],"significantly":[513],"previous":[517],"state-of-the-art":[518],"due":[521],"to":[522],"Kogan":[523],"Parter":[525],"[63":[526],"Foundations":[531],"Computer":[533],"Science,":[534],"IEEE,":[535],"2022,":[536],"766\u2013777].":[538]},"counts_by_year":[],"updated_date":"2026-11-06T12:05:46.655746","created_date":"2026-11-03T00:00:00"}