{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:YMVJALBQWRYBKXAWNP5HXD4TSM","short_pith_number":"pith:YMVJALBQ","schema_version":"1.0","canonical_sha256":"c32a902c30b470155c166bfa7b8f93931f0eb581470fa61d2421842b4a64534d","source":{"kind":"arxiv","id":"1205.1195","version":1},"attestation_state":"computed","paper":{"title":"Sequential-Access FM-Indexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Travis Gagie","submitted_at":"2012-05-06T09:26:45Z","abstract_excerpt":"Previous authors have shown how to build FM-indexes efficiently in external memory, but querying them efficiently remains an open problem. Searching na\\\"{i}vely for a pattern $P$ requires (\\Theta (|P|)) random access. In this paper we show how, by storing a few small auxiliary tables, we can access data only in the order in which they appear on disk, which should be faster."},"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":"1205.1195","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-06T09:26:45Z","cross_cats_sorted":[],"title_canon_sha256":"22463d66124a24f65e3f7a474dead160f287b89b2df66d2f8fe6836a631eddc8","abstract_canon_sha256":"c4fd861d2109a0532bd8c01a76458db4c6144adb5b004d42a5e68b4ab4c1fc81"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:11.836019Z","signature_b64":"emxwXHiH0QMyPy3XGOaZMfOkC6xNnaAr3qLtNkdzbN0YlJV5hGGW8+My3dPiIQ9tgkBegnk+9FK10ftZ7JGtCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c32a902c30b470155c166bfa7b8f93931f0eb581470fa61d2421842b4a64534d","last_reissued_at":"2026-05-18T03:56:11.835285Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:11.835285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sequential-Access FM-Indexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Travis Gagie","submitted_at":"2012-05-06T09:26:45Z","abstract_excerpt":"Previous authors have shown how to build FM-indexes efficiently in external memory, but querying them efficiently remains an open problem. Searching na\\\"{i}vely for a pattern $P$ requires (\\Theta (|P|)) random access. In this paper we show how, by storing a few small auxiliary tables, we can access data only in the order in which they appear on disk, which should be faster."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1195","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":"1205.1195","created_at":"2026-05-18T03:56:11.835412+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.1195v1","created_at":"2026-05-18T03:56:11.835412+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1195","created_at":"2026-05-18T03:56:11.835412+00:00"},{"alias_kind":"pith_short_12","alias_value":"YMVJALBQWRYB","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"YMVJALBQWRYBKXAW","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"YMVJALBQ","created_at":"2026-05-18T12:27:27.928770+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/YMVJALBQWRYBKXAWNP5HXD4TSM","json":"https://pith.science/pith/YMVJALBQWRYBKXAWNP5HXD4TSM.json","graph_json":"https://pith.science/api/pith-number/YMVJALBQWRYBKXAWNP5HXD4TSM/graph.json","events_json":"https://pith.science/api/pith-number/YMVJALBQWRYBKXAWNP5HXD4TSM/events.json","paper":"https://pith.science/paper/YMVJALBQ"},"agent_actions":{"view_html":"https://pith.science/pith/YMVJALBQWRYBKXAWNP5HXD4TSM","download_json":"https://pith.science/pith/YMVJALBQWRYBKXAWNP5HXD4TSM.json","view_paper":"https://pith.science/paper/YMVJALBQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.1195&json=true","fetch_graph":"https://pith.science/api/pith-number/YMVJALBQWRYBKXAWNP5HXD4TSM/graph.json","fetch_events":"https://pith.science/api/pith-number/YMVJALBQWRYBKXAWNP5HXD4TSM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YMVJALBQWRYBKXAWNP5HXD4TSM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YMVJALBQWRYBKXAWNP5HXD4TSM/action/storage_attestation","attest_author":"https://pith.science/pith/YMVJALBQWRYBKXAWNP5HXD4TSM/action/author_attestation","sign_citation":"https://pith.science/pith/YMVJALBQWRYBKXAWNP5HXD4TSM/action/citation_signature","submit_replication":"https://pith.science/pith/YMVJALBQWRYBKXAWNP5HXD4TSM/action/replication_record"}},"created_at":"2026-05-18T03:56:11.835412+00:00","updated_at":"2026-05-18T03:56:11.835412+00:00"}