{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TBOS6HEGKDNJTH7M5HLVIX6RMR","short_pith_number":"pith:TBOS6HEG","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"},"canonical_sha256":"985d2f1c8650da999fece9d7545fd164574804880360523860414470a0619e2f","source":{"kind":"arxiv","id":"1412.4365","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.4365","created_at":"2026-05-18T01:25:02Z"},{"alias_kind":"arxiv_version","alias_value":"1412.4365v3","created_at":"2026-05-18T01:25:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4365","created_at":"2026-05-18T01:25:02Z"},{"alias_kind":"pith_short_12","alias_value":"TBOS6HEGKDNJ","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TBOS6HEGKDNJTH7M","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TBOS6HEG","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TBOS6HEGKDNJTH7M5HLVIX6RMR","target":"record","payload":{"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"},"canonical_sha256":"985d2f1c8650da999fece9d7545fd164574804880360523860414470a0619e2f","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"},"source_kind":"arxiv","source_id":"1412.4365","source_version":3,"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-18T01:25:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mtfreLCFgqlqhFLyB3tsklcf+LWXVQIycHmAnb9e5SG99J96kaj2ThSwk5DtC1F1tRBRPE5ZoRmfSALxrRdMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:36:13.533182Z"},"content_sha256":"87af5569a88f499f0aec535aeda537418e4bf1e6fc9cef07545571867514efce","schema_version":"1.0","event_id":"sha256:87af5569a88f499f0aec535aeda537418e4bf1e6fc9cef07545571867514efce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TBOS6HEGKDNJTH7M5HLVIX6RMR","target":"graph","payload":{"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"},"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-18T01:25:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cU5/Die90/Ty1Tw3SKbKvo0ijPULvF1qiXRfhQKNQCgM/T+VsvAFAiLGl0wSaXWSly1C8y6GQmNgbkD8mjdOAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:36:13.533894Z"},"content_sha256":"8529ed2b338ac615ac13b822042fc2012029f6679dfba7c3b41e6836efecec2a","schema_version":"1.0","event_id":"sha256:8529ed2b338ac615ac13b822042fc2012029f6679dfba7c3b41e6836efecec2a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TBOS6HEGKDNJTH7M5HLVIX6RMR/bundle.json","state_url":"https://pith.science/pith/TBOS6HEGKDNJTH7M5HLVIX6RMR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TBOS6HEGKDNJTH7M5HLVIX6RMR/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-08T01:36:13Z","links":{"resolver":"https://pith.science/pith/TBOS6HEGKDNJTH7M5HLVIX6RMR","bundle":"https://pith.science/pith/TBOS6HEGKDNJTH7M5HLVIX6RMR/bundle.json","state":"https://pith.science/pith/TBOS6HEGKDNJTH7M5HLVIX6RMR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TBOS6HEGKDNJTH7M5HLVIX6RMR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TBOS6HEGKDNJTH7M5HLVIX6RMR","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":"d17b2d4460fc58bc4a976a1c421b81c42018fccb58dcf8587b4d065e260a7250","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-14T14:32:12Z","title_canon_sha256":"f21f7a3cec853464bbc245596fba60ebd8fbeab5dfcad510d3ec871f403d7cde"},"schema_version":"1.0","source":{"id":"1412.4365","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.4365","created_at":"2026-05-18T01:25:02Z"},{"alias_kind":"arxiv_version","alias_value":"1412.4365v3","created_at":"2026-05-18T01:25:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4365","created_at":"2026-05-18T01:25:02Z"},{"alias_kind":"pith_short_12","alias_value":"TBOS6HEGKDNJ","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TBOS6HEGKDNJTH7M","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TBOS6HEG","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:8529ed2b338ac615ac13b822042fc2012029f6679dfba7c3b41e6836efecec2a","target":"graph","created_at":"2026-05-18T01:25:02Z","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":"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","authors_text":"Hajime Matsui, Norihiro Nakashima","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-14T14:32:12Z","title":"Decoding of Projective Reed-Muller Codes by Dividing a Projective Space into Affine Spaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4365","kind":"arxiv","version":3},"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:87af5569a88f499f0aec535aeda537418e4bf1e6fc9cef07545571867514efce","target":"record","created_at":"2026-05-18T01:25:02Z","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":"d17b2d4460fc58bc4a976a1c421b81c42018fccb58dcf8587b4d065e260a7250","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-14T14:32:12Z","title_canon_sha256":"f21f7a3cec853464bbc245596fba60ebd8fbeab5dfcad510d3ec871f403d7cde"},"schema_version":"1.0","source":{"id":"1412.4365","kind":"arxiv","version":3}},"canonical_sha256":"985d2f1c8650da999fece9d7545fd164574804880360523860414470a0619e2f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"985d2f1c8650da999fece9d7545fd164574804880360523860414470a0619e2f","first_computed_at":"2026-05-18T01:25:02.447735Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:02.447735Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+b2OqQqXnOLJ3P2QPZItNSxoHpKK8wUqcIhyIP6pxyAGLez+QMFeLfZKBDtOZpt60r6VvDVUrqVJj6QsYNZ6Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:02.448401Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.4365","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87af5569a88f499f0aec535aeda537418e4bf1e6fc9cef07545571867514efce","sha256:8529ed2b338ac615ac13b822042fc2012029f6679dfba7c3b41e6836efecec2a"],"state_sha256":"e2a41884e5bccce2ea98f077a6024147827fafacc5be5ef30d5d9aac75bd60f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LocQnnh+EkCVOpEXGZUMg77EWVaBQBsnaLu0WZgGbr1vm6kjkdKMDdoQTIYQuCVqsB08WdR4sajcYgqK2/I0AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T01:36:13.537859Z","bundle_sha256":"eae8b7961353b4958f2664f6ebaec3ab5031d0be0c7f4840ee6fddb82bd3aeeb"}}