{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:A3CLHE7KPK27O7ACTKD6JU3YVC","short_pith_number":"pith:A3CLHE7K","schema_version":"1.0","canonical_sha256":"06c4b393ea7ab5f77c029a87e4d378a88aefb760d2bad021b81c343b4d4dc061","source":{"kind":"arxiv","id":"1804.04720","version":1},"attestation_state":"computed","paper":{"title":"Fast Prefix Search in Little Space, with Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna","submitted_at":"2018-04-12T20:35:06Z","abstract_excerpt":"It has been shown in the indexing literature that there is an essential difference between prefix/range searches on the one hand, and predecessor/rank searches on the other hand, in that the former provably allows faster query resolution. Traditionally, prefix search is solved by data structures that are also dictionaries---they actually contain the strings in $S$. For very large collections stored in slow-access memory, we propose much more compact data structures that support \\emph{weak} prefix searches---they return the ranks of matching strings provided that \\emph{some} string in $S$ start"},"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":"1804.04720","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-12T20:35:06Z","cross_cats_sorted":[],"title_canon_sha256":"87e58d551fe95b1324f3eb9bbe0683c10b6d42f7131d63d3247499b064dde7c8","abstract_canon_sha256":"da80d597c565205b7a33108870d2947e3a3b77bd9d87646728701d89373a45e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:35.190689Z","signature_b64":"l3lcs0vrXBmvjMeEkx4EYQRPdco1XafRNL5qcxThicw6zxMHCPJyxACguOWrffZ3cCO6goKOcsG8GVUoxcFtBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06c4b393ea7ab5f77c029a87e4d378a88aefb760d2bad021b81c343b4d4dc061","last_reissued_at":"2026-05-18T00:18:35.190150Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:35.190150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Prefix Search in Little Space, with Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna","submitted_at":"2018-04-12T20:35:06Z","abstract_excerpt":"It has been shown in the indexing literature that there is an essential difference between prefix/range searches on the one hand, and predecessor/rank searches on the other hand, in that the former provably allows faster query resolution. Traditionally, prefix search is solved by data structures that are also dictionaries---they actually contain the strings in $S$. For very large collections stored in slow-access memory, we propose much more compact data structures that support \\emph{weak} prefix searches---they return the ranks of matching strings provided that \\emph{some} string in $S$ start"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.04720","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":"1804.04720","created_at":"2026-05-18T00:18:35.190238+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.04720v1","created_at":"2026-05-18T00:18:35.190238+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.04720","created_at":"2026-05-18T00:18:35.190238+00:00"},{"alias_kind":"pith_short_12","alias_value":"A3CLHE7KPK27","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"A3CLHE7KPK27O7AC","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"A3CLHE7K","created_at":"2026-05-18T12:32:13.499390+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/A3CLHE7KPK27O7ACTKD6JU3YVC","json":"https://pith.science/pith/A3CLHE7KPK27O7ACTKD6JU3YVC.json","graph_json":"https://pith.science/api/pith-number/A3CLHE7KPK27O7ACTKD6JU3YVC/graph.json","events_json":"https://pith.science/api/pith-number/A3CLHE7KPK27O7ACTKD6JU3YVC/events.json","paper":"https://pith.science/paper/A3CLHE7K"},"agent_actions":{"view_html":"https://pith.science/pith/A3CLHE7KPK27O7ACTKD6JU3YVC","download_json":"https://pith.science/pith/A3CLHE7KPK27O7ACTKD6JU3YVC.json","view_paper":"https://pith.science/paper/A3CLHE7K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.04720&json=true","fetch_graph":"https://pith.science/api/pith-number/A3CLHE7KPK27O7ACTKD6JU3YVC/graph.json","fetch_events":"https://pith.science/api/pith-number/A3CLHE7KPK27O7ACTKD6JU3YVC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A3CLHE7KPK27O7ACTKD6JU3YVC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A3CLHE7KPK27O7ACTKD6JU3YVC/action/storage_attestation","attest_author":"https://pith.science/pith/A3CLHE7KPK27O7ACTKD6JU3YVC/action/author_attestation","sign_citation":"https://pith.science/pith/A3CLHE7KPK27O7ACTKD6JU3YVC/action/citation_signature","submit_replication":"https://pith.science/pith/A3CLHE7KPK27O7ACTKD6JU3YVC/action/replication_record"}},"created_at":"2026-05-18T00:18:35.190238+00:00","updated_at":"2026-05-18T00:18:35.190238+00:00"}