{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:A6AJV26LNLAFS5HOTJBA55PXLZ","short_pith_number":"pith:A6AJV26L","canonical_record":{"source":{"id":"1211.2367","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-11-11T01:59:11Z","cross_cats_sorted":[],"title_canon_sha256":"8133d92fa295ce57d6e0a351bea48cf072625919998719151e5114519688dedb","abstract_canon_sha256":"0fcd4f6d5c9251953a7ade6fea0bc50aa38c80963f5aa600b49ebc10e4da47e5"},"schema_version":"1.0"},"canonical_sha256":"07809aebcb6ac05974ee9a420ef5f75e7d51f10bf74bb41a34f343def9412133","source":{"kind":"arxiv","id":"1211.2367","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.2367","created_at":"2026-05-18T03:41:03Z"},{"alias_kind":"arxiv_version","alias_value":"1211.2367v1","created_at":"2026-05-18T03:41:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2367","created_at":"2026-05-18T03:41:03Z"},{"alias_kind":"pith_short_12","alias_value":"A6AJV26LNLAF","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"A6AJV26LNLAFS5HO","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"A6AJV26L","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:A6AJV26LNLAFS5HOTJBA55PXLZ","target":"record","payload":{"canonical_record":{"source":{"id":"1211.2367","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-11-11T01:59:11Z","cross_cats_sorted":[],"title_canon_sha256":"8133d92fa295ce57d6e0a351bea48cf072625919998719151e5114519688dedb","abstract_canon_sha256":"0fcd4f6d5c9251953a7ade6fea0bc50aa38c80963f5aa600b49ebc10e4da47e5"},"schema_version":"1.0"},"canonical_sha256":"07809aebcb6ac05974ee9a420ef5f75e7d51f10bf74bb41a34f343def9412133","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:03.617512Z","signature_b64":"j4Xe7482akxHZrQinwjIZWaVgNFNSgEoSVWfrL8osYZ+HmmVyp+uTXFRl/YQWysR0lFb82hORpbn8/lGcPQ6CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07809aebcb6ac05974ee9a420ef5f75e7d51f10bf74bb41a34f343def9412133","last_reissued_at":"2026-05-18T03:41:03.616979Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:03.616979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.2367","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-18T03:41:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WzklYeXVBCm8zDcWKs3MXj4b2ayTrdlHw0+XSXX5Fv4Sxq3ygVl3T4LEro0gwzCjomYIdToB7usl2LFcD/ZXAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:38:27.232727Z"},"content_sha256":"5824fb9a41233e2b3ed400dee8f5f0f18e31b839f4d3c5aea2add11210907c77","schema_version":"1.0","event_id":"sha256:5824fb9a41233e2b3ed400dee8f5f0f18e31b839f4d3c5aea2add11210907c77"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:A6AJV26LNLAFS5HOTJBA55PXLZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying on Large Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Ada Wai-chee Fu, Huanhuan Wu, James Cheng, Raymond Chi-Wing Wong, Shumo Chu","submitted_at":"2012-11-11T01:59:11Z","abstract_excerpt":"We study the problem of computing shortest path or distance between two query vertices in a graph, which has numerous important applications. Quite a number of indexes have been proposed to answer such distance queries. However, all of these indexes can only process graphs of size barely up to 1 million vertices, which is rather small in view of many of the fast-growing real-world graphs today such as social networks and Web graphs. We propose an efficient index, which is a novel labeling scheme based on the independent set of a graph. We show that our method can handle graphs of size three or"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2367","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-18T03:41:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EEa/1A/IyC8ZotYfsUslZkg6A6thXV+sxrukEv88lEQDXy2jMWT6wKOT4AnmtqGVqJdhtI28bZwRKJm/2NY9Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:38:27.233293Z"},"content_sha256":"46d2d798a0b8122e8cdd7c6e640452ceb99fee4f5b09a91b81286f689051b5a5","schema_version":"1.0","event_id":"sha256:46d2d798a0b8122e8cdd7c6e640452ceb99fee4f5b09a91b81286f689051b5a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A6AJV26LNLAFS5HOTJBA55PXLZ/bundle.json","state_url":"https://pith.science/pith/A6AJV26LNLAFS5HOTJBA55PXLZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A6AJV26LNLAFS5HOTJBA55PXLZ/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-03T02:38:27Z","links":{"resolver":"https://pith.science/pith/A6AJV26LNLAFS5HOTJBA55PXLZ","bundle":"https://pith.science/pith/A6AJV26LNLAFS5HOTJBA55PXLZ/bundle.json","state":"https://pith.science/pith/A6AJV26LNLAFS5HOTJBA55PXLZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A6AJV26LNLAFS5HOTJBA55PXLZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:A6AJV26LNLAFS5HOTJBA55PXLZ","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":"0fcd4f6d5c9251953a7ade6fea0bc50aa38c80963f5aa600b49ebc10e4da47e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-11-11T01:59:11Z","title_canon_sha256":"8133d92fa295ce57d6e0a351bea48cf072625919998719151e5114519688dedb"},"schema_version":"1.0","source":{"id":"1211.2367","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.2367","created_at":"2026-05-18T03:41:03Z"},{"alias_kind":"arxiv_version","alias_value":"1211.2367v1","created_at":"2026-05-18T03:41:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2367","created_at":"2026-05-18T03:41:03Z"},{"alias_kind":"pith_short_12","alias_value":"A6AJV26LNLAF","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"A6AJV26LNLAFS5HO","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"A6AJV26L","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:46d2d798a0b8122e8cdd7c6e640452ceb99fee4f5b09a91b81286f689051b5a5","target":"graph","created_at":"2026-05-18T03:41:03Z","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 problem of computing shortest path or distance between two query vertices in a graph, which has numerous important applications. Quite a number of indexes have been proposed to answer such distance queries. However, all of these indexes can only process graphs of size barely up to 1 million vertices, which is rather small in view of many of the fast-growing real-world graphs today such as social networks and Web graphs. We propose an efficient index, which is a novel labeling scheme based on the independent set of a graph. We show that our method can handle graphs of size three or","authors_text":"Ada Wai-chee Fu, Huanhuan Wu, James Cheng, Raymond Chi-Wing Wong, Shumo Chu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-11-11T01:59:11Z","title":"IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying on Large Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2367","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:5824fb9a41233e2b3ed400dee8f5f0f18e31b839f4d3c5aea2add11210907c77","target":"record","created_at":"2026-05-18T03:41:03Z","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":"0fcd4f6d5c9251953a7ade6fea0bc50aa38c80963f5aa600b49ebc10e4da47e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-11-11T01:59:11Z","title_canon_sha256":"8133d92fa295ce57d6e0a351bea48cf072625919998719151e5114519688dedb"},"schema_version":"1.0","source":{"id":"1211.2367","kind":"arxiv","version":1}},"canonical_sha256":"07809aebcb6ac05974ee9a420ef5f75e7d51f10bf74bb41a34f343def9412133","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"07809aebcb6ac05974ee9a420ef5f75e7d51f10bf74bb41a34f343def9412133","first_computed_at":"2026-05-18T03:41:03.616979Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:03.616979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j4Xe7482akxHZrQinwjIZWaVgNFNSgEoSVWfrL8osYZ+HmmVyp+uTXFRl/YQWysR0lFb82hORpbn8/lGcPQ6CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:03.617512Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.2367","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5824fb9a41233e2b3ed400dee8f5f0f18e31b839f4d3c5aea2add11210907c77","sha256:46d2d798a0b8122e8cdd7c6e640452ceb99fee4f5b09a91b81286f689051b5a5"],"state_sha256":"f43fba8cc7108e5054d3c3364315579ffe96c8be3b9e613d7a628cc16f88a3bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jj3+n+7dtjaIZK9t/q+4tjM5QpeDJMEzC7dVPQ95qNgI5SRu4JYB3r7V2DsXdr2ffdYM+IsfhQv82xpw+S9wCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:38:27.236094Z","bundle_sha256":"65406f0545465a3d2bed30723d006eccb099938685b3ff48bc9feace04572edb"}}