{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VHK6JDKPJUXBECBVLA6UUAZBW3","short_pith_number":"pith:VHK6JDKP","canonical_record":{"source":{"id":"1606.06636","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-21T16:12:29Z","cross_cats_sorted":[],"title_canon_sha256":"555313204ff9188f67d9daae3a6ee7f06d7e3e7aced2f67a64651861270fe535","abstract_canon_sha256":"1b4f5b77b9c2781e422ac036ec4e3bdb73c87103f37db16567a11a2cc68d0097"},"schema_version":"1.0"},"canonical_sha256":"a9d5e48d4f4d2e120835583d4a0321b6c3a0de848f25b01db175816178586584","source":{"kind":"arxiv","id":"1606.06636","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.06636","created_at":"2026-05-18T00:41:12Z"},{"alias_kind":"arxiv_version","alias_value":"1606.06636v2","created_at":"2026-05-18T00:41:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06636","created_at":"2026-05-18T00:41:12Z"},{"alias_kind":"pith_short_12","alias_value":"VHK6JDKPJUXB","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VHK6JDKPJUXBECBV","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VHK6JDKP","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VHK6JDKPJUXBECBVLA6UUAZBW3","target":"record","payload":{"canonical_record":{"source":{"id":"1606.06636","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-21T16:12:29Z","cross_cats_sorted":[],"title_canon_sha256":"555313204ff9188f67d9daae3a6ee7f06d7e3e7aced2f67a64651861270fe535","abstract_canon_sha256":"1b4f5b77b9c2781e422ac036ec4e3bdb73c87103f37db16567a11a2cc68d0097"},"schema_version":"1.0"},"canonical_sha256":"a9d5e48d4f4d2e120835583d4a0321b6c3a0de848f25b01db175816178586584","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:12.958878Z","signature_b64":"OijE2xmxy+6LMaqT3sSQB2ngmW4HhZKIrNuWgkkT7IoJajx4YirwJqA3U66oOuxOnoXEbcWCFpih8z7KOUYjDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9d5e48d4f4d2e120835583d4a0321b6c3a0de848f25b01db175816178586584","last_reissued_at":"2026-05-18T00:41:12.958087Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:12.958087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.06636","source_version":2,"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:41:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ha8N4MYVt7Goqjzl7TOTUWtIVvww1mi3h4IMEchw83u/9W3c2pv3STgwxMFIcFR2wbE/UZ1uqUVonG71X7sXAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:00:43.462495Z"},"content_sha256":"5d11ad43c7f4a81563695918658af0bf35ee3e0db5b19dd64891f0ed770f52b3","schema_version":"1.0","event_id":"sha256:5d11ad43c7f4a81563695918658af0bf35ee3e0db5b19dd64891f0ed770f52b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VHK6JDKPJUXBECBVLA6UUAZBW3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Intriguingly Simple and Efficient Time-Dependent Routing in Road Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ben Strasser","submitted_at":"2016-06-21T16:12:29Z","abstract_excerpt":"We study the earliest arrival problem in road networks with static time-dependent functions as arc weights. We propose and evaluate the following simple algorithm: (1) average the travel time in k time windows, (2) compute a shortest time-independent path within each window and mark the edges in these paths, and (3) compute a shortest time-dependent path in the original graph restricted to the marked edges. Our experimental evaluation shows that this simple algorithm yields near optimal results on well-established benchmark instances. We additionally demonstrate that the error can be further r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06636","kind":"arxiv","version":2},"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:41:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IzZeskkraVxwJ4PgZLWk+y+Y2WfrLP7ahyXIydwKbQ8WpMHEFfcWP7+/RLjh/2uZYx0IGMbnqszJiccO+jNJCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:00:43.462838Z"},"content_sha256":"d30c75e1bd15f4ff7af46bf5ff5cb2e3f62c58ba5ae114b32ad5e019a479a2da","schema_version":"1.0","event_id":"sha256:d30c75e1bd15f4ff7af46bf5ff5cb2e3f62c58ba5ae114b32ad5e019a479a2da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VHK6JDKPJUXBECBVLA6UUAZBW3/bundle.json","state_url":"https://pith.science/pith/VHK6JDKPJUXBECBVLA6UUAZBW3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VHK6JDKPJUXBECBVLA6UUAZBW3/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-30T15:00:43Z","links":{"resolver":"https://pith.science/pith/VHK6JDKPJUXBECBVLA6UUAZBW3","bundle":"https://pith.science/pith/VHK6JDKPJUXBECBVLA6UUAZBW3/bundle.json","state":"https://pith.science/pith/VHK6JDKPJUXBECBVLA6UUAZBW3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VHK6JDKPJUXBECBVLA6UUAZBW3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VHK6JDKPJUXBECBVLA6UUAZBW3","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":"1b4f5b77b9c2781e422ac036ec4e3bdb73c87103f37db16567a11a2cc68d0097","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-21T16:12:29Z","title_canon_sha256":"555313204ff9188f67d9daae3a6ee7f06d7e3e7aced2f67a64651861270fe535"},"schema_version":"1.0","source":{"id":"1606.06636","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.06636","created_at":"2026-05-18T00:41:12Z"},{"alias_kind":"arxiv_version","alias_value":"1606.06636v2","created_at":"2026-05-18T00:41:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06636","created_at":"2026-05-18T00:41:12Z"},{"alias_kind":"pith_short_12","alias_value":"VHK6JDKPJUXB","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VHK6JDKPJUXBECBV","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VHK6JDKP","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:d30c75e1bd15f4ff7af46bf5ff5cb2e3f62c58ba5ae114b32ad5e019a479a2da","target":"graph","created_at":"2026-05-18T00:41:12Z","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":"We study the earliest arrival problem in road networks with static time-dependent functions as arc weights. We propose and evaluate the following simple algorithm: (1) average the travel time in k time windows, (2) compute a shortest time-independent path within each window and mark the edges in these paths, and (3) compute a shortest time-dependent path in the original graph restricted to the marked edges. Our experimental evaluation shows that this simple algorithm yields near optimal results on well-established benchmark instances. We additionally demonstrate that the error can be further r","authors_text":"Ben Strasser","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-21T16:12:29Z","title":"Intriguingly Simple and Efficient Time-Dependent Routing in Road Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06636","kind":"arxiv","version":2},"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:5d11ad43c7f4a81563695918658af0bf35ee3e0db5b19dd64891f0ed770f52b3","target":"record","created_at":"2026-05-18T00:41:12Z","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":"1b4f5b77b9c2781e422ac036ec4e3bdb73c87103f37db16567a11a2cc68d0097","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-21T16:12:29Z","title_canon_sha256":"555313204ff9188f67d9daae3a6ee7f06d7e3e7aced2f67a64651861270fe535"},"schema_version":"1.0","source":{"id":"1606.06636","kind":"arxiv","version":2}},"canonical_sha256":"a9d5e48d4f4d2e120835583d4a0321b6c3a0de848f25b01db175816178586584","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9d5e48d4f4d2e120835583d4a0321b6c3a0de848f25b01db175816178586584","first_computed_at":"2026-05-18T00:41:12.958087Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:12.958087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OijE2xmxy+6LMaqT3sSQB2ngmW4HhZKIrNuWgkkT7IoJajx4YirwJqA3U66oOuxOnoXEbcWCFpih8z7KOUYjDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:12.958878Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.06636","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d11ad43c7f4a81563695918658af0bf35ee3e0db5b19dd64891f0ed770f52b3","sha256:d30c75e1bd15f4ff7af46bf5ff5cb2e3f62c58ba5ae114b32ad5e019a479a2da"],"state_sha256":"2d2d48de660bf18a82cde0d737d0b536d0e3d3ed093ff4f1b8c2618e72c0d25e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ekHisNRnphchyALWH6d1qJfMW/gGeXnByKnD2YTf5N938V8l6BW8a+J+PYNQwVaZ4Q2a2UWPXgbjhyCHvOMtDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T15:00:43.464896Z","bundle_sha256":"918691df79ad7aae699a683e0d4f03c97b290f9188d89bf2b3496f29a1762680"}}