{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:3ZW4OPHUPQSAZDBQRGSGS4N2QD","short_pith_number":"pith:3ZW4OPHU","canonical_record":{"source":{"id":"1211.3375","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-11-14T18:28:28Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"f25031c52c798ce8a0a42af11c487f18a415eae8037ee9f0f1be958aa74a7cd5","abstract_canon_sha256":"6c00e3ad6f150b7bb078b974f79a4734a06a5d2377ba994c06fe53d252aa5937"},"schema_version":"1.0"},"canonical_sha256":"de6dc73cf47c240c8c3089a46971ba80ec7d8b9455256fb1ffaf6ade6519cded","source":{"kind":"arxiv","id":"1211.3375","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.3375","created_at":"2026-05-18T03:39:41Z"},{"alias_kind":"arxiv_version","alias_value":"1211.3375v5","created_at":"2026-05-18T03:39:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3375","created_at":"2026-05-18T03:39:41Z"},{"alias_kind":"pith_short_12","alias_value":"3ZW4OPHUPQSA","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"3ZW4OPHUPQSAZDBQ","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"3ZW4OPHU","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:3ZW4OPHUPQSAZDBQRGSGS4N2QD","target":"record","payload":{"canonical_record":{"source":{"id":"1211.3375","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-11-14T18:28:28Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"f25031c52c798ce8a0a42af11c487f18a415eae8037ee9f0f1be958aa74a7cd5","abstract_canon_sha256":"6c00e3ad6f150b7bb078b974f79a4734a06a5d2377ba994c06fe53d252aa5937"},"schema_version":"1.0"},"canonical_sha256":"de6dc73cf47c240c8c3089a46971ba80ec7d8b9455256fb1ffaf6ade6519cded","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:41.246003Z","signature_b64":"34xQXVsLIodFyYemnIMNXG2lW8aT0VDAZtAbOzE5dEtJ/x3FA7a499iSHCD/6gfR4oiUrZta2j3xmsRcX42VBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de6dc73cf47c240c8c3089a46971ba80ec7d8b9455256fb1ffaf6ade6519cded","last_reissued_at":"2026-05-18T03:39:41.245225Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:41.245225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.3375","source_version":5,"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:39:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Hz790PZLcFpCGNEWX6JvKJULa8YrgsM51s4+tj1AW7pHSGOLf7Vgur7/95cqFvn95vzKqh3g8V1JySnTpxiAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:22:42.409620Z"},"content_sha256":"9535a4bdaa337f717c34c596482ce7727c6d863d093da989a668aff923b626f6","schema_version":"1.0","event_id":"sha256:9535a4bdaa337f717c34c596482ce7727c6d863d093da989a668aff923b626f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:3ZW4OPHUPQSAZDBQRGSGS4N2QD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High-Performance Reachability Query Processing under Index Size Restrictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DB","authors_text":"Avishek Anand, Gerhard Weikum, Srikanta Bedathur, Stephan Seufert","submitted_at":"2012-11-14T18:28:28Z","abstract_excerpt":"In this paper, we propose a scalable and highly efficient index structure for the reachability problem over graphs. We build on the well-known node interval labeling scheme where the set of vertices reachable from a particular node is compactly encoded as a collection of node identifier ranges. We impose an explicit bound on the size of the index and flexibly assign approximate reachability ranges to nodes of the graph such that the number of index probes to answer a query is minimized. The resulting tunable index structure generates a better range labeling if the space budget is increased, th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3375","kind":"arxiv","version":5},"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:39:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RFbJB+op7y6RVj+7dhCJleQ7+OkHQHN1H2P0BEN26rkg7kZxzQYstyWisxmnzLZc0LI6bpSDJHV3RIW8MKv1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:22:42.409970Z"},"content_sha256":"b2ff61911eded14d8321456d9358a40367cb4af31c16ae6a0a6ee9ce507661d8","schema_version":"1.0","event_id":"sha256:b2ff61911eded14d8321456d9358a40367cb4af31c16ae6a0a6ee9ce507661d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3ZW4OPHUPQSAZDBQRGSGS4N2QD/bundle.json","state_url":"https://pith.science/pith/3ZW4OPHUPQSAZDBQRGSGS4N2QD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3ZW4OPHUPQSAZDBQRGSGS4N2QD/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-05-28T10:22:42Z","links":{"resolver":"https://pith.science/pith/3ZW4OPHUPQSAZDBQRGSGS4N2QD","bundle":"https://pith.science/pith/3ZW4OPHUPQSAZDBQRGSGS4N2QD/bundle.json","state":"https://pith.science/pith/3ZW4OPHUPQSAZDBQRGSGS4N2QD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3ZW4OPHUPQSAZDBQRGSGS4N2QD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3ZW4OPHUPQSAZDBQRGSGS4N2QD","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":"6c00e3ad6f150b7bb078b974f79a4734a06a5d2377ba994c06fe53d252aa5937","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-11-14T18:28:28Z","title_canon_sha256":"f25031c52c798ce8a0a42af11c487f18a415eae8037ee9f0f1be958aa74a7cd5"},"schema_version":"1.0","source":{"id":"1211.3375","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.3375","created_at":"2026-05-18T03:39:41Z"},{"alias_kind":"arxiv_version","alias_value":"1211.3375v5","created_at":"2026-05-18T03:39:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3375","created_at":"2026-05-18T03:39:41Z"},{"alias_kind":"pith_short_12","alias_value":"3ZW4OPHUPQSA","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"3ZW4OPHUPQSAZDBQ","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"3ZW4OPHU","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:b2ff61911eded14d8321456d9358a40367cb4af31c16ae6a0a6ee9ce507661d8","target":"graph","created_at":"2026-05-18T03:39:41Z","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":"In this paper, we propose a scalable and highly efficient index structure for the reachability problem over graphs. We build on the well-known node interval labeling scheme where the set of vertices reachable from a particular node is compactly encoded as a collection of node identifier ranges. We impose an explicit bound on the size of the index and flexibly assign approximate reachability ranges to nodes of the graph such that the number of index probes to answer a query is minimized. The resulting tunable index structure generates a better range labeling if the space budget is increased, th","authors_text":"Avishek Anand, Gerhard Weikum, Srikanta Bedathur, Stephan Seufert","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-11-14T18:28:28Z","title":"High-Performance Reachability Query Processing under Index Size Restrictions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3375","kind":"arxiv","version":5},"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:9535a4bdaa337f717c34c596482ce7727c6d863d093da989a668aff923b626f6","target":"record","created_at":"2026-05-18T03:39:41Z","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":"6c00e3ad6f150b7bb078b974f79a4734a06a5d2377ba994c06fe53d252aa5937","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-11-14T18:28:28Z","title_canon_sha256":"f25031c52c798ce8a0a42af11c487f18a415eae8037ee9f0f1be958aa74a7cd5"},"schema_version":"1.0","source":{"id":"1211.3375","kind":"arxiv","version":5}},"canonical_sha256":"de6dc73cf47c240c8c3089a46971ba80ec7d8b9455256fb1ffaf6ade6519cded","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de6dc73cf47c240c8c3089a46971ba80ec7d8b9455256fb1ffaf6ade6519cded","first_computed_at":"2026-05-18T03:39:41.245225Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:39:41.245225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"34xQXVsLIodFyYemnIMNXG2lW8aT0VDAZtAbOzE5dEtJ/x3FA7a499iSHCD/6gfR4oiUrZta2j3xmsRcX42VBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:39:41.246003Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.3375","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9535a4bdaa337f717c34c596482ce7727c6d863d093da989a668aff923b626f6","sha256:b2ff61911eded14d8321456d9358a40367cb4af31c16ae6a0a6ee9ce507661d8"],"state_sha256":"9534b86d742d465feabcc26a76db3b213b36920c88eb79903a061cc61258695f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eeBmOTEZ589s+ZeHga0e90tK3EEJt/YURFBaRQF9yk+QpB+QWD3MPGmRsPz9AfGNvTR95nbWfLQbfSHZD/WnCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:22:42.411985Z","bundle_sha256":"536b2bd1747b4290f135c7dcc6f8cadac3f9ed7f8bf35df179b8dfe9e39be9fb"}}