{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TBOS6HEGKDNJTH7M5HLVIX6RMR","short_pith_number":"pith:TBOS6HEG","schema_version":"1.0","canonical_sha256":"985d2f1c8650da999fece9d7545fd164574804880360523860414470a0619e2f","source":{"kind":"arxiv","id":"1412.4365","version":3},"attestation_state":"computed","paper":{"title":"Decoding of Projective Reed-Muller Codes by Dividing a Projective Space into Affine Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hajime Matsui, Norihiro Nakashima","submitted_at":"2014-12-14T14:32:12Z","abstract_excerpt":"A projective Reed-Muller (PRM) code, obtained by modifying a (classical) Reed-Muller code with respect to a projective space, is a doubly extended Reed-Solomon code when the dimension of the related projective space is equal to 1. The minimum distance and dual code of a PRM code are known, and some decoding examples have been represented for low-dimensional projective space. In this study, we construct a decoding algorithm for all PRM codes by dividing a projective space into a union of affine spaces. In addition, we determine the computational complexity and the number of errors correctable o"},"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":"1412.4365","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-14T14:32:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f21f7a3cec853464bbc245596fba60ebd8fbeab5dfcad510d3ec871f403d7cde","abstract_canon_sha256":"d17b2d4460fc58bc4a976a1c421b81c42018fccb58dcf8587b4d065e260a7250"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:02.448401Z","signature_b64":"+b2OqQqXnOLJ3P2QPZItNSxoHpKK8wUqcIhyIP6pxyAGLez+QMFeLfZKBDtOZpt60r6VvDVUrqVJj6QsYNZ6Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"985d2f1c8650da999fece9d7545fd164574804880360523860414470a0619e2f","last_reissued_at":"2026-05-18T01:25:02.447735Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:02.447735Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decoding of Projective Reed-Muller Codes by Dividing a Projective Space into Affine Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hajime Matsui, Norihiro Nakashima","submitted_at":"2014-12-14T14:32:12Z","abstract_excerpt":"A projective Reed-Muller (PRM) code, obtained by modifying a (classical) Reed-Muller code with respect to a projective space, is a doubly extended Reed-Solomon code when the dimension of the related projective space is equal to 1. The minimum distance and dual code of a PRM code are known, and some decoding examples have been represented for low-dimensional projective space. In this study, we construct a decoding algorithm for all PRM codes by dividing a projective space into a union of affine spaces. In addition, we determine the computational complexity and the number of errors correctable o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4365","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.4365","created_at":"2026-05-18T01:25:02.447831+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.4365v3","created_at":"2026-05-18T01:25:02.447831+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4365","created_at":"2026-05-18T01:25:02.447831+00:00"},{"alias_kind":"pith_short_12","alias_value":"TBOS6HEGKDNJ","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"TBOS6HEGKDNJTH7M","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"TBOS6HEG","created_at":"2026-05-18T12:28:49.207871+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/TBOS6HEGKDNJTH7M5HLVIX6RMR","json":"https://pith.science/pith/TBOS6HEGKDNJTH7M5HLVIX6RMR.json","graph_json":"https://pith.science/api/pith-number/TBOS6HEGKDNJTH7M5HLVIX6RMR/graph.json","events_json":"https://pith.science/api/pith-number/TBOS6HEGKDNJTH7M5HLVIX6RMR/events.json","paper":"https://pith.science/paper/TBOS6HEG"},"agent_actions":{"view_html":"https://pith.science/pith/TBOS6HEGKDNJTH7M5HLVIX6RMR","download_json":"https://pith.science/pith/TBOS6HEGKDNJTH7M5HLVIX6RMR.json","view_paper":"https://pith.science/paper/TBOS6HEG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.4365&json=true","fetch_graph":"https://pith.science/api/pith-number/TBOS6HEGKDNJTH7M5HLVIX6RMR/graph.json","fetch_events":"https://pith.science/api/pith-number/TBOS6HEGKDNJTH7M5HLVIX6RMR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TBOS6HEGKDNJTH7M5HLVIX6RMR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TBOS6HEGKDNJTH7M5HLVIX6RMR/action/storage_attestation","attest_author":"https://pith.science/pith/TBOS6HEGKDNJTH7M5HLVIX6RMR/action/author_attestation","sign_citation":"https://pith.science/pith/TBOS6HEGKDNJTH7M5HLVIX6RMR/action/citation_signature","submit_replication":"https://pith.science/pith/TBOS6HEGKDNJTH7M5HLVIX6RMR/action/replication_record"}},"created_at":"2026-05-18T01:25:02.447831+00:00","updated_at":"2026-05-18T01:25:02.447831+00:00"}