{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:73K7OPTHDXKYAAF32ULMQWLYRA","short_pith_number":"pith:73K7OPTH","schema_version":"1.0","canonical_sha256":"fed5f73e671dd58000bbd516c85978883be16baa468dce80d848a6cceb12e56c","source":{"kind":"arxiv","id":"2506.12924","version":1},"attestation_state":"computed","paper":{"title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Gennian Ge, Moshe Schwartz, Wenjun Yu, Yubo Sun, Zixiang Xu","submitted_at":"2025-06-15T17:49:35Z","abstract_excerpt":"We study optimal reconstruction codes over the multiple-burst substitution channel. Our main contribution is establishing a trade-off between the error-correction capability of the code, the number of reads used in the reconstruction process, and the decoding list size. We show that over a channel that introduces at most $t$ bursts, we can use a length-$n$ code capable of correcting $\\epsilon$ errors, with $\\Theta(n^\\rho)$ reads, and decoding with a list of size $O(n^\\lambda)$, where $t-1=\\epsilon+\\rho+\\lambda$. In the process of proving this, we establish sharp asymptotic bounds on the size o"},"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":"2506.12924","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-06-15T17:49:35Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"31528fd2c7e6f31cafd1e2925e8eab2e3bdd8189b9040783f835c264a95bfc9a","abstract_canon_sha256":"454fee09f9e8bba8a36e194844d77465c0b330b2ed3cc05b5384c49082ed7543"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:22:02.384747Z","signature_b64":"pV+ao9MOZgCCfJtA5D24QBaI0KeA6JBMlVcpj47/FQiiPk9rYSbs+YkXsNdwAmROg8uLVs9McppTP0ij6HGpBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fed5f73e671dd58000bbd516c85978883be16baa468dce80d848a6cceb12e56c","last_reissued_at":"2026-07-05T11:22:02.384290Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:22:02.384290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Gennian Ge, Moshe Schwartz, Wenjun Yu, Yubo Sun, Zixiang Xu","submitted_at":"2025-06-15T17:49:35Z","abstract_excerpt":"We study optimal reconstruction codes over the multiple-burst substitution channel. Our main contribution is establishing a trade-off between the error-correction capability of the code, the number of reads used in the reconstruction process, and the decoding list size. We show that over a channel that introduces at most $t$ bursts, we can use a length-$n$ code capable of correcting $\\epsilon$ errors, with $\\Theta(n^\\rho)$ reads, and decoding with a list of size $O(n^\\lambda)$, where $t-1=\\epsilon+\\rho+\\lambda$. In the process of proving this, we establish sharp asymptotic bounds on the size o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.12924","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/2506.12924/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":"2506.12924","created_at":"2026-07-05T11:22:02.384359+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.12924v1","created_at":"2026-07-05T11:22:02.384359+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.12924","created_at":"2026-07-05T11:22:02.384359+00:00"},{"alias_kind":"pith_short_12","alias_value":"73K7OPTHDXKY","created_at":"2026-07-05T11:22:02.384359+00:00"},{"alias_kind":"pith_short_16","alias_value":"73K7OPTHDXKYAAF3","created_at":"2026-07-05T11:22:02.384359+00:00"},{"alias_kind":"pith_short_8","alias_value":"73K7OPTH","created_at":"2026-07-05T11:22:02.384359+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/73K7OPTHDXKYAAF32ULMQWLYRA","json":"https://pith.science/pith/73K7OPTHDXKYAAF32ULMQWLYRA.json","graph_json":"https://pith.science/api/pith-number/73K7OPTHDXKYAAF32ULMQWLYRA/graph.json","events_json":"https://pith.science/api/pith-number/73K7OPTHDXKYAAF32ULMQWLYRA/events.json","paper":"https://pith.science/paper/73K7OPTH"},"agent_actions":{"view_html":"https://pith.science/pith/73K7OPTHDXKYAAF32ULMQWLYRA","download_json":"https://pith.science/pith/73K7OPTHDXKYAAF32ULMQWLYRA.json","view_paper":"https://pith.science/paper/73K7OPTH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.12924&json=true","fetch_graph":"https://pith.science/api/pith-number/73K7OPTHDXKYAAF32ULMQWLYRA/graph.json","fetch_events":"https://pith.science/api/pith-number/73K7OPTHDXKYAAF32ULMQWLYRA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/73K7OPTHDXKYAAF32ULMQWLYRA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/73K7OPTHDXKYAAF32ULMQWLYRA/action/storage_attestation","attest_author":"https://pith.science/pith/73K7OPTHDXKYAAF32ULMQWLYRA/action/author_attestation","sign_citation":"https://pith.science/pith/73K7OPTHDXKYAAF32ULMQWLYRA/action/citation_signature","submit_replication":"https://pith.science/pith/73K7OPTHDXKYAAF32ULMQWLYRA/action/replication_record"}},"created_at":"2026-07-05T11:22:02.384359+00:00","updated_at":"2026-07-05T11:22:02.384359+00:00"}