{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:WNCR4VRL2MVRRGSWHCIA46A4QY","short_pith_number":"pith:WNCR4VRL","schema_version":"1.0","canonical_sha256":"b3451e562bd32b189a5638900e781c8608fe3806b265d059ac992d5f69bf9b74","source":{"kind":"arxiv","id":"1208.0090","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1208.0090","created_at":"2026-05-18T03:49:44.956991+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.0090v1","created_at":"2026-05-18T03:49:44.956991+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0090","created_at":"2026-05-18T03:49:44.956991+00:00"},{"alias_kind":"pith_short_12","alias_value":"WNCR4VRL2MVR","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"WNCR4VRL2MVRRGSW","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"WNCR4VRL","created_at":"2026-05-18T12:27:25.539911+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/WNCR4VRL2MVRRGSWHCIA46A4QY","json":"https://pith.science/pith/WNCR4VRL2MVRRGSWHCIA46A4QY.json","graph_json":"https://pith.science/api/pith-number/WNCR4VRL2MVRRGSWHCIA46A4QY/graph.json","events_json":"https://pith.science/api/pith-number/WNCR4VRL2MVRRGSWHCIA46A4QY/events.json","paper":"https://pith.science/paper/WNCR4VRL"},"agent_actions":{"view_html":"https://pith.science/pith/WNCR4VRL2MVRRGSWHCIA46A4QY","download_json":"https://pith.science/pith/WNCR4VRL2MVRRGSWHCIA46A4QY.json","view_paper":"https://pith.science/paper/WNCR4VRL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.0090&json=true","fetch_graph":"https://pith.science/api/pith-number/WNCR4VRL2MVRRGSWHCIA46A4QY/graph.json","fetch_events":"https://pith.science/api/pith-number/WNCR4VRL2MVRRGSWHCIA46A4QY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WNCR4VRL2MVRRGSWHCIA46A4QY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WNCR4VRL2MVRRGSWHCIA46A4QY/action/storage_attestation","attest_author":"https://pith.science/pith/WNCR4VRL2MVRRGSWHCIA46A4QY/action/author_attestation","sign_citation":"https://pith.science/pith/WNCR4VRL2MVRRGSWHCIA46A4QY/action/citation_signature","submit_replication":"https://pith.science/pith/WNCR4VRL2MVRRGSWHCIA46A4QY/action/replication_record"}},"created_at":"2026-05-18T03:49:44.956991+00:00","updated_at":"2026-05-18T03:49:44.956991+00:00"}