{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:WNCR4VRL2MVRRGSWHCIA46A4QY","short_pith_number":"pith:WNCR4VRL","canonical_record":{"source":{"id":"1208.0090","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T03:55:46Z","cross_cats_sorted":[],"title_canon_sha256":"e887355ed8142e2449ca5e019b85c17f975b278cb2ba1099168e8cfdbbe611e9","abstract_canon_sha256":"e78fe6fa00aa00efe8bf41192e4b2b88937215a8fcf4816a17cab29d1c46f037"},"schema_version":"1.0"},"canonical_sha256":"b3451e562bd32b189a5638900e781c8608fe3806b265d059ac992d5f69bf9b74","source":{"kind":"arxiv","id":"1208.0090","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.0090","created_at":"2026-05-18T03:49:44Z"},{"alias_kind":"arxiv_version","alias_value":"1208.0090v1","created_at":"2026-05-18T03:49:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0090","created_at":"2026-05-18T03:49:44Z"},{"alias_kind":"pith_short_12","alias_value":"WNCR4VRL2MVR","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WNCR4VRL2MVRRGSW","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WNCR4VRL","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:WNCR4VRL2MVRRGSWHCIA46A4QY","target":"record","payload":{"canonical_record":{"source":{"id":"1208.0090","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T03:55:46Z","cross_cats_sorted":[],"title_canon_sha256":"e887355ed8142e2449ca5e019b85c17f975b278cb2ba1099168e8cfdbbe611e9","abstract_canon_sha256":"e78fe6fa00aa00efe8bf41192e4b2b88937215a8fcf4816a17cab29d1c46f037"},"schema_version":"1.0"},"canonical_sha256":"b3451e562bd32b189a5638900e781c8608fe3806b265d059ac992d5f69bf9b74","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:44.957631Z","signature_b64":"rW5SuGmg+H2wuScPwO2DRnnyuHuAMFjO4Pr4YschFX9j9iITg+ArdFJPzg3oWQmolGwh83CJaB28FgRJpin5BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3451e562bd32b189a5638900e781c8608fe3806b265d059ac992d5f69bf9b74","last_reissued_at":"2026-05-18T03:49:44.956901Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:44.956901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.0090","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:49:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V8REJl3u5DvPQrWJjv25LrC5kGShhtGbp+H1YiBK7Uvj0TD9rr9FHkp9Nc1pU+WOZSJwXVrAdVKQvWF5a7yQAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:17:30.761227Z"},"content_sha256":"64ce5cfed266c4446cde79ee30eda6ae250d3e4c83fe63c35f77e8f8b6e76fc7","schema_version":"1.0","event_id":"sha256:64ce5cfed266c4446cde79ee30eda6ae250d3e4c83fe63c35f77e8f8b6e76fc7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:WNCR4VRL2MVRRGSWHCIA46A4QY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"K-Reach: Who is in Your Small World","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Haixun Wang, Hong Cheng, James Cheng, Jeffrey Xu Yu, Zechao Shang","submitted_at":"2012-08-01T03:55:46Z","abstract_excerpt":"We study the problem of answering k-hop reachability queries in a directed graph, i.e., whether there exists a directed path of length k, from a source query vertex to a target query vertex in the input graph. The problem of k-hop reachability is a general problem of the classic reachability (where k=infinity). Existing indexes for processing classic reachability queries, as well as for processing shortest path queries, are not applicable or not efficient for processing k-hop reachability queries. We propose an index for processing k-hop reachability queries, which is simple in design and effi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0090","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:49:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ln7ELRK5bQm7fnzx5yGH09JP+c3R5Bd48CQu2DtOqQ81+/kOQmiBW//WiThG1qa3pI7799QPvEF+wpPgQYOsBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:17:30.761591Z"},"content_sha256":"62dfbf5fdfe17f59e4f2445417b10352f5ffab3d6ed60a965ba592f6ff93b662","schema_version":"1.0","event_id":"sha256:62dfbf5fdfe17f59e4f2445417b10352f5ffab3d6ed60a965ba592f6ff93b662"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WNCR4VRL2MVRRGSWHCIA46A4QY/bundle.json","state_url":"https://pith.science/pith/WNCR4VRL2MVRRGSWHCIA46A4QY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WNCR4VRL2MVRRGSWHCIA46A4QY/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-04T19:17:30Z","links":{"resolver":"https://pith.science/pith/WNCR4VRL2MVRRGSWHCIA46A4QY","bundle":"https://pith.science/pith/WNCR4VRL2MVRRGSWHCIA46A4QY/bundle.json","state":"https://pith.science/pith/WNCR4VRL2MVRRGSWHCIA46A4QY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WNCR4VRL2MVRRGSWHCIA46A4QY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:WNCR4VRL2MVRRGSWHCIA46A4QY","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":"e78fe6fa00aa00efe8bf41192e4b2b88937215a8fcf4816a17cab29d1c46f037","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T03:55:46Z","title_canon_sha256":"e887355ed8142e2449ca5e019b85c17f975b278cb2ba1099168e8cfdbbe611e9"},"schema_version":"1.0","source":{"id":"1208.0090","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.0090","created_at":"2026-05-18T03:49:44Z"},{"alias_kind":"arxiv_version","alias_value":"1208.0090v1","created_at":"2026-05-18T03:49:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0090","created_at":"2026-05-18T03:49:44Z"},{"alias_kind":"pith_short_12","alias_value":"WNCR4VRL2MVR","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WNCR4VRL2MVRRGSW","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WNCR4VRL","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:62dfbf5fdfe17f59e4f2445417b10352f5ffab3d6ed60a965ba592f6ff93b662","target":"graph","created_at":"2026-05-18T03:49:44Z","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 answering k-hop reachability queries in a directed graph, i.e., whether there exists a directed path of length k, from a source query vertex to a target query vertex in the input graph. The problem of k-hop reachability is a general problem of the classic reachability (where k=infinity). Existing indexes for processing classic reachability queries, as well as for processing shortest path queries, are not applicable or not efficient for processing k-hop reachability queries. We propose an index for processing k-hop reachability queries, which is simple in design and effi","authors_text":"Haixun Wang, Hong Cheng, James Cheng, Jeffrey Xu Yu, Zechao Shang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T03:55:46Z","title":"K-Reach: Who is in Your Small World"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0090","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:64ce5cfed266c4446cde79ee30eda6ae250d3e4c83fe63c35f77e8f8b6e76fc7","target":"record","created_at":"2026-05-18T03:49:44Z","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":"e78fe6fa00aa00efe8bf41192e4b2b88937215a8fcf4816a17cab29d1c46f037","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T03:55:46Z","title_canon_sha256":"e887355ed8142e2449ca5e019b85c17f975b278cb2ba1099168e8cfdbbe611e9"},"schema_version":"1.0","source":{"id":"1208.0090","kind":"arxiv","version":1}},"canonical_sha256":"b3451e562bd32b189a5638900e781c8608fe3806b265d059ac992d5f69bf9b74","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3451e562bd32b189a5638900e781c8608fe3806b265d059ac992d5f69bf9b74","first_computed_at":"2026-05-18T03:49:44.956901Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:44.956901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rW5SuGmg+H2wuScPwO2DRnnyuHuAMFjO4Pr4YschFX9j9iITg+ArdFJPzg3oWQmolGwh83CJaB28FgRJpin5BA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:44.957631Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.0090","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64ce5cfed266c4446cde79ee30eda6ae250d3e4c83fe63c35f77e8f8b6e76fc7","sha256:62dfbf5fdfe17f59e4f2445417b10352f5ffab3d6ed60a965ba592f6ff93b662"],"state_sha256":"811c63f4f61a4a25ff78a449605f2c59cc8a1ae67e3d2fa0462415be776c56f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l2zFK4iNeR/ZsFSnbggG7R4W+aDGK1F+8J0+S1dHYw7H5zIj9MlZey4vspsv116y5dhZGjDeYEcLN+0FX/bhDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T19:17:30.763513Z","bundle_sha256":"2ba8f160080c5ce91bbd0200412765eb7d485b389cb6eae4fd639b2f1efa7e35"}}