{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7ZDBMJVGJVS6GC7JPSDNZGJMCO","short_pith_number":"pith:7ZDBMJVG","canonical_record":{"source":{"id":"1301.0977","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-01-06T06:12:42Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2f2d5f5e8666ac0cbd6e074009944a60ec23a92f17f5ffb072a9191e1d0e2411","abstract_canon_sha256":"95c37ea6588de3a5a99b40a61cc4a141f4ab4168c024f63d130e3fde1d2c3531"},"schema_version":"1.0"},"canonical_sha256":"fe461626a64d65e30be97c86dc992c1398f90e294dfcb25e2601e0918d861fd9","source":{"kind":"arxiv","id":"1301.0977","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0977","created_at":"2026-05-18T03:37:07Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0977v1","created_at":"2026-05-18T03:37:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0977","created_at":"2026-05-18T03:37:07Z"},{"alias_kind":"pith_short_12","alias_value":"7ZDBMJVGJVS6","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"7ZDBMJVGJVS6GC7J","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"7ZDBMJVG","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7ZDBMJVGJVS6GC7JPSDNZGJMCO","target":"record","payload":{"canonical_record":{"source":{"id":"1301.0977","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-01-06T06:12:42Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2f2d5f5e8666ac0cbd6e074009944a60ec23a92f17f5ffb072a9191e1d0e2411","abstract_canon_sha256":"95c37ea6588de3a5a99b40a61cc4a141f4ab4168c024f63d130e3fde1d2c3531"},"schema_version":"1.0"},"canonical_sha256":"fe461626a64d65e30be97c86dc992c1398f90e294dfcb25e2601e0918d861fd9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:07.139289Z","signature_b64":"JOGnWRK+l0wfIuLIpqCU8fmte/QBMZY/yjwpAfDfKMs+i1yuKzWNNVg28bzHZBAaYuVa9+1ivf0ODNax84FYAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe461626a64d65e30be97c86dc992c1398f90e294dfcb25e2601e0918d861fd9","last_reissued_at":"2026-05-18T03:37:07.138493Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:07.138493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.0977","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-18T03:37:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"baqw8b+agtYnUUYSNApAmoD0CLo1wf3pbwkTVzUfTA96zJZmnFc3llC4ZZvqNVwqw5RMtH/Uu52c89wcBo8EBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:21:34.888787Z"},"content_sha256":"38195cb45e1294569e9e17e6266a8ebc5b029967c5b5380b881958900e8e6a92","schema_version":"1.0","event_id":"sha256:38195cb45e1294569e9e17e6266a8ebc5b029967c5b5380b881958900e8e6a92"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7ZDBMJVGJVS6GC7JPSDNZGJMCO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DAGGER: A Scalable Index for Reachability Queries in Large Dynamic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DB","authors_text":"Hilmi Yildirim, Mohammed J. Zaki, Vineet Chaoji","submitted_at":"2013-01-06T06:12:42Z","abstract_excerpt":"With the ubiquity of large-scale graph data in a variety of application domains, querying them effectively is a challenge. In particular, reachability queries are becoming increasingly important, especially for containment, subsumption, and connectivity checks. Whereas many methods have been proposed for static graph reachability, many real-world graphs are constantly evolving, which calls for dynamic indexing. In this paper, we present a fully dynamic reachability index over dynamic graphs. Our method, called DAGGER, is a light-weight index based on interval labeling, that scales to million n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0977","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-18T03:37:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G4/keIMTlAl1HwHETQpELC1UnZh06+Tl7rYWa+0g71XGgvlcj1AlQ4X7EIZ9rDLnKrMYaVQbUHkizCSUFrS1AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:21:34.889440Z"},"content_sha256":"a7d9848b42d98cf2aae8fe7df6dcf3cbdf7e6f3d1e21329ea17364f09b21b294","schema_version":"1.0","event_id":"sha256:a7d9848b42d98cf2aae8fe7df6dcf3cbdf7e6f3d1e21329ea17364f09b21b294"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7ZDBMJVGJVS6GC7JPSDNZGJMCO/bundle.json","state_url":"https://pith.science/pith/7ZDBMJVGJVS6GC7JPSDNZGJMCO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7ZDBMJVGJVS6GC7JPSDNZGJMCO/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-31T08:21:34Z","links":{"resolver":"https://pith.science/pith/7ZDBMJVGJVS6GC7JPSDNZGJMCO","bundle":"https://pith.science/pith/7ZDBMJVGJVS6GC7JPSDNZGJMCO/bundle.json","state":"https://pith.science/pith/7ZDBMJVGJVS6GC7JPSDNZGJMCO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7ZDBMJVGJVS6GC7JPSDNZGJMCO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7ZDBMJVGJVS6GC7JPSDNZGJMCO","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":"95c37ea6588de3a5a99b40a61cc4a141f4ab4168c024f63d130e3fde1d2c3531","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-01-06T06:12:42Z","title_canon_sha256":"2f2d5f5e8666ac0cbd6e074009944a60ec23a92f17f5ffb072a9191e1d0e2411"},"schema_version":"1.0","source":{"id":"1301.0977","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0977","created_at":"2026-05-18T03:37:07Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0977v1","created_at":"2026-05-18T03:37:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0977","created_at":"2026-05-18T03:37:07Z"},{"alias_kind":"pith_short_12","alias_value":"7ZDBMJVGJVS6","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"7ZDBMJVGJVS6GC7J","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"7ZDBMJVG","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:a7d9848b42d98cf2aae8fe7df6dcf3cbdf7e6f3d1e21329ea17364f09b21b294","target":"graph","created_at":"2026-05-18T03:37:07Z","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":"With the ubiquity of large-scale graph data in a variety of application domains, querying them effectively is a challenge. In particular, reachability queries are becoming increasingly important, especially for containment, subsumption, and connectivity checks. Whereas many methods have been proposed for static graph reachability, many real-world graphs are constantly evolving, which calls for dynamic indexing. In this paper, we present a fully dynamic reachability index over dynamic graphs. Our method, called DAGGER, is a light-weight index based on interval labeling, that scales to million n","authors_text":"Hilmi Yildirim, Mohammed J. Zaki, Vineet Chaoji","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-01-06T06:12:42Z","title":"DAGGER: A Scalable Index for Reachability Queries in Large Dynamic Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0977","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:38195cb45e1294569e9e17e6266a8ebc5b029967c5b5380b881958900e8e6a92","target":"record","created_at":"2026-05-18T03:37:07Z","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":"95c37ea6588de3a5a99b40a61cc4a141f4ab4168c024f63d130e3fde1d2c3531","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-01-06T06:12:42Z","title_canon_sha256":"2f2d5f5e8666ac0cbd6e074009944a60ec23a92f17f5ffb072a9191e1d0e2411"},"schema_version":"1.0","source":{"id":"1301.0977","kind":"arxiv","version":1}},"canonical_sha256":"fe461626a64d65e30be97c86dc992c1398f90e294dfcb25e2601e0918d861fd9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe461626a64d65e30be97c86dc992c1398f90e294dfcb25e2601e0918d861fd9","first_computed_at":"2026-05-18T03:37:07.138493Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:37:07.138493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JOGnWRK+l0wfIuLIpqCU8fmte/QBMZY/yjwpAfDfKMs+i1yuKzWNNVg28bzHZBAaYuVa9+1ivf0ODNax84FYAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:37:07.139289Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.0977","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38195cb45e1294569e9e17e6266a8ebc5b029967c5b5380b881958900e8e6a92","sha256:a7d9848b42d98cf2aae8fe7df6dcf3cbdf7e6f3d1e21329ea17364f09b21b294"],"state_sha256":"3283d3a3543d921f363102016e9c52c765dd8b37332ad3605945070bc862122a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k6FmN6CvjaDeJn2nLyhpYPRJR7u6BnN01PDgRuGEkRC4oz4gQ1Pz8DAp6dg2ZLoBo2z1R+IDPRCA+V/MB+BAAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:21:34.892669Z","bundle_sha256":"87dcc1067c75c571629b85ea25c7de15e9e92ddd065045a1be268eff9251726b"}}