{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:VU5K73JMN5FC4PDNYXQ4P7MZYY","short_pith_number":"pith:VU5K73JM","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"},"canonical_sha256":"ad3aafed2c6f4a2e3c6dc5e1c7fd99c624713907be71054797ea2cf749f6e2f0","source":{"kind":"arxiv","id":"2507.04806","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.04806","created_at":"2026-07-05T11:32:54Z"},{"alias_kind":"arxiv_version","alias_value":"2507.04806v1","created_at":"2026-07-05T11:32:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.04806","created_at":"2026-07-05T11:32:54Z"},{"alias_kind":"pith_short_12","alias_value":"VU5K73JMN5FC","created_at":"2026-07-05T11:32:54Z"},{"alias_kind":"pith_short_16","alias_value":"VU5K73JMN5FC4PDN","created_at":"2026-07-05T11:32:54Z"},{"alias_kind":"pith_short_8","alias_value":"VU5K73JM","created_at":"2026-07-05T11:32:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:VU5K73JMN5FC4PDNYXQ4P7MZYY","target":"record","payload":{"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"},"canonical_sha256":"ad3aafed2c6f4a2e3c6dc5e1c7fd99c624713907be71054797ea2cf749f6e2f0","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"},"source_kind":"arxiv","source_id":"2507.04806","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:32:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"noKYjzR6HPOK1EsqMXmMRLeqGMwMS88icPLEZezyeGpAJItJortbiGb1ciHfaCpZ/ykk/mt3bamEnrPNr0UuDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T01:56:56.453808Z"},"content_sha256":"f21559278780a80d80287478183f52587190b15efd1c939fe1b3dadcd0a159db","schema_version":"1.0","event_id":"sha256:f21559278780a80d80287478183f52587190b15efd1c939fe1b3dadcd0a159db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:VU5K73JMN5FC4PDNYXQ4P7MZYY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:32:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DcDpXFU6cIP/yOx1Xmznc+9nLDYNMP+Oj8Brp/PCIK1dv5YZnJ3xKhYzp2WNljzlRskcxH8PJaz2XRLoUe+nAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T01:56:56.454628Z"},"content_sha256":"628d3b43306717231b0236c7de489ac9b5495175a3f29e445d6ecabaaa056bbf","schema_version":"1.0","event_id":"sha256:628d3b43306717231b0236c7de489ac9b5495175a3f29e445d6ecabaaa056bbf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VU5K73JMN5FC4PDNYXQ4P7MZYY/bundle.json","state_url":"https://pith.science/pith/VU5K73JMN5FC4PDNYXQ4P7MZYY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VU5K73JMN5FC4PDNYXQ4P7MZYY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-09T01:56:56Z","links":{"resolver":"https://pith.science/pith/VU5K73JMN5FC4PDNYXQ4P7MZYY","bundle":"https://pith.science/pith/VU5K73JMN5FC4PDNYXQ4P7MZYY/bundle.json","state":"https://pith.science/pith/VU5K73JMN5FC4PDNYXQ4P7MZYY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VU5K73JMN5FC4PDNYXQ4P7MZYY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:VU5K73JMN5FC4PDNYXQ4P7MZYY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"98a034f9cbb6aabcca28a28249811856746b027a99272440f33ee35cb2544f07","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-07-07T09:25:02Z","title_canon_sha256":"e811ebc5febedb4cff5ffee64b5ac0371be95fe91c04262bd3dc3500ab323734"},"schema_version":"1.0","source":{"id":"2507.04806","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.04806","created_at":"2026-07-05T11:32:54Z"},{"alias_kind":"arxiv_version","alias_value":"2507.04806v1","created_at":"2026-07-05T11:32:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.04806","created_at":"2026-07-05T11:32:54Z"},{"alias_kind":"pith_short_12","alias_value":"VU5K73JMN5FC","created_at":"2026-07-05T11:32:54Z"},{"alias_kind":"pith_short_16","alias_value":"VU5K73JMN5FC4PDN","created_at":"2026-07-05T11:32:54Z"},{"alias_kind":"pith_short_8","alias_value":"VU5K73JM","created_at":"2026-07-05T11:32:54Z"}],"graph_snapshots":[{"event_id":"sha256:628d3b43306717231b0236c7de489ac9b5495175a3f29e445d6ecabaaa056bbf","target":"graph","created_at":"2026-07-05T11:32:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.04806/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Gennian Ge, Zuo Ye","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.04806","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f21559278780a80d80287478183f52587190b15efd1c939fe1b3dadcd0a159db","target":"record","created_at":"2026-07-05T11:32:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"98a034f9cbb6aabcca28a28249811856746b027a99272440f33ee35cb2544f07","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-07-07T09:25:02Z","title_canon_sha256":"e811ebc5febedb4cff5ffee64b5ac0371be95fe91c04262bd3dc3500ab323734"},"schema_version":"1.0","source":{"id":"2507.04806","kind":"arxiv","version":1}},"canonical_sha256":"ad3aafed2c6f4a2e3c6dc5e1c7fd99c624713907be71054797ea2cf749f6e2f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad3aafed2c6f4a2e3c6dc5e1c7fd99c624713907be71054797ea2cf749f6e2f0","first_computed_at":"2026-07-05T11:32:54.546735Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:32:54.546735Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O21iFF7qPp28jML8i6s/yDjyr782mZYD++PcdDLTxtj0IpCMY6bC5K3LnEJO8fMBTzTpX8ezZPhOFsVPvenrAA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:32:54.547247Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.04806","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f21559278780a80d80287478183f52587190b15efd1c939fe1b3dadcd0a159db","sha256:628d3b43306717231b0236c7de489ac9b5495175a3f29e445d6ecabaaa056bbf"],"state_sha256":"f84c7ba7ecf88c7f900273a075edace0bc0844c7de54e3c8bcac8a5d693c4e56"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bNMTJm4lcMAjISzHCq7iOnw8Z5viv0EFMjoR8rsxsmR8LlnYUCYYjeOYKFIDzDPtOr2H5F2dgYC3lXadXutHDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T01:56:56.459936Z","bundle_sha256":"a9c62cdf2c4966ece7ad20ce3c1e03cc3d05284962b3b5d70f7d95c0bcee26b0"}}