{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3RVVLVZ5OR7CGLHZME32ZWJQDH","short_pith_number":"pith:3RVVLVZ5","canonical_record":{"source":{"id":"1405.4051","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-05-16T02:11:41Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"ced41548ea2cbd3c56ee1443f36fa70830b765ac1494d7f1ba1ba903c9c5b90c","abstract_canon_sha256":"a02c763d89a9b9c0c29f1ba43a87c35b33e55cec2da65ca70dd53be12918a760"},"schema_version":"1.0"},"canonical_sha256":"dc6b55d73d747e232cf96137acd93019fc60d6e3085cb9892dd89c4607c12a44","source":{"kind":"arxiv","id":"1405.4051","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.4051","created_at":"2026-05-18T01:37:51Z"},{"alias_kind":"arxiv_version","alias_value":"1405.4051v2","created_at":"2026-05-18T01:37:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4051","created_at":"2026-05-18T01:37:51Z"},{"alias_kind":"pith_short_12","alias_value":"3RVVLVZ5OR7C","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3RVVLVZ5OR7CGLHZ","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3RVVLVZ5","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3RVVLVZ5OR7CGLHZME32ZWJQDH","target":"record","payload":{"canonical_record":{"source":{"id":"1405.4051","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-05-16T02:11:41Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"ced41548ea2cbd3c56ee1443f36fa70830b765ac1494d7f1ba1ba903c9c5b90c","abstract_canon_sha256":"a02c763d89a9b9c0c29f1ba43a87c35b33e55cec2da65ca70dd53be12918a760"},"schema_version":"1.0"},"canonical_sha256":"dc6b55d73d747e232cf96137acd93019fc60d6e3085cb9892dd89c4607c12a44","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:51.245101Z","signature_b64":"o6L0hj4TgM1tF5cZQpjeMQpLmJSqBa9W74wqvK9oLtqVYr0TphFc13XmIY47TMuXexbC37oG/L4rcJgwO+aLBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc6b55d73d747e232cf96137acd93019fc60d6e3085cb9892dd89c4607c12a44","last_reissued_at":"2026-05-18T01:37:51.244383Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:51.244383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.4051","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-18T01:37:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PCqlLGlzeBwHMfv6wdoKqEOpgdYEbjPqw8xNt2KJ3aDDPbOUEPBSJfLcMSsxkVz4fZn9atGV+4fQFdyjwpdSDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T18:13:09.591811Z"},"content_sha256":"4908c9af9a27411e13b3638ceb5d3129189635ce8a20d5e7a9b2698b586190f1","schema_version":"1.0","event_id":"sha256:4908c9af9a27411e13b3638ceb5d3129189635ce8a20d5e7a9b2698b586190f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3RVVLVZ5OR7CGLHZME32ZWJQDH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An approximation algorithm for shortest path based on the hierarchy networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Duan-Bing Chen, Guan-nan Wang, Hui Gao, Liang-Wei Wang, Shi-nan Gong","submitted_at":"2014-05-16T02:11:41Z","abstract_excerpt":"It is a critical issue to compute the shortest paths between nodes in networks. Exact algorithms for shortest paths are usually inapplicable for large scale networks due to the high computational complexity. In this paper, we propose a novel algorithm that is applicable for large networks with high efficiency and accuracy. The basic idea of our algorithm is to iteratively construct higher level hierarchy networks by condensing the central nodes and their neighbors into super nodes until the scale of the top level network is very small. Then the algorithm approximates the distances of the short"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4051","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-18T01:37:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NHADrZRFjiS5isIJruG2F7AXj6Z+5lkNjH8/h+uXHRzxn+xZ14J0u5fFz70/IU41Cj+rwfAduAUqSPiEhrAlAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T18:13:09.592168Z"},"content_sha256":"b6021aacb7ba033055ba1905c5d0608807a7e910be9ad5c424f4337aa7db933b","schema_version":"1.0","event_id":"sha256:b6021aacb7ba033055ba1905c5d0608807a7e910be9ad5c424f4337aa7db933b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3RVVLVZ5OR7CGLHZME32ZWJQDH/bundle.json","state_url":"https://pith.science/pith/3RVVLVZ5OR7CGLHZME32ZWJQDH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3RVVLVZ5OR7CGLHZME32ZWJQDH/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-05T18:13:09Z","links":{"resolver":"https://pith.science/pith/3RVVLVZ5OR7CGLHZME32ZWJQDH","bundle":"https://pith.science/pith/3RVVLVZ5OR7CGLHZME32ZWJQDH/bundle.json","state":"https://pith.science/pith/3RVVLVZ5OR7CGLHZME32ZWJQDH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3RVVLVZ5OR7CGLHZME32ZWJQDH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3RVVLVZ5OR7CGLHZME32ZWJQDH","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":"a02c763d89a9b9c0c29f1ba43a87c35b33e55cec2da65ca70dd53be12918a760","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-05-16T02:11:41Z","title_canon_sha256":"ced41548ea2cbd3c56ee1443f36fa70830b765ac1494d7f1ba1ba903c9c5b90c"},"schema_version":"1.0","source":{"id":"1405.4051","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.4051","created_at":"2026-05-18T01:37:51Z"},{"alias_kind":"arxiv_version","alias_value":"1405.4051v2","created_at":"2026-05-18T01:37:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4051","created_at":"2026-05-18T01:37:51Z"},{"alias_kind":"pith_short_12","alias_value":"3RVVLVZ5OR7C","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3RVVLVZ5OR7CGLHZ","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3RVVLVZ5","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:b6021aacb7ba033055ba1905c5d0608807a7e910be9ad5c424f4337aa7db933b","target":"graph","created_at":"2026-05-18T01:37:51Z","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":"It is a critical issue to compute the shortest paths between nodes in networks. Exact algorithms for shortest paths are usually inapplicable for large scale networks due to the high computational complexity. In this paper, we propose a novel algorithm that is applicable for large networks with high efficiency and accuracy. The basic idea of our algorithm is to iteratively construct higher level hierarchy networks by condensing the central nodes and their neighbors into super nodes until the scale of the top level network is very small. Then the algorithm approximates the distances of the short","authors_text":"Duan-Bing Chen, Guan-nan Wang, Hui Gao, Liang-Wei Wang, Shi-nan Gong","cross_cats":["physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-05-16T02:11:41Z","title":"An approximation algorithm for shortest path based on the hierarchy networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4051","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:4908c9af9a27411e13b3638ceb5d3129189635ce8a20d5e7a9b2698b586190f1","target":"record","created_at":"2026-05-18T01:37:51Z","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":"a02c763d89a9b9c0c29f1ba43a87c35b33e55cec2da65ca70dd53be12918a760","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-05-16T02:11:41Z","title_canon_sha256":"ced41548ea2cbd3c56ee1443f36fa70830b765ac1494d7f1ba1ba903c9c5b90c"},"schema_version":"1.0","source":{"id":"1405.4051","kind":"arxiv","version":2}},"canonical_sha256":"dc6b55d73d747e232cf96137acd93019fc60d6e3085cb9892dd89c4607c12a44","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc6b55d73d747e232cf96137acd93019fc60d6e3085cb9892dd89c4607c12a44","first_computed_at":"2026-05-18T01:37:51.244383Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:51.244383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o6L0hj4TgM1tF5cZQpjeMQpLmJSqBa9W74wqvK9oLtqVYr0TphFc13XmIY47TMuXexbC37oG/L4rcJgwO+aLBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:51.245101Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.4051","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4908c9af9a27411e13b3638ceb5d3129189635ce8a20d5e7a9b2698b586190f1","sha256:b6021aacb7ba033055ba1905c5d0608807a7e910be9ad5c424f4337aa7db933b"],"state_sha256":"2647e209bfac970c1b4b603fdfdd186d550355bc0c7e688a5489a2a8a97e758a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sb7DkQ1HSYrp1O4BhDSLSRgei0+ILUJP+pR60gBdAtlR4fWXp+UmoekNnMcTd63Q1kRyWfSFwsMuMYJfp9fVBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T18:13:09.594309Z","bundle_sha256":"484645026242df7a67219d6eca30fab0627cac1db4aee65a08603729267453ec"}}