{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NBUQRNIGA3ZRD2IACOYYKFC5WI","short_pith_number":"pith:NBUQRNIG","schema_version":"1.0","canonical_sha256":"686908b50606f311e90013b185145db209b0b67549bc8220b126502d6663c830","source":{"kind":"arxiv","id":"1606.03897","version":1},"attestation_state":"computed","paper":{"title":"FM-index of Alignment with Gaps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Heejin Park, Hyunjoon Kim, Joong Chae Na, Kunsoo Park, Laurent Mouchardd, Martine Leonard, Seunghwan Min, Thierry Lecroq","submitted_at":"2016-06-13T11:23:45Z","abstract_excerpt":"Recently, a compressed index for similar strings, called the FM-index of alignment (FMA), has been proposed with the functionalities of pattern search and random access. The FMA is quite efficient in space requirement and pattern search time, but it is applicable only for an alignment of similar strings without gaps. In this paper we propose the FM-index of alignment with gaps, a realistic index for similar strings, which allows gaps in their alignment. For this, we design a new version of the suffix array of alignment by using alignment transformation and a new definition of the alignment-suf"},"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":"1606.03897","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-13T11:23:45Z","cross_cats_sorted":[],"title_canon_sha256":"1f8be74d233bb57239e4900b87189b1c0805e9b9da6c2ad64819603c9a2b203a","abstract_canon_sha256":"0a1ca50deb9a995314c32221e743b7877dfeb501fbc609763807d51912609338"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:32.836104Z","signature_b64":"bM1ziygYIO9jgr316Z17ZIy2ag3F8Vj60+8AdR0tAypEQzcPFQYpDDsZ6NV6i8531cX9JwTCIAmxVMchln1vBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"686908b50606f311e90013b185145db209b0b67549bc8220b126502d6663c830","last_reissued_at":"2026-05-18T01:12:32.835669Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:32.835669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FM-index of Alignment with Gaps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Heejin Park, Hyunjoon Kim, Joong Chae Na, Kunsoo Park, Laurent Mouchardd, Martine Leonard, Seunghwan Min, Thierry Lecroq","submitted_at":"2016-06-13T11:23:45Z","abstract_excerpt":"Recently, a compressed index for similar strings, called the FM-index of alignment (FMA), has been proposed with the functionalities of pattern search and random access. The FMA is quite efficient in space requirement and pattern search time, but it is applicable only for an alignment of similar strings without gaps. In this paper we propose the FM-index of alignment with gaps, a realistic index for similar strings, which allows gaps in their alignment. For this, we design a new version of the suffix array of alignment by using alignment transformation and a new definition of the alignment-suf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03897","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":"1606.03897","created_at":"2026-05-18T01:12:32.835744+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.03897v1","created_at":"2026-05-18T01:12:32.835744+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03897","created_at":"2026-05-18T01:12:32.835744+00:00"},{"alias_kind":"pith_short_12","alias_value":"NBUQRNIGA3ZR","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"NBUQRNIGA3ZRD2IA","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"NBUQRNIG","created_at":"2026-05-18T12:30:32.724797+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/NBUQRNIGA3ZRD2IACOYYKFC5WI","json":"https://pith.science/pith/NBUQRNIGA3ZRD2IACOYYKFC5WI.json","graph_json":"https://pith.science/api/pith-number/NBUQRNIGA3ZRD2IACOYYKFC5WI/graph.json","events_json":"https://pith.science/api/pith-number/NBUQRNIGA3ZRD2IACOYYKFC5WI/events.json","paper":"https://pith.science/paper/NBUQRNIG"},"agent_actions":{"view_html":"https://pith.science/pith/NBUQRNIGA3ZRD2IACOYYKFC5WI","download_json":"https://pith.science/pith/NBUQRNIGA3ZRD2IACOYYKFC5WI.json","view_paper":"https://pith.science/paper/NBUQRNIG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.03897&json=true","fetch_graph":"https://pith.science/api/pith-number/NBUQRNIGA3ZRD2IACOYYKFC5WI/graph.json","fetch_events":"https://pith.science/api/pith-number/NBUQRNIGA3ZRD2IACOYYKFC5WI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NBUQRNIGA3ZRD2IACOYYKFC5WI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NBUQRNIGA3ZRD2IACOYYKFC5WI/action/storage_attestation","attest_author":"https://pith.science/pith/NBUQRNIGA3ZRD2IACOYYKFC5WI/action/author_attestation","sign_citation":"https://pith.science/pith/NBUQRNIGA3ZRD2IACOYYKFC5WI/action/citation_signature","submit_replication":"https://pith.science/pith/NBUQRNIGA3ZRD2IACOYYKFC5WI/action/replication_record"}},"created_at":"2026-05-18T01:12:32.835744+00:00","updated_at":"2026-05-18T01:12:32.835744+00:00"}