{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:I7XKRSFJ2WH4LLOPHX3IEMKBRS","short_pith_number":"pith:I7XKRSFJ","schema_version":"1.0","canonical_sha256":"47eea8c8a9d58fc5adcf3df68231418cab79a07774496be8f3777ed0cbf8f29e","source":{"kind":"arxiv","id":"1405.5919","version":2},"attestation_state":"computed","paper":{"title":"Two simple full-text indexes based on the suffix array","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Marcin Raniszewski, Szymon Grabowski","submitted_at":"2014-05-22T21:55:00Z","abstract_excerpt":"We propose two suffix array inspired full-text indexes. One, called SA-hash, augments the suffix array with a hash table to speed up pattern searches due to significantly narrowed search interval before the binary search phase. The other, called FBCSA, is a compact data structure, similar to M{\\\"a}kinen's compact suffix array, but working on fixed sized blocks. Experiments on the Pizza~\\&~Chili 200\\,MB datasets show that SA-hash is about 2--3 times faster in pattern searches (counts) than the standard suffix array, for the price of requiring $0.2n-1.1n$ bytes of extra space, where $n$ is the t"},"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":"1405.5919","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-22T21:55:00Z","cross_cats_sorted":[],"title_canon_sha256":"dd3b5fae36ce0e7b709c7df27dae5eae6bb26cc26ba439115d99e07204987573","abstract_canon_sha256":"f46840ec85b64b03d12625a52e46d8c90956fd3b2ca13d85e813f77a6ed498bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:10.355893Z","signature_b64":"R5sSmflZDYq4kdG6HLJL8jX0PYVseYamgjsGDzJR7dRtRQTK+A9aZZlQ6C+Tep3KjV0oH9hGB0FdIzzWg8HTDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47eea8c8a9d58fc5adcf3df68231418cab79a07774496be8f3777ed0cbf8f29e","last_reissued_at":"2026-05-18T01:14:10.355282Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:10.355282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two simple full-text indexes based on the suffix array","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Marcin Raniszewski, Szymon Grabowski","submitted_at":"2014-05-22T21:55:00Z","abstract_excerpt":"We propose two suffix array inspired full-text indexes. One, called SA-hash, augments the suffix array with a hash table to speed up pattern searches due to significantly narrowed search interval before the binary search phase. The other, called FBCSA, is a compact data structure, similar to M{\\\"a}kinen's compact suffix array, but working on fixed sized blocks. Experiments on the Pizza~\\&~Chili 200\\,MB datasets show that SA-hash is about 2--3 times faster in pattern searches (counts) than the standard suffix array, for the price of requiring $0.2n-1.1n$ bytes of extra space, where $n$ is the t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5919","kind":"arxiv","version":2},"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":"1405.5919","created_at":"2026-05-18T01:14:10.355404+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.5919v2","created_at":"2026-05-18T01:14:10.355404+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5919","created_at":"2026-05-18T01:14:10.355404+00:00"},{"alias_kind":"pith_short_12","alias_value":"I7XKRSFJ2WH4","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"I7XKRSFJ2WH4LLOP","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"I7XKRSFJ","created_at":"2026-05-18T12:28:33.132498+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/I7XKRSFJ2WH4LLOPHX3IEMKBRS","json":"https://pith.science/pith/I7XKRSFJ2WH4LLOPHX3IEMKBRS.json","graph_json":"https://pith.science/api/pith-number/I7XKRSFJ2WH4LLOPHX3IEMKBRS/graph.json","events_json":"https://pith.science/api/pith-number/I7XKRSFJ2WH4LLOPHX3IEMKBRS/events.json","paper":"https://pith.science/paper/I7XKRSFJ"},"agent_actions":{"view_html":"https://pith.science/pith/I7XKRSFJ2WH4LLOPHX3IEMKBRS","download_json":"https://pith.science/pith/I7XKRSFJ2WH4LLOPHX3IEMKBRS.json","view_paper":"https://pith.science/paper/I7XKRSFJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.5919&json=true","fetch_graph":"https://pith.science/api/pith-number/I7XKRSFJ2WH4LLOPHX3IEMKBRS/graph.json","fetch_events":"https://pith.science/api/pith-number/I7XKRSFJ2WH4LLOPHX3IEMKBRS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I7XKRSFJ2WH4LLOPHX3IEMKBRS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I7XKRSFJ2WH4LLOPHX3IEMKBRS/action/storage_attestation","attest_author":"https://pith.science/pith/I7XKRSFJ2WH4LLOPHX3IEMKBRS/action/author_attestation","sign_citation":"https://pith.science/pith/I7XKRSFJ2WH4LLOPHX3IEMKBRS/action/citation_signature","submit_replication":"https://pith.science/pith/I7XKRSFJ2WH4LLOPHX3IEMKBRS/action/replication_record"}},"created_at":"2026-05-18T01:14:10.355404+00:00","updated_at":"2026-05-18T01:14:10.355404+00:00"}