{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:SD7NTWZFFNZCMVUXSX7I4XRE23","short_pith_number":"pith:SD7NTWZF","canonical_record":{"source":{"id":"1601.06048","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-22T15:45:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3760de1fe18ab072273099bd1eaaead52cda347a05f1eeba7ed6e83af8c94b89","abstract_canon_sha256":"d035a81a67a66f9d9f16cc4dca8c878c3c92fc06092f2e6913a2e86d52c7f459"},"schema_version":"1.0"},"canonical_sha256":"90fed9db252b7226569795fe8e5e24d6da0c71eee5d48a64bb05d6a6a549b1fa","source":{"kind":"arxiv","id":"1601.06048","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06048","created_at":"2026-05-18T01:11:17Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06048v3","created_at":"2026-05-18T01:11:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06048","created_at":"2026-05-18T01:11:17Z"},{"alias_kind":"pith_short_12","alias_value":"SD7NTWZFFNZC","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SD7NTWZFFNZCMVUX","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SD7NTWZF","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:SD7NTWZFFNZCMVUXSX7I4XRE23","target":"record","payload":{"canonical_record":{"source":{"id":"1601.06048","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-22T15:45:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3760de1fe18ab072273099bd1eaaead52cda347a05f1eeba7ed6e83af8c94b89","abstract_canon_sha256":"d035a81a67a66f9d9f16cc4dca8c878c3c92fc06092f2e6913a2e86d52c7f459"},"schema_version":"1.0"},"canonical_sha256":"90fed9db252b7226569795fe8e5e24d6da0c71eee5d48a64bb05d6a6a549b1fa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:17.758994Z","signature_b64":"cAeMbz8a6NXsS0abS7kirnlRu4zpYuhD5X+huH/wThw2zQwcxmUCgxgjkl8+C6bP6s5geHGYqc6K98TerTmXBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90fed9db252b7226569795fe8e5e24d6da0c71eee5d48a64bb05d6a6a549b1fa","last_reissued_at":"2026-05-18T01:11:17.758573Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:17.758573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.06048","source_version":3,"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-18T01:11:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bVIOTya+ZB8Sy+GcomQHHa07XI7jObkg/yowA+b626aJUkRYlicl5EFidd/co3OicdVz1a0sKMzNy4R8ViYVCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:12:31.570979Z"},"content_sha256":"db8b0951661adcf3f82ede5d35e393e975821d0b831242156323e1a18c83cf4f","schema_version":"1.0","event_id":"sha256:db8b0951661adcf3f82ede5d35e393e975821d0b831242156323e1a18c83cf4f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:SD7NTWZFFNZCMVUXSX7I4XRE23","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Comparing the Bit-MAP and Block-MAP Decoding Thresholds of Reed-Muller Codes on BMS Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Henry D. Pfister, Marco Mondelli, R\\\"udiger Urbanke, Santhosh Kumar, Shrinivas Kudekar","submitted_at":"2016-01-22T15:45:27Z","abstract_excerpt":"The question whether RM codes are capacity-achieving is a long-standing open problem in coding theory that was recently answered in the affirmative for transmission over erasure channels [1], [2]. Remarkably, the proof does not rely on specific properties of RM codes, apart from their symmetry. Indeed, the main technical result consists in showing that any sequence of linear codes, with doubly-transitive permutation groups, achieves capacity on the memoryless erasure channel under bit-MAP decoding. Thus, a natural question is what happens under block-MAP decoding. In [1], [2], by exploiting fu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06048","kind":"arxiv","version":3},"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-18T01:11:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ovm91JiVKCQ9KHfVsYFfti84aB5yjKjBIQG6quEJCWKHJ7tSACeVOeHJjtpGvCfoZiO94i5l/uR6iB95tAbkDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:12:31.571683Z"},"content_sha256":"6d2820cf82e28ec27dedc70ac4f08fd034a08f588981be715ad0d441feee0fa8","schema_version":"1.0","event_id":"sha256:6d2820cf82e28ec27dedc70ac4f08fd034a08f588981be715ad0d441feee0fa8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SD7NTWZFFNZCMVUXSX7I4XRE23/bundle.json","state_url":"https://pith.science/pith/SD7NTWZFFNZCMVUXSX7I4XRE23/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SD7NTWZFFNZCMVUXSX7I4XRE23/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-25T16:12:31Z","links":{"resolver":"https://pith.science/pith/SD7NTWZFFNZCMVUXSX7I4XRE23","bundle":"https://pith.science/pith/SD7NTWZFFNZCMVUXSX7I4XRE23/bundle.json","state":"https://pith.science/pith/SD7NTWZFFNZCMVUXSX7I4XRE23/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SD7NTWZFFNZCMVUXSX7I4XRE23/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SD7NTWZFFNZCMVUXSX7I4XRE23","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":"d035a81a67a66f9d9f16cc4dca8c878c3c92fc06092f2e6913a2e86d52c7f459","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-22T15:45:27Z","title_canon_sha256":"3760de1fe18ab072273099bd1eaaead52cda347a05f1eeba7ed6e83af8c94b89"},"schema_version":"1.0","source":{"id":"1601.06048","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06048","created_at":"2026-05-18T01:11:17Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06048v3","created_at":"2026-05-18T01:11:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06048","created_at":"2026-05-18T01:11:17Z"},{"alias_kind":"pith_short_12","alias_value":"SD7NTWZFFNZC","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SD7NTWZFFNZCMVUX","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SD7NTWZF","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:6d2820cf82e28ec27dedc70ac4f08fd034a08f588981be715ad0d441feee0fa8","target":"graph","created_at":"2026-05-18T01:11:17Z","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":"The question whether RM codes are capacity-achieving is a long-standing open problem in coding theory that was recently answered in the affirmative for transmission over erasure channels [1], [2]. Remarkably, the proof does not rely on specific properties of RM codes, apart from their symmetry. Indeed, the main technical result consists in showing that any sequence of linear codes, with doubly-transitive permutation groups, achieves capacity on the memoryless erasure channel under bit-MAP decoding. Thus, a natural question is what happens under block-MAP decoding. In [1], [2], by exploiting fu","authors_text":"Henry D. Pfister, Marco Mondelli, R\\\"udiger Urbanke, Santhosh Kumar, Shrinivas Kudekar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-22T15:45:27Z","title":"Comparing the Bit-MAP and Block-MAP Decoding Thresholds of Reed-Muller Codes on BMS Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06048","kind":"arxiv","version":3},"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:db8b0951661adcf3f82ede5d35e393e975821d0b831242156323e1a18c83cf4f","target":"record","created_at":"2026-05-18T01:11:17Z","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":"d035a81a67a66f9d9f16cc4dca8c878c3c92fc06092f2e6913a2e86d52c7f459","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-22T15:45:27Z","title_canon_sha256":"3760de1fe18ab072273099bd1eaaead52cda347a05f1eeba7ed6e83af8c94b89"},"schema_version":"1.0","source":{"id":"1601.06048","kind":"arxiv","version":3}},"canonical_sha256":"90fed9db252b7226569795fe8e5e24d6da0c71eee5d48a64bb05d6a6a549b1fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90fed9db252b7226569795fe8e5e24d6da0c71eee5d48a64bb05d6a6a549b1fa","first_computed_at":"2026-05-18T01:11:17.758573Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:17.758573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cAeMbz8a6NXsS0abS7kirnlRu4zpYuhD5X+huH/wThw2zQwcxmUCgxgjkl8+C6bP6s5geHGYqc6K98TerTmXBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:17.758994Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.06048","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db8b0951661adcf3f82ede5d35e393e975821d0b831242156323e1a18c83cf4f","sha256:6d2820cf82e28ec27dedc70ac4f08fd034a08f588981be715ad0d441feee0fa8"],"state_sha256":"d7193d0ea37cbade5fa9e210532e44d860826beb50bc5ab577ec2413f6808452"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tw05ZiETgvcw4QgSh6C3BQKD3H4Cv6T/hmVWoUd6IbOMUGjGnVeG1fCm5h4cpLS3YLNpdX9LGUfM6nF9qC88Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:12:31.575548Z","bundle_sha256":"2d9b3e9270bfd75117fc126ef916160b2d1b02286bdc0fa02239e335459448eb"}}