{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:O733VDJ5VSUHLINQWC6ZXOF3BS","short_pith_number":"pith:O733VDJ5","canonical_record":{"source":{"id":"1801.09481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-29T12:47:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e5993f2a47a815cd47e8015d4df9aa45b96f2b0ebd7959214bee5f32aa740669","abstract_canon_sha256":"33327a3b1326805cc2a1f9c6718d6de870c88de7a944d306bae62a65059088b2"},"schema_version":"1.0"},"canonical_sha256":"77f7ba8d3daca875a1b0b0bd9bb8bb0c8203c58adb9cc000fd18ab936fa227f7","source":{"kind":"arxiv","id":"1801.09481","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.09481","created_at":"2026-05-18T00:24:57Z"},{"alias_kind":"arxiv_version","alias_value":"1801.09481v1","created_at":"2026-05-18T00:24:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.09481","created_at":"2026-05-18T00:24:57Z"},{"alias_kind":"pith_short_12","alias_value":"O733VDJ5VSUH","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"O733VDJ5VSUHLINQ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"O733VDJ5","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:O733VDJ5VSUHLINQWC6ZXOF3BS","target":"record","payload":{"canonical_record":{"source":{"id":"1801.09481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-29T12:47:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e5993f2a47a815cd47e8015d4df9aa45b96f2b0ebd7959214bee5f32aa740669","abstract_canon_sha256":"33327a3b1326805cc2a1f9c6718d6de870c88de7a944d306bae62a65059088b2"},"schema_version":"1.0"},"canonical_sha256":"77f7ba8d3daca875a1b0b0bd9bb8bb0c8203c58adb9cc000fd18ab936fa227f7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:57.326689Z","signature_b64":"XVVA8jW0+g3I3a8kiC56KV12KbtRp8vx9sxv8+uqWI9R6pl/7Y09aNz7e21g0no/BBqf1STkkFxhJrBEQMMUCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77f7ba8d3daca875a1b0b0bd9bb8bb0c8203c58adb9cc000fd18ab936fa227f7","last_reissued_at":"2026-05-18T00:24:57.325935Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:57.325935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.09481","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-18T00:24:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rtsh4pAR67Tt2olPpuMaGRb3PQaNFHOozVTfa/AF1cHwleX0kf91+ttuPPIEMY+CzA2gnLZ6eZeWP8cf8sIHCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:09:42.679020Z"},"content_sha256":"7cf7e28b58392ffcf20db889c7aacea4e511a5794690d87bda5970288ec48a73","schema_version":"1.0","event_id":"sha256:7cf7e28b58392ffcf20db889c7aacea4e511a5794690d87bda5970288ec48a73"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:O733VDJ5VSUHLINQWC6ZXOF3BS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hamed Hassani, Or Ordentlich, R\\\"udiger Urbanke, Shrinivas Kudekar, Yury Polyanskiy","submitted_at":"2018-01-29T12:47:17Z","abstract_excerpt":"Consider a binary linear code of length $N$, minimum distance $d_{\\text{min}}$, transmission over the binary erasure channel with parameter $0 < \\epsilon < 1$ or the binary symmetric channel with parameter $0 < \\epsilon < \\frac12$, and block-MAP decoding. It was shown by Tillich and Zemor that in this case the error probability of the block-MAP decoder transitions \"quickly\" from $\\delta$ to $1-\\delta$ for any $\\delta>0$ if the minimum distance is large. In particular the width of the transition is of order $O(1/\\sqrt{d_{\\text{min}}})$. We strengthen this result by showing that under suitable c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.09481","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-18T00:24:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0RwsTqF+jUevnnUVI0nlkBie+twpl0c9cGD1EuwTsCMecnDumi8SA8uAzK5QGKqUZb0HF/an6ZDxt6iu6H38BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:09:42.679379Z"},"content_sha256":"cbcbdb5597342b4c5fa9f5c7b976c8622cf87f5dca3cf8c77cb9fa926b19a1e3","schema_version":"1.0","event_id":"sha256:cbcbdb5597342b4c5fa9f5c7b976c8622cf87f5dca3cf8c77cb9fa926b19a1e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O733VDJ5VSUHLINQWC6ZXOF3BS/bundle.json","state_url":"https://pith.science/pith/O733VDJ5VSUHLINQWC6ZXOF3BS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O733VDJ5VSUHLINQWC6ZXOF3BS/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-28T15:09:42Z","links":{"resolver":"https://pith.science/pith/O733VDJ5VSUHLINQWC6ZXOF3BS","bundle":"https://pith.science/pith/O733VDJ5VSUHLINQWC6ZXOF3BS/bundle.json","state":"https://pith.science/pith/O733VDJ5VSUHLINQWC6ZXOF3BS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O733VDJ5VSUHLINQWC6ZXOF3BS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:O733VDJ5VSUHLINQWC6ZXOF3BS","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":"33327a3b1326805cc2a1f9c6718d6de870c88de7a944d306bae62a65059088b2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-29T12:47:17Z","title_canon_sha256":"e5993f2a47a815cd47e8015d4df9aa45b96f2b0ebd7959214bee5f32aa740669"},"schema_version":"1.0","source":{"id":"1801.09481","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.09481","created_at":"2026-05-18T00:24:57Z"},{"alias_kind":"arxiv_version","alias_value":"1801.09481v1","created_at":"2026-05-18T00:24:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.09481","created_at":"2026-05-18T00:24:57Z"},{"alias_kind":"pith_short_12","alias_value":"O733VDJ5VSUH","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"O733VDJ5VSUHLINQ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"O733VDJ5","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:cbcbdb5597342b4c5fa9f5c7b976c8622cf87f5dca3cf8c77cb9fa926b19a1e3","target":"graph","created_at":"2026-05-18T00:24:57Z","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":"Consider a binary linear code of length $N$, minimum distance $d_{\\text{min}}$, transmission over the binary erasure channel with parameter $0 < \\epsilon < 1$ or the binary symmetric channel with parameter $0 < \\epsilon < \\frac12$, and block-MAP decoding. It was shown by Tillich and Zemor that in this case the error probability of the block-MAP decoder transitions \"quickly\" from $\\delta$ to $1-\\delta$ for any $\\delta>0$ if the minimum distance is large. In particular the width of the transition is of order $O(1/\\sqrt{d_{\\text{min}}})$. We strengthen this result by showing that under suitable c","authors_text":"Hamed Hassani, Or Ordentlich, R\\\"udiger Urbanke, Shrinivas Kudekar, Yury Polyanskiy","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-29T12:47:17Z","title":"Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.09481","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:7cf7e28b58392ffcf20db889c7aacea4e511a5794690d87bda5970288ec48a73","target":"record","created_at":"2026-05-18T00:24:57Z","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":"33327a3b1326805cc2a1f9c6718d6de870c88de7a944d306bae62a65059088b2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-29T12:47:17Z","title_canon_sha256":"e5993f2a47a815cd47e8015d4df9aa45b96f2b0ebd7959214bee5f32aa740669"},"schema_version":"1.0","source":{"id":"1801.09481","kind":"arxiv","version":1}},"canonical_sha256":"77f7ba8d3daca875a1b0b0bd9bb8bb0c8203c58adb9cc000fd18ab936fa227f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77f7ba8d3daca875a1b0b0bd9bb8bb0c8203c58adb9cc000fd18ab936fa227f7","first_computed_at":"2026-05-18T00:24:57.325935Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:57.325935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XVVA8jW0+g3I3a8kiC56KV12KbtRp8vx9sxv8+uqWI9R6pl/7Y09aNz7e21g0no/BBqf1STkkFxhJrBEQMMUCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:57.326689Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.09481","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7cf7e28b58392ffcf20db889c7aacea4e511a5794690d87bda5970288ec48a73","sha256:cbcbdb5597342b4c5fa9f5c7b976c8622cf87f5dca3cf8c77cb9fa926b19a1e3"],"state_sha256":"91031320599ca528405cfff860312d0ec6ab09e2c23e9ff8b7f4a10a07b3b92c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gHAOCHHzJ0oSbrck0IVaDOEv9sA/YR7bnGT+rdsR7WYeNCa4FCCAqGCsJWJFZMS1QeiIWGAMIei9uqNQYyidCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T15:09:42.681392Z","bundle_sha256":"8a442f03c96042bd7120dc9de69daacd85126de52a416eb550e2aecf2d7845eb"}}