{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:PH2OAQPUBWVJ3LFFPVZD3QWJCK","short_pith_number":"pith:PH2OAQPU","schema_version":"1.0","canonical_sha256":"79f4e041f40daa9daca57d723dc2c912933bd4e8373c4a53ea4c9c99edcd132e","source":{"kind":"arxiv","id":"1406.1714","version":2},"attestation_state":"computed","paper":{"title":"On extendibility of additive code isometries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Serhii Dyshko","submitted_at":"2014-06-06T15:39:38Z","abstract_excerpt":"For linear codes, the MacWilliams Extension Theorem states that each linear isometry of a linear code extends to a linear isometry of the whole space. But, in general, it is not the situation for nonlinear codes. In this paper it is proved, that if the length of an additive code is less than some threshold value, then an analogue of the MacWilliams Extension Theorem holds. One family of unextendible code isometries for the threshold value of code length is described."},"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":"1406.1714","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-06T15:39:38Z","cross_cats_sorted":[],"title_canon_sha256":"e9f6f32686b2ef491b3f2d6bc79824d20ce5fa08a717aeef8e02f50ebe41610d","abstract_canon_sha256":"d2993c82203111e71721b8adee186ca35c6205081a641ed435b5aa1b36d1cf50"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:23.000807Z","signature_b64":"MX/uXYFh0CQUhjGGzQAUE5w+hA58sfhJM6mx5i7yy+gwNYTdLOmlhu2GSyDSI0/Qng7G37VJMZetYEqabpyEDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79f4e041f40daa9daca57d723dc2c912933bd4e8373c4a53ea4c9c99edcd132e","last_reissued_at":"2026-05-18T01:12:23.000393Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:23.000393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On extendibility of additive code isometries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Serhii Dyshko","submitted_at":"2014-06-06T15:39:38Z","abstract_excerpt":"For linear codes, the MacWilliams Extension Theorem states that each linear isometry of a linear code extends to a linear isometry of the whole space. But, in general, it is not the situation for nonlinear codes. In this paper it is proved, that if the length of an additive code is less than some threshold value, then an analogue of the MacWilliams Extension Theorem holds. One family of unextendible code isometries for the threshold value of code length is described."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1714","kind":"arxiv","version":2},"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":"1406.1714","created_at":"2026-05-18T01:12:23.000440+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.1714v2","created_at":"2026-05-18T01:12:23.000440+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1714","created_at":"2026-05-18T01:12:23.000440+00:00"},{"alias_kind":"pith_short_12","alias_value":"PH2OAQPUBWVJ","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PH2OAQPUBWVJ3LFF","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PH2OAQPU","created_at":"2026-05-18T12:28:43.426989+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/PH2OAQPUBWVJ3LFFPVZD3QWJCK","json":"https://pith.science/pith/PH2OAQPUBWVJ3LFFPVZD3QWJCK.json","graph_json":"https://pith.science/api/pith-number/PH2OAQPUBWVJ3LFFPVZD3QWJCK/graph.json","events_json":"https://pith.science/api/pith-number/PH2OAQPUBWVJ3LFFPVZD3QWJCK/events.json","paper":"https://pith.science/paper/PH2OAQPU"},"agent_actions":{"view_html":"https://pith.science/pith/PH2OAQPUBWVJ3LFFPVZD3QWJCK","download_json":"https://pith.science/pith/PH2OAQPUBWVJ3LFFPVZD3QWJCK.json","view_paper":"https://pith.science/paper/PH2OAQPU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.1714&json=true","fetch_graph":"https://pith.science/api/pith-number/PH2OAQPUBWVJ3LFFPVZD3QWJCK/graph.json","fetch_events":"https://pith.science/api/pith-number/PH2OAQPUBWVJ3LFFPVZD3QWJCK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PH2OAQPUBWVJ3LFFPVZD3QWJCK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PH2OAQPUBWVJ3LFFPVZD3QWJCK/action/storage_attestation","attest_author":"https://pith.science/pith/PH2OAQPUBWVJ3LFFPVZD3QWJCK/action/author_attestation","sign_citation":"https://pith.science/pith/PH2OAQPUBWVJ3LFFPVZD3QWJCK/action/citation_signature","submit_replication":"https://pith.science/pith/PH2OAQPUBWVJ3LFFPVZD3QWJCK/action/replication_record"}},"created_at":"2026-05-18T01:12:23.000440+00:00","updated_at":"2026-05-18T01:12:23.000440+00:00"}