{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:3QTDGTLBCGGXUSH6EVFXWGQERE","short_pith_number":"pith:3QTDGTLB","schema_version":"1.0","canonical_sha256":"dc26334d61118d7a48fe254b7b1a0489117453c2dc5343be0905015cbbd788d1","source":{"kind":"arxiv","id":"2508.14386","version":1},"attestation_state":"computed","paper":{"title":"Reconstruction Codes for Deletions and Insertions: Connection, Distinction, and Construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gennian Ge, Yubo Sun","submitted_at":"2025-08-20T03:26:55Z","abstract_excerpt":"Let $\\mathcal{B}(\\cdot)$ be an error ball function. A set of $q$-ary sequences of length $n$ is referred to as an \\emph{$(n,q,N;\\mathcal{B})$-reconstruction code} if each sequence $\\boldsymbol{x}$ within this set can be uniquely reconstructed from any $N$ distinct elements within its error ball $\\mathcal{B}(\\boldsymbol{x})$. The main objective in this area is to determine or establish bounds for the minimum redundancy of $(n,q,N;\\mathcal{B})$-reconstruction codes, denoted by $\\rho(n,q,N;\\mathcal{B})$. In this paper, we investigate reconstruction codes where the error ball is either the \\emph{$"},"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":"2508.14386","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-08-20T03:26:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d191181b8d2b7e5a9185d97e381acdb0fb85eba8beadfdd122bfb64c22dd93df","abstract_canon_sha256":"aab4bbc2cffdccf043640c4d7a1fea43e14be07e2f772e5548952c29f025724d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:56:31.011075Z","signature_b64":"KGuRLssxYnDLBn+Lm2b0vO0W67jjJQMDuke4buaLozu03xnwUcfXf3iLMLUZslv6rkJisIXqIUMg9hjyrViNBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc26334d61118d7a48fe254b7b1a0489117453c2dc5343be0905015cbbd788d1","last_reissued_at":"2026-07-05T11:56:31.010641Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:56:31.010641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reconstruction Codes for Deletions and Insertions: Connection, Distinction, and Construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gennian Ge, Yubo Sun","submitted_at":"2025-08-20T03:26:55Z","abstract_excerpt":"Let $\\mathcal{B}(\\cdot)$ be an error ball function. A set of $q$-ary sequences of length $n$ is referred to as an \\emph{$(n,q,N;\\mathcal{B})$-reconstruction code} if each sequence $\\boldsymbol{x}$ within this set can be uniquely reconstructed from any $N$ distinct elements within its error ball $\\mathcal{B}(\\boldsymbol{x})$. The main objective in this area is to determine or establish bounds for the minimum redundancy of $(n,q,N;\\mathcal{B})$-reconstruction codes, denoted by $\\rho(n,q,N;\\mathcal{B})$. In this paper, we investigate reconstruction codes where the error ball is either the \\emph{$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.14386","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/2508.14386/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":"2508.14386","created_at":"2026-07-05T11:56:31.010698+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.14386v1","created_at":"2026-07-05T11:56:31.010698+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.14386","created_at":"2026-07-05T11:56:31.010698+00:00"},{"alias_kind":"pith_short_12","alias_value":"3QTDGTLBCGGX","created_at":"2026-07-05T11:56:31.010698+00:00"},{"alias_kind":"pith_short_16","alias_value":"3QTDGTLBCGGXUSH6","created_at":"2026-07-05T11:56:31.010698+00:00"},{"alias_kind":"pith_short_8","alias_value":"3QTDGTLB","created_at":"2026-07-05T11:56:31.010698+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/3QTDGTLBCGGXUSH6EVFXWGQERE","json":"https://pith.science/pith/3QTDGTLBCGGXUSH6EVFXWGQERE.json","graph_json":"https://pith.science/api/pith-number/3QTDGTLBCGGXUSH6EVFXWGQERE/graph.json","events_json":"https://pith.science/api/pith-number/3QTDGTLBCGGXUSH6EVFXWGQERE/events.json","paper":"https://pith.science/paper/3QTDGTLB"},"agent_actions":{"view_html":"https://pith.science/pith/3QTDGTLBCGGXUSH6EVFXWGQERE","download_json":"https://pith.science/pith/3QTDGTLBCGGXUSH6EVFXWGQERE.json","view_paper":"https://pith.science/paper/3QTDGTLB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.14386&json=true","fetch_graph":"https://pith.science/api/pith-number/3QTDGTLBCGGXUSH6EVFXWGQERE/graph.json","fetch_events":"https://pith.science/api/pith-number/3QTDGTLBCGGXUSH6EVFXWGQERE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3QTDGTLBCGGXUSH6EVFXWGQERE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3QTDGTLBCGGXUSH6EVFXWGQERE/action/storage_attestation","attest_author":"https://pith.science/pith/3QTDGTLBCGGXUSH6EVFXWGQERE/action/author_attestation","sign_citation":"https://pith.science/pith/3QTDGTLBCGGXUSH6EVFXWGQERE/action/citation_signature","submit_replication":"https://pith.science/pith/3QTDGTLBCGGXUSH6EVFXWGQERE/action/replication_record"}},"created_at":"2026-07-05T11:56:31.010698+00:00","updated_at":"2026-07-05T11:56:31.010698+00:00"}