{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:67ELXNLHENSVHW3DII25GBGUBM","short_pith_number":"pith:67ELXNLH","canonical_record":{"source":{"id":"1404.4465","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-17T09:55:59Z","cross_cats_sorted":[],"title_canon_sha256":"6ec27fe5f5a566782ef6e3c1f7efd08afc0ab8197b4a2fed6625101b252e63f6","abstract_canon_sha256":"287fa5bf50b524822a75002017c508a9980a1473880552fd3b2c3b5938736a2c"},"schema_version":"1.0"},"canonical_sha256":"f7c8bbb567236553db634235d304d40b336b11eb3d72299ecf6b28d5c7a33fd5","source":{"kind":"arxiv","id":"1404.4465","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4465","created_at":"2026-05-18T02:54:04Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4465v1","created_at":"2026-05-18T02:54:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4465","created_at":"2026-05-18T02:54:04Z"},{"alias_kind":"pith_short_12","alias_value":"67ELXNLHENSV","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"67ELXNLHENSVHW3D","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"67ELXNLH","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:67ELXNLHENSVHW3DII25GBGUBM","target":"record","payload":{"canonical_record":{"source":{"id":"1404.4465","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-17T09:55:59Z","cross_cats_sorted":[],"title_canon_sha256":"6ec27fe5f5a566782ef6e3c1f7efd08afc0ab8197b4a2fed6625101b252e63f6","abstract_canon_sha256":"287fa5bf50b524822a75002017c508a9980a1473880552fd3b2c3b5938736a2c"},"schema_version":"1.0"},"canonical_sha256":"f7c8bbb567236553db634235d304d40b336b11eb3d72299ecf6b28d5c7a33fd5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:04.288475Z","signature_b64":"wrzfZ6c0ihp1CCr9Of5Uptng+iyOgqUT5QSKDL2T7xJtqR3ajvrFaSxb8/9uoFBrkZ4FjsN6XFnf5r0iadaYAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7c8bbb567236553db634235d304d40b336b11eb3d72299ecf6b28d5c7a33fd5","last_reissued_at":"2026-05-18T02:54:04.287837Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:04.287837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.4465","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-18T02:54:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qWCI0lUTrDOhO+bFQMioQXbiPg60/qUQZ8MDcuM8+0gZz5KTKPMlz1JRxSXNw2mM7LTxBzIgxCupXknlNS21BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:34:46.767049Z"},"content_sha256":"fd5f629c79956c13bb2925ab6910b51e6413770bc2b91b0b322be0c2be06f975","schema_version":"1.0","event_id":"sha256:fd5f629c79956c13bb2925ab6910b51e6413770bc2b91b0b322be0c2be06f975"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:67ELXNLHENSVHW3DII25GBGUBM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"PReaCH: A Fast Lightweight Reachability Index using Pruning and Contraction Hierarchies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Florian Merz, Peter Sanders","submitted_at":"2014-04-17T09:55:59Z","abstract_excerpt":"We develop the data structure PReaCH (for Pruned Reachability Contraction Hierarchies) which supports reachability queries in a directed graph, i.e., it supports queries that ask whether two nodes in the graph are connected by a directed path. PReaCH adapts the contraction hierarchy speedup techniques for shortest path queries to the reachability setting. The resulting approach is surprisingly simple and guarantees linear space and near linear preprocessing time. Orthogonally to that, we improve existing pruning techniques for the search by gathering more information from a single DFS-traversa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4465","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-18T02:54:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XQ0/aPnt/URoVPcT/Luq28z4TspX95+jGEocfYLeEPEzJQcYRDlABcoC/x07A1B07zj3NQUj/hDz0eSv4t8cBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:34:46.767448Z"},"content_sha256":"562a062da879bf6b8dde68229d0404995fa378d3ca4f6cfe0c00b128140761f9","schema_version":"1.0","event_id":"sha256:562a062da879bf6b8dde68229d0404995fa378d3ca4f6cfe0c00b128140761f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/67ELXNLHENSVHW3DII25GBGUBM/bundle.json","state_url":"https://pith.science/pith/67ELXNLHENSVHW3DII25GBGUBM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/67ELXNLHENSVHW3DII25GBGUBM/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-02T08:34:46Z","links":{"resolver":"https://pith.science/pith/67ELXNLHENSVHW3DII25GBGUBM","bundle":"https://pith.science/pith/67ELXNLHENSVHW3DII25GBGUBM/bundle.json","state":"https://pith.science/pith/67ELXNLHENSVHW3DII25GBGUBM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/67ELXNLHENSVHW3DII25GBGUBM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:67ELXNLHENSVHW3DII25GBGUBM","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":"287fa5bf50b524822a75002017c508a9980a1473880552fd3b2c3b5938736a2c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-17T09:55:59Z","title_canon_sha256":"6ec27fe5f5a566782ef6e3c1f7efd08afc0ab8197b4a2fed6625101b252e63f6"},"schema_version":"1.0","source":{"id":"1404.4465","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4465","created_at":"2026-05-18T02:54:04Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4465v1","created_at":"2026-05-18T02:54:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4465","created_at":"2026-05-18T02:54:04Z"},{"alias_kind":"pith_short_12","alias_value":"67ELXNLHENSV","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"67ELXNLHENSVHW3D","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"67ELXNLH","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:562a062da879bf6b8dde68229d0404995fa378d3ca4f6cfe0c00b128140761f9","target":"graph","created_at":"2026-05-18T02:54:04Z","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 develop the data structure PReaCH (for Pruned Reachability Contraction Hierarchies) which supports reachability queries in a directed graph, i.e., it supports queries that ask whether two nodes in the graph are connected by a directed path. PReaCH adapts the contraction hierarchy speedup techniques for shortest path queries to the reachability setting. The resulting approach is surprisingly simple and guarantees linear space and near linear preprocessing time. Orthogonally to that, we improve existing pruning techniques for the search by gathering more information from a single DFS-traversa","authors_text":"Florian Merz, Peter Sanders","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-17T09:55:59Z","title":"PReaCH: A Fast Lightweight Reachability Index using Pruning and Contraction Hierarchies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4465","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:fd5f629c79956c13bb2925ab6910b51e6413770bc2b91b0b322be0c2be06f975","target":"record","created_at":"2026-05-18T02:54:04Z","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":"287fa5bf50b524822a75002017c508a9980a1473880552fd3b2c3b5938736a2c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-17T09:55:59Z","title_canon_sha256":"6ec27fe5f5a566782ef6e3c1f7efd08afc0ab8197b4a2fed6625101b252e63f6"},"schema_version":"1.0","source":{"id":"1404.4465","kind":"arxiv","version":1}},"canonical_sha256":"f7c8bbb567236553db634235d304d40b336b11eb3d72299ecf6b28d5c7a33fd5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7c8bbb567236553db634235d304d40b336b11eb3d72299ecf6b28d5c7a33fd5","first_computed_at":"2026-05-18T02:54:04.287837Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:04.287837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wrzfZ6c0ihp1CCr9Of5Uptng+iyOgqUT5QSKDL2T7xJtqR3ajvrFaSxb8/9uoFBrkZ4FjsN6XFnf5r0iadaYAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:04.288475Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.4465","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd5f629c79956c13bb2925ab6910b51e6413770bc2b91b0b322be0c2be06f975","sha256:562a062da879bf6b8dde68229d0404995fa378d3ca4f6cfe0c00b128140761f9"],"state_sha256":"d99655ecfef5b2984dcf5df51523187d306337d36cedc832491d7b3d2279827f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R4lOQ92rS49ZHk2nMVEnYtHvKu18YlMPDRcx7cDk1rCbr9OA164eIM2k8g+HWDySEWnnCGuZ7fVv23koQeaaCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T08:34:46.769246Z","bundle_sha256":"73dd05501d8b3d8a3712be7198974cb61cc23fe135535f763ac472b5bce6941c"}}