{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:B5SMG3SYSWCG47MSJKNHEWJM46","short_pith_number":"pith:B5SMG3SY","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"},"canonical_sha256":"0f64c36e5895846e7d924a9a72592ce7bdff0bc953c24ae213d25c55aae15798","source":{"kind":"arxiv","id":"1305.0502","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.0502","created_at":"2026-05-18T03:19:34Z"},{"alias_kind":"arxiv_version","alias_value":"1305.0502v2","created_at":"2026-05-18T03:19:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0502","created_at":"2026-05-18T03:19:34Z"},{"alias_kind":"pith_short_12","alias_value":"B5SMG3SYSWCG","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"B5SMG3SYSWCG47MS","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"B5SMG3SY","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:B5SMG3SYSWCG47MSJKNHEWJM46","target":"record","payload":{"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"},"canonical_sha256":"0f64c36e5895846e7d924a9a72592ce7bdff0bc953c24ae213d25c55aae15798","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"},"source_kind":"arxiv","source_id":"1305.0502","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-18T03:19:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pWrft9yCSgmbMgXlPM8Xzgmi1PKWxXubwz9J9j1R53jpSiXSGFNQRq4/uoGH5jd7qC8F4FYuUm+ISKu1fycnBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:54:43.562426Z"},"content_sha256":"5c822a55320d22a0bfdf6cc0fd2044a33168d9d8fb967994d7b36ac418a50b6c","schema_version":"1.0","event_id":"sha256:5c822a55320d22a0bfdf6cc0fd2044a33168d9d8fb967994d7b36ac418a50b6c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:B5SMG3SYSWCG47MSJKNHEWJM46","target":"graph","payload":{"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"},"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:19:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k2n+rgV/PhiKJbKvFnR0rAo7uq2NaVbVAgJ+T+m+Xd3kh6OQRV5fn4Skfs6AX/6LnEo3O4TPiEeO6UbMrSxACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:54:43.562782Z"},"content_sha256":"5c7857b74af8a5c3f0325f80435af98c8e12a880a5ed71889eb682b79b24a356","schema_version":"1.0","event_id":"sha256:5c7857b74af8a5c3f0325f80435af98c8e12a880a5ed71889eb682b79b24a356"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B5SMG3SYSWCG47MSJKNHEWJM46/bundle.json","state_url":"https://pith.science/pith/B5SMG3SYSWCG47MSJKNHEWJM46/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B5SMG3SYSWCG47MSJKNHEWJM46/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-03T09:54:43Z","links":{"resolver":"https://pith.science/pith/B5SMG3SYSWCG47MSJKNHEWJM46","bundle":"https://pith.science/pith/B5SMG3SYSWCG47MSJKNHEWJM46/bundle.json","state":"https://pith.science/pith/B5SMG3SYSWCG47MSJKNHEWJM46/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B5SMG3SYSWCG47MSJKNHEWJM46/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:B5SMG3SYSWCG47MSJKNHEWJM46","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":"e0d76885d1c71e64c51dadcdf8ed90ea6965a69f842aca913e2f6f0b26cf2212","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-05-02T16:39:04Z","title_canon_sha256":"ab88ae3c14ad5fd6f2790ea2571ef908c24baf3ec5b7d391ddb3f90804c58a0f"},"schema_version":"1.0","source":{"id":"1305.0502","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.0502","created_at":"2026-05-18T03:19:34Z"},{"alias_kind":"arxiv_version","alias_value":"1305.0502v2","created_at":"2026-05-18T03:19:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0502","created_at":"2026-05-18T03:19:34Z"},{"alias_kind":"pith_short_12","alias_value":"B5SMG3SYSWCG","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"B5SMG3SYSWCG47MS","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"B5SMG3SY","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:5c7857b74af8a5c3f0325f80435af98c8e12a880a5ed71889eb682b79b24a356","target":"graph","created_at":"2026-05-18T03:19:34Z","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":"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","authors_text":"Guan Wang, Ruoming Jin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-05-02T16:39:04Z","title":"Simple, Fast, and Scalable Reachability Oracle"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0502","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:5c822a55320d22a0bfdf6cc0fd2044a33168d9d8fb967994d7b36ac418a50b6c","target":"record","created_at":"2026-05-18T03:19:34Z","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":"e0d76885d1c71e64c51dadcdf8ed90ea6965a69f842aca913e2f6f0b26cf2212","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-05-02T16:39:04Z","title_canon_sha256":"ab88ae3c14ad5fd6f2790ea2571ef908c24baf3ec5b7d391ddb3f90804c58a0f"},"schema_version":"1.0","source":{"id":"1305.0502","kind":"arxiv","version":2}},"canonical_sha256":"0f64c36e5895846e7d924a9a72592ce7bdff0bc953c24ae213d25c55aae15798","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f64c36e5895846e7d924a9a72592ce7bdff0bc953c24ae213d25c55aae15798","first_computed_at":"2026-05-18T03:19:34.646689Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:19:34.646689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hMVKRawxEk/73Cwsufh2Wnsfsf++tQc2UfUR4zjAFLXRhLAE8bgUu0yjz0ejYnoNkNe8xC3SYU8bPKh29THxAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:19:34.647175Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.0502","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c822a55320d22a0bfdf6cc0fd2044a33168d9d8fb967994d7b36ac418a50b6c","sha256:5c7857b74af8a5c3f0325f80435af98c8e12a880a5ed71889eb682b79b24a356"],"state_sha256":"973ca3da8c91631d3f4850a97ed3c8c5ef67c3e4f34d56a332044068423c5903"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xLhvoz93ezuRKlM0VNNjk4X3rF4zVxPeKqxul3WzA7EsDBqrHO0b3NnOiBrXZekl3FQWjgUv5rg7GJ2NsjQpAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T09:54:43.564796Z","bundle_sha256":"04dc0bc2de82c2c2ffab3b6b44e33eea9adbef19fce647bd27a2037690a8dcfc"}}