{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EDJI237R2INJ45FDYDTAMI2HXK","short_pith_number":"pith:EDJI237R","schema_version":"1.0","canonical_sha256":"20d28d6ff1d21a9e74a3c0e6062347ba90db6233997018a1a6dbfb373bbddb4f","source":{"kind":"arxiv","id":"1806.04834","version":2},"attestation_state":"computed","paper":{"title":"Additive perfect codes in Doob graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"(2) Sobolev Institute of Mathematics, China, Daitao Huang (1), Denis S. Krotov (2) ((1) Anhui University, Hefei, Minjia Shi (1), Novosibirsk, Russia)","submitted_at":"2018-06-13T03:15:36Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1806.04834","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-13T03:15:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a3f2567cadd13ab696e89cf3da23ddd39b343a57f72ef5c3d657b57682a2049a","abstract_canon_sha256":"fab353a77fe13016c36914e91cfdb52ce4952738a411d58f144cbe283e65c894"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:54.011247Z","signature_b64":"ACEdAboh1mSFoPV5FFLdwvMKJUZ/5AYXABcg3dXtil91P6itcSQOfR30r6QivAvOa9hTDI2W7kKj5LvrNzrHCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20d28d6ff1d21a9e74a3c0e6062347ba90db6233997018a1a6dbfb373bbddb4f","last_reissued_at":"2026-05-17T23:41:54.010496Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:54.010496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Additive perfect codes in Doob graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"(2) Sobolev Institute of Mathematics, China, Daitao Huang (1), Denis S. Krotov (2) ((1) Anhui University, Hefei, Minjia Shi (1), Novosibirsk, Russia)","submitted_at":"2018-06-13T03:15:36Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04834","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.04834","created_at":"2026-05-17T23:41:54.010580+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.04834v2","created_at":"2026-05-17T23:41:54.010580+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04834","created_at":"2026-05-17T23:41:54.010580+00:00"},{"alias_kind":"pith_short_12","alias_value":"EDJI237R2INJ","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EDJI237R2INJ45FD","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EDJI237R","created_at":"2026-05-18T12:32:22.470017+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EDJI237R2INJ45FDYDTAMI2HXK","json":"https://pith.science/pith/EDJI237R2INJ45FDYDTAMI2HXK.json","graph_json":"https://pith.science/api/pith-number/EDJI237R2INJ45FDYDTAMI2HXK/graph.json","events_json":"https://pith.science/api/pith-number/EDJI237R2INJ45FDYDTAMI2HXK/events.json","paper":"https://pith.science/paper/EDJI237R"},"agent_actions":{"view_html":"https://pith.science/pith/EDJI237R2INJ45FDYDTAMI2HXK","download_json":"https://pith.science/pith/EDJI237R2INJ45FDYDTAMI2HXK.json","view_paper":"https://pith.science/paper/EDJI237R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.04834&json=true","fetch_graph":"https://pith.science/api/pith-number/EDJI237R2INJ45FDYDTAMI2HXK/graph.json","fetch_events":"https://pith.science/api/pith-number/EDJI237R2INJ45FDYDTAMI2HXK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EDJI237R2INJ45FDYDTAMI2HXK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EDJI237R2INJ45FDYDTAMI2HXK/action/storage_attestation","attest_author":"https://pith.science/pith/EDJI237R2INJ45FDYDTAMI2HXK/action/author_attestation","sign_citation":"https://pith.science/pith/EDJI237R2INJ45FDYDTAMI2HXK/action/citation_signature","submit_replication":"https://pith.science/pith/EDJI237R2INJ45FDYDTAMI2HXK/action/replication_record"}},"created_at":"2026-05-17T23:41:54.010580+00:00","updated_at":"2026-05-17T23:41:54.010580+00:00"}