{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:7THPHV7GRVIW7CQ666W4U75REV","short_pith_number":"pith:7THPHV7G","schema_version":"1.0","canonical_sha256":"fccef3d7e68d516f8a1ef7adca7fb1254d4281b0debeae04ecfba4ae1e35c5ce","source":{"kind":"arxiv","id":"2506.15233","version":1},"attestation_state":"computed","paper":{"title":"New Bounds and Constructions for Variable Packet-Error Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Itzhak Tamo, Ron M. Roth, Xiangliang Kong, Xin Wang","submitted_at":"2025-06-18T08:17:28Z","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"},"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.15233","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-06-18T08:17:28Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"1de1409257fd5dc28b352b7855336a8acecc8b0fd29804e8641ced2b38e51961","abstract_canon_sha256":"4b6069871f101097d5efa3f03ce5283044557c598c861b82b5b14396db7f4fd2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:23:39.887763Z","signature_b64":"gd+X2qr/JQ/SOP3rxfbAKhy/yNuFduiVCDvYgec8c65vd4uX6GF5LQGFPyr9Z7jbu2a/AHO2daCRO6N+gSZ4DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fccef3d7e68d516f8a1ef7adca7fb1254d4281b0debeae04ecfba4ae1e35c5ce","last_reissued_at":"2026-07-05T11:23:39.887248Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:23:39.887248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Bounds and Constructions for Variable Packet-Error Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Itzhak Tamo, Ron M. Roth, Xiangliang Kong, Xin Wang","submitted_at":"2025-06-18T08:17:28Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.15233","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.15233/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.15233","created_at":"2026-07-05T11:23:39.887308+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.15233v1","created_at":"2026-07-05T11:23:39.887308+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.15233","created_at":"2026-07-05T11:23:39.887308+00:00"},{"alias_kind":"pith_short_12","alias_value":"7THPHV7GRVIW","created_at":"2026-07-05T11:23:39.887308+00:00"},{"alias_kind":"pith_short_16","alias_value":"7THPHV7GRVIW7CQ6","created_at":"2026-07-05T11:23:39.887308+00:00"},{"alias_kind":"pith_short_8","alias_value":"7THPHV7G","created_at":"2026-07-05T11:23:39.887308+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/7THPHV7GRVIW7CQ666W4U75REV","json":"https://pith.science/pith/7THPHV7GRVIW7CQ666W4U75REV.json","graph_json":"https://pith.science/api/pith-number/7THPHV7GRVIW7CQ666W4U75REV/graph.json","events_json":"https://pith.science/api/pith-number/7THPHV7GRVIW7CQ666W4U75REV/events.json","paper":"https://pith.science/paper/7THPHV7G"},"agent_actions":{"view_html":"https://pith.science/pith/7THPHV7GRVIW7CQ666W4U75REV","download_json":"https://pith.science/pith/7THPHV7GRVIW7CQ666W4U75REV.json","view_paper":"https://pith.science/paper/7THPHV7G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.15233&json=true","fetch_graph":"https://pith.science/api/pith-number/7THPHV7GRVIW7CQ666W4U75REV/graph.json","fetch_events":"https://pith.science/api/pith-number/7THPHV7GRVIW7CQ666W4U75REV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7THPHV7GRVIW7CQ666W4U75REV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7THPHV7GRVIW7CQ666W4U75REV/action/storage_attestation","attest_author":"https://pith.science/pith/7THPHV7GRVIW7CQ666W4U75REV/action/author_attestation","sign_citation":"https://pith.science/pith/7THPHV7GRVIW7CQ666W4U75REV/action/citation_signature","submit_replication":"https://pith.science/pith/7THPHV7GRVIW7CQ666W4U75REV/action/replication_record"}},"created_at":"2026-07-05T11:23:39.887308+00:00","updated_at":"2026-07-05T11:23:39.887308+00:00"}