{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UWQ5WOZOFG47XIP6G4NIQJIWKD","short_pith_number":"pith:UWQ5WOZO","schema_version":"1.0","canonical_sha256":"a5a1db3b2e29b9fba1fe371a88251650e3ac2637112bfe3faec766505bb4fb11","source":{"kind":"arxiv","id":"1507.05212","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1507.05212","created_at":"2026-05-18T00:43:39.874182+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.05212v1","created_at":"2026-05-18T00:43:39.874182+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05212","created_at":"2026-05-18T00:43:39.874182+00:00"},{"alias_kind":"pith_short_12","alias_value":"UWQ5WOZOFG47","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UWQ5WOZOFG47XIP6","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UWQ5WOZO","created_at":"2026-05-18T12:29:44.643036+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/UWQ5WOZOFG47XIP6G4NIQJIWKD","json":"https://pith.science/pith/UWQ5WOZOFG47XIP6G4NIQJIWKD.json","graph_json":"https://pith.science/api/pith-number/UWQ5WOZOFG47XIP6G4NIQJIWKD/graph.json","events_json":"https://pith.science/api/pith-number/UWQ5WOZOFG47XIP6G4NIQJIWKD/events.json","paper":"https://pith.science/paper/UWQ5WOZO"},"agent_actions":{"view_html":"https://pith.science/pith/UWQ5WOZOFG47XIP6G4NIQJIWKD","download_json":"https://pith.science/pith/UWQ5WOZOFG47XIP6G4NIQJIWKD.json","view_paper":"https://pith.science/paper/UWQ5WOZO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.05212&json=true","fetch_graph":"https://pith.science/api/pith-number/UWQ5WOZOFG47XIP6G4NIQJIWKD/graph.json","fetch_events":"https://pith.science/api/pith-number/UWQ5WOZOFG47XIP6G4NIQJIWKD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UWQ5WOZOFG47XIP6G4NIQJIWKD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UWQ5WOZOFG47XIP6G4NIQJIWKD/action/storage_attestation","attest_author":"https://pith.science/pith/UWQ5WOZOFG47XIP6G4NIQJIWKD/action/author_attestation","sign_citation":"https://pith.science/pith/UWQ5WOZOFG47XIP6G4NIQJIWKD/action/citation_signature","submit_replication":"https://pith.science/pith/UWQ5WOZOFG47XIP6G4NIQJIWKD/action/replication_record"}},"created_at":"2026-05-18T00:43:39.874182+00:00","updated_at":"2026-05-18T00:43:39.874182+00:00"}