{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WID4RVKXGASGJIUQTJUBQDWBYU","short_pith_number":"pith:WID4RVKX","schema_version":"1.0","canonical_sha256":"b207c8d557302464a2909a68180ec1c502080bdf6b6888507d0bb9a83cd876ca","source":{"kind":"arxiv","id":"1412.3795","version":2},"attestation_state":"computed","paper":{"title":"Embedding in $q$-ary $1$-perfect codes and partitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Denis S. Krotov, Evgeniya V. Sotnikova","submitted_at":"2014-12-11T20:58:28Z","abstract_excerpt":"We prove that every $1$-error-correcting code over a finite field can be embedded in a $1$-perfect code of some larger length. Embedding in this context means that the original code is a subcode of the resulting $1$-perfect code and can be obtained from it by repeated shortening. Further, we generalize the results to partitions: every partition of the Hamming space into $1$-error-correcting codes can be embedded in a partition of a space of some larger dimension into $1$-perfect codes. For the partitions, the embedding length is close to the theoretical bound for the general case and optimal f"},"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.3795","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-11T20:58:28Z","cross_cats_sorted":["cs.DM","cs.IT","math.IT"],"title_canon_sha256":"dbfff8c4ff0967b07138eb1825c9cb35795c0bda1137dcbe80356cc4062bdcee","abstract_canon_sha256":"b97d0c18b6e30787c20ca2e6632c45c6db1270de683d37e9637d34ecaa56e970"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:52.857299Z","signature_b64":"P2/7k3rtVa+GK1PPvsv0+52WQmHEz0RjsLuw2C7rfEgGXVcFtPM4aDa7D1xIsuE6K2gK2hoxRvKcKGGmgjEjCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b207c8d557302464a2909a68180ec1c502080bdf6b6888507d0bb9a83cd876ca","last_reissued_at":"2026-05-18T01:55:52.856853Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:52.856853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Embedding in $q$-ary $1$-perfect codes and partitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Denis S. Krotov, Evgeniya V. Sotnikova","submitted_at":"2014-12-11T20:58:28Z","abstract_excerpt":"We prove that every $1$-error-correcting code over a finite field can be embedded in a $1$-perfect code of some larger length. Embedding in this context means that the original code is a subcode of the resulting $1$-perfect code and can be obtained from it by repeated shortening. Further, we generalize the results to partitions: every partition of the Hamming space into $1$-error-correcting codes can be embedded in a partition of a space of some larger dimension into $1$-perfect codes. For the partitions, the embedding length is close to the theoretical bound for the general case and optimal f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3795","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":"1412.3795","created_at":"2026-05-18T01:55:52.856917+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.3795v2","created_at":"2026-05-18T01:55:52.856917+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3795","created_at":"2026-05-18T01:55:52.856917+00:00"},{"alias_kind":"pith_short_12","alias_value":"WID4RVKXGASG","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WID4RVKXGASGJIUQ","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WID4RVKX","created_at":"2026-05-18T12:28:54.890064+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/WID4RVKXGASGJIUQTJUBQDWBYU","json":"https://pith.science/pith/WID4RVKXGASGJIUQTJUBQDWBYU.json","graph_json":"https://pith.science/api/pith-number/WID4RVKXGASGJIUQTJUBQDWBYU/graph.json","events_json":"https://pith.science/api/pith-number/WID4RVKXGASGJIUQTJUBQDWBYU/events.json","paper":"https://pith.science/paper/WID4RVKX"},"agent_actions":{"view_html":"https://pith.science/pith/WID4RVKXGASGJIUQTJUBQDWBYU","download_json":"https://pith.science/pith/WID4RVKXGASGJIUQTJUBQDWBYU.json","view_paper":"https://pith.science/paper/WID4RVKX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.3795&json=true","fetch_graph":"https://pith.science/api/pith-number/WID4RVKXGASGJIUQTJUBQDWBYU/graph.json","fetch_events":"https://pith.science/api/pith-number/WID4RVKXGASGJIUQTJUBQDWBYU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WID4RVKXGASGJIUQTJUBQDWBYU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WID4RVKXGASGJIUQTJUBQDWBYU/action/storage_attestation","attest_author":"https://pith.science/pith/WID4RVKXGASGJIUQTJUBQDWBYU/action/author_attestation","sign_citation":"https://pith.science/pith/WID4RVKXGASGJIUQTJUBQDWBYU/action/citation_signature","submit_replication":"https://pith.science/pith/WID4RVKXGASGJIUQTJUBQDWBYU/action/replication_record"}},"created_at":"2026-05-18T01:55:52.856917+00:00","updated_at":"2026-05-18T01:55:52.856917+00:00"}