{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:A4Q36SJBANEVVV66CZTFBARRIH","short_pith_number":"pith:A4Q36SJB","schema_version":"1.0","canonical_sha256":"0721bf492103495ad7de166650823141ce6063c9f85b982a9b58d6821901cc0c","source":{"kind":"arxiv","id":"2605.21727","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.21727","created_at":"2026-05-22T01:03:29.597022+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.21727v1","created_at":"2026-05-22T01:03:29.597022+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21727","created_at":"2026-05-22T01:03:29.597022+00:00"},{"alias_kind":"pith_short_12","alias_value":"A4Q36SJBANEV","created_at":"2026-05-22T01:03:29.597022+00:00"},{"alias_kind":"pith_short_16","alias_value":"A4Q36SJBANEVVV66","created_at":"2026-05-22T01:03:29.597022+00:00"},{"alias_kind":"pith_short_8","alias_value":"A4Q36SJB","created_at":"2026-05-22T01:03:29.597022+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A4Q36SJBANEVVV66CZTFBARRIH","json":"https://pith.science/pith/A4Q36SJBANEVVV66CZTFBARRIH.json","graph_json":"https://pith.science/api/pith-number/A4Q36SJBANEVVV66CZTFBARRIH/graph.json","events_json":"https://pith.science/api/pith-number/A4Q36SJBANEVVV66CZTFBARRIH/events.json","paper":"https://pith.science/paper/A4Q36SJB"},"agent_actions":{"view_html":"https://pith.science/pith/A4Q36SJBANEVVV66CZTFBARRIH","download_json":"https://pith.science/pith/A4Q36SJBANEVVV66CZTFBARRIH.json","view_paper":"https://pith.science/paper/A4Q36SJB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.21727&json=true","fetch_graph":"https://pith.science/api/pith-number/A4Q36SJBANEVVV66CZTFBARRIH/graph.json","fetch_events":"https://pith.science/api/pith-number/A4Q36SJBANEVVV66CZTFBARRIH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A4Q36SJBANEVVV66CZTFBARRIH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A4Q36SJBANEVVV66CZTFBARRIH/action/storage_attestation","attest_author":"https://pith.science/pith/A4Q36SJBANEVVV66CZTFBARRIH/action/author_attestation","sign_citation":"https://pith.science/pith/A4Q36SJBANEVVV66CZTFBARRIH/action/citation_signature","submit_replication":"https://pith.science/pith/A4Q36SJBANEVVV66CZTFBARRIH/action/replication_record"}},"created_at":"2026-05-22T01:03:29.597022+00:00","updated_at":"2026-05-22T01:03:29.597022+00:00"}