{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WVDMYMVK6E3CJXGGLQEWESAS7L","short_pith_number":"pith:WVDMYMVK","canonical_record":{"source":{"id":"1510.02886","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2015-10-10T08:06:07Z","cross_cats_sorted":[],"title_canon_sha256":"d3ce21333a7a4fbac17a69a5840479ccc4a77569022d4a83b48144338a2fde16","abstract_canon_sha256":"1e2953c1ebbdd291a45e264a9476f22b984818ee36f89604f935cedd24ff7f91"},"schema_version":"1.0"},"canonical_sha256":"b546cc32aaf13624dcc65c09624812fadb119bd021ebb714cb030715820df7fa","source":{"kind":"arxiv","id":"1510.02886","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.02886","created_at":"2026-05-18T01:25:17Z"},{"alias_kind":"arxiv_version","alias_value":"1510.02886v3","created_at":"2026-05-18T01:25:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02886","created_at":"2026-05-18T01:25:17Z"},{"alias_kind":"pith_short_12","alias_value":"WVDMYMVK6E3C","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WVDMYMVK6E3CJXGG","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WVDMYMVK","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WVDMYMVK6E3CJXGGLQEWESAS7L","target":"record","payload":{"canonical_record":{"source":{"id":"1510.02886","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2015-10-10T08:06:07Z","cross_cats_sorted":[],"title_canon_sha256":"d3ce21333a7a4fbac17a69a5840479ccc4a77569022d4a83b48144338a2fde16","abstract_canon_sha256":"1e2953c1ebbdd291a45e264a9476f22b984818ee36f89604f935cedd24ff7f91"},"schema_version":"1.0"},"canonical_sha256":"b546cc32aaf13624dcc65c09624812fadb119bd021ebb714cb030715820df7fa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:17.784705Z","signature_b64":"YjHQazFjaXwOuDRY8Tr0/NR1fzma3htUwMbRs/C5WoZpwh22urzY5PPAOBzUju4NyQjQrJF8Q2zWZii93yLhCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b546cc32aaf13624dcc65c09624812fadb119bd021ebb714cb030715820df7fa","last_reissued_at":"2026-05-18T01:25:17.784000Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:17.784000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.02886","source_version":3,"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-18T01:25:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pU0yX2tpn3odysD6vIXfu9/OpI7weuMZ21VGwjFmNL79k53yCp83lhR3cHq++U7lM7uttG8Y1hPnOgAKOxnjAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:24:04.593581Z"},"content_sha256":"b4ec092fce2ee5ea1b54d2cf8bfa62eb7d4bb91c1c97b5b0f347920149d2255f","schema_version":"1.0","event_id":"sha256:b4ec092fce2ee5ea1b54d2cf8bfa62eb7d4bb91c1c97b5b0f347920149d2255f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WVDMYMVK6E3CJXGGLQEWESAS7L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient and Accurate Path Cost Estimation Using Trajectory Data","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Bin Yang, Chenjuan Guo, Christian S. Jensen, Jian Dai","submitted_at":"2015-10-10T08:06:07Z","abstract_excerpt":"Using the growing volumes of vehicle trajectory data, it becomes increasingly possible to capture time-varying and uncertain travel costs in a road network, including travel time and fuel consumption. The current paradigm represents a road network as a graph, assigns weights to the graph's edges by fragmenting trajectories into small pieces that fit the underlying edges, and then applies a routing algorithm to the resulting graph. We propose a new paradigm that targets more accurate and more efficient estimation of the costs of paths by associating weights with sub-paths in the road network. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02886","kind":"arxiv","version":3},"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-18T01:25:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B/jKbKwQn4VTt6c9gyUNKNaJ6Mri5ntq5vXQIsW1ICB3nDJirnIi/Exm04UYeuIHa76xcDfQBHglKpFwYpIxBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:24:04.593924Z"},"content_sha256":"76ac336a6bf6869938acce988d7061d20d92b719f446380c01a6cc3c9c0949de","schema_version":"1.0","event_id":"sha256:76ac336a6bf6869938acce988d7061d20d92b719f446380c01a6cc3c9c0949de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WVDMYMVK6E3CJXGGLQEWESAS7L/bundle.json","state_url":"https://pith.science/pith/WVDMYMVK6E3CJXGGLQEWESAS7L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WVDMYMVK6E3CJXGGLQEWESAS7L/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-06-04T01:24:04Z","links":{"resolver":"https://pith.science/pith/WVDMYMVK6E3CJXGGLQEWESAS7L","bundle":"https://pith.science/pith/WVDMYMVK6E3CJXGGLQEWESAS7L/bundle.json","state":"https://pith.science/pith/WVDMYMVK6E3CJXGGLQEWESAS7L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WVDMYMVK6E3CJXGGLQEWESAS7L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WVDMYMVK6E3CJXGGLQEWESAS7L","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":"1e2953c1ebbdd291a45e264a9476f22b984818ee36f89604f935cedd24ff7f91","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2015-10-10T08:06:07Z","title_canon_sha256":"d3ce21333a7a4fbac17a69a5840479ccc4a77569022d4a83b48144338a2fde16"},"schema_version":"1.0","source":{"id":"1510.02886","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.02886","created_at":"2026-05-18T01:25:17Z"},{"alias_kind":"arxiv_version","alias_value":"1510.02886v3","created_at":"2026-05-18T01:25:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02886","created_at":"2026-05-18T01:25:17Z"},{"alias_kind":"pith_short_12","alias_value":"WVDMYMVK6E3C","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WVDMYMVK6E3CJXGG","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WVDMYMVK","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:76ac336a6bf6869938acce988d7061d20d92b719f446380c01a6cc3c9c0949de","target":"graph","created_at":"2026-05-18T01:25:17Z","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":"Using the growing volumes of vehicle trajectory data, it becomes increasingly possible to capture time-varying and uncertain travel costs in a road network, including travel time and fuel consumption. The current paradigm represents a road network as a graph, assigns weights to the graph's edges by fragmenting trajectories into small pieces that fit the underlying edges, and then applies a routing algorithm to the resulting graph. We propose a new paradigm that targets more accurate and more efficient estimation of the costs of paths by associating weights with sub-paths in the road network. T","authors_text":"Bin Yang, Chenjuan Guo, Christian S. Jensen, Jian Dai","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2015-10-10T08:06:07Z","title":"Efficient and Accurate Path Cost Estimation Using Trajectory Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02886","kind":"arxiv","version":3},"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:b4ec092fce2ee5ea1b54d2cf8bfa62eb7d4bb91c1c97b5b0f347920149d2255f","target":"record","created_at":"2026-05-18T01:25:17Z","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":"1e2953c1ebbdd291a45e264a9476f22b984818ee36f89604f935cedd24ff7f91","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2015-10-10T08:06:07Z","title_canon_sha256":"d3ce21333a7a4fbac17a69a5840479ccc4a77569022d4a83b48144338a2fde16"},"schema_version":"1.0","source":{"id":"1510.02886","kind":"arxiv","version":3}},"canonical_sha256":"b546cc32aaf13624dcc65c09624812fadb119bd021ebb714cb030715820df7fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b546cc32aaf13624dcc65c09624812fadb119bd021ebb714cb030715820df7fa","first_computed_at":"2026-05-18T01:25:17.784000Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:17.784000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YjHQazFjaXwOuDRY8Tr0/NR1fzma3htUwMbRs/C5WoZpwh22urzY5PPAOBzUju4NyQjQrJF8Q2zWZii93yLhCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:17.784705Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.02886","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4ec092fce2ee5ea1b54d2cf8bfa62eb7d4bb91c1c97b5b0f347920149d2255f","sha256:76ac336a6bf6869938acce988d7061d20d92b719f446380c01a6cc3c9c0949de"],"state_sha256":"8e579d4a7456585bcd535773d76743a3edb521fb0b80c99694e5d0979078b384"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hG1iH6soOsD6XylAAhLyyCCFG6epYekbpbxbK77ZLQ0nJb0xRtacTH3L6f3snjdhm7fPpz+GFKH/etWv83a+BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T01:24:04.596072Z","bundle_sha256":"8eb767b6f7e297598225a451c8b7ff3485671acc1d08469bed78222aae65d843"}}