{"id":"https://openalex.org/W7158459793","doi":"https://doi.org/10.48550/arxiv.2604.26451","title":"Path-Reporting Distance Oracles for Vertex-Labeled Graphs","display_name":"Path-Reporting Distance Oracles for Vertex-Labeled Graphs","publication_year":2026,"publication_date":"2026-04-29","ids":{"openalex":"https://openalex.org/W7158459793","doi":"https://doi.org/10.48550/arxiv.2604.26451"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.26451","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.26451","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,"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"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.26451","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066182501","display_name":"Ofer Neiman","orcid":"https://orcid.org/0000-0003-4179-4364"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Neiman, Ofer","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5134918769","display_name":"Alon Spector","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Spector, Alon","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"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.444599986076355,"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.444599986076355,"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/T11106","display_name":"Data Management and Algorithms","score":0.20010000467300415,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.06549999862909317,"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/oracle","display_name":"Oracle","score":0.8817999958992004},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6237000226974487},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48750001192092896},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4578999876976013},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.38760000467300415},{"id":"https://openalex.org/keywords/distance-measures","display_name":"Distance measures","score":0.38350000977516174},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.3190999925136566},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3041999936103821}],"concepts":[{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.8817999958992004},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6237000226974487},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5709999799728394},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5327000021934509},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48750001192092896},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4578999876976013},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.38760000467300415},{"id":"https://openalex.org/C2639959","wikidata":"https://www.wikidata.org/wiki/Q1344778","display_name":"Distance measures","level":2,"score":0.38350000977516174},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35580000281333923},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3321000039577484},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.3190999925136566},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3041999936103821},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.3009999990463257},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3003000020980835},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.29840001463890076},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.2955999970436096},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2784999907016754},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.2768000066280365},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.27390000224113464},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.26809999346733093},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.2500999867916107}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.26451","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.26451","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,"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":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.26451","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.26451","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,"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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Let":[0],"$G=(V,E)$":[1],"be":[2],"a":[3,14,57,80,83,137,164,192,202,249],"weighted":[4],"undirected":[5],"graph,":[6],"with":[7,23,41,141,253],"$n$":[8],"vertices.":[9],"A":[10,27,89],"distance":[11,21,92,112,139,196,251],"oracle":[12,40,53,140,214,252],"is":[13,78,162,174],"data":[15],"structure":[16],"that":[17,129],"can":[18,54],"quickly":[19],"answer":[20],"queries,":[22],"some":[24],"stretch":[25,42,142,161,206,216,232,254],"factor.":[26],"seminal":[28],"work":[29],"of":[30,86,96,119,166,201,240],"\\cite{TZ01},":[31,171],"given":[32,79],"an":[33,39],"integer":[34,132],"$k\\ge":[35],"1$,":[36,134],"provides":[37],"such":[38],"$2k-1$,":[43,236,255],"query":[44,144,218,244,256],"time":[45,145,219,257],"$O(k)$,":[46,146,220],"and":[47,103,147,172,184,207,221,260],"size":[48,87,148,222,261],"$O(k\\cdot":[49,149,262],"n^{1+1/k})$.":[50],"Furthermore,":[51],"this":[52,67,182],"also":[55],"report":[56],"path":[58],"in":[59,74,127,170,181,205],"$G$":[60],"corresponding":[61],"to":[62,115,229,233],"the":[63,97,111,116,186,199,231,234,238,243],"returned":[64],"distance.":[65],"In":[66],"paper":[68],"we":[69,190,226,247],"focus":[70],"on":[71],"vertex-labeled":[72],"graphs,":[73],"which":[75],"each":[76],"vertex":[77,118],"label":[81,120],"from":[82,113,156],"set":[84],"$L$":[85],"$\\ell$.":[88],"{\\em":[90,193],"vertex-label":[91,138,195,250],"oracle}":[93],"answers":[94],"queries":[95],"form":[98],"$(v,\u03bb)$,":[99],"where":[100],"$v\\in":[101],"V$":[102],"$\u03bb\\in":[104],"L$,":[105],"by":[106],"reporting":[107],"(an":[108],"approximation":[109],"to)":[110],"$v$":[114],"closest":[117],"$\u03bb$.":[121],"Following":[122],"\\cite{HLWY11},":[123],"it":[124,173],"was":[125],"shown":[126],"\\cite{C12}":[128],"for":[130],"any":[131,210],"$k>":[133],"there":[135],"exists":[136],"$4k-5$,":[143],"n\\cdot":[150,263],"\\ell^{1/k})$.":[151,224,264],"This":[152],"state-of-the-art":[153],"result":[154],"suffers":[155],"two":[157],"main":[158],"drawbacks:":[159],"The":[160],"roughly":[163],"factor":[165],"2":[167],"larger":[168],"than":[169],"not":[175],"path-reporting.":[176],"We":[177],"address":[178],"these":[179],"concerns":[180],"work,":[183],"provide":[185],"following":[187],"results:":[188],"First,":[189],"devise":[191,248],"path-reporting}":[194],"oracle,":[197],"at":[198,237],"cost":[200,239],"slight":[203],"increase":[204],"size.":[208],"For":[209],"constant":[211],"$0<\u03b5<1$,":[212],"our":[213],"has":[215],"$(4k-5)\\cdot(1+\u03b5)$,":[217],"$O(n^{1+o(1)}\\cdot":[223],"Second,":[225],"show":[227],"how":[228],"improve":[230],"optimal":[235],"mildly":[241],"increasing":[242],"time.":[245],"Specifically,":[246],"$O(\\ell^{1/k}\\cdot\\log":[258],"n)$,":[259],"\\end{itemize}":[265]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-01T00:00:00"}