{"paper":{"title":"Hierarchical Time-Dependent Oracles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christos Zaroliagis, Dorothea Wagner, Spyros Kontogiannis","submitted_at":"2015-02-18T13:34:22Z","abstract_excerpt":"We study networks obeying \\emph{time-dependent} min-cost path metrics, and present novel oracles for them which \\emph{provably} achieve two unique features: % (i) \\emph{subquadratic} preprocessing time and space, \\emph{independent} of the metric's amount of disconcavity; % (ii) \\emph{sublinear} query time, in either the network size or the actual Dijkstra-Rank of the query at hand."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05222","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}