{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ZS7KXT4NXHHOLJGZPQZZ6LM6ZP","short_pith_number":"pith:ZS7KXT4N","canonical_record":{"source":{"id":"1305.3733","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-16T09:32:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"61166823a6b745a34a9a9e0fd34ee5526e18de9f6c32df5ae107713f4a6737af","abstract_canon_sha256":"42fa2ee4c5be556c586d5644341a56caa098b15568123a367fedd3f2b1956d00"},"schema_version":"1.0"},"canonical_sha256":"ccbeabcf8db9cee5a4d97c339f2d9ecbd0e0ce7e2f9fc45b65e7845714edd6d8","source":{"kind":"arxiv","id":"1305.3733","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.3733","created_at":"2026-05-18T03:25:34Z"},{"alias_kind":"arxiv_version","alias_value":"1305.3733v1","created_at":"2026-05-18T03:25:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3733","created_at":"2026-05-18T03:25:34Z"},{"alias_kind":"pith_short_12","alias_value":"ZS7KXT4NXHHO","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZS7KXT4NXHHOLJGZ","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZS7KXT4N","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ZS7KXT4NXHHOLJGZPQZZ6LM6ZP","target":"record","payload":{"canonical_record":{"source":{"id":"1305.3733","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-16T09:32:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"61166823a6b745a34a9a9e0fd34ee5526e18de9f6c32df5ae107713f4a6737af","abstract_canon_sha256":"42fa2ee4c5be556c586d5644341a56caa098b15568123a367fedd3f2b1956d00"},"schema_version":"1.0"},"canonical_sha256":"ccbeabcf8db9cee5a4d97c339f2d9ecbd0e0ce7e2f9fc45b65e7845714edd6d8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:34.075966Z","signature_b64":"MbEsCgnVh10O/45MLpCy9Tb7iyzhcraQ9WDH1hA9mRDxGvPBL8WagCxSomOtI42d9+t+7iEeoC9EiSwcUJp0Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccbeabcf8db9cee5a4d97c339f2d9ecbd0e0ce7e2f9fc45b65e7845714edd6d8","last_reissued_at":"2026-05-18T03:25:34.075288Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:34.075288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.3733","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-05-18T03:25:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rO9eRnjY030sq6rNpLp3DHER2euQRC9hAD7pogSvG3noozidT7F0EE15/R9CbpNJNWU1UvwHrx7UF4kQk1UcCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:01:39.592549Z"},"content_sha256":"4d2409020c7e99b4d87e3ec7f232179b5093f405672dbf54dd2d7ae7da4d0d77","schema_version":"1.0","event_id":"sha256:4d2409020c7e99b4d87e3ec7f232179b5093f405672dbf54dd2d7ae7da4d0d77"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ZS7KXT4NXHHOLJGZPQZZ6LM6ZP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coding with Encoding Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christina Fragouli, I-Hsiang Wang, Jad Hachem, Suhas Diggavi","submitted_at":"2013-05-16T09:32:42Z","abstract_excerpt":"We study the channel coding problem when errors and uncertainty occur in the encoding process. For simplicity we assume the channel between the encoder and the decoder is perfect. Focusing on linear block codes, we model the encoding uncertainty as erasures on the edges in the factor graph of the encoder generator matrix. We first take a worst-case approach and find the maximum tolerable number of erasures for perfect error correction. Next, we take a probabilistic approach and derive a sufficient condition on the rate of a set of codes, such that decoding error probability vanishes as blockle"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3733","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":""},"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-05-18T03:25:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CpLAmt+bnbQZVHfHDtpZ9a1lGDKOPsPifweEKmd9pBOwgm5mFlVna9F8a+uP2FHr/aENU5RZyuHk0/5+3GzoCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:01:39.592909Z"},"content_sha256":"f68f401882dab384b5a20d7a73e7339915bc166edb2e312670cd3a6f244e9fcd","schema_version":"1.0","event_id":"sha256:f68f401882dab384b5a20d7a73e7339915bc166edb2e312670cd3a6f244e9fcd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZS7KXT4NXHHOLJGZPQZZ6LM6ZP/bundle.json","state_url":"https://pith.science/pith/ZS7KXT4NXHHOLJGZPQZZ6LM6ZP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZS7KXT4NXHHOLJGZPQZZ6LM6ZP/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-05-30T05:01:39Z","links":{"resolver":"https://pith.science/pith/ZS7KXT4NXHHOLJGZPQZZ6LM6ZP","bundle":"https://pith.science/pith/ZS7KXT4NXHHOLJGZPQZZ6LM6ZP/bundle.json","state":"https://pith.science/pith/ZS7KXT4NXHHOLJGZPQZZ6LM6ZP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZS7KXT4NXHHOLJGZPQZZ6LM6ZP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ZS7KXT4NXHHOLJGZPQZZ6LM6ZP","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":"42fa2ee4c5be556c586d5644341a56caa098b15568123a367fedd3f2b1956d00","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-16T09:32:42Z","title_canon_sha256":"61166823a6b745a34a9a9e0fd34ee5526e18de9f6c32df5ae107713f4a6737af"},"schema_version":"1.0","source":{"id":"1305.3733","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.3733","created_at":"2026-05-18T03:25:34Z"},{"alias_kind":"arxiv_version","alias_value":"1305.3733v1","created_at":"2026-05-18T03:25:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3733","created_at":"2026-05-18T03:25:34Z"},{"alias_kind":"pith_short_12","alias_value":"ZS7KXT4NXHHO","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZS7KXT4NXHHOLJGZ","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZS7KXT4N","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:f68f401882dab384b5a20d7a73e7339915bc166edb2e312670cd3a6f244e9fcd","target":"graph","created_at":"2026-05-18T03:25:34Z","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"},"paper":{"abstract_excerpt":"We study the channel coding problem when errors and uncertainty occur in the encoding process. For simplicity we assume the channel between the encoder and the decoder is perfect. Focusing on linear block codes, we model the encoding uncertainty as erasures on the edges in the factor graph of the encoder generator matrix. We first take a worst-case approach and find the maximum tolerable number of erasures for perfect error correction. Next, we take a probabilistic approach and derive a sufficient condition on the rate of a set of codes, such that decoding error probability vanishes as blockle","authors_text":"Christina Fragouli, I-Hsiang Wang, Jad Hachem, Suhas Diggavi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-16T09:32:42Z","title":"Coding with Encoding Uncertainty"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3733","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:4d2409020c7e99b4d87e3ec7f232179b5093f405672dbf54dd2d7ae7da4d0d77","target":"record","created_at":"2026-05-18T03:25:34Z","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":"42fa2ee4c5be556c586d5644341a56caa098b15568123a367fedd3f2b1956d00","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-16T09:32:42Z","title_canon_sha256":"61166823a6b745a34a9a9e0fd34ee5526e18de9f6c32df5ae107713f4a6737af"},"schema_version":"1.0","source":{"id":"1305.3733","kind":"arxiv","version":1}},"canonical_sha256":"ccbeabcf8db9cee5a4d97c339f2d9ecbd0e0ce7e2f9fc45b65e7845714edd6d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ccbeabcf8db9cee5a4d97c339f2d9ecbd0e0ce7e2f9fc45b65e7845714edd6d8","first_computed_at":"2026-05-18T03:25:34.075288Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:34.075288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MbEsCgnVh10O/45MLpCy9Tb7iyzhcraQ9WDH1hA9mRDxGvPBL8WagCxSomOtI42d9+t+7iEeoC9EiSwcUJp0Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:34.075966Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.3733","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d2409020c7e99b4d87e3ec7f232179b5093f405672dbf54dd2d7ae7da4d0d77","sha256:f68f401882dab384b5a20d7a73e7339915bc166edb2e312670cd3a6f244e9fcd"],"state_sha256":"4df86cd1fb694874e49005e45cba8380b380930946ca561d160a93817cc8a06c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hKyybNEMbAHkjkSPBZml6h5J72XeqCjUu5M6lk6ybbWr5/Eez/wpC2BW90Ukln0Kkmtw95BsJL2r70IaMIcKAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:01:39.594974Z","bundle_sha256":"ecc102720a3a186c0e5ab86a637f1a3ddddbce915124339e0bcf7b0da80ed42a"}}