{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7ZDBMJVGJVS6GC7JPSDNZGJMCO","short_pith_number":"pith:7ZDBMJVG","schema_version":"1.0","canonical_sha256":"fe461626a64d65e30be97c86dc992c1398f90e294dfcb25e2601e0918d861fd9","source":{"kind":"arxiv","id":"1301.0977","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1301.0977","created_at":"2026-05-18T03:37:07.138626+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.0977v1","created_at":"2026-05-18T03:37:07.138626+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0977","created_at":"2026-05-18T03:37:07.138626+00:00"},{"alias_kind":"pith_short_12","alias_value":"7ZDBMJVGJVS6","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"7ZDBMJVGJVS6GC7J","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"7ZDBMJVG","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/7ZDBMJVGJVS6GC7JPSDNZGJMCO","json":"https://pith.science/pith/7ZDBMJVGJVS6GC7JPSDNZGJMCO.json","graph_json":"https://pith.science/api/pith-number/7ZDBMJVGJVS6GC7JPSDNZGJMCO/graph.json","events_json":"https://pith.science/api/pith-number/7ZDBMJVGJVS6GC7JPSDNZGJMCO/events.json","paper":"https://pith.science/paper/7ZDBMJVG"},"agent_actions":{"view_html":"https://pith.science/pith/7ZDBMJVGJVS6GC7JPSDNZGJMCO","download_json":"https://pith.science/pith/7ZDBMJVGJVS6GC7JPSDNZGJMCO.json","view_paper":"https://pith.science/paper/7ZDBMJVG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.0977&json=true","fetch_graph":"https://pith.science/api/pith-number/7ZDBMJVGJVS6GC7JPSDNZGJMCO/graph.json","fetch_events":"https://pith.science/api/pith-number/7ZDBMJVGJVS6GC7JPSDNZGJMCO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7ZDBMJVGJVS6GC7JPSDNZGJMCO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7ZDBMJVGJVS6GC7JPSDNZGJMCO/action/storage_attestation","attest_author":"https://pith.science/pith/7ZDBMJVGJVS6GC7JPSDNZGJMCO/action/author_attestation","sign_citation":"https://pith.science/pith/7ZDBMJVGJVS6GC7JPSDNZGJMCO/action/citation_signature","submit_replication":"https://pith.science/pith/7ZDBMJVGJVS6GC7JPSDNZGJMCO/action/replication_record"}},"created_at":"2026-05-18T03:37:07.138626+00:00","updated_at":"2026-05-18T03:37:07.138626+00:00"}