{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:B5SMG3SYSWCG47MSJKNHEWJM46","short_pith_number":"pith:B5SMG3SY","schema_version":"1.0","canonical_sha256":"0f64c36e5895846e7d924a9a72592ce7bdff0bc953c24ae213d25c55aae15798","source":{"kind":"arxiv","id":"1305.0502","version":2},"attestation_state":"computed","paper":{"title":"Simple, Fast, and Scalable Reachability Oracle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Guan Wang, Ruoming Jin","submitted_at":"2013-05-02T16:39:04Z","abstract_excerpt":"A reachability oracle (or hop labeling) assigns each vertex v two sets of vertices: Lout(v) and Lin(v), such that u reaches v iff Lout(u) \\cap Lin(v) \\neq \\emptyset. Despite their simplicity and elegance, reachability oracles have failed to achieve efficiency in more than ten years since their introduction: the main problem is high construction cost, which stems from a set-cover framework and the need to materialize transitive closure. In this paper, we present two simple and efficient labeling algorithms, Hierarchical-Labeling and Distribution-Labeling, which can work onmassive real-world gra"},"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":"1305.0502","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-05-02T16:39:04Z","cross_cats_sorted":[],"title_canon_sha256":"ab88ae3c14ad5fd6f2790ea2571ef908c24baf3ec5b7d391ddb3f90804c58a0f","abstract_canon_sha256":"e0d76885d1c71e64c51dadcdf8ed90ea6965a69f842aca913e2f6f0b26cf2212"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:34.647175Z","signature_b64":"hMVKRawxEk/73Cwsufh2Wnsfsf++tQc2UfUR4zjAFLXRhLAE8bgUu0yjz0ejYnoNkNe8xC3SYU8bPKh29THxAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f64c36e5895846e7d924a9a72592ce7bdff0bc953c24ae213d25c55aae15798","last_reissued_at":"2026-05-18T03:19:34.646689Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:34.646689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simple, Fast, and Scalable Reachability Oracle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Guan Wang, Ruoming Jin","submitted_at":"2013-05-02T16:39:04Z","abstract_excerpt":"A reachability oracle (or hop labeling) assigns each vertex v two sets of vertices: Lout(v) and Lin(v), such that u reaches v iff Lout(u) \\cap Lin(v) \\neq \\emptyset. Despite their simplicity and elegance, reachability oracles have failed to achieve efficiency in more than ten years since their introduction: the main problem is high construction cost, which stems from a set-cover framework and the need to materialize transitive closure. In this paper, we present two simple and efficient labeling algorithms, Hierarchical-Labeling and Distribution-Labeling, which can work onmassive real-world gra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0502","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1305.0502","created_at":"2026-05-18T03:19:34.646755+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.0502v2","created_at":"2026-05-18T03:19:34.646755+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0502","created_at":"2026-05-18T03:19:34.646755+00:00"},{"alias_kind":"pith_short_12","alias_value":"B5SMG3SYSWCG","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"B5SMG3SYSWCG47MS","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"B5SMG3SY","created_at":"2026-05-18T12:27:38.830355+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/B5SMG3SYSWCG47MSJKNHEWJM46","json":"https://pith.science/pith/B5SMG3SYSWCG47MSJKNHEWJM46.json","graph_json":"https://pith.science/api/pith-number/B5SMG3SYSWCG47MSJKNHEWJM46/graph.json","events_json":"https://pith.science/api/pith-number/B5SMG3SYSWCG47MSJKNHEWJM46/events.json","paper":"https://pith.science/paper/B5SMG3SY"},"agent_actions":{"view_html":"https://pith.science/pith/B5SMG3SYSWCG47MSJKNHEWJM46","download_json":"https://pith.science/pith/B5SMG3SYSWCG47MSJKNHEWJM46.json","view_paper":"https://pith.science/paper/B5SMG3SY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.0502&json=true","fetch_graph":"https://pith.science/api/pith-number/B5SMG3SYSWCG47MSJKNHEWJM46/graph.json","fetch_events":"https://pith.science/api/pith-number/B5SMG3SYSWCG47MSJKNHEWJM46/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B5SMG3SYSWCG47MSJKNHEWJM46/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B5SMG3SYSWCG47MSJKNHEWJM46/action/storage_attestation","attest_author":"https://pith.science/pith/B5SMG3SYSWCG47MSJKNHEWJM46/action/author_attestation","sign_citation":"https://pith.science/pith/B5SMG3SYSWCG47MSJKNHEWJM46/action/citation_signature","submit_replication":"https://pith.science/pith/B5SMG3SYSWCG47MSJKNHEWJM46/action/replication_record"}},"created_at":"2026-05-18T03:19:34.646755+00:00","updated_at":"2026-05-18T03:19:34.646755+00:00"}