{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UWQ5WOZOFG47XIP6G4NIQJIWKD","short_pith_number":"pith:UWQ5WOZO","canonical_record":{"source":{"id":"1507.05212","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-18T18:15:04Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"e7ce0ef6aca4a13a294f08cef2ed6b8495513426495ac9fe7c3c666234408ddf","abstract_canon_sha256":"1771860131637e9a6669edd73f289deb02ecf72df84e5966bde01173df045cda"},"schema_version":"1.0"},"canonical_sha256":"a5a1db3b2e29b9fba1fe371a88251650e3ac2637112bfe3faec766505bb4fb11","source":{"kind":"arxiv","id":"1507.05212","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05212","created_at":"2026-05-18T00:43:39Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05212v1","created_at":"2026-05-18T00:43:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05212","created_at":"2026-05-18T00:43:39Z"},{"alias_kind":"pith_short_12","alias_value":"UWQ5WOZOFG47","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UWQ5WOZOFG47XIP6","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UWQ5WOZO","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UWQ5WOZOFG47XIP6G4NIQJIWKD","target":"record","payload":{"canonical_record":{"source":{"id":"1507.05212","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-18T18:15:04Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"e7ce0ef6aca4a13a294f08cef2ed6b8495513426495ac9fe7c3c666234408ddf","abstract_canon_sha256":"1771860131637e9a6669edd73f289deb02ecf72df84e5966bde01173df045cda"},"schema_version":"1.0"},"canonical_sha256":"a5a1db3b2e29b9fba1fe371a88251650e3ac2637112bfe3faec766505bb4fb11","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:39.874680Z","signature_b64":"4GkadMy1fOjJbUuJJGPElWwlORwNgJfJqDBIxYFX9jmKkyh7J2XuU4+2YFd33JBsbksx3/ek99Ee5Q3khkzfCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5a1db3b2e29b9fba1fe371a88251650e3ac2637112bfe3faec766505bb4fb11","last_reissued_at":"2026-05-18T00:43:39.874114Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:39.874114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.05212","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:43:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"analhfZWkB2zS/XXu0LcExVRcaROvGUrbSGNkoUB7rz5SOWxeHFjjHw8/NZe1vyttvS03pHDRlUFUQt/QuqrBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T12:19:04.132562Z"},"content_sha256":"3ac570b6444bfc3a12b94fdbbf17a2213a9972fd188e1720bbf6093a3d453f22","schema_version":"1.0","event_id":"sha256:3ac570b6444bfc3a12b94fdbbf17a2213a9972fd188e1720bbf6093a3d453f22"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UWQ5WOZOFG47XIP6G4NIQJIWKD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Geometric approach to the MacWilliams Extension Theorem for codes over modules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Serhii Dyshko","submitted_at":"2015-07-18T18:15:04Z","abstract_excerpt":"The MacWilliams Extension Theorem states that each linear Hamming isometry of a linear code extends to a monomial map. In this paper an analogue of the extension theorem for linear codes over a module alphabet is observed. A geometric approach to the extendability of isometries is described. For a matrix module alphabet we found the minimum length of a code for which an unextendable Hamming isometry exists. We also proved an extension theorem for MDS codes over a module alphabet."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05212","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:43:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wCviuCd8qXQTIUVa4+eQoWKG1uwtXNPuO8OuOrDj/JekBx8A1w+1lg+H/z7Q3Ec83RFOGy17dvdRYcoa5bbGBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T12:19:04.133039Z"},"content_sha256":"34689734303a35b308fc6dd5b4cd79044f21f0326ed3031627d38a69731264c7","schema_version":"1.0","event_id":"sha256:34689734303a35b308fc6dd5b4cd79044f21f0326ed3031627d38a69731264c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UWQ5WOZOFG47XIP6G4NIQJIWKD/bundle.json","state_url":"https://pith.science/pith/UWQ5WOZOFG47XIP6G4NIQJIWKD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UWQ5WOZOFG47XIP6G4NIQJIWKD/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-08-05T12:19:04Z","links":{"resolver":"https://pith.science/pith/UWQ5WOZOFG47XIP6G4NIQJIWKD","bundle":"https://pith.science/pith/UWQ5WOZOFG47XIP6G4NIQJIWKD/bundle.json","state":"https://pith.science/pith/UWQ5WOZOFG47XIP6G4NIQJIWKD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UWQ5WOZOFG47XIP6G4NIQJIWKD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UWQ5WOZOFG47XIP6G4NIQJIWKD","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":"1771860131637e9a6669edd73f289deb02ecf72df84e5966bde01173df045cda","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-18T18:15:04Z","title_canon_sha256":"e7ce0ef6aca4a13a294f08cef2ed6b8495513426495ac9fe7c3c666234408ddf"},"schema_version":"1.0","source":{"id":"1507.05212","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05212","created_at":"2026-05-18T00:43:39Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05212v1","created_at":"2026-05-18T00:43:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05212","created_at":"2026-05-18T00:43:39Z"},{"alias_kind":"pith_short_12","alias_value":"UWQ5WOZOFG47","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UWQ5WOZOFG47XIP6","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UWQ5WOZO","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:34689734303a35b308fc6dd5b4cd79044f21f0326ed3031627d38a69731264c7","target":"graph","created_at":"2026-05-18T00:43:39Z","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":"The MacWilliams Extension Theorem states that each linear Hamming isometry of a linear code extends to a monomial map. In this paper an analogue of the extension theorem for linear codes over a module alphabet is observed. A geometric approach to the extendability of isometries is described. For a matrix module alphabet we found the minimum length of a code for which an unextendable Hamming isometry exists. We also proved an extension theorem for MDS codes over a module alphabet.","authors_text":"Serhii Dyshko","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-18T18:15:04Z","title":"Geometric approach to the MacWilliams Extension Theorem for codes over modules"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05212","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:3ac570b6444bfc3a12b94fdbbf17a2213a9972fd188e1720bbf6093a3d453f22","target":"record","created_at":"2026-05-18T00:43:39Z","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":"1771860131637e9a6669edd73f289deb02ecf72df84e5966bde01173df045cda","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-18T18:15:04Z","title_canon_sha256":"e7ce0ef6aca4a13a294f08cef2ed6b8495513426495ac9fe7c3c666234408ddf"},"schema_version":"1.0","source":{"id":"1507.05212","kind":"arxiv","version":1}},"canonical_sha256":"a5a1db3b2e29b9fba1fe371a88251650e3ac2637112bfe3faec766505bb4fb11","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a5a1db3b2e29b9fba1fe371a88251650e3ac2637112bfe3faec766505bb4fb11","first_computed_at":"2026-05-18T00:43:39.874114Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:39.874114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4GkadMy1fOjJbUuJJGPElWwlORwNgJfJqDBIxYFX9jmKkyh7J2XuU4+2YFd33JBsbksx3/ek99Ee5Q3khkzfCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:39.874680Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.05212","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ac570b6444bfc3a12b94fdbbf17a2213a9972fd188e1720bbf6093a3d453f22","sha256:34689734303a35b308fc6dd5b4cd79044f21f0326ed3031627d38a69731264c7"],"state_sha256":"19aef0705d47f7108e90a8f367a1d2c141ddd4afa3236188fdb3e5251f157e79"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Dpzi2X3OYBHiijDsryZOdHZ2eSiHzzU6DOjIiFpmw+YqROhj2w6YwP8YWVgh41VeqXjFPk6Tie6ct+quf1QBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T12:19:04.139618Z","bundle_sha256":"b26aaad6b4fa7444641ce9c5196c553b22b5cf259e12dded53f49afe99cdae0b"}}