{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IMJ23WMHYS5I3DO2YPZ2BN3I6Y","short_pith_number":"pith:IMJ23WMH","canonical_record":{"source":{"id":"1411.2692","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-11T03:56:38Z","cross_cats_sorted":[],"title_canon_sha256":"4293e9b548bfb2cf56997277f213e10d3b2e719a81e7a820de5852525a401804","abstract_canon_sha256":"4ae10bc466c7a54981f1a1ea9ebfca07d1ce6403c06d2623073031bbc23f59b1"},"schema_version":"1.0"},"canonical_sha256":"4313add987c4ba8d8ddac3f3a0b768f63d2ac94c07cef714d8a1bffcf7575cc3","source":{"kind":"arxiv","id":"1411.2692","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.2692","created_at":"2026-05-18T02:37:53Z"},{"alias_kind":"arxiv_version","alias_value":"1411.2692v1","created_at":"2026-05-18T02:37:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2692","created_at":"2026-05-18T02:37:53Z"},{"alias_kind":"pith_short_12","alias_value":"IMJ23WMHYS5I","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IMJ23WMHYS5I3DO2","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IMJ23WMH","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IMJ23WMHYS5I3DO2YPZ2BN3I6Y","target":"record","payload":{"canonical_record":{"source":{"id":"1411.2692","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-11T03:56:38Z","cross_cats_sorted":[],"title_canon_sha256":"4293e9b548bfb2cf56997277f213e10d3b2e719a81e7a820de5852525a401804","abstract_canon_sha256":"4ae10bc466c7a54981f1a1ea9ebfca07d1ce6403c06d2623073031bbc23f59b1"},"schema_version":"1.0"},"canonical_sha256":"4313add987c4ba8d8ddac3f3a0b768f63d2ac94c07cef714d8a1bffcf7575cc3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:53.320893Z","signature_b64":"3QB5YIXF+1pU1H3nN2IVuG/L8DojGnynHsg2J7NEpeJ13b1YnQ0cPGzYyoziR+bcF62nGCfE1CA0RT3SeS9tBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4313add987c4ba8d8ddac3f3a0b768f63d2ac94c07cef714d8a1bffcf7575cc3","last_reissued_at":"2026-05-18T02:37:53.320454Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:53.320454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.2692","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-18T02:37:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"80yQAonyqVhQwvXJX26Xja0qMsdevlg7LM89LTegZbU7oKeBXAlUkQ1Z5uSdDIP+sPEDyKiJlg3fv8fckcpCCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:51:14.302772Z"},"content_sha256":"67e37406f6b91f3ed42702d963093e5a3769a258a513448555bddead483ca503","schema_version":"1.0","event_id":"sha256:67e37406f6b91f3ed42702d963093e5a3769a258a513448555bddead483ca503"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IMJ23WMHYS5I3DO2YPZ2BN3I6Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Transitive nonpropelinear perfect codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"F. I. Solov'eva, I. Yu. Mogilnykh","submitted_at":"2014-11-11T03:56:38Z","abstract_excerpt":"A code is called transitive if its automorphism group (the isometry group) of the code acts transitively on its codewords. If there is a subgroup of the automorphism group acting regularly on the code, the code is called propelinear. Using Magma software package we establish that among 201 equivalence classes of transitive perfect codes of length 15 from \\cite{ost} there is a unique nonpropelinear code. We solve the existence problem for transitive nonpropelinear perfect codes for any admissible length $n$, $n\\geq 15$. Moreover we prove that there are at least 5 pairwise nonequivalent such cod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.2692","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-18T02:37:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+mZy1zsdL2lgALKKsuLk433LgzkjZZlzwbIa0OizlKJkQJDA5udMc4bHEhCpcmv3M+96D2OfHMz6IUJLW+BlBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:51:14.303105Z"},"content_sha256":"6966940cdaa896c12a303bf34e1844ab2bd125f28ead2cf85f119099a19b30f5","schema_version":"1.0","event_id":"sha256:6966940cdaa896c12a303bf34e1844ab2bd125f28ead2cf85f119099a19b30f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IMJ23WMHYS5I3DO2YPZ2BN3I6Y/bundle.json","state_url":"https://pith.science/pith/IMJ23WMHYS5I3DO2YPZ2BN3I6Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IMJ23WMHYS5I3DO2YPZ2BN3I6Y/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-06-08T21:51:14Z","links":{"resolver":"https://pith.science/pith/IMJ23WMHYS5I3DO2YPZ2BN3I6Y","bundle":"https://pith.science/pith/IMJ23WMHYS5I3DO2YPZ2BN3I6Y/bundle.json","state":"https://pith.science/pith/IMJ23WMHYS5I3DO2YPZ2BN3I6Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IMJ23WMHYS5I3DO2YPZ2BN3I6Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IMJ23WMHYS5I3DO2YPZ2BN3I6Y","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":"4ae10bc466c7a54981f1a1ea9ebfca07d1ce6403c06d2623073031bbc23f59b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-11T03:56:38Z","title_canon_sha256":"4293e9b548bfb2cf56997277f213e10d3b2e719a81e7a820de5852525a401804"},"schema_version":"1.0","source":{"id":"1411.2692","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.2692","created_at":"2026-05-18T02:37:53Z"},{"alias_kind":"arxiv_version","alias_value":"1411.2692v1","created_at":"2026-05-18T02:37:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2692","created_at":"2026-05-18T02:37:53Z"},{"alias_kind":"pith_short_12","alias_value":"IMJ23WMHYS5I","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IMJ23WMHYS5I3DO2","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IMJ23WMH","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:6966940cdaa896c12a303bf34e1844ab2bd125f28ead2cf85f119099a19b30f5","target":"graph","created_at":"2026-05-18T02:37:53Z","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":"A code is called transitive if its automorphism group (the isometry group) of the code acts transitively on its codewords. If there is a subgroup of the automorphism group acting regularly on the code, the code is called propelinear. Using Magma software package we establish that among 201 equivalence classes of transitive perfect codes of length 15 from \\cite{ost} there is a unique nonpropelinear code. We solve the existence problem for transitive nonpropelinear perfect codes for any admissible length $n$, $n\\geq 15$. Moreover we prove that there are at least 5 pairwise nonequivalent such cod","authors_text":"F. I. Solov'eva, I. Yu. Mogilnykh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-11T03:56:38Z","title":"Transitive nonpropelinear perfect codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.2692","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:67e37406f6b91f3ed42702d963093e5a3769a258a513448555bddead483ca503","target":"record","created_at":"2026-05-18T02:37:53Z","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":"4ae10bc466c7a54981f1a1ea9ebfca07d1ce6403c06d2623073031bbc23f59b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-11T03:56:38Z","title_canon_sha256":"4293e9b548bfb2cf56997277f213e10d3b2e719a81e7a820de5852525a401804"},"schema_version":"1.0","source":{"id":"1411.2692","kind":"arxiv","version":1}},"canonical_sha256":"4313add987c4ba8d8ddac3f3a0b768f63d2ac94c07cef714d8a1bffcf7575cc3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4313add987c4ba8d8ddac3f3a0b768f63d2ac94c07cef714d8a1bffcf7575cc3","first_computed_at":"2026-05-18T02:37:53.320454Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:37:53.320454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3QB5YIXF+1pU1H3nN2IVuG/L8DojGnynHsg2J7NEpeJ13b1YnQ0cPGzYyoziR+bcF62nGCfE1CA0RT3SeS9tBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:37:53.320893Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.2692","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67e37406f6b91f3ed42702d963093e5a3769a258a513448555bddead483ca503","sha256:6966940cdaa896c12a303bf34e1844ab2bd125f28ead2cf85f119099a19b30f5"],"state_sha256":"6de15b7ecea15470a084f98b15e93d54f9e53f3d8ee0258f990e51050a7f9fa5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EmCZKeUv5yD/F/xWxzBIvqg446rtaco51f8FE6/sNvwPf4GvjvVfLkeoxms2NGxIE0nCxAUbHVqIjHNac3c1Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T21:51:14.304892Z","bundle_sha256":"0849a7d7558e3c6ae1749e15feabc1aa7bb5cedca4222c613cd84d7790c0b9d1"}}