{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NACSTWFGPEIJNMYVDVA3UEB7D4","short_pith_number":"pith:NACSTWFG","canonical_record":{"source":{"id":"1704.08445","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-27T06:17:24Z","cross_cats_sorted":[],"title_canon_sha256":"315ca03445ba9f3d2f5b15c385ba1aad9ad97aeb479f27fa2d30115eebaef113","abstract_canon_sha256":"87d432391a16d2adc14ddc4cd4b1e406226514f889a04fee9eec0421b199bf71"},"schema_version":"1.0"},"canonical_sha256":"680529d8a6791096b3151d41ba103f1f39ee8fc69f9e2b02cc1ca80c52c55b1a","source":{"kind":"arxiv","id":"1704.08445","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08445","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08445v1","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08445","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"pith_short_12","alias_value":"NACSTWFGPEIJ","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NACSTWFGPEIJNMYV","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NACSTWFG","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NACSTWFGPEIJNMYVDVA3UEB7D4","target":"record","payload":{"canonical_record":{"source":{"id":"1704.08445","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-27T06:17:24Z","cross_cats_sorted":[],"title_canon_sha256":"315ca03445ba9f3d2f5b15c385ba1aad9ad97aeb479f27fa2d30115eebaef113","abstract_canon_sha256":"87d432391a16d2adc14ddc4cd4b1e406226514f889a04fee9eec0421b199bf71"},"schema_version":"1.0"},"canonical_sha256":"680529d8a6791096b3151d41ba103f1f39ee8fc69f9e2b02cc1ca80c52c55b1a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:27.671472Z","signature_b64":"ERJW42ErZVic0IitB8pCubJBD5v3AonVYQPLyZXxxCdNNy/bEX/MXmFsr86TScizKSQ8p0ES8TzrHSkZn45vDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"680529d8a6791096b3151d41ba103f1f39ee8fc69f9e2b02cc1ca80c52c55b1a","last_reissued_at":"2026-05-18T00:45:27.670900Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:27.670900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.08445","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:45:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NPsFBETTGUYxy5QTsQDS90ZwzCam2RYXJB7Y33fYYqFiz8KwUAK0QGM49xqs1dSQL/RptNadMR7qtBu8VMltAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:01:58.590283Z"},"content_sha256":"eba77b067881974b78bd33ef62b5acd6e7d8cb94cab165891559b9b56943a54f","schema_version":"1.0","event_id":"sha256:eba77b067881974b78bd33ef62b5acd6e7d8cb94cab165891559b9b56943a54f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NACSTWFGPEIJNMYVDVA3UEB7D4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Oracles for Time-Dependent Road Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Paraskevopoulos, Christos Zaroliagis, Dorothea Wagner, Georgia Papastavrou, Spyros Kontogiannis","submitted_at":"2017-04-27T06:17:24Z","abstract_excerpt":"A novel landmark-based oracle (CFLAT) is presented, which provides earliest-arrival-time route plans in time-dependent road networks. To our knowledge, this is the first oracle that preprocesses combinatorial structures (collections of time-stamped min-travel-time-path trees) rather than travel-time functions. The preprocessed data structure is exploited by a new query algorithm (CFCA) which computes (and pays for it), apart from earliest-arrival-time estimations, the actual connecting path that preserves the theoretical approximation guarantees. To make it practical and tackle the main burden"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08445","kind":"arxiv","version":1},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:45:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"078awABQpkdKcPw7LQVScd+fErGzDOHF8HJbW8Wl5S8L68Ib72M6sZz6/iAlqaMb+/+MU9VLpqPnjcgjTwZ3DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:01:58.590712Z"},"content_sha256":"99c8b4ecade798b7f57b61214d47eb10baf52fbb5d9ff9c1c21a410d6f0d1b71","schema_version":"1.0","event_id":"sha256:99c8b4ecade798b7f57b61214d47eb10baf52fbb5d9ff9c1c21a410d6f0d1b71"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NACSTWFGPEIJNMYVDVA3UEB7D4/bundle.json","state_url":"https://pith.science/pith/NACSTWFGPEIJNMYVDVA3UEB7D4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NACSTWFGPEIJNMYVDVA3UEB7D4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T20:01:58Z","links":{"resolver":"https://pith.science/pith/NACSTWFGPEIJNMYVDVA3UEB7D4","bundle":"https://pith.science/pith/NACSTWFGPEIJNMYVDVA3UEB7D4/bundle.json","state":"https://pith.science/pith/NACSTWFGPEIJNMYVDVA3UEB7D4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NACSTWFGPEIJNMYVDVA3UEB7D4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NACSTWFGPEIJNMYVDVA3UEB7D4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"87d432391a16d2adc14ddc4cd4b1e406226514f889a04fee9eec0421b199bf71","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-27T06:17:24Z","title_canon_sha256":"315ca03445ba9f3d2f5b15c385ba1aad9ad97aeb479f27fa2d30115eebaef113"},"schema_version":"1.0","source":{"id":"1704.08445","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08445","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08445v1","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08445","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"pith_short_12","alias_value":"NACSTWFGPEIJ","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NACSTWFGPEIJNMYV","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NACSTWFG","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:99c8b4ecade798b7f57b61214d47eb10baf52fbb5d9ff9c1c21a410d6f0d1b71","target":"graph","created_at":"2026-05-18T00:45:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"A novel landmark-based oracle (CFLAT) is presented, which provides earliest-arrival-time route plans in time-dependent road networks. To our knowledge, this is the first oracle that preprocesses combinatorial structures (collections of time-stamped min-travel-time-path trees) rather than travel-time functions. The preprocessed data structure is exploited by a new query algorithm (CFCA) which computes (and pays for it), apart from earliest-arrival-time estimations, the actual connecting path that preserves the theoretical approximation guarantees. To make it practical and tackle the main burden","authors_text":"Andreas Paraskevopoulos, Christos Zaroliagis, Dorothea Wagner, Georgia Papastavrou, Spyros Kontogiannis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-27T06:17:24Z","title":"Improved Oracles for Time-Dependent Road Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08445","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:eba77b067881974b78bd33ef62b5acd6e7d8cb94cab165891559b9b56943a54f","target":"record","created_at":"2026-05-18T00:45:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"87d432391a16d2adc14ddc4cd4b1e406226514f889a04fee9eec0421b199bf71","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-27T06:17:24Z","title_canon_sha256":"315ca03445ba9f3d2f5b15c385ba1aad9ad97aeb479f27fa2d30115eebaef113"},"schema_version":"1.0","source":{"id":"1704.08445","kind":"arxiv","version":1}},"canonical_sha256":"680529d8a6791096b3151d41ba103f1f39ee8fc69f9e2b02cc1ca80c52c55b1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"680529d8a6791096b3151d41ba103f1f39ee8fc69f9e2b02cc1ca80c52c55b1a","first_computed_at":"2026-05-18T00:45:27.670900Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:27.670900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ERJW42ErZVic0IitB8pCubJBD5v3AonVYQPLyZXxxCdNNy/bEX/MXmFsr86TScizKSQ8p0ES8TzrHSkZn45vDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:27.671472Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.08445","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eba77b067881974b78bd33ef62b5acd6e7d8cb94cab165891559b9b56943a54f","sha256:99c8b4ecade798b7f57b61214d47eb10baf52fbb5d9ff9c1c21a410d6f0d1b71"],"state_sha256":"26df2f8e77eff5cf650de3670a73de7c0e8ff19767258e03c8f7db0fa82992f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xr7dtn5yeEJzg9QA2yIJA1i9lMSWX/lwlv4F0lrNLYIzzRI0Ue5beplAk82Vfcz/uGwYL3SPhjgy/vxGA6ihAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:01:58.593369Z","bundle_sha256":"086b632523c84cedf594898074b33f3813b275042a68192bcfcf84aca2edd553"}}