{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PWGFPVLEDUVMBGJYM3JAFRTUXC","short_pith_number":"pith:PWGFPVLE","schema_version":"1.0","canonical_sha256":"7d8c57d5641d2ac0993866d202c674b880a7cceee9a91e807efbf0145237b0bf","source":{"kind":"arxiv","id":"1503.05977","version":1},"attestation_state":"computed","paper":{"title":"Dynamic Data Structures for Document Collections and Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jeffrey Scott Vitter, J. Ian Munro, Yakov Nekrich","submitted_at":"2015-03-20T01:31:25Z","abstract_excerpt":"In the dynamic indexing problem, we must maintain a changing collection of text documents so that we can efficiently support insertions, deletions, and pattern matching queries. We are especially interested in developing efficient data structures that store and query the documents in compressed form. All previous compressed solutions to this problem rely on answering rank and select queries on a dynamic sequence of symbols. Because of the lower bound in [Fredman and Saks, 1989], answering rank queries presents a bottleneck in compressed dynamic indexing. In this paper we show how this lower bo"},"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":"1503.05977","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-20T01:31:25Z","cross_cats_sorted":[],"title_canon_sha256":"5ba8801d4d03797f44304a69dc8a29748d9f5d5a40fdad5bd7a73688f9eaf912","abstract_canon_sha256":"af141a1d2b6ef1b4440ef3590c8fbcb4857bb555a099ab391d2ffadf17fd6094"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:49.013786Z","signature_b64":"2HI+oDrwrz7rlzTMuyb61NqKcwyKUg6Rm0GS3MD7GIofhG1ZwOW+xhOJE2bzrBNHJCl9y+MU22RYB/826wNXCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d8c57d5641d2ac0993866d202c674b880a7cceee9a91e807efbf0145237b0bf","last_reissued_at":"2026-05-18T02:20:49.013205Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:49.013205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Data Structures for Document Collections and Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jeffrey Scott Vitter, J. Ian Munro, Yakov Nekrich","submitted_at":"2015-03-20T01:31:25Z","abstract_excerpt":"In the dynamic indexing problem, we must maintain a changing collection of text documents so that we can efficiently support insertions, deletions, and pattern matching queries. We are especially interested in developing efficient data structures that store and query the documents in compressed form. All previous compressed solutions to this problem rely on answering rank and select queries on a dynamic sequence of symbols. Because of the lower bound in [Fredman and Saks, 1989], answering rank queries presents a bottleneck in compressed dynamic indexing. In this paper we show how this lower bo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.05977","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":"1503.05977","created_at":"2026-05-18T02:20:49.013303+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.05977v1","created_at":"2026-05-18T02:20:49.013303+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.05977","created_at":"2026-05-18T02:20:49.013303+00:00"},{"alias_kind":"pith_short_12","alias_value":"PWGFPVLEDUVM","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PWGFPVLEDUVMBGJY","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PWGFPVLE","created_at":"2026-05-18T12:29:37.295048+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/PWGFPVLEDUVMBGJYM3JAFRTUXC","json":"https://pith.science/pith/PWGFPVLEDUVMBGJYM3JAFRTUXC.json","graph_json":"https://pith.science/api/pith-number/PWGFPVLEDUVMBGJYM3JAFRTUXC/graph.json","events_json":"https://pith.science/api/pith-number/PWGFPVLEDUVMBGJYM3JAFRTUXC/events.json","paper":"https://pith.science/paper/PWGFPVLE"},"agent_actions":{"view_html":"https://pith.science/pith/PWGFPVLEDUVMBGJYM3JAFRTUXC","download_json":"https://pith.science/pith/PWGFPVLEDUVMBGJYM3JAFRTUXC.json","view_paper":"https://pith.science/paper/PWGFPVLE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.05977&json=true","fetch_graph":"https://pith.science/api/pith-number/PWGFPVLEDUVMBGJYM3JAFRTUXC/graph.json","fetch_events":"https://pith.science/api/pith-number/PWGFPVLEDUVMBGJYM3JAFRTUXC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PWGFPVLEDUVMBGJYM3JAFRTUXC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PWGFPVLEDUVMBGJYM3JAFRTUXC/action/storage_attestation","attest_author":"https://pith.science/pith/PWGFPVLEDUVMBGJYM3JAFRTUXC/action/author_attestation","sign_citation":"https://pith.science/pith/PWGFPVLEDUVMBGJYM3JAFRTUXC/action/citation_signature","submit_replication":"https://pith.science/pith/PWGFPVLEDUVMBGJYM3JAFRTUXC/action/replication_record"}},"created_at":"2026-05-18T02:20:49.013303+00:00","updated_at":"2026-05-18T02:20:49.013303+00:00"}