{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:OHQHYSSSFQLIPBRVAWLMBRKQOC","short_pith_number":"pith:OHQHYSSS","canonical_record":{"source":{"id":"1001.0001","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-12-30T21:39:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"24ed1f7bb3dd959312c0d434e0af378baba1eaa4a781e82654a4822d44d12725","abstract_canon_sha256":"688a73433baf8a3c6583f3d4490b7e6bd6544fde9ecbd28095a4910a9707e5b4"},"schema_version":"1.0"},"canonical_sha256":"71e07c4a522c168786350596c0c5507088396c02a606d6e222a7ff63a3bb7a59","source":{"kind":"arxiv","id":"1001.0001","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:OHQHYSSSFQLIPBRVAWLMBRKQOC","target":"record","payload":{"canonical_record":{"source":{"id":"1001.0001","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-12-30T21:39:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"24ed1f7bb3dd959312c0d434e0af378baba1eaa4a781e82654a4822d44d12725","abstract_canon_sha256":"688a73433baf8a3c6583f3d4490b7e6bd6544fde9ecbd28095a4910a9707e5b4"},"schema_version":"1.0"},"canonical_sha256":"71e07c4a522c168786350596c0c5507088396c02a606d6e222a7ff63a3bb7a59","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:50.160819Z","signature_b64":"op7HdUUFT+dzVUEFm4jKAc4P4n7fLHSUHHmo3JLwzw9Y1fR6LoKKxfWk4UOKqJ9b/WWilu/ROIyuO3eVmeH/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71e07c4a522c168786350596c0c5507088396c02a606d6e222a7ff63a3bb7a59","last_reissued_at":"2026-05-18T04:22:50.160045Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:50.160045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1001.0001","source_version":1,"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-18T04:22:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AmRN9OLKMe8XgzSOuZQm0r283S0YfPbzt/ju1BMtrY9crEsx/+7XdzYLWFUvUlKZt6UJ7OISdMUNHiLniryXDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T22:16:38.339662Z"},"content_sha256":"51573b9240484b5179092cac713b8c4570e17999cd867b0303f97e84f941255c","schema_version":"1.0","event_id":"sha256:51573b9240484b5179092cac713b8c4570e17999cd867b0303f97e84f941255c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:OHQHYSSSFQLIPBRVAWLMBRKQOC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the structure of non-full-rank perfect codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Denis Krotov (Sobolev Institute of Mathematics, KTH, Novosibirsk, Olof Heden (Department of Mathematics, Russia), Stockholm, Sweden)","submitted_at":"2009-12-30T21:39:20Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.0001","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"},"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-18T04:22:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D76krSqE7H8T8IobjSdEsqOGpvSmZlt055HejnXteM7OkXAFQRar8tlFh2aHARpz2pWg0oM+Sabt2RK/iOHXDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T22:16:38.340021Z"},"content_sha256":"a829fabc672405f55715138ba72460499c01b777d368589b137cbb3443869b51","schema_version":"1.0","event_id":"sha256:a829fabc672405f55715138ba72460499c01b777d368589b137cbb3443869b51"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OHQHYSSSFQLIPBRVAWLMBRKQOC/bundle.json","state_url":"https://pith.science/pith/OHQHYSSSFQLIPBRVAWLMBRKQOC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OHQHYSSSFQLIPBRVAWLMBRKQOC/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-19T22:16:38Z","links":{"resolver":"https://pith.science/pith/OHQHYSSSFQLIPBRVAWLMBRKQOC","bundle":"https://pith.science/pith/OHQHYSSSFQLIPBRVAWLMBRKQOC/bundle.json","state":"https://pith.science/pith/OHQHYSSSFQLIPBRVAWLMBRKQOC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OHQHYSSSFQLIPBRVAWLMBRKQOC/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EI2l7i7Ya22/T7osvgY0piMJh7f2WxPWC8ZQw3NVQpTjibp8S04WWJza/zDXSBiXdhGU0WDoaAHA1n2W1T6sCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T22:16:38.342125Z","bundle_sha256":"419f8e30702b9498f068072308a9b9ee61f51a692fab0b3e595fd398b4868777"}}