{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:Y3V7SSI5SFULHBUXU5PV3BRPRF","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":"d8f231843d1c4489794b135278bee47446420452334678ffac2d08d60c44b863","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-13T10:35:17Z","title_canon_sha256":"4f9add25d2aede2e2486fe8d97ecc8b34b23f50f107da692c89dae8053037b2b"},"schema_version":"1.0","source":{"id":"1609.03755","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03755","created_at":"2026-05-18T00:31:51Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03755v3","created_at":"2026-05-18T00:31:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03755","created_at":"2026-05-18T00:31:51Z"},{"alias_kind":"pith_short_12","alias_value":"Y3V7SSI5SFUL","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"Y3V7SSI5SFULHBUX","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"Y3V7SSI5","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:8e7233a88891098ca14ecd967f890b3960087a3a0e57baeb07741ce051667a3c","target":"graph","created_at":"2026-05-18T00:31:51Z","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":"Given a graph $\\Gamma$, a subset $C$ of $V(\\Gamma)$ is called a perfect code in $\\Gamma$ if every vertex of $\\Gamma$ is at distance no more than one to exactly one vertex in $C$, and a subset $C$ of $V(\\Gamma)$ is called a total perfect code in $\\Gamma$ if every vertex of $\\Gamma$ is adjacent to exactly one vertex in $C$. In this paper we study perfect codes and total perfect codes in Cayley graphs, with a focus on the following themes: when a subgroup of a given group is a (total) perfect code in a Cayley graph of the group; and how to construct new (total) perfect codes in a Cayley graph fro","authors_text":"Binzhou Xia, He Huang, Sanming Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-13T10:35:17Z","title":"Perfect codes in Cayley graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03755","kind":"arxiv","version":3},"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:7f4929768f9ea9c90e14155d52fadfc385472204834bdaa9bcb34b33c0b85d2f","target":"record","created_at":"2026-05-18T00:31:51Z","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":"d8f231843d1c4489794b135278bee47446420452334678ffac2d08d60c44b863","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-13T10:35:17Z","title_canon_sha256":"4f9add25d2aede2e2486fe8d97ecc8b34b23f50f107da692c89dae8053037b2b"},"schema_version":"1.0","source":{"id":"1609.03755","kind":"arxiv","version":3}},"canonical_sha256":"c6ebf9491d9168b38697a75f5d862f895308d860ab5abdf824e0c8c88a77aa6b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c6ebf9491d9168b38697a75f5d862f895308d860ab5abdf824e0c8c88a77aa6b","first_computed_at":"2026-05-18T00:31:51.918547Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:51.918547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VHhvHt2cxJTc2SCgZjnabTjlhwOitIwB77PKzH+LdQL70c/MfTj7eJ3moo+uyH6dis2fgrzrbFRFf+5aR93zAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:51.918993Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.03755","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f4929768f9ea9c90e14155d52fadfc385472204834bdaa9bcb34b33c0b85d2f","sha256:8e7233a88891098ca14ecd967f890b3960087a3a0e57baeb07741ce051667a3c"],"state_sha256":"2c1a69773c504cac1c598d28d26c8b5313f51284b124d67bf934049e4cc5ca3f"}