{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:74QAG3LFH4XOQGIOCS6PXADV23","short_pith_number":"pith:74QAG3LF","schema_version":"1.0","canonical_sha256":"ff20036d653f2ee8190e14bcfb8075d6f91b02573d51a5c3d2aebe9c2e27e5e7","source":{"kind":"arxiv","id":"1711.02035","version":2},"attestation_state":"computed","paper":{"title":"Optimum Search Schemes for Approximate String Matching Using Bidirectional FM-Index","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bahman Torkamandi, Christopher Pockrandt, Haochen Luo, Kiavash Kianfar, Knut Reinert","submitted_at":"2017-11-06T17:41:38Z","abstract_excerpt":"Finding approximate occurrences of a pattern in a text using a full-text index is a central problem in bioinformatics and has been extensively researched. Bidirectional indices have opened new possibilities in this regard allowing the search to start from anywhere within the pattern and extend in both directions. In particular, use of search schemes (partitioning the pattern and searching the pieces in certain orders with given bounds on errors) can yield significant speed-ups. However, finding optimal search schemes is a difficult combinatorial optimization problem.\n  Here for the first time,"},"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":"1711.02035","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-06T17:41:38Z","cross_cats_sorted":[],"title_canon_sha256":"6e4323c83854fad98ea983ba17276ac210cbfb83cffb90bc693d149f8b2e4feb","abstract_canon_sha256":"19b387fe65f41d717333f1833edd62720d895779f7bdeb98803e07fb35a9d348"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:02.706245Z","signature_b64":"0TszTAXkGRfK13txfK1vV5FV4hLiMDEediAu8HCiXJYgBeOZQ5duqIMoC7l3b1EGByhZlk8d8vZpNWbM9uEfCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff20036d653f2ee8190e14bcfb8075d6f91b02573d51a5c3d2aebe9c2e27e5e7","last_reissued_at":"2026-05-18T00:22:02.705774Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:02.705774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimum Search Schemes for Approximate String Matching Using Bidirectional FM-Index","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bahman Torkamandi, Christopher Pockrandt, Haochen Luo, Kiavash Kianfar, Knut Reinert","submitted_at":"2017-11-06T17:41:38Z","abstract_excerpt":"Finding approximate occurrences of a pattern in a text using a full-text index is a central problem in bioinformatics and has been extensively researched. Bidirectional indices have opened new possibilities in this regard allowing the search to start from anywhere within the pattern and extend in both directions. In particular, use of search schemes (partitioning the pattern and searching the pieces in certain orders with given bounds on errors) can yield significant speed-ups. However, finding optimal search schemes is a difficult combinatorial optimization problem.\n  Here for the first time,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02035","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":"1711.02035","created_at":"2026-05-18T00:22:02.705849+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.02035v2","created_at":"2026-05-18T00:22:02.705849+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02035","created_at":"2026-05-18T00:22:02.705849+00:00"},{"alias_kind":"pith_short_12","alias_value":"74QAG3LFH4XO","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"74QAG3LFH4XOQGIO","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"74QAG3LF","created_at":"2026-05-18T12:31:03.183658+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/74QAG3LFH4XOQGIOCS6PXADV23","json":"https://pith.science/pith/74QAG3LFH4XOQGIOCS6PXADV23.json","graph_json":"https://pith.science/api/pith-number/74QAG3LFH4XOQGIOCS6PXADV23/graph.json","events_json":"https://pith.science/api/pith-number/74QAG3LFH4XOQGIOCS6PXADV23/events.json","paper":"https://pith.science/paper/74QAG3LF"},"agent_actions":{"view_html":"https://pith.science/pith/74QAG3LFH4XOQGIOCS6PXADV23","download_json":"https://pith.science/pith/74QAG3LFH4XOQGIOCS6PXADV23.json","view_paper":"https://pith.science/paper/74QAG3LF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.02035&json=true","fetch_graph":"https://pith.science/api/pith-number/74QAG3LFH4XOQGIOCS6PXADV23/graph.json","fetch_events":"https://pith.science/api/pith-number/74QAG3LFH4XOQGIOCS6PXADV23/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/74QAG3LFH4XOQGIOCS6PXADV23/action/timestamp_anchor","attest_storage":"https://pith.science/pith/74QAG3LFH4XOQGIOCS6PXADV23/action/storage_attestation","attest_author":"https://pith.science/pith/74QAG3LFH4XOQGIOCS6PXADV23/action/author_attestation","sign_citation":"https://pith.science/pith/74QAG3LFH4XOQGIOCS6PXADV23/action/citation_signature","submit_replication":"https://pith.science/pith/74QAG3LFH4XOQGIOCS6PXADV23/action/replication_record"}},"created_at":"2026-05-18T00:22:02.705849+00:00","updated_at":"2026-05-18T00:22:02.705849+00:00"}