{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FZSAJGUDUOJCLMA2ZTLYHV4T3I","short_pith_number":"pith:FZSAJGUD","canonical_record":{"source":{"id":"1807.03912","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-11T00:46:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"56113fb1fc44160c20c078a50693403f8f3afc1296c58e1d959077c84836626b","abstract_canon_sha256":"57b2514c7fcc8d410e000090794d69f6ecd83b24f864af458018cc12ec51af1f"},"schema_version":"1.0"},"canonical_sha256":"2e64049a83a39225b01accd783d793da264dbc0dc3d583169dbc03e976cebefa","source":{"kind":"arxiv","id":"1807.03912","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03912","created_at":"2026-05-18T00:10:58Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03912v1","created_at":"2026-05-18T00:10:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03912","created_at":"2026-05-18T00:10:58Z"},{"alias_kind":"pith_short_12","alias_value":"FZSAJGUDUOJC","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FZSAJGUDUOJCLMA2","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FZSAJGUD","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FZSAJGUDUOJCLMA2ZTLYHV4T3I","target":"record","payload":{"canonical_record":{"source":{"id":"1807.03912","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-11T00:46:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"56113fb1fc44160c20c078a50693403f8f3afc1296c58e1d959077c84836626b","abstract_canon_sha256":"57b2514c7fcc8d410e000090794d69f6ecd83b24f864af458018cc12ec51af1f"},"schema_version":"1.0"},"canonical_sha256":"2e64049a83a39225b01accd783d793da264dbc0dc3d583169dbc03e976cebefa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:58.690985Z","signature_b64":"n0Zg7Q6WCHWUjzRI3HkxoZBKD9pTsF9yBz6UHXbYHea8HL1aEsf0x8XGDBh0jj4JyM+C15WTDXh9b6BsrUwOBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e64049a83a39225b01accd783d793da264dbc0dc3d583169dbc03e976cebefa","last_reissued_at":"2026-05-18T00:10:58.690228Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:58.690228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.03912","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:10:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4R3oFyWuUo+Wv9rJiWfKz3Nw3AGwiWUdWZoiXjLoB8cV2alZlpXYqI0i+irM6F96poNV5HRuaq36C2Zgu0oUDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:27:42.026650Z"},"content_sha256":"8be0ab59f995b506505c0f36988d266c5211243b92da4e1bd2b8ca415e8ffffa","schema_version":"1.0","event_id":"sha256:8be0ab59f995b506505c0f36988d266c5211243b92da4e1bd2b8ca415e8ffffa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FZSAJGUDUOJCLMA2ZTLYHV4T3I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decoding Reed-Muller and Polar Codes by Successive Factor Graph Permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Marco Mondelli, Nghia Doan, Seyyed Ali Hashemi, Warren J. Gross","submitted_at":"2018-07-11T00:46:06Z","abstract_excerpt":"Reed-Muller (RM) and polar codes are a class of capacity-achieving channel coding schemes with the same factor graph representation. Low-complexity decoding algorithms fall short in providing a good error-correction performance for RM and polar codes. Using the symmetric group of RM and polar codes, the specific decoding algorithm can be carried out on multiple permutations of the factor graph to boost the error-correction performance. However, this approach results in high decoding complexity. In this paper, we first derive the total number of factor graph permutations on which the decoding c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03912","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:10:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/LMMLsHUFD19HmXYunsmpcvwQRFaVgejhWxCHxPOyHcTEdCcg8wXNrEl0OHbQl3cDQMTFDZOhittGeV0XrQjBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:27:42.027010Z"},"content_sha256":"6985ad80e2b4f194abdb7d83350e9e77d8b47cdafe11fb57f05f118e3aa1d2ff","schema_version":"1.0","event_id":"sha256:6985ad80e2b4f194abdb7d83350e9e77d8b47cdafe11fb57f05f118e3aa1d2ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FZSAJGUDUOJCLMA2ZTLYHV4T3I/bundle.json","state_url":"https://pith.science/pith/FZSAJGUDUOJCLMA2ZTLYHV4T3I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FZSAJGUDUOJCLMA2ZTLYHV4T3I/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-28T05:27:42Z","links":{"resolver":"https://pith.science/pith/FZSAJGUDUOJCLMA2ZTLYHV4T3I","bundle":"https://pith.science/pith/FZSAJGUDUOJCLMA2ZTLYHV4T3I/bundle.json","state":"https://pith.science/pith/FZSAJGUDUOJCLMA2ZTLYHV4T3I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FZSAJGUDUOJCLMA2ZTLYHV4T3I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FZSAJGUDUOJCLMA2ZTLYHV4T3I","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":"57b2514c7fcc8d410e000090794d69f6ecd83b24f864af458018cc12ec51af1f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-11T00:46:06Z","title_canon_sha256":"56113fb1fc44160c20c078a50693403f8f3afc1296c58e1d959077c84836626b"},"schema_version":"1.0","source":{"id":"1807.03912","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03912","created_at":"2026-05-18T00:10:58Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03912v1","created_at":"2026-05-18T00:10:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03912","created_at":"2026-05-18T00:10:58Z"},{"alias_kind":"pith_short_12","alias_value":"FZSAJGUDUOJC","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FZSAJGUDUOJCLMA2","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FZSAJGUD","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:6985ad80e2b4f194abdb7d83350e9e77d8b47cdafe11fb57f05f118e3aa1d2ff","target":"graph","created_at":"2026-05-18T00:10:58Z","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":"Reed-Muller (RM) and polar codes are a class of capacity-achieving channel coding schemes with the same factor graph representation. Low-complexity decoding algorithms fall short in providing a good error-correction performance for RM and polar codes. Using the symmetric group of RM and polar codes, the specific decoding algorithm can be carried out on multiple permutations of the factor graph to boost the error-correction performance. However, this approach results in high decoding complexity. In this paper, we first derive the total number of factor graph permutations on which the decoding c","authors_text":"Marco Mondelli, Nghia Doan, Seyyed Ali Hashemi, Warren J. Gross","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-11T00:46:06Z","title":"Decoding Reed-Muller and Polar Codes by Successive Factor Graph Permutations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03912","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:8be0ab59f995b506505c0f36988d266c5211243b92da4e1bd2b8ca415e8ffffa","target":"record","created_at":"2026-05-18T00:10:58Z","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":"57b2514c7fcc8d410e000090794d69f6ecd83b24f864af458018cc12ec51af1f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-11T00:46:06Z","title_canon_sha256":"56113fb1fc44160c20c078a50693403f8f3afc1296c58e1d959077c84836626b"},"schema_version":"1.0","source":{"id":"1807.03912","kind":"arxiv","version":1}},"canonical_sha256":"2e64049a83a39225b01accd783d793da264dbc0dc3d583169dbc03e976cebefa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e64049a83a39225b01accd783d793da264dbc0dc3d583169dbc03e976cebefa","first_computed_at":"2026-05-18T00:10:58.690228Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:58.690228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n0Zg7Q6WCHWUjzRI3HkxoZBKD9pTsF9yBz6UHXbYHea8HL1aEsf0x8XGDBh0jj4JyM+C15WTDXh9b6BsrUwOBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:58.690985Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.03912","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8be0ab59f995b506505c0f36988d266c5211243b92da4e1bd2b8ca415e8ffffa","sha256:6985ad80e2b4f194abdb7d83350e9e77d8b47cdafe11fb57f05f118e3aa1d2ff"],"state_sha256":"6aabd20f66c076ec388bcde0b4f4d0197d129fdc620fb5eae77a583539711c95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F/rwaxzGP9qyhA2wekYEP8RLUt7U1AYKuNNhWefAMZhsKdApBp0Yn82uXf+tHI8p6uIUPxDqVmnC4THih+YGBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T05:27:42.029026Z","bundle_sha256":"016c41449142166010e847ae3cfdd8f5c369d25f5e2eeaeebea718f748f15877"}}