{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WID4RVKXGASGJIUQTJUBQDWBYU","short_pith_number":"pith:WID4RVKX","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"},"canonical_sha256":"b207c8d557302464a2909a68180ec1c502080bdf6b6888507d0bb9a83cd876ca","source":{"kind":"arxiv","id":"1412.3795","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.3795","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"arxiv_version","alias_value":"1412.3795v2","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3795","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"pith_short_12","alias_value":"WID4RVKXGASG","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WID4RVKXGASGJIUQ","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WID4RVKX","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WID4RVKXGASGJIUQTJUBQDWBYU","target":"record","payload":{"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"},"canonical_sha256":"b207c8d557302464a2909a68180ec1c502080bdf6b6888507d0bb9a83cd876ca","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"},"source_kind":"arxiv","source_id":"1412.3795","source_version":2,"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:55:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rjKvuSAmG/8RobklaCuA6Q3n54g20t1q7cCOMfUPTYjglrbvuDYGVKfwUfU8QN9imudhUOwyOv4OR1NJqpI2Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:06:13.266058Z"},"content_sha256":"121e7de7cae170dcbd30692f19a4bceabb79f73e29c12247f8664b46d2d24129","schema_version":"1.0","event_id":"sha256:121e7de7cae170dcbd30692f19a4bceabb79f73e29c12247f8664b46d2d24129"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WID4RVKXGASGJIUQTJUBQDWBYU","target":"graph","payload":{"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"},"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:55:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CiniEnbUClSGlDkt3J5nYAKw4giDdq+u52rl5oWhspOhvq1xlcCQiQgRfjqfETmd8Rbal5Ivrd/Wc2XehSXcDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:06:13.266714Z"},"content_sha256":"7a3e86ac56b0b1a5b80d932bc5af0ed41ffbb797b271a2c4b4f26d90b5680a08","schema_version":"1.0","event_id":"sha256:7a3e86ac56b0b1a5b80d932bc5af0ed41ffbb797b271a2c4b4f26d90b5680a08"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WID4RVKXGASGJIUQTJUBQDWBYU/bundle.json","state_url":"https://pith.science/pith/WID4RVKXGASGJIUQTJUBQDWBYU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WID4RVKXGASGJIUQTJUBQDWBYU/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-05-30T00:06:13Z","links":{"resolver":"https://pith.science/pith/WID4RVKXGASGJIUQTJUBQDWBYU","bundle":"https://pith.science/pith/WID4RVKXGASGJIUQTJUBQDWBYU/bundle.json","state":"https://pith.science/pith/WID4RVKXGASGJIUQTJUBQDWBYU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WID4RVKXGASGJIUQTJUBQDWBYU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WID4RVKXGASGJIUQTJUBQDWBYU","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":"b97d0c18b6e30787c20ca2e6632c45c6db1270de683d37e9637d34ecaa56e970","cross_cats_sorted":["cs.DM","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-11T20:58:28Z","title_canon_sha256":"dbfff8c4ff0967b07138eb1825c9cb35795c0bda1137dcbe80356cc4062bdcee"},"schema_version":"1.0","source":{"id":"1412.3795","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.3795","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"arxiv_version","alias_value":"1412.3795v2","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3795","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"pith_short_12","alias_value":"WID4RVKXGASG","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WID4RVKXGASGJIUQ","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WID4RVKX","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:7a3e86ac56b0b1a5b80d932bc5af0ed41ffbb797b271a2c4b4f26d90b5680a08","target":"graph","created_at":"2026-05-18T01:55:52Z","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":"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","authors_text":"Denis S. Krotov, Evgeniya V. Sotnikova","cross_cats":["cs.DM","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-11T20:58:28Z","title":"Embedding in $q$-ary $1$-perfect codes and partitions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3795","kind":"arxiv","version":2},"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:121e7de7cae170dcbd30692f19a4bceabb79f73e29c12247f8664b46d2d24129","target":"record","created_at":"2026-05-18T01:55:52Z","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":"b97d0c18b6e30787c20ca2e6632c45c6db1270de683d37e9637d34ecaa56e970","cross_cats_sorted":["cs.DM","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-11T20:58:28Z","title_canon_sha256":"dbfff8c4ff0967b07138eb1825c9cb35795c0bda1137dcbe80356cc4062bdcee"},"schema_version":"1.0","source":{"id":"1412.3795","kind":"arxiv","version":2}},"canonical_sha256":"b207c8d557302464a2909a68180ec1c502080bdf6b6888507d0bb9a83cd876ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b207c8d557302464a2909a68180ec1c502080bdf6b6888507d0bb9a83cd876ca","first_computed_at":"2026-05-18T01:55:52.856853Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:55:52.856853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P2/7k3rtVa+GK1PPvsv0+52WQmHEz0RjsLuw2C7rfEgGXVcFtPM4aDa7D1xIsuE6K2gK2hoxRvKcKGGmgjEjCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:55:52.857299Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.3795","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:121e7de7cae170dcbd30692f19a4bceabb79f73e29c12247f8664b46d2d24129","sha256:7a3e86ac56b0b1a5b80d932bc5af0ed41ffbb797b271a2c4b4f26d90b5680a08"],"state_sha256":"2cbbddfde5fc88fa3824a476e1e43d9d11b11a2dceaf17d4964a925434cfc26d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Xg44WwSi8SCFMgn583wC8QEABXFHQhFJxnkzY7Q5GwBS100oN0mIu+mHb8RH+/jCC0AdtAI2s8w5yaeDL3IDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T00:06:13.269669Z","bundle_sha256":"b156ff002fb53121fb3d0a9b36d4fb0967c13214ced6c6dae9097bd7c7a140e9"}}