{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:OHQHYSSSFQLIPBRVAWLMBRKQOC","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":"688a73433baf8a3c6583f3d4490b7e6bd6544fde9ecbd28095a4910a9707e5b4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-12-30T21:39:20Z","title_canon_sha256":"24ed1f7bb3dd959312c0d434e0af378baba1eaa4a781e82654a4822d44d12725"},"schema_version":"1.0","source":{"id":"1001.0001","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.0001","created_at":"2026-05-18T04:22:50Z"},{"alias_kind":"arxiv_version","alias_value":"1001.0001v1","created_at":"2026-05-18T04:22:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.0001","created_at":"2026-05-18T04:22:50Z"},{"alias_kind":"pith_short_12","alias_value":"OHQHYSSSFQLI","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"OHQHYSSSFQLIPBRV","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"OHQHYSSS","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:a829fabc672405f55715138ba72460499c01b777d368589b137cbb3443869b51","target":"graph","created_at":"2026-05-18T04:22:50Z","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 Krotov combining construction of perfect 1-error-correcting binary codes from 2000 and a theorem of Heden saying that every non-full-rank perfect 1-error-correcting binary code can be constructed by this combining construction is generalized to the $q$-ary case. Simply, every non-full-rank perfect code $C$ is the union of a well-defined family of $\\mu$-components $K_\\mu$, where $\\mu$ belongs to an \"outer\" perfect code $C^*$, and these components are at distance three from each other. Components from distinct codes can thus freely be combined to obtain new perfect codes. The Phelps general ","authors_text":"Denis Krotov (Sobolev Institute of Mathematics, KTH, Novosibirsk, Olof Heden (Department of Mathematics, Russia), Stockholm, Sweden)","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-12-30T21:39:20Z","title":"On the structure of non-full-rank perfect codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.0001","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:51573b9240484b5179092cac713b8c4570e17999cd867b0303f97e84f941255c","target":"record","created_at":"2026-05-18T04:22:50Z","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":"688a73433baf8a3c6583f3d4490b7e6bd6544fde9ecbd28095a4910a9707e5b4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-12-30T21:39:20Z","title_canon_sha256":"24ed1f7bb3dd959312c0d434e0af378baba1eaa4a781e82654a4822d44d12725"},"schema_version":"1.0","source":{"id":"1001.0001","kind":"arxiv","version":1}},"canonical_sha256":"71e07c4a522c168786350596c0c5507088396c02a606d6e222a7ff63a3bb7a59","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"71e07c4a522c168786350596c0c5507088396c02a606d6e222a7ff63a3bb7a59","first_computed_at":"2026-05-18T04:22:50.160045Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:22:50.160045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"op7HdUUFT+dzVUEFm4jKAc4P4n7fLHSUHHmo3JLwzw9Y1fR6LoKKxfWk4UOKqJ9b/WWilu/ROIyuO3eVmeH/Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:22:50.160819Z","signed_message":"canonical_sha256_bytes"},"source_id":"1001.0001","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51573b9240484b5179092cac713b8c4570e17999cd867b0303f97e84f941255c","sha256:a829fabc672405f55715138ba72460499c01b777d368589b137cbb3443869b51"],"state_sha256":"fd89b1d784b3d4abf3fe829b3c06b1f12fc919095fe0c823114875139f7feb62"}