{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CUXSU6JPJWAAFUURF3W2QFTYUN","short_pith_number":"pith:CUXSU6JP","canonical_record":{"source":{"id":"1602.01537","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-02-04T02:02:05Z","cross_cats_sorted":[],"title_canon_sha256":"5ea3f4249d181aee757a4a6fa2e92113123856796a310d7f1e09fd3c922a2403","abstract_canon_sha256":"f3a30ff22d11634e59a7204fe371770a4c744472e626f778805433dffb81e764"},"schema_version":"1.0"},"canonical_sha256":"152f2a792f4d8002d2912eeda81678a353be31c5297d32b1b57d4b7bbf719241","source":{"kind":"arxiv","id":"1602.01537","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01537","created_at":"2026-05-18T00:55:58Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01537v2","created_at":"2026-05-18T00:55:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01537","created_at":"2026-05-18T00:55:58Z"},{"alias_kind":"pith_short_12","alias_value":"CUXSU6JPJWAA","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CUXSU6JPJWAAFUUR","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CUXSU6JP","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CUXSU6JPJWAAFUURF3W2QFTYUN","target":"record","payload":{"canonical_record":{"source":{"id":"1602.01537","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-02-04T02:02:05Z","cross_cats_sorted":[],"title_canon_sha256":"5ea3f4249d181aee757a4a6fa2e92113123856796a310d7f1e09fd3c922a2403","abstract_canon_sha256":"f3a30ff22d11634e59a7204fe371770a4c744472e626f778805433dffb81e764"},"schema_version":"1.0"},"canonical_sha256":"152f2a792f4d8002d2912eeda81678a353be31c5297d32b1b57d4b7bbf719241","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:58.308423Z","signature_b64":"YwkzY1ORO5Y4T8YF59sMttAOIE+zl/cysX4nFD8rSZmJgnSIXNPua1zhpTrv43miNT1l+wu6nzxmVDA78PUuDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"152f2a792f4d8002d2912eeda81678a353be31c5297d32b1b57d4b7bbf719241","last_reissued_at":"2026-05-18T00:55:58.308016Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:58.308016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.01537","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-18T00:55:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mjRn/FHugkwf2uV8furF8uEOmWmFA+6wPwww8GaM302IqZxbXzUViu/0XbV+TauFtkHXI6bGlpiXwgaX9hl2DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:16:57.644512Z"},"content_sha256":"2bae05743d76aa02957cc2f6f709cc9e31b4f198f160ae2916641abea0bd61aa","schema_version":"1.0","event_id":"sha256:2bae05743d76aa02957cc2f6f709cc9e31b4f198f160ae2916641abea0bd61aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CUXSU6JPJWAAFUURF3W2QFTYUN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"TopCom: Index for Shortest Distance Query in Directed Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Mohammad Al Hasan, Vachik S. Dave","submitted_at":"2016-02-04T02:02:05Z","abstract_excerpt":"Finding shortest distance between two vertices in a graph is an important problem due to its numerous applications in diverse domains, including geo-spatial databases, social network analysis, and information retrieval. Classical algorithms (such as, Dijkstra) solve this problem in polynomial time, but these algorithms cannot provide real-time response for a large number of bursty queries on a large graph. So, indexing based solutions that pre-process the graph for efficiently answering (exactly or approximately) a large number of distance queries in real-time is becoming increasingly popular."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01537","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-18T00:55:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bsObFDwktDeWkY5q+dzH6HqoL9qoRPS7ZzBPfooc24HLlUn/HrsN5ms14gilDmCTQ+uDejKGuIxRW+qg3aGpCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:16:57.644942Z"},"content_sha256":"be4059154a3af5b89933ef99e986b3dc9e716ca47f177aabef7cc20b466a0a39","schema_version":"1.0","event_id":"sha256:be4059154a3af5b89933ef99e986b3dc9e716ca47f177aabef7cc20b466a0a39"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CUXSU6JPJWAAFUURF3W2QFTYUN/bundle.json","state_url":"https://pith.science/pith/CUXSU6JPJWAAFUURF3W2QFTYUN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CUXSU6JPJWAAFUURF3W2QFTYUN/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-05-28T04:16:57Z","links":{"resolver":"https://pith.science/pith/CUXSU6JPJWAAFUURF3W2QFTYUN","bundle":"https://pith.science/pith/CUXSU6JPJWAAFUURF3W2QFTYUN/bundle.json","state":"https://pith.science/pith/CUXSU6JPJWAAFUURF3W2QFTYUN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CUXSU6JPJWAAFUURF3W2QFTYUN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CUXSU6JPJWAAFUURF3W2QFTYUN","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":"f3a30ff22d11634e59a7204fe371770a4c744472e626f778805433dffb81e764","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-02-04T02:02:05Z","title_canon_sha256":"5ea3f4249d181aee757a4a6fa2e92113123856796a310d7f1e09fd3c922a2403"},"schema_version":"1.0","source":{"id":"1602.01537","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01537","created_at":"2026-05-18T00:55:58Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01537v2","created_at":"2026-05-18T00:55:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01537","created_at":"2026-05-18T00:55:58Z"},{"alias_kind":"pith_short_12","alias_value":"CUXSU6JPJWAA","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CUXSU6JPJWAAFUUR","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CUXSU6JP","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:be4059154a3af5b89933ef99e986b3dc9e716ca47f177aabef7cc20b466a0a39","target":"graph","created_at":"2026-05-18T00:55:58Z","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":"Finding shortest distance between two vertices in a graph is an important problem due to its numerous applications in diverse domains, including geo-spatial databases, social network analysis, and information retrieval. Classical algorithms (such as, Dijkstra) solve this problem in polynomial time, but these algorithms cannot provide real-time response for a large number of bursty queries on a large graph. So, indexing based solutions that pre-process the graph for efficiently answering (exactly or approximately) a large number of distance queries in real-time is becoming increasingly popular.","authors_text":"Mohammad Al Hasan, Vachik S. Dave","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-02-04T02:02:05Z","title":"TopCom: Index for Shortest Distance Query in Directed Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01537","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:2bae05743d76aa02957cc2f6f709cc9e31b4f198f160ae2916641abea0bd61aa","target":"record","created_at":"2026-05-18T00:55:58Z","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":"f3a30ff22d11634e59a7204fe371770a4c744472e626f778805433dffb81e764","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-02-04T02:02:05Z","title_canon_sha256":"5ea3f4249d181aee757a4a6fa2e92113123856796a310d7f1e09fd3c922a2403"},"schema_version":"1.0","source":{"id":"1602.01537","kind":"arxiv","version":2}},"canonical_sha256":"152f2a792f4d8002d2912eeda81678a353be31c5297d32b1b57d4b7bbf719241","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"152f2a792f4d8002d2912eeda81678a353be31c5297d32b1b57d4b7bbf719241","first_computed_at":"2026-05-18T00:55:58.308016Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:58.308016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YwkzY1ORO5Y4T8YF59sMttAOIE+zl/cysX4nFD8rSZmJgnSIXNPua1zhpTrv43miNT1l+wu6nzxmVDA78PUuDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:58.308423Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.01537","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2bae05743d76aa02957cc2f6f709cc9e31b4f198f160ae2916641abea0bd61aa","sha256:be4059154a3af5b89933ef99e986b3dc9e716ca47f177aabef7cc20b466a0a39"],"state_sha256":"3b599199d5c1af28ad9917e9371c0a517d2339f0d7ed3371eafe38d3712e4ef1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r2Tx8bCS9gGC2BSM9ILYOA4GPa7HnG5V5sp9LYLsAshhzJfOo6YpXo+FFEJ8wrwCrcl4AcwxH5s9HEYj8PWjAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T04:16:57.647143Z","bundle_sha256":"4d5d5f4a19e53b92b8b156faf5b0a7918bd289a2b55ddabf55556bc9247ec8dc"}}