{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:A4Q36SJBANEVVV66CZTFBARRIH","short_pith_number":"pith:A4Q36SJB","canonical_record":{"source":{"id":"2605.21727","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-20T20:37:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"30728c118a4c4021f40cb335ae924b8be86cee53738523a182c1524881b113e4","abstract_canon_sha256":"38b23e3c3ce9f8cbf62b53489cd126cb4b5d7d6a11314fef85832cecf6b612d7"},"schema_version":"1.0"},"canonical_sha256":"0721bf492103495ad7de166650823141ce6063c9f85b982a9b58d6821901cc0c","source":{"kind":"arxiv","id":"2605.21727","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.21727","created_at":"2026-05-22T01:03:29Z"},{"alias_kind":"arxiv_version","alias_value":"2605.21727v1","created_at":"2026-05-22T01:03:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21727","created_at":"2026-05-22T01:03:29Z"},{"alias_kind":"pith_short_12","alias_value":"A4Q36SJBANEV","created_at":"2026-05-22T01:03:29Z"},{"alias_kind":"pith_short_16","alias_value":"A4Q36SJBANEVVV66","created_at":"2026-05-22T01:03:29Z"},{"alias_kind":"pith_short_8","alias_value":"A4Q36SJB","created_at":"2026-05-22T01:03:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:A4Q36SJBANEVVV66CZTFBARRIH","target":"record","payload":{"canonical_record":{"source":{"id":"2605.21727","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-20T20:37:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"30728c118a4c4021f40cb335ae924b8be86cee53738523a182c1524881b113e4","abstract_canon_sha256":"38b23e3c3ce9f8cbf62b53489cd126cb4b5d7d6a11314fef85832cecf6b612d7"},"schema_version":"1.0"},"canonical_sha256":"0721bf492103495ad7de166650823141ce6063c9f85b982a9b58d6821901cc0c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:03:29.597564Z","signature_b64":"clgG/z0ufLc8YdxApDq99QXkWjYbhUzizgof260KbZxuRmzYO0ey16kb8z60mLE9dU/oSuNI+8Ek8A2rTw4SBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0721bf492103495ad7de166650823141ce6063c9f85b982a9b58d6821901cc0c","last_reissued_at":"2026-05-22T01:03:29.596923Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:03:29.596923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.21727","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-22T01:03:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"shYxs3XPPr0B7ChVrGVRrECf5MJ3Gc52QU7o+8F/1fnESN9IHjMjxmwdjoAkvCXEgdNxa62+X4Dwoahvw+m4Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:56:22.136444Z"},"content_sha256":"e16ae6972407d201b585e716d12bc7a1c996c4d3371983c5b778063c87ee6f89","schema_version":"1.0","event_id":"sha256:e16ae6972407d201b585e716d12bc7a1c996c4d3371983c5b778063c87ee6f89"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:A4Q36SJBANEVVV66CZTFBARRIH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reed-Muller Codes for Joint Random and Stuck-At Error Correction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cyril Guyot, Ivana Djurdjevic, Robert Mateescu","submitted_at":"2026-05-20T20:37:45Z","abstract_excerpt":"Block codes are considered for improving the reliability of messages stored in a computer memory with both stuck-at defects and random errors. It is assumed that the side information about the state of the defects is available to the encoder, but not to the decoder. A novel recursive construction of a set of masks is developed such that it can satisfy any $s$ stuck-at errors in a $2^m$ binary sequence, when $s \\leq m$. We prove that the masks generated in this way are codewords in a Reed-Muller $RM(s-1, m)$ code. The constructed set contains no more than $2^s m^{s-1}$ masks. We provide the low"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21727","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.21727/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-22T01:03:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ulUqVCayv4eIZ7cj5KRpFMgasQQmVdLxSYfopXXHJwZRtTwSzvNCJVrxlc6fYeRNZTuAa6W/nSzKkRMHDT1oCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:56:22.136819Z"},"content_sha256":"ab1203ff7190c8cad76e3b1799411ebbda8c1dc7cd13defeea2cfc990ded81a1","schema_version":"1.0","event_id":"sha256:ab1203ff7190c8cad76e3b1799411ebbda8c1dc7cd13defeea2cfc990ded81a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A4Q36SJBANEVVV66CZTFBARRIH/bundle.json","state_url":"https://pith.science/pith/A4Q36SJBANEVVV66CZTFBARRIH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A4Q36SJBANEVVV66CZTFBARRIH/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-20T05:56:22Z","links":{"resolver":"https://pith.science/pith/A4Q36SJBANEVVV66CZTFBARRIH","bundle":"https://pith.science/pith/A4Q36SJBANEVVV66CZTFBARRIH/bundle.json","state":"https://pith.science/pith/A4Q36SJBANEVVV66CZTFBARRIH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A4Q36SJBANEVVV66CZTFBARRIH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:A4Q36SJBANEVVV66CZTFBARRIH","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":"38b23e3c3ce9f8cbf62b53489cd126cb4b5d7d6a11314fef85832cecf6b612d7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-20T20:37:45Z","title_canon_sha256":"30728c118a4c4021f40cb335ae924b8be86cee53738523a182c1524881b113e4"},"schema_version":"1.0","source":{"id":"2605.21727","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.21727","created_at":"2026-05-22T01:03:29Z"},{"alias_kind":"arxiv_version","alias_value":"2605.21727v1","created_at":"2026-05-22T01:03:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21727","created_at":"2026-05-22T01:03:29Z"},{"alias_kind":"pith_short_12","alias_value":"A4Q36SJBANEV","created_at":"2026-05-22T01:03:29Z"},{"alias_kind":"pith_short_16","alias_value":"A4Q36SJBANEVVV66","created_at":"2026-05-22T01:03:29Z"},{"alias_kind":"pith_short_8","alias_value":"A4Q36SJB","created_at":"2026-05-22T01:03:29Z"}],"graph_snapshots":[{"event_id":"sha256:ab1203ff7190c8cad76e3b1799411ebbda8c1dc7cd13defeea2cfc990ded81a1","target":"graph","created_at":"2026-05-22T01:03:29Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.21727/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Block codes are considered for improving the reliability of messages stored in a computer memory with both stuck-at defects and random errors. It is assumed that the side information about the state of the defects is available to the encoder, but not to the decoder. A novel recursive construction of a set of masks is developed such that it can satisfy any $s$ stuck-at errors in a $2^m$ binary sequence, when $s \\leq m$. We prove that the masks generated in this way are codewords in a Reed-Muller $RM(s-1, m)$ code. The constructed set contains no more than $2^s m^{s-1}$ masks. We provide the low","authors_text":"Cyril Guyot, Ivana Djurdjevic, Robert Mateescu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-20T20:37:45Z","title":"Reed-Muller Codes for Joint Random and Stuck-At Error Correction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21727","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:e16ae6972407d201b585e716d12bc7a1c996c4d3371983c5b778063c87ee6f89","target":"record","created_at":"2026-05-22T01:03:29Z","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":"38b23e3c3ce9f8cbf62b53489cd126cb4b5d7d6a11314fef85832cecf6b612d7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-20T20:37:45Z","title_canon_sha256":"30728c118a4c4021f40cb335ae924b8be86cee53738523a182c1524881b113e4"},"schema_version":"1.0","source":{"id":"2605.21727","kind":"arxiv","version":1}},"canonical_sha256":"0721bf492103495ad7de166650823141ce6063c9f85b982a9b58d6821901cc0c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0721bf492103495ad7de166650823141ce6063c9f85b982a9b58d6821901cc0c","first_computed_at":"2026-05-22T01:03:29.596923Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-22T01:03:29.596923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"clgG/z0ufLc8YdxApDq99QXkWjYbhUzizgof260KbZxuRmzYO0ey16kb8z60mLE9dU/oSuNI+8Ek8A2rTw4SBQ==","signature_status":"signed_v1","signed_at":"2026-05-22T01:03:29.597564Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.21727","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e16ae6972407d201b585e716d12bc7a1c996c4d3371983c5b778063c87ee6f89","sha256:ab1203ff7190c8cad76e3b1799411ebbda8c1dc7cd13defeea2cfc990ded81a1"],"state_sha256":"5c7a5c8ebede61f1c29ae97ecf92e71964eaa516f0067500d9fa893af451445b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+lMVcDQcSO4Q8Xw1VyB9Fk+eBKZow7kdHEv5GJ3+rp1fooI0RzYwf1Gzvyz6FD6wuiUKeTc1f9C6bzToH7XtAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T05:56:22.138944Z","bundle_sha256":"28484648a6e1babf706a9779d10591b28523bc0b9f7565883179516aa6dcf48b"}}