{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:TV3LOLIJFQCIEVFZGNLCZW3J6X","short_pith_number":"pith:TV3LOLIJ","canonical_record":{"source":{"id":"1310.4349","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-16T12:31:01Z","cross_cats_sorted":["cs.AR","cs.DM","cs.ET","math.IT"],"title_canon_sha256":"cb3b369ee9d262f4d64f6b2ccd5a6894eda7ef28e166042bcb4b65d40958eae9","abstract_canon_sha256":"cd8014c0473ab6ecf5d51d04631b4abfa557459b281a711aa727a15408df9755"},"schema_version":"1.0"},"canonical_sha256":"9d76b72d092c048254b933562cdb69f5c9fbb321904f82de600054146b71c4b0","source":{"kind":"arxiv","id":"1310.4349","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.4349","created_at":"2026-05-18T00:12:01Z"},{"alias_kind":"arxiv_version","alias_value":"1310.4349v2","created_at":"2026-05-18T00:12:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4349","created_at":"2026-05-18T00:12:01Z"},{"alias_kind":"pith_short_12","alias_value":"TV3LOLIJFQCI","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TV3LOLIJFQCIEVFZ","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TV3LOLIJ","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:TV3LOLIJFQCIEVFZGNLCZW3J6X","target":"record","payload":{"canonical_record":{"source":{"id":"1310.4349","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-16T12:31:01Z","cross_cats_sorted":["cs.AR","cs.DM","cs.ET","math.IT"],"title_canon_sha256":"cb3b369ee9d262f4d64f6b2ccd5a6894eda7ef28e166042bcb4b65d40958eae9","abstract_canon_sha256":"cd8014c0473ab6ecf5d51d04631b4abfa557459b281a711aa727a15408df9755"},"schema_version":"1.0"},"canonical_sha256":"9d76b72d092c048254b933562cdb69f5c9fbb321904f82de600054146b71c4b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:01.310353Z","signature_b64":"HoiebMxCAI7BnAPTv+fvD6gP8DClhEYqJuz0KovqMucY+YPVshGaUXqKnHjjU/CrxLFYx2KV0n7UbuGPaJGZAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d76b72d092c048254b933562cdb69f5c9fbb321904f82de600054146b71c4b0","last_reissued_at":"2026-05-18T00:12:01.309788Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:01.309788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.4349","source_version":2,"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:12:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+9CMZITZQQ6KDHu2/Wz/nvOEjQNSZRw8uXrP07Cl0Me8ZBy2LA0mFjFIpqmYujpr96VV9lgGerAxMJn1BMnPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:27:44.874494Z"},"content_sha256":"07689b4be7cea75e6b9a09ce0e1386f468c18457a7177a7ef4f181be9204640c","schema_version":"1.0","event_id":"sha256:07689b4be7cea75e6b9a09ce0e1386f468c18457a7177a7ef4f181be9204640c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:TV3LOLIJFQCIEVFZGNLCZW3J6X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Improved Majority-Logic Decoder Offering Massively Parallel Decoding for Real-Time Control in Embedded Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR","cs.DM","cs.ET","math.IT"],"primary_cat":"cs.IT","authors_text":"Juliane Bertram, Michael Huber, Peter Hauck","submitted_at":"2013-10-16T12:31:01Z","abstract_excerpt":"We propose an easy-to-implement hard-decision majority-logic decoding algorithm for Reed-Muller codes RM(r,m) with m >= 3, m/2 >= r >= 1. The presented algorithm outperforms the best known majority-logic decoding algorithms and offers highly parallel decoding. The result is of special importance for safety- and time-critical applications in embedded systems. A simple combinational circuit can perform the proposed decoding. In particular, we show how our decoder for the three-error-correcting code RM(2,5) of dimension 16 and length 32 can be realized on hardware level."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.4349","kind":"arxiv","version":2},"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:12:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G80yiVlAh0i9lyKcXC3YQQ3C1k3EgWNhAP681PJyrtIcC7VKldUpq2G6PEnsZPDiCUTAfHGGPXZ0hdNPq5jlCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:27:44.875192Z"},"content_sha256":"312769182fde340f4b994c17684b5d232b3ed9bd6282cd19e90b0f04bb6fd57b","schema_version":"1.0","event_id":"sha256:312769182fde340f4b994c17684b5d232b3ed9bd6282cd19e90b0f04bb6fd57b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TV3LOLIJFQCIEVFZGNLCZW3J6X/bundle.json","state_url":"https://pith.science/pith/TV3LOLIJFQCIEVFZGNLCZW3J6X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TV3LOLIJFQCIEVFZGNLCZW3J6X/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-31T16:27:44Z","links":{"resolver":"https://pith.science/pith/TV3LOLIJFQCIEVFZGNLCZW3J6X","bundle":"https://pith.science/pith/TV3LOLIJFQCIEVFZGNLCZW3J6X/bundle.json","state":"https://pith.science/pith/TV3LOLIJFQCIEVFZGNLCZW3J6X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TV3LOLIJFQCIEVFZGNLCZW3J6X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:TV3LOLIJFQCIEVFZGNLCZW3J6X","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":"cd8014c0473ab6ecf5d51d04631b4abfa557459b281a711aa727a15408df9755","cross_cats_sorted":["cs.AR","cs.DM","cs.ET","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-16T12:31:01Z","title_canon_sha256":"cb3b369ee9d262f4d64f6b2ccd5a6894eda7ef28e166042bcb4b65d40958eae9"},"schema_version":"1.0","source":{"id":"1310.4349","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.4349","created_at":"2026-05-18T00:12:01Z"},{"alias_kind":"arxiv_version","alias_value":"1310.4349v2","created_at":"2026-05-18T00:12:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4349","created_at":"2026-05-18T00:12:01Z"},{"alias_kind":"pith_short_12","alias_value":"TV3LOLIJFQCI","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TV3LOLIJFQCIEVFZ","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TV3LOLIJ","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:312769182fde340f4b994c17684b5d232b3ed9bd6282cd19e90b0f04bb6fd57b","target":"graph","created_at":"2026-05-18T00:12:01Z","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 propose an easy-to-implement hard-decision majority-logic decoding algorithm for Reed-Muller codes RM(r,m) with m >= 3, m/2 >= r >= 1. The presented algorithm outperforms the best known majority-logic decoding algorithms and offers highly parallel decoding. The result is of special importance for safety- and time-critical applications in embedded systems. A simple combinational circuit can perform the proposed decoding. In particular, we show how our decoder for the three-error-correcting code RM(2,5) of dimension 16 and length 32 can be realized on hardware level.","authors_text":"Juliane Bertram, Michael Huber, Peter Hauck","cross_cats":["cs.AR","cs.DM","cs.ET","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-16T12:31:01Z","title":"An Improved Majority-Logic Decoder Offering Massively Parallel Decoding for Real-Time Control in Embedded Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.4349","kind":"arxiv","version":2},"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:07689b4be7cea75e6b9a09ce0e1386f468c18457a7177a7ef4f181be9204640c","target":"record","created_at":"2026-05-18T00:12:01Z","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":"cd8014c0473ab6ecf5d51d04631b4abfa557459b281a711aa727a15408df9755","cross_cats_sorted":["cs.AR","cs.DM","cs.ET","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-16T12:31:01Z","title_canon_sha256":"cb3b369ee9d262f4d64f6b2ccd5a6894eda7ef28e166042bcb4b65d40958eae9"},"schema_version":"1.0","source":{"id":"1310.4349","kind":"arxiv","version":2}},"canonical_sha256":"9d76b72d092c048254b933562cdb69f5c9fbb321904f82de600054146b71c4b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d76b72d092c048254b933562cdb69f5c9fbb321904f82de600054146b71c4b0","first_computed_at":"2026-05-18T00:12:01.309788Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:01.309788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HoiebMxCAI7BnAPTv+fvD6gP8DClhEYqJuz0KovqMucY+YPVshGaUXqKnHjjU/CrxLFYx2KV0n7UbuGPaJGZAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:01.310353Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.4349","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07689b4be7cea75e6b9a09ce0e1386f468c18457a7177a7ef4f181be9204640c","sha256:312769182fde340f4b994c17684b5d232b3ed9bd6282cd19e90b0f04bb6fd57b"],"state_sha256":"3dcb80c7df9a7712942a437c3d412d3d6c7ed7129d451ef1167dddc4d0156818"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pfZc4GPppxSse1ciwRn21wNbqeinaNNqbR4x7Ub1ZLBZri92ZD9RpQypmnb7RzaiFH22PV+AQMrHLPpIB3ReBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T16:27:44.878818Z","bundle_sha256":"83245ddd801b26469f44a166824e323a81c3773bc7c5fd84c47d2003a08a8024"}}