{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:H3O5G5GI65HRDLLAVM7UP3THRM","short_pith_number":"pith:H3O5G5GI","schema_version":"1.0","canonical_sha256":"3eddd374c8f74f11ad60ab3f47ee678b20b93d6b8950a4ae9bea2867482f1c39","source":{"kind":"arxiv","id":"2505.04232","version":1},"attestation_state":"computed","paper":{"title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gennian Ge, Yubo Sun, Yuling Li","submitted_at":"2025-05-07T08:34:06Z","abstract_excerpt":"In this paper, we investigate binary reconstruction codes capable of correcting one deletion and one substitution. We define the \\emph{single-deletion single-substitution ball} function $ \\mathcal{B} $ as a mapping from a sequence to the set of sequences that can be derived from it by performing one deletion and one substitution. A binary \\emph{$(n,N;\\mathcal{B})$-reconstruction code} is defined as a collection of binary sequences of length $ n $ such that the intersection size between the single-deletion single-substitution balls of any two distinct codewords is strictly less than $ N $. This"},"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":"2505.04232","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-05-07T08:34:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"48fb270c2c262688ad7a62ab4ea67be33cc1ea0b89e4532da9d008a0923b89e0","abstract_canon_sha256":"afa13ad540cb457f9381b08beb2637a2103757917aead9563fc3c6686557063e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:59:38.527451Z","signature_b64":"WHvJ1teaDPnwTt2/BxWOlYKdOkRMSlvYQcmHj/hb2SVZOPR1mxnwVfyBhYOOWtrWCXQo3B2SoSm3+MIIK3leAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3eddd374c8f74f11ad60ab3f47ee678b20b93d6b8950a4ae9bea2867482f1c39","last_reissued_at":"2026-07-05T10:59:38.526967Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:59:38.526967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gennian Ge, Yubo Sun, Yuling Li","submitted_at":"2025-05-07T08:34:06Z","abstract_excerpt":"In this paper, we investigate binary reconstruction codes capable of correcting one deletion and one substitution. We define the \\emph{single-deletion single-substitution ball} function $ \\mathcal{B} $ as a mapping from a sequence to the set of sequences that can be derived from it by performing one deletion and one substitution. A binary \\emph{$(n,N;\\mathcal{B})$-reconstruction code} is defined as a collection of binary sequences of length $ n $ such that the intersection size between the single-deletion single-substitution balls of any two distinct codewords is strictly less than $ N $. This"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.04232","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/2505.04232/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":"2505.04232","created_at":"2026-07-05T10:59:38.527024+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.04232v1","created_at":"2026-07-05T10:59:38.527024+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.04232","created_at":"2026-07-05T10:59:38.527024+00:00"},{"alias_kind":"pith_short_12","alias_value":"H3O5G5GI65HR","created_at":"2026-07-05T10:59:38.527024+00:00"},{"alias_kind":"pith_short_16","alias_value":"H3O5G5GI65HRDLLA","created_at":"2026-07-05T10:59:38.527024+00:00"},{"alias_kind":"pith_short_8","alias_value":"H3O5G5GI","created_at":"2026-07-05T10:59:38.527024+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.25294","citing_title":"Correcting One Deletion and One Substitution with a Constant Number of Reads","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H3O5G5GI65HRDLLAVM7UP3THRM","json":"https://pith.science/pith/H3O5G5GI65HRDLLAVM7UP3THRM.json","graph_json":"https://pith.science/api/pith-number/H3O5G5GI65HRDLLAVM7UP3THRM/graph.json","events_json":"https://pith.science/api/pith-number/H3O5G5GI65HRDLLAVM7UP3THRM/events.json","paper":"https://pith.science/paper/H3O5G5GI"},"agent_actions":{"view_html":"https://pith.science/pith/H3O5G5GI65HRDLLAVM7UP3THRM","download_json":"https://pith.science/pith/H3O5G5GI65HRDLLAVM7UP3THRM.json","view_paper":"https://pith.science/paper/H3O5G5GI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.04232&json=true","fetch_graph":"https://pith.science/api/pith-number/H3O5G5GI65HRDLLAVM7UP3THRM/graph.json","fetch_events":"https://pith.science/api/pith-number/H3O5G5GI65HRDLLAVM7UP3THRM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H3O5G5GI65HRDLLAVM7UP3THRM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H3O5G5GI65HRDLLAVM7UP3THRM/action/storage_attestation","attest_author":"https://pith.science/pith/H3O5G5GI65HRDLLAVM7UP3THRM/action/author_attestation","sign_citation":"https://pith.science/pith/H3O5G5GI65HRDLLAVM7UP3THRM/action/citation_signature","submit_replication":"https://pith.science/pith/H3O5G5GI65HRDLLAVM7UP3THRM/action/replication_record"}},"created_at":"2026-07-05T10:59:38.527024+00:00","updated_at":"2026-07-05T10:59:38.527024+00:00"}