{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LBA7M4HGATZIQQN5B63KV3L2QO","short_pith_number":"pith:LBA7M4HG","schema_version":"1.0","canonical_sha256":"5841f670e604f28841bd0fb6aaed7a83ac85c8ede696dbe2d3bbeed3ba1946d1","source":{"kind":"arxiv","id":"1602.06688","version":2},"attestation_state":"computed","paper":{"title":"siEDM: an efficient string index and search algorithm for edit distance with moves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hiroshi Sakamoto, Kenta Nakashima, Tetsuji Kuboyama, Yasuo Tabei, Yoshimasa Takabatake","submitted_at":"2016-02-22T09:02:44Z","abstract_excerpt":"Although several self-indexes for highly repetitive text collections exist, developing an index and search algorithm with editing operations remains a challenge. Edit distance with moves (EDM) is a string-to-string distance measure that includes substring moves in addition to ordinal editing operations to turn one string into another. Although the problem of computing EDM is intractable, it has a wide range of potential applications, especially in approximate string retrieval. Despite the importance of computing EDM, there has been no efficient method for indexing and searching large text coll"},"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":"1602.06688","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-22T09:02:44Z","cross_cats_sorted":[],"title_canon_sha256":"0b342d37b422f1fb6cf7e5818a30b349dd154f26c496c34e733d12a913c7bdc5","abstract_canon_sha256":"ca184151f5a52d749209f443dfd19a61df4f95ccc3fd7e032d68e6c7c9026b5d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:30.215700Z","signature_b64":"UaNRo0cGWLHnxw/nImoKSp1ifI51LhEi/9zz8Y5FOnLXC2bZdiOjx0S0P1E2iJlVyxfn2CzFm3AOZXjR6Y3KBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5841f670e604f28841bd0fb6aaed7a83ac85c8ede696dbe2d3bbeed3ba1946d1","last_reissued_at":"2026-05-18T01:17:30.214993Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:30.214993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"siEDM: an efficient string index and search algorithm for edit distance with moves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hiroshi Sakamoto, Kenta Nakashima, Tetsuji Kuboyama, Yasuo Tabei, Yoshimasa Takabatake","submitted_at":"2016-02-22T09:02:44Z","abstract_excerpt":"Although several self-indexes for highly repetitive text collections exist, developing an index and search algorithm with editing operations remains a challenge. Edit distance with moves (EDM) is a string-to-string distance measure that includes substring moves in addition to ordinal editing operations to turn one string into another. Although the problem of computing EDM is intractable, it has a wide range of potential applications, especially in approximate string retrieval. Despite the importance of computing EDM, there has been no efficient method for indexing and searching large text coll"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06688","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":"1602.06688","created_at":"2026-05-18T01:17:30.215097+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.06688v2","created_at":"2026-05-18T01:17:30.215097+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06688","created_at":"2026-05-18T01:17:30.215097+00:00"},{"alias_kind":"pith_short_12","alias_value":"LBA7M4HGATZI","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LBA7M4HGATZIQQN5","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LBA7M4HG","created_at":"2026-05-18T12:30:29.479603+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/LBA7M4HGATZIQQN5B63KV3L2QO","json":"https://pith.science/pith/LBA7M4HGATZIQQN5B63KV3L2QO.json","graph_json":"https://pith.science/api/pith-number/LBA7M4HGATZIQQN5B63KV3L2QO/graph.json","events_json":"https://pith.science/api/pith-number/LBA7M4HGATZIQQN5B63KV3L2QO/events.json","paper":"https://pith.science/paper/LBA7M4HG"},"agent_actions":{"view_html":"https://pith.science/pith/LBA7M4HGATZIQQN5B63KV3L2QO","download_json":"https://pith.science/pith/LBA7M4HGATZIQQN5B63KV3L2QO.json","view_paper":"https://pith.science/paper/LBA7M4HG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.06688&json=true","fetch_graph":"https://pith.science/api/pith-number/LBA7M4HGATZIQQN5B63KV3L2QO/graph.json","fetch_events":"https://pith.science/api/pith-number/LBA7M4HGATZIQQN5B63KV3L2QO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LBA7M4HGATZIQQN5B63KV3L2QO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LBA7M4HGATZIQQN5B63KV3L2QO/action/storage_attestation","attest_author":"https://pith.science/pith/LBA7M4HGATZIQQN5B63KV3L2QO/action/author_attestation","sign_citation":"https://pith.science/pith/LBA7M4HGATZIQQN5B63KV3L2QO/action/citation_signature","submit_replication":"https://pith.science/pith/LBA7M4HGATZIQQN5B63KV3L2QO/action/replication_record"}},"created_at":"2026-05-18T01:17:30.215097+00:00","updated_at":"2026-05-18T01:17:30.215097+00:00"}