{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EDJI237R2INJ45FDYDTAMI2HXK","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":"fab353a77fe13016c36914e91cfdb52ce4952738a411d58f144cbe283e65c894","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-13T03:15:36Z","title_canon_sha256":"a3f2567cadd13ab696e89cf3da23ddd39b343a57f72ef5c3d657b57682a2049a"},"schema_version":"1.0","source":{"id":"1806.04834","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04834","created_at":"2026-05-17T23:41:54Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04834v2","created_at":"2026-05-17T23:41:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04834","created_at":"2026-05-17T23:41:54Z"},{"alias_kind":"pith_short_12","alias_value":"EDJI237R2INJ","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EDJI237R2INJ45FD","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EDJI237R","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:cd6e7f8fa9c68091976f01800aba4a16a9d3cf3e1aa6494f65154eed4e89c88d","target":"graph","created_at":"2026-05-17T23:41:54Z","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 Doob graph $D(m,n)$ is the Cartesian product of $m>0$ copies of the Shrikhande graph and $n$ copies of the complete graph of order $4$. Naturally, $D(m,n)$ can be represented as a Cayley graph on the additive group $(Z_4^2)^m \\times (Z_2^2)^{n'} \\times Z_4^{n''}$, where $n'+n''=n$. A set of vertices of $D(m,n)$ is called an additive code if it forms a subgroup of this group. We construct a $3$-parameter class of additive perfect codes in Doob graphs and show that the known necessary conditions of the existence of additive $1$-perfect codes in $D(m,n'+n'')$ are sufficient. Additionally, two","authors_text":"(2) Sobolev Institute of Mathematics, China, Daitao Huang (1), Denis S. Krotov (2) ((1) Anhui University, Hefei, Minjia Shi (1), Novosibirsk, Russia)","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-13T03:15:36Z","title":"Additive perfect codes in Doob graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04834","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:51b6df519dbb0cb42c436d950029537f5aebd2775eb9c93246002f6971b970ac","target":"record","created_at":"2026-05-17T23:41:54Z","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":"fab353a77fe13016c36914e91cfdb52ce4952738a411d58f144cbe283e65c894","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-13T03:15:36Z","title_canon_sha256":"a3f2567cadd13ab696e89cf3da23ddd39b343a57f72ef5c3d657b57682a2049a"},"schema_version":"1.0","source":{"id":"1806.04834","kind":"arxiv","version":2}},"canonical_sha256":"20d28d6ff1d21a9e74a3c0e6062347ba90db6233997018a1a6dbfb373bbddb4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20d28d6ff1d21a9e74a3c0e6062347ba90db6233997018a1a6dbfb373bbddb4f","first_computed_at":"2026-05-17T23:41:54.010496Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:54.010496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ACEdAboh1mSFoPV5FFLdwvMKJUZ/5AYXABcg3dXtil91P6itcSQOfR30r6QivAvOa9hTDI2W7kKj5LvrNzrHCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:54.011247Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.04834","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51b6df519dbb0cb42c436d950029537f5aebd2775eb9c93246002f6971b970ac","sha256:cd6e7f8fa9c68091976f01800aba4a16a9d3cf3e1aa6494f65154eed4e89c88d"],"state_sha256":"5e5bdf83878dd7e160277cf1d56c34f490928ad410433741fbc43ef3e60ccd36"}