{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:7GPE33CGLWD5MHZDZKXWRUGTJ7","short_pith_number":"pith:7GPE33CG","canonical_record":{"source":{"id":"1212.1139","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-05T19:56:58Z","cross_cats_sorted":["cs.DM","cs.ET","math.CO","math.IT"],"title_canon_sha256":"175ffd723c5eb446fb1a1904773957d9d7e0810cbdfcc90f98cddbbd578d2976","abstract_canon_sha256":"f4ca564d58a73a4d0d5b75c7f6e29d2c26107533638b08b25b9ff16bc1ee1185"},"schema_version":"1.0"},"canonical_sha256":"f99e4dec465d87d61f23caaf68d0d34fd452610633ab604b78635f66ee6c4201","source":{"kind":"arxiv","id":"1212.1139","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.1139","created_at":"2026-05-18T03:10:24Z"},{"alias_kind":"arxiv_version","alias_value":"1212.1139v1","created_at":"2026-05-18T03:10:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.1139","created_at":"2026-05-18T03:10:24Z"},{"alias_kind":"pith_short_12","alias_value":"7GPE33CGLWD5","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"7GPE33CGLWD5MHZD","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"7GPE33CG","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:7GPE33CGLWD5MHZDZKXWRUGTJ7","target":"record","payload":{"canonical_record":{"source":{"id":"1212.1139","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-05T19:56:58Z","cross_cats_sorted":["cs.DM","cs.ET","math.CO","math.IT"],"title_canon_sha256":"175ffd723c5eb446fb1a1904773957d9d7e0810cbdfcc90f98cddbbd578d2976","abstract_canon_sha256":"f4ca564d58a73a4d0d5b75c7f6e29d2c26107533638b08b25b9ff16bc1ee1185"},"schema_version":"1.0"},"canonical_sha256":"f99e4dec465d87d61f23caaf68d0d34fd452610633ab604b78635f66ee6c4201","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:24.345305Z","signature_b64":"CCmn+/OoJxI2Bz3Xi5e1uDv0cymZS1cvIINzur0rggrGY47kApzWs5c5fYWUtFCrI9Dx4ucJdKTlb14PWJZHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f99e4dec465d87d61f23caaf68d0d34fd452610633ab604b78635f66ee6c4201","last_reissued_at":"2026-05-18T03:10:24.344500Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:24.344500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.1139","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:10:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f4Vg81jIrgEO89dbkmHUyWSak+r/TCieKEjzkYcUcTuoAAX2MTK+6yC49PTa3aVRtt1e9SK42J8BOCyggHtfCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T05:39:20.628437Z"},"content_sha256":"17e26138818fc12afd8324c767eb623e73cbf65943ed9afc5ec458b8043a7e62","schema_version":"1.0","event_id":"sha256:17e26138818fc12afd8324c767eb623e73cbf65943ed9afc5ec458b8043a7e62"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:7GPE33CGLWD5MHZDZKXWRUGTJ7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Majority-Logic Decoding of Short-Length Reed--Muller Codes at Information Positions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.ET","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Dennis Brauchle, Juliane Bertram, Michael Huber, Peter Hauck, Sebastian Ziesche","submitted_at":"2012-12-05T19:56:58Z","abstract_excerpt":"Short-length Reed--Muller codes under majority-logic decoding are of particular importance for efficient hardware implementations in real-time and embedded systems. This paper significantly improves Chen's two-step majority-logic decoding method for binary Reed--Muller codes $\\text{RM}(r,m)$, $r \\leq m/2$, if --- systematic encoding assumed --- only errors at information positions are to be corrected. Some general results on the minimal number of majority gates are presented that are particularly good for short codes. Specifically, with its importance in applications as a 3-error-correcting, s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.1139","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:10:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ayIv4pKct+BZlbK/Znn1aqms6mInrIkLpdOVKHG2FCmb/OYyGNzotoHTNWK/ZKZMMCsN++dV9Yyxh+clxNADCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T05:39:20.628787Z"},"content_sha256":"1a013254744e1b04d29581c1de4edf9751a88f048dc3f3efc94bf3fb42259bbf","schema_version":"1.0","event_id":"sha256:1a013254744e1b04d29581c1de4edf9751a88f048dc3f3efc94bf3fb42259bbf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7GPE33CGLWD5MHZDZKXWRUGTJ7/bundle.json","state_url":"https://pith.science/pith/7GPE33CGLWD5MHZDZKXWRUGTJ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7GPE33CGLWD5MHZDZKXWRUGTJ7/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-06-28T05:39:20Z","links":{"resolver":"https://pith.science/pith/7GPE33CGLWD5MHZDZKXWRUGTJ7","bundle":"https://pith.science/pith/7GPE33CGLWD5MHZDZKXWRUGTJ7/bundle.json","state":"https://pith.science/pith/7GPE33CGLWD5MHZDZKXWRUGTJ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7GPE33CGLWD5MHZDZKXWRUGTJ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:7GPE33CGLWD5MHZDZKXWRUGTJ7","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":"f4ca564d58a73a4d0d5b75c7f6e29d2c26107533638b08b25b9ff16bc1ee1185","cross_cats_sorted":["cs.DM","cs.ET","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-05T19:56:58Z","title_canon_sha256":"175ffd723c5eb446fb1a1904773957d9d7e0810cbdfcc90f98cddbbd578d2976"},"schema_version":"1.0","source":{"id":"1212.1139","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.1139","created_at":"2026-05-18T03:10:24Z"},{"alias_kind":"arxiv_version","alias_value":"1212.1139v1","created_at":"2026-05-18T03:10:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.1139","created_at":"2026-05-18T03:10:24Z"},{"alias_kind":"pith_short_12","alias_value":"7GPE33CGLWD5","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"7GPE33CGLWD5MHZD","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"7GPE33CG","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:1a013254744e1b04d29581c1de4edf9751a88f048dc3f3efc94bf3fb42259bbf","target":"graph","created_at":"2026-05-18T03:10:24Z","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":"Short-length Reed--Muller codes under majority-logic decoding are of particular importance for efficient hardware implementations in real-time and embedded systems. This paper significantly improves Chen's two-step majority-logic decoding method for binary Reed--Muller codes $\\text{RM}(r,m)$, $r \\leq m/2$, if --- systematic encoding assumed --- only errors at information positions are to be corrected. Some general results on the minimal number of majority gates are presented that are particularly good for short codes. Specifically, with its importance in applications as a 3-error-correcting, s","authors_text":"Dennis Brauchle, Juliane Bertram, Michael Huber, Peter Hauck, Sebastian Ziesche","cross_cats":["cs.DM","cs.ET","math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-05T19:56:58Z","title":"Efficient Majority-Logic Decoding of Short-Length Reed--Muller Codes at Information Positions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.1139","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:17e26138818fc12afd8324c767eb623e73cbf65943ed9afc5ec458b8043a7e62","target":"record","created_at":"2026-05-18T03:10:24Z","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":"f4ca564d58a73a4d0d5b75c7f6e29d2c26107533638b08b25b9ff16bc1ee1185","cross_cats_sorted":["cs.DM","cs.ET","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-05T19:56:58Z","title_canon_sha256":"175ffd723c5eb446fb1a1904773957d9d7e0810cbdfcc90f98cddbbd578d2976"},"schema_version":"1.0","source":{"id":"1212.1139","kind":"arxiv","version":1}},"canonical_sha256":"f99e4dec465d87d61f23caaf68d0d34fd452610633ab604b78635f66ee6c4201","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f99e4dec465d87d61f23caaf68d0d34fd452610633ab604b78635f66ee6c4201","first_computed_at":"2026-05-18T03:10:24.344500Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:24.344500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CCmn+/OoJxI2Bz3Xi5e1uDv0cymZS1cvIINzur0rggrGY47kApzWs5c5fYWUtFCrI9Dx4ucJdKTlb14PWJZHDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:24.345305Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.1139","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17e26138818fc12afd8324c767eb623e73cbf65943ed9afc5ec458b8043a7e62","sha256:1a013254744e1b04d29581c1de4edf9751a88f048dc3f3efc94bf3fb42259bbf"],"state_sha256":"8cb714099edc18080dba08b7f29e419d2e54b79d38206f112eba2d8ebd381852"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ik/h3dAZR4NKf4dZ86RK5Qm+Qnio8eu0WHfPOFLk4zMIbpDIsZiGQGJSO0NTJ5kDiPMnBwPZWAGSkQeoa64pBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T05:39:20.630659Z","bundle_sha256":"342fadfdb9b4689a46f9501bd19e491a8656a4efb4b20d5e472054d1ec6c2f1e"}}