{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:P57BJRP7MT7CXYUUEC2XLYGZNG","short_pith_number":"pith:P57BJRP7","schema_version":"1.0","canonical_sha256":"7f7e14c5ff64fe2be29420b575e0d969a46fe6eda8ee8bb28473bd754b4d2ab4","source":{"kind":"arxiv","id":"1502.05222","version":4},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1502.05222","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-18T13:34:22Z","cross_cats_sorted":[],"title_canon_sha256":"36b59634df6a0c72ffa55ee25af129288df09cea2efb245dc8c006bccd195b9c","abstract_canon_sha256":"3e29c87330cd087580aa7a5d9885ef9d50f8227740c1bf9ab30c566faaf02416"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:38.785647Z","signature_b64":"q9FjoZI8iI6Vvg7Nl6edSemmKdJY4u45a/hsbcZy4FYlsHolzN7B1aDep33mqF76mVP6zFnM/6+BGcLIfQB/Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f7e14c5ff64fe2be29420b575e0d969a46fe6eda8ee8bb28473bd754b4d2ab4","last_reissued_at":"2026-05-18T01:11:38.785254Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:38.785254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1502.05222","created_at":"2026-05-18T01:11:38.785322+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.05222v4","created_at":"2026-05-18T01:11:38.785322+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05222","created_at":"2026-05-18T01:11:38.785322+00:00"},{"alias_kind":"pith_short_12","alias_value":"P57BJRP7MT7C","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"P57BJRP7MT7CXYUU","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"P57BJRP7","created_at":"2026-05-18T12:29:34.919912+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P57BJRP7MT7CXYUUEC2XLYGZNG","json":"https://pith.science/pith/P57BJRP7MT7CXYUUEC2XLYGZNG.json","graph_json":"https://pith.science/api/pith-number/P57BJRP7MT7CXYUUEC2XLYGZNG/graph.json","events_json":"https://pith.science/api/pith-number/P57BJRP7MT7CXYUUEC2XLYGZNG/events.json","paper":"https://pith.science/paper/P57BJRP7"},"agent_actions":{"view_html":"https://pith.science/pith/P57BJRP7MT7CXYUUEC2XLYGZNG","download_json":"https://pith.science/pith/P57BJRP7MT7CXYUUEC2XLYGZNG.json","view_paper":"https://pith.science/paper/P57BJRP7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.05222&json=true","fetch_graph":"https://pith.science/api/pith-number/P57BJRP7MT7CXYUUEC2XLYGZNG/graph.json","fetch_events":"https://pith.science/api/pith-number/P57BJRP7MT7CXYUUEC2XLYGZNG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P57BJRP7MT7CXYUUEC2XLYGZNG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P57BJRP7MT7CXYUUEC2XLYGZNG/action/storage_attestation","attest_author":"https://pith.science/pith/P57BJRP7MT7CXYUUEC2XLYGZNG/action/author_attestation","sign_citation":"https://pith.science/pith/P57BJRP7MT7CXYUUEC2XLYGZNG/action/citation_signature","submit_replication":"https://pith.science/pith/P57BJRP7MT7CXYUUEC2XLYGZNG/action/replication_record"}},"created_at":"2026-05-18T01:11:38.785322+00:00","updated_at":"2026-05-18T01:11:38.785322+00:00"}