{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:4I5S6D2BWUMZ4KXNZAFGBRFL3J","short_pith_number":"pith:4I5S6D2B","schema_version":"1.0","canonical_sha256":"e23b2f0f41b5199e2aedc80a60c4abda6fd12d49081e667fab52783462bd29d8","source":{"kind":"arxiv","id":"1104.3810","version":1},"attestation_state":"computed","paper":{"title":"Fixed Block Compression Boosting in FM-Indexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.DS","authors_text":"Juha K\\\"arkk\\\"ainen, Simon J. Puglisi","submitted_at":"2011-04-19T17:26:46Z","abstract_excerpt":"A compressed full-text self-index occupies space close to that of the compressed text and simultaneously allows fast pattern matching and random access to the underlying text. Among the best compressed self-indexes, in theory and in practice, are several members of the FM-index family. In this paper, we describe new FM-index variants that combine nice theoretical properties, simple implementation and improved practical performance. Our main result is a new technique called fixed block compression boosting, which is a simpler and faster alternative to optimal compression boosting and implicit c"},"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":"1104.3810","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-19T17:26:46Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"eb68cbdb7012807f13c797f97be2bc169866f49fe985805deb61702378c8913f","abstract_canon_sha256":"d8f37fe23baa8dd8151d8bdf4b7095932d9a655d25231883a7ae41a37decd606"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:55.645984Z","signature_b64":"HCfg/+qOQqpnT7ClkkEvi7S7mpKtilTP4heamdnt3dGZ5LIU5yQg8ZjjS9Uc73YUu0ljntT34UPkb5rzPhiLBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e23b2f0f41b5199e2aedc80a60c4abda6fd12d49081e667fab52783462bd29d8","last_reissued_at":"2026-05-18T04:23:55.645604Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:55.645604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fixed Block Compression Boosting in FM-Indexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.DS","authors_text":"Juha K\\\"arkk\\\"ainen, Simon J. Puglisi","submitted_at":"2011-04-19T17:26:46Z","abstract_excerpt":"A compressed full-text self-index occupies space close to that of the compressed text and simultaneously allows fast pattern matching and random access to the underlying text. Among the best compressed self-indexes, in theory and in practice, are several members of the FM-index family. In this paper, we describe new FM-index variants that combine nice theoretical properties, simple implementation and improved practical performance. Our main result is a new technique called fixed block compression boosting, which is a simpler and faster alternative to optimal compression boosting and implicit c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3810","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":"1104.3810","created_at":"2026-05-18T04:23:55.645667+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.3810v1","created_at":"2026-05-18T04:23:55.645667+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3810","created_at":"2026-05-18T04:23:55.645667+00:00"},{"alias_kind":"pith_short_12","alias_value":"4I5S6D2BWUMZ","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"4I5S6D2BWUMZ4KXN","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"4I5S6D2B","created_at":"2026-05-18T12:26:20.644004+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/4I5S6D2BWUMZ4KXNZAFGBRFL3J","json":"https://pith.science/pith/4I5S6D2BWUMZ4KXNZAFGBRFL3J.json","graph_json":"https://pith.science/api/pith-number/4I5S6D2BWUMZ4KXNZAFGBRFL3J/graph.json","events_json":"https://pith.science/api/pith-number/4I5S6D2BWUMZ4KXNZAFGBRFL3J/events.json","paper":"https://pith.science/paper/4I5S6D2B"},"agent_actions":{"view_html":"https://pith.science/pith/4I5S6D2BWUMZ4KXNZAFGBRFL3J","download_json":"https://pith.science/pith/4I5S6D2BWUMZ4KXNZAFGBRFL3J.json","view_paper":"https://pith.science/paper/4I5S6D2B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.3810&json=true","fetch_graph":"https://pith.science/api/pith-number/4I5S6D2BWUMZ4KXNZAFGBRFL3J/graph.json","fetch_events":"https://pith.science/api/pith-number/4I5S6D2BWUMZ4KXNZAFGBRFL3J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4I5S6D2BWUMZ4KXNZAFGBRFL3J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4I5S6D2BWUMZ4KXNZAFGBRFL3J/action/storage_attestation","attest_author":"https://pith.science/pith/4I5S6D2BWUMZ4KXNZAFGBRFL3J/action/author_attestation","sign_citation":"https://pith.science/pith/4I5S6D2BWUMZ4KXNZAFGBRFL3J/action/citation_signature","submit_replication":"https://pith.science/pith/4I5S6D2BWUMZ4KXNZAFGBRFL3J/action/replication_record"}},"created_at":"2026-05-18T04:23:55.645667+00:00","updated_at":"2026-05-18T04:23:55.645667+00:00"}