{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LLMR2HZHNRROUQ7GAEXF3Q5AO2","short_pith_number":"pith:LLMR2HZH","schema_version":"1.0","canonical_sha256":"5ad91d1f276c62ea43e6012e5dc3a076ba370f46dccf1cd6c366111c48967c42","source":{"kind":"arxiv","id":"1506.04896","version":2},"attestation_state":"computed","paper":{"title":"FM-index for dummies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Marcin Raniszewski, Sebastian Deorowicz, Szymon Grabowski","submitted_at":"2015-06-16T09:53:29Z","abstract_excerpt":"The FM-index is a celebrated compressed data structure for full-text pattern searching. After the first wave of interest in its theoretical developments, we can observe a surge of interest in practical FM-index variants in the last few years. These enhancements are often related to a bit-vector representation, augmented with an efficient rank-handling data structure. In this work, we propose a new, cache-friendly, implementation of the rank primitive and advocate for a very simple architecture of the FM-index, which trades compression ratio for speed. Experimental results show that our variant"},"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":"1506.04896","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-16T09:53:29Z","cross_cats_sorted":[],"title_canon_sha256":"cc56d502007202ed2d0079bcb3d34c6690f7c0b80e3f78246502d2bd867d1047","abstract_canon_sha256":"4a481e24d9c6e9ef0c5249e8d85834e279cee79ebf5e7ca3790d098e2c4f81f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:20.803738Z","signature_b64":"Py4pgRTlurpWIwFXnOYfyxzzsu9NmUBkXJS63cFqAi+3eA+DVbPF531ADAPM1ndxEhll8idYdErrIxnfiWT6Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ad91d1f276c62ea43e6012e5dc3a076ba370f46dccf1cd6c366111c48967c42","last_reissued_at":"2026-05-18T01:29:20.802957Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:20.802957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FM-index for dummies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Marcin Raniszewski, Sebastian Deorowicz, Szymon Grabowski","submitted_at":"2015-06-16T09:53:29Z","abstract_excerpt":"The FM-index is a celebrated compressed data structure for full-text pattern searching. After the first wave of interest in its theoretical developments, we can observe a surge of interest in practical FM-index variants in the last few years. These enhancements are often related to a bit-vector representation, augmented with an efficient rank-handling data structure. In this work, we propose a new, cache-friendly, implementation of the rank primitive and advocate for a very simple architecture of the FM-index, which trades compression ratio for speed. Experimental results show that our variant"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04896","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":"1506.04896","created_at":"2026-05-18T01:29:20.803087+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.04896v2","created_at":"2026-05-18T01:29:20.803087+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04896","created_at":"2026-05-18T01:29:20.803087+00:00"},{"alias_kind":"pith_short_12","alias_value":"LLMR2HZHNRRO","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LLMR2HZHNRROUQ7G","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LLMR2HZH","created_at":"2026-05-18T12:29:29.992203+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/LLMR2HZHNRROUQ7GAEXF3Q5AO2","json":"https://pith.science/pith/LLMR2HZHNRROUQ7GAEXF3Q5AO2.json","graph_json":"https://pith.science/api/pith-number/LLMR2HZHNRROUQ7GAEXF3Q5AO2/graph.json","events_json":"https://pith.science/api/pith-number/LLMR2HZHNRROUQ7GAEXF3Q5AO2/events.json","paper":"https://pith.science/paper/LLMR2HZH"},"agent_actions":{"view_html":"https://pith.science/pith/LLMR2HZHNRROUQ7GAEXF3Q5AO2","download_json":"https://pith.science/pith/LLMR2HZHNRROUQ7GAEXF3Q5AO2.json","view_paper":"https://pith.science/paper/LLMR2HZH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.04896&json=true","fetch_graph":"https://pith.science/api/pith-number/LLMR2HZHNRROUQ7GAEXF3Q5AO2/graph.json","fetch_events":"https://pith.science/api/pith-number/LLMR2HZHNRROUQ7GAEXF3Q5AO2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LLMR2HZHNRROUQ7GAEXF3Q5AO2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LLMR2HZHNRROUQ7GAEXF3Q5AO2/action/storage_attestation","attest_author":"https://pith.science/pith/LLMR2HZHNRROUQ7GAEXF3Q5AO2/action/author_attestation","sign_citation":"https://pith.science/pith/LLMR2HZHNRROUQ7GAEXF3Q5AO2/action/citation_signature","submit_replication":"https://pith.science/pith/LLMR2HZHNRROUQ7GAEXF3Q5AO2/action/replication_record"}},"created_at":"2026-05-18T01:29:20.803087+00:00","updated_at":"2026-05-18T01:29:20.803087+00:00"}