{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:YY5FWWG55IG47NZN7QFUDUVPIH","short_pith_number":"pith:YY5FWWG5","canonical_record":{"source":{"id":"1201.6564","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-01-31T15:08:53Z","cross_cats_sorted":[],"title_canon_sha256":"89cf7ae6a1e3160bccf7cb144f543b39e391a1b399bd433a21f41ac2c9fc0982","abstract_canon_sha256":"eeecf092932d701805728507c6a4f29f91e5777655f1b4299305c24a9f75eeb3"},"schema_version":"1.0"},"canonical_sha256":"c63a5b58ddea0dcfb72dfc0b41d2af41c345917b0447636356bffc9698e95853","source":{"kind":"arxiv","id":"1201.6564","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.6564","created_at":"2026-05-18T04:03:31Z"},{"alias_kind":"arxiv_version","alias_value":"1201.6564v1","created_at":"2026-05-18T04:03:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.6564","created_at":"2026-05-18T04:03:31Z"},{"alias_kind":"pith_short_12","alias_value":"YY5FWWG55IG4","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"YY5FWWG55IG47NZN","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"YY5FWWG5","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:YY5FWWG55IG47NZN7QFUDUVPIH","target":"record","payload":{"canonical_record":{"source":{"id":"1201.6564","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-01-31T15:08:53Z","cross_cats_sorted":[],"title_canon_sha256":"89cf7ae6a1e3160bccf7cb144f543b39e391a1b399bd433a21f41ac2c9fc0982","abstract_canon_sha256":"eeecf092932d701805728507c6a4f29f91e5777655f1b4299305c24a9f75eeb3"},"schema_version":"1.0"},"canonical_sha256":"c63a5b58ddea0dcfb72dfc0b41d2af41c345917b0447636356bffc9698e95853","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:31.183302Z","signature_b64":"9Ahhc6OpeuRQUI5jDfqPsnicnXsUFaPlrZuuO1FUUUblY1fwpjGyRBX+uRV6+3u9c+Wke/zbndAo5opYSJQ9Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c63a5b58ddea0dcfb72dfc0b41d2af41c345917b0447636356bffc9698e95853","last_reissued_at":"2026-05-18T04:03:31.182786Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:31.182786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.6564","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-18T04:03:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1NHY9HZRR6qeGEQNcuit+6RTh6yLBJSJd0J+IWoIAoo+C7oJbZn2TW3QtnZKxlbCnbJQ0aspMa3p7yzTq3uAAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T15:21:36.365355Z"},"content_sha256":"9e1c46c4dc90989c81cc6a6a056e6bddebe26b3d155d4d3e1b120794b92861eb","schema_version":"1.0","event_id":"sha256:9e1c46c4dc90989c81cc6a6a056e6bddebe26b3d155d4d3e1b120794b92861eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:YY5FWWG55IG47NZN7QFUDUVPIH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Andy Diwen Zhu, Dingxiong Deng, Gao Cong, Lingkun Wu, Shuigeng Zhou, Xiaokui Xiao","submitted_at":"2012-01-31T15:08:53Z","abstract_excerpt":"Computing the shortest path between two given locations in a road network is an important problem that finds applications in various map services and commercial navigation products. The state-of-the-art solutions for the problem can be divided into two categories: spatial-coherence-based methods and vertex-importance-based approaches. The two categories of techniques, however, have not been compared systematically under the same experimental framework, as they were developed from two independent lines of research that do not refer to each other. This renders it difficult for a practitioner to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.6564","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-18T04:03:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aykZ5H7q1NLkaP26igj5361Ydy21xDBFG7JeX/S1XLzXZQ5p/IIwrybJ3gvWWNVerIY1njn8V8PXfc8U080lCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T15:21:36.365752Z"},"content_sha256":"e29ccbe0441dcb033109925cf2a49abe2f916e47dca59ce98b55c840a27431c3","schema_version":"1.0","event_id":"sha256:e29ccbe0441dcb033109925cf2a49abe2f916e47dca59ce98b55c840a27431c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YY5FWWG55IG47NZN7QFUDUVPIH/bundle.json","state_url":"https://pith.science/pith/YY5FWWG55IG47NZN7QFUDUVPIH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YY5FWWG55IG47NZN7QFUDUVPIH/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-29T15:21:36Z","links":{"resolver":"https://pith.science/pith/YY5FWWG55IG47NZN7QFUDUVPIH","bundle":"https://pith.science/pith/YY5FWWG55IG47NZN7QFUDUVPIH/bundle.json","state":"https://pith.science/pith/YY5FWWG55IG47NZN7QFUDUVPIH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YY5FWWG55IG47NZN7QFUDUVPIH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:YY5FWWG55IG47NZN7QFUDUVPIH","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":"eeecf092932d701805728507c6a4f29f91e5777655f1b4299305c24a9f75eeb3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-01-31T15:08:53Z","title_canon_sha256":"89cf7ae6a1e3160bccf7cb144f543b39e391a1b399bd433a21f41ac2c9fc0982"},"schema_version":"1.0","source":{"id":"1201.6564","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.6564","created_at":"2026-05-18T04:03:31Z"},{"alias_kind":"arxiv_version","alias_value":"1201.6564v1","created_at":"2026-05-18T04:03:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.6564","created_at":"2026-05-18T04:03:31Z"},{"alias_kind":"pith_short_12","alias_value":"YY5FWWG55IG4","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"YY5FWWG55IG47NZN","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"YY5FWWG5","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:e29ccbe0441dcb033109925cf2a49abe2f916e47dca59ce98b55c840a27431c3","target":"graph","created_at":"2026-05-18T04:03:31Z","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":"Computing the shortest path between two given locations in a road network is an important problem that finds applications in various map services and commercial navigation products. The state-of-the-art solutions for the problem can be divided into two categories: spatial-coherence-based methods and vertex-importance-based approaches. The two categories of techniques, however, have not been compared systematically under the same experimental framework, as they were developed from two independent lines of research that do not refer to each other. This renders it difficult for a practitioner to ","authors_text":"Andy Diwen Zhu, Dingxiong Deng, Gao Cong, Lingkun Wu, Shuigeng Zhou, Xiaokui Xiao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-01-31T15:08:53Z","title":"Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.6564","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:9e1c46c4dc90989c81cc6a6a056e6bddebe26b3d155d4d3e1b120794b92861eb","target":"record","created_at":"2026-05-18T04:03:31Z","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":"eeecf092932d701805728507c6a4f29f91e5777655f1b4299305c24a9f75eeb3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-01-31T15:08:53Z","title_canon_sha256":"89cf7ae6a1e3160bccf7cb144f543b39e391a1b399bd433a21f41ac2c9fc0982"},"schema_version":"1.0","source":{"id":"1201.6564","kind":"arxiv","version":1}},"canonical_sha256":"c63a5b58ddea0dcfb72dfc0b41d2af41c345917b0447636356bffc9698e95853","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c63a5b58ddea0dcfb72dfc0b41d2af41c345917b0447636356bffc9698e95853","first_computed_at":"2026-05-18T04:03:31.182786Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:03:31.182786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9Ahhc6OpeuRQUI5jDfqPsnicnXsUFaPlrZuuO1FUUUblY1fwpjGyRBX+uRV6+3u9c+Wke/zbndAo5opYSJQ9Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:03:31.183302Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.6564","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e1c46c4dc90989c81cc6a6a056e6bddebe26b3d155d4d3e1b120794b92861eb","sha256:e29ccbe0441dcb033109925cf2a49abe2f916e47dca59ce98b55c840a27431c3"],"state_sha256":"f43e382e694527d18f7d11048d6bd3e88e27ab4862cc0226dc554219428fe664"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dTqguLd1HAaA6ktS05yZ1AmhiEA6XqJFogxLbThCaZHSWSLbu8Pc6d60z2fvnHr8F25XYQfwwrOwFxqT2WucCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T15:21:36.367610Z","bundle_sha256":"c068a5e3b2730f5e9245426a1c351e2d7c1aa7b6c654c8e272d11fb57f3ba483"}}