{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PFXO7YD6YHTSK7KA77AVCAZKU3","short_pith_number":"pith:PFXO7YD6","schema_version":"1.0","canonical_sha256":"796eefe07ec1e7257d40ffc151032aa6d63a689b75765d2254a337b114a28d7d","source":{"kind":"arxiv","id":"1504.07298","version":2},"attestation_state":"computed","paper":{"title":"Adaptive Computation of the Swap-Insert Correction Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"J\\'er\\'emy Barbay, Pablo P\\'erez-Lantero","submitted_at":"2015-04-27T23:00:16Z","abstract_excerpt":"The Swap-Insert Correction distance from a string $S$ of length $n$ to another string $L$ of length $m\\geq n$ on the alphabet $[1..d]$ is the minimum number of insertions, and swaps of pairs of adjacent symbols, converting $S$ into $L$. Contrarily to other correction distances, computing it is NP-Hard in the size $d$ of the alphabet. We describe an algorithm computing this distance in time within $O(d^2 nm g^{d-1})$, where there are $n_\\alpha$ occurrences of $\\alpha$ in $S$, $m_\\alpha$ occurrences of $\\alpha$ in $L$, and where $g=\\max_{\\alpha\\in[1..d]} \\min\\{n_\\alpha,m_\\alpha-n_\\alpha\\}$ measu"},"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":"1504.07298","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-27T23:00:16Z","cross_cats_sorted":[],"title_canon_sha256":"257a4c54ff0d169dd7ac2574cacf2cca763113f1ca2592a7a17e2a66af34f1f4","abstract_canon_sha256":"c6c0038ae0d04bf5ec43fac185817c636057411d77c0d331bed30e7a52a71d16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:47.165983Z","signature_b64":"3tpFK0BGMBQ5QmOHvOD/XVZkWmMoW0EctthJTNqx947rlFhRS4XGoixqktpFv6Smes5+jv41o7CvmYklaxHNCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"796eefe07ec1e7257d40ffc151032aa6d63a689b75765d2254a337b114a28d7d","last_reissued_at":"2026-05-18T01:37:47.165594Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:47.165594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Computation of the Swap-Insert Correction Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"J\\'er\\'emy Barbay, Pablo P\\'erez-Lantero","submitted_at":"2015-04-27T23:00:16Z","abstract_excerpt":"The Swap-Insert Correction distance from a string $S$ of length $n$ to another string $L$ of length $m\\geq n$ on the alphabet $[1..d]$ is the minimum number of insertions, and swaps of pairs of adjacent symbols, converting $S$ into $L$. Contrarily to other correction distances, computing it is NP-Hard in the size $d$ of the alphabet. We describe an algorithm computing this distance in time within $O(d^2 nm g^{d-1})$, where there are $n_\\alpha$ occurrences of $\\alpha$ in $S$, $m_\\alpha$ occurrences of $\\alpha$ in $L$, and where $g=\\max_{\\alpha\\in[1..d]} \\min\\{n_\\alpha,m_\\alpha-n_\\alpha\\}$ measu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07298","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":"1504.07298","created_at":"2026-05-18T01:37:47.165659+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.07298v2","created_at":"2026-05-18T01:37:47.165659+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07298","created_at":"2026-05-18T01:37:47.165659+00:00"},{"alias_kind":"pith_short_12","alias_value":"PFXO7YD6YHTS","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PFXO7YD6YHTSK7KA","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PFXO7YD6","created_at":"2026-05-18T12:29:37.295048+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/PFXO7YD6YHTSK7KA77AVCAZKU3","json":"https://pith.science/pith/PFXO7YD6YHTSK7KA77AVCAZKU3.json","graph_json":"https://pith.science/api/pith-number/PFXO7YD6YHTSK7KA77AVCAZKU3/graph.json","events_json":"https://pith.science/api/pith-number/PFXO7YD6YHTSK7KA77AVCAZKU3/events.json","paper":"https://pith.science/paper/PFXO7YD6"},"agent_actions":{"view_html":"https://pith.science/pith/PFXO7YD6YHTSK7KA77AVCAZKU3","download_json":"https://pith.science/pith/PFXO7YD6YHTSK7KA77AVCAZKU3.json","view_paper":"https://pith.science/paper/PFXO7YD6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.07298&json=true","fetch_graph":"https://pith.science/api/pith-number/PFXO7YD6YHTSK7KA77AVCAZKU3/graph.json","fetch_events":"https://pith.science/api/pith-number/PFXO7YD6YHTSK7KA77AVCAZKU3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PFXO7YD6YHTSK7KA77AVCAZKU3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PFXO7YD6YHTSK7KA77AVCAZKU3/action/storage_attestation","attest_author":"https://pith.science/pith/PFXO7YD6YHTSK7KA77AVCAZKU3/action/author_attestation","sign_citation":"https://pith.science/pith/PFXO7YD6YHTSK7KA77AVCAZKU3/action/citation_signature","submit_replication":"https://pith.science/pith/PFXO7YD6YHTSK7KA77AVCAZKU3/action/replication_record"}},"created_at":"2026-05-18T01:37:47.165659+00:00","updated_at":"2026-05-18T01:37:47.165659+00:00"}