{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:7THPHV7GRVIW7CQ666W4U75REV","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":"4b6069871f101097d5efa3f03ce5283044557c598c861b82b5b14396db7f4fd2","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-06-18T08:17:28Z","title_canon_sha256":"1de1409257fd5dc28b352b7855336a8acecc8b0fd29804e8641ced2b38e51961"},"schema_version":"1.0","source":{"id":"2506.15233","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.15233","created_at":"2026-07-05T11:23:39Z"},{"alias_kind":"arxiv_version","alias_value":"2506.15233v1","created_at":"2026-07-05T11:23:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.15233","created_at":"2026-07-05T11:23:39Z"},{"alias_kind":"pith_short_12","alias_value":"7THPHV7GRVIW","created_at":"2026-07-05T11:23:39Z"},{"alias_kind":"pith_short_16","alias_value":"7THPHV7GRVIW7CQ6","created_at":"2026-07-05T11:23:39Z"},{"alias_kind":"pith_short_8","alias_value":"7THPHV7G","created_at":"2026-07-05T11:23:39Z"}],"graph_snapshots":[{"event_id":"sha256:ef76ab9d89e22c5138550dffff0db966c57177e086a21cc56352ab05c07c0f00","target":"graph","created_at":"2026-07-05T11:23:39Z","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.15233/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we consider the problem of variable packet-error coding, which emerges in network communication scenarios where a source transmits information to a destination through multiple disjoint paths. The objective is to design codes with dynamic error-correcting capabilities that adapt to varying numbers of errors. Specifically, we first provide several bounds on the rate--distortion trade-off for general variable packet-error coding schemes. Then, we present two explicit constructions of variable packet-error coding schemes. The first construction uses higher-order MDS codes and provi","authors_text":"Itzhak Tamo, Ron M. Roth, Xiangliang Kong, Xin Wang","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-06-18T08:17:28Z","title":"New Bounds and Constructions for Variable Packet-Error Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.15233","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:0a2d91e32a1d1301160c4f8596cc413f1a560e6273e56f2b952892772faf490d","target":"record","created_at":"2026-07-05T11:23:39Z","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":"4b6069871f101097d5efa3f03ce5283044557c598c861b82b5b14396db7f4fd2","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-06-18T08:17:28Z","title_canon_sha256":"1de1409257fd5dc28b352b7855336a8acecc8b0fd29804e8641ced2b38e51961"},"schema_version":"1.0","source":{"id":"2506.15233","kind":"arxiv","version":1}},"canonical_sha256":"fccef3d7e68d516f8a1ef7adca7fb1254d4281b0debeae04ecfba4ae1e35c5ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fccef3d7e68d516f8a1ef7adca7fb1254d4281b0debeae04ecfba4ae1e35c5ce","first_computed_at":"2026-07-05T11:23:39.887248Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:23:39.887248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gd+X2qr/JQ/SOP3rxfbAKhy/yNuFduiVCDvYgec8c65vd4uX6GF5LQGFPyr9Z7jbu2a/AHO2daCRO6N+gSZ4DQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:23:39.887763Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.15233","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a2d91e32a1d1301160c4f8596cc413f1a560e6273e56f2b952892772faf490d","sha256:ef76ab9d89e22c5138550dffff0db966c57177e086a21cc56352ab05c07c0f00"],"state_sha256":"80e38b6d21b269fa73e35e848c75abd4f41eadc5110b57c1d3f7a7bec6ca618e"}