{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:73K7OPTHDXKYAAF32ULMQWLYRA","short_pith_number":"pith:73K7OPTH","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"},"canonical_sha256":"fed5f73e671dd58000bbd516c85978883be16baa468dce80d848a6cceb12e56c","source":{"kind":"arxiv","id":"2506.12924","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.12924","created_at":"2026-07-05T11:22:02Z"},{"alias_kind":"arxiv_version","alias_value":"2506.12924v1","created_at":"2026-07-05T11:22:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.12924","created_at":"2026-07-05T11:22:02Z"},{"alias_kind":"pith_short_12","alias_value":"73K7OPTHDXKY","created_at":"2026-07-05T11:22:02Z"},{"alias_kind":"pith_short_16","alias_value":"73K7OPTHDXKYAAF3","created_at":"2026-07-05T11:22:02Z"},{"alias_kind":"pith_short_8","alias_value":"73K7OPTH","created_at":"2026-07-05T11:22:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:73K7OPTHDXKYAAF32ULMQWLYRA","target":"record","payload":{"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"},"canonical_sha256":"fed5f73e671dd58000bbd516c85978883be16baa468dce80d848a6cceb12e56c","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"},"source_kind":"arxiv","source_id":"2506.12924","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:22:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oZEiyKpigNwZkagpm0cSgyf0ZTEZLljedHGSCAS6UXLXyS5sWO0VvDae8DG2Iu5v69h/5SNzNvx0O+sqScAICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T12:55:54.828314Z"},"content_sha256":"8731184d8b1991cab6e593224c284201240c8e451eb583a4561d231ec62b1201","schema_version":"1.0","event_id":"sha256:8731184d8b1991cab6e593224c284201240c8e451eb583a4561d231ec62b1201"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:73K7OPTHDXKYAAF32ULMQWLYRA","target":"graph","payload":{"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"},"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:22:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ICp2ATtjCNeecwJ79r8mFC6PKSjYZniD1t027VggBZ0JakVr/8O9uFP+RD7txE8Op3lONF12S/lVEqQk8coaCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T12:55:54.828811Z"},"content_sha256":"6c03e2cbe0e6b37a438b15438cad61bc1d3664d4231551401eb5907a9faa058a","schema_version":"1.0","event_id":"sha256:6c03e2cbe0e6b37a438b15438cad61bc1d3664d4231551401eb5907a9faa058a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/73K7OPTHDXKYAAF32ULMQWLYRA/bundle.json","state_url":"https://pith.science/pith/73K7OPTHDXKYAAF32ULMQWLYRA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/73K7OPTHDXKYAAF32ULMQWLYRA/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-08T12:55:54Z","links":{"resolver":"https://pith.science/pith/73K7OPTHDXKYAAF32ULMQWLYRA","bundle":"https://pith.science/pith/73K7OPTHDXKYAAF32ULMQWLYRA/bundle.json","state":"https://pith.science/pith/73K7OPTHDXKYAAF32ULMQWLYRA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/73K7OPTHDXKYAAF32ULMQWLYRA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:73K7OPTHDXKYAAF32ULMQWLYRA","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":"454fee09f9e8bba8a36e194844d77465c0b330b2ed3cc05b5384c49082ed7543","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-06-15T17:49:35Z","title_canon_sha256":"31528fd2c7e6f31cafd1e2925e8eab2e3bdd8189b9040783f835c264a95bfc9a"},"schema_version":"1.0","source":{"id":"2506.12924","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.12924","created_at":"2026-07-05T11:22:02Z"},{"alias_kind":"arxiv_version","alias_value":"2506.12924v1","created_at":"2026-07-05T11:22:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.12924","created_at":"2026-07-05T11:22:02Z"},{"alias_kind":"pith_short_12","alias_value":"73K7OPTHDXKY","created_at":"2026-07-05T11:22:02Z"},{"alias_kind":"pith_short_16","alias_value":"73K7OPTHDXKYAAF3","created_at":"2026-07-05T11:22:02Z"},{"alias_kind":"pith_short_8","alias_value":"73K7OPTH","created_at":"2026-07-05T11:22:02Z"}],"graph_snapshots":[{"event_id":"sha256:6c03e2cbe0e6b37a438b15438cad61bc1d3664d4231551401eb5907a9faa058a","target":"graph","created_at":"2026-07-05T11:22:02Z","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/2506.12924/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Gennian Ge, Moshe Schwartz, Wenjun Yu, Yubo Sun, Zixiang Xu","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-06-15T17:49:35Z","title":"Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.12924","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:8731184d8b1991cab6e593224c284201240c8e451eb583a4561d231ec62b1201","target":"record","created_at":"2026-07-05T11:22:02Z","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":"454fee09f9e8bba8a36e194844d77465c0b330b2ed3cc05b5384c49082ed7543","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-06-15T17:49:35Z","title_canon_sha256":"31528fd2c7e6f31cafd1e2925e8eab2e3bdd8189b9040783f835c264a95bfc9a"},"schema_version":"1.0","source":{"id":"2506.12924","kind":"arxiv","version":1}},"canonical_sha256":"fed5f73e671dd58000bbd516c85978883be16baa468dce80d848a6cceb12e56c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fed5f73e671dd58000bbd516c85978883be16baa468dce80d848a6cceb12e56c","first_computed_at":"2026-07-05T11:22:02.384290Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:22:02.384290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pV+ao9MOZgCCfJtA5D24QBaI0KeA6JBMlVcpj47/FQiiPk9rYSbs+YkXsNdwAmROg8uLVs9McppTP0ij6HGpBA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:22:02.384747Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.12924","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8731184d8b1991cab6e593224c284201240c8e451eb583a4561d231ec62b1201","sha256:6c03e2cbe0e6b37a438b15438cad61bc1d3664d4231551401eb5907a9faa058a"],"state_sha256":"ebb61d31277932a0e553983d68469dee739a5f57fea49bc5169e8b403e8d19e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0SLSCdpD0U91DuRQOoDY2D+TgWTWvaSWSBwT9yz76Map1yyRuktLx+C1oB3oOjpabMv8GP/Pj6rFG/6xvskvCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T12:55:54.832580Z","bundle_sha256":"1242e7311357af5f8028e43e0bfa6258314f6decee2ecf9bbb8776111ad2dfb0"}}