{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:A6AJV26LNLAFS5HOTJBA55PXLZ","short_pith_number":"pith:A6AJV26L","schema_version":"1.0","canonical_sha256":"07809aebcb6ac05974ee9a420ef5f75e7d51f10bf74bb41a34f343def9412133","source":{"kind":"arxiv","id":"1211.2367","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1211.2367","created_at":"2026-05-18T03:41:03.617078+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.2367v1","created_at":"2026-05-18T03:41:03.617078+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2367","created_at":"2026-05-18T03:41:03.617078+00:00"},{"alias_kind":"pith_short_12","alias_value":"A6AJV26LNLAF","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"A6AJV26LNLAFS5HO","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"A6AJV26L","created_at":"2026-05-18T12:26:58.693483+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A6AJV26LNLAFS5HOTJBA55PXLZ","json":"https://pith.science/pith/A6AJV26LNLAFS5HOTJBA55PXLZ.json","graph_json":"https://pith.science/api/pith-number/A6AJV26LNLAFS5HOTJBA55PXLZ/graph.json","events_json":"https://pith.science/api/pith-number/A6AJV26LNLAFS5HOTJBA55PXLZ/events.json","paper":"https://pith.science/paper/A6AJV26L"},"agent_actions":{"view_html":"https://pith.science/pith/A6AJV26LNLAFS5HOTJBA55PXLZ","download_json":"https://pith.science/pith/A6AJV26LNLAFS5HOTJBA55PXLZ.json","view_paper":"https://pith.science/paper/A6AJV26L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.2367&json=true","fetch_graph":"https://pith.science/api/pith-number/A6AJV26LNLAFS5HOTJBA55PXLZ/graph.json","fetch_events":"https://pith.science/api/pith-number/A6AJV26LNLAFS5HOTJBA55PXLZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A6AJV26LNLAFS5HOTJBA55PXLZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A6AJV26LNLAFS5HOTJBA55PXLZ/action/storage_attestation","attest_author":"https://pith.science/pith/A6AJV26LNLAFS5HOTJBA55PXLZ/action/author_attestation","sign_citation":"https://pith.science/pith/A6AJV26LNLAFS5HOTJBA55PXLZ/action/citation_signature","submit_replication":"https://pith.science/pith/A6AJV26LNLAFS5HOTJBA55PXLZ/action/replication_record"}},"created_at":"2026-05-18T03:41:03.617078+00:00","updated_at":"2026-05-18T03:41:03.617078+00:00"}