{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VU5K73JMN5FC4PDNYXQ4P7MZYY","short_pith_number":"pith:VU5K73JM","schema_version":"1.0","canonical_sha256":"ad3aafed2c6f4a2e3c6dc5e1c7fd99c624713907be71054797ea2cf749f6e2f0","source":{"kind":"arxiv","id":"2507.04806","version":1},"attestation_state":"computed","paper":{"title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gennian Ge, Zuo Ye","submitted_at":"2025-07-07T09:25:02Z","abstract_excerpt":"The Damerau-Levenshtein distance between two sequences is the minimum number of operations (deletions, insertions, substitutions, and adjacent transpositions) required to convert one sequence into another. Notwithstanding a long history of this metric, research on error-correcting codes under this distance has remained limited. Recently, motivated by applications in DNA-based storage systems, Gabrys \\textit{et al} and Wang \\texit{et al} reinvigorated interest in this metric. In their works, some codes correcting both deletions and adjacent transpositions were constructed. However, theoretical "},"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":"2507.04806","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-07-07T09:25:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e811ebc5febedb4cff5ffee64b5ac0371be95fe91c04262bd3dc3500ab323734","abstract_canon_sha256":"98a034f9cbb6aabcca28a28249811856746b027a99272440f33ee35cb2544f07"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:32:54.547247Z","signature_b64":"O21iFF7qPp28jML8i6s/yDjyr782mZYD++PcdDLTxtj0IpCMY6bC5K3LnEJO8fMBTzTpX8ezZPhOFsVPvenrAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad3aafed2c6f4a2e3c6dc5e1c7fd99c624713907be71054797ea2cf749f6e2f0","last_reissued_at":"2026-07-05T11:32:54.546735Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:32:54.546735Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gennian Ge, Zuo Ye","submitted_at":"2025-07-07T09:25:02Z","abstract_excerpt":"The Damerau-Levenshtein distance between two sequences is the minimum number of operations (deletions, insertions, substitutions, and adjacent transpositions) required to convert one sequence into another. Notwithstanding a long history of this metric, research on error-correcting codes under this distance has remained limited. Recently, motivated by applications in DNA-based storage systems, Gabrys \\textit{et al} and Wang \\texit{et al} reinvigorated interest in this metric. In their works, some codes correcting both deletions and adjacent transpositions were constructed. However, theoretical "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.04806","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.04806/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2507.04806","created_at":"2026-07-05T11:32:54.546794+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.04806v1","created_at":"2026-07-05T11:32:54.546794+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.04806","created_at":"2026-07-05T11:32:54.546794+00:00"},{"alias_kind":"pith_short_12","alias_value":"VU5K73JMN5FC","created_at":"2026-07-05T11:32:54.546794+00:00"},{"alias_kind":"pith_short_16","alias_value":"VU5K73JMN5FC4PDN","created_at":"2026-07-05T11:32:54.546794+00:00"},{"alias_kind":"pith_short_8","alias_value":"VU5K73JM","created_at":"2026-07-05T11:32:54.546794+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/VU5K73JMN5FC4PDNYXQ4P7MZYY","json":"https://pith.science/pith/VU5K73JMN5FC4PDNYXQ4P7MZYY.json","graph_json":"https://pith.science/api/pith-number/VU5K73JMN5FC4PDNYXQ4P7MZYY/graph.json","events_json":"https://pith.science/api/pith-number/VU5K73JMN5FC4PDNYXQ4P7MZYY/events.json","paper":"https://pith.science/paper/VU5K73JM"},"agent_actions":{"view_html":"https://pith.science/pith/VU5K73JMN5FC4PDNYXQ4P7MZYY","download_json":"https://pith.science/pith/VU5K73JMN5FC4PDNYXQ4P7MZYY.json","view_paper":"https://pith.science/paper/VU5K73JM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.04806&json=true","fetch_graph":"https://pith.science/api/pith-number/VU5K73JMN5FC4PDNYXQ4P7MZYY/graph.json","fetch_events":"https://pith.science/api/pith-number/VU5K73JMN5FC4PDNYXQ4P7MZYY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VU5K73JMN5FC4PDNYXQ4P7MZYY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VU5K73JMN5FC4PDNYXQ4P7MZYY/action/storage_attestation","attest_author":"https://pith.science/pith/VU5K73JMN5FC4PDNYXQ4P7MZYY/action/author_attestation","sign_citation":"https://pith.science/pith/VU5K73JMN5FC4PDNYXQ4P7MZYY/action/citation_signature","submit_replication":"https://pith.science/pith/VU5K73JMN5FC4PDNYXQ4P7MZYY/action/replication_record"}},"created_at":"2026-07-05T11:32:54.546794+00:00","updated_at":"2026-07-05T11:32:54.546794+00:00"}