{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:Y3V7SSI5SFULHBUXU5PV3BRPRF","short_pith_number":"pith:Y3V7SSI5","schema_version":"1.0","canonical_sha256":"c6ebf9491d9168b38697a75f5d862f895308d860ab5abdf824e0c8c88a77aa6b","source":{"kind":"arxiv","id":"1609.03755","version":3},"attestation_state":"computed","paper":{"title":"Perfect codes in Cayley graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Binzhou Xia, He Huang, Sanming Zhou","submitted_at":"2016-09-13T10:35:17Z","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"},"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":"1609.03755","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-13T10:35:17Z","cross_cats_sorted":[],"title_canon_sha256":"4f9add25d2aede2e2486fe8d97ecc8b34b23f50f107da692c89dae8053037b2b","abstract_canon_sha256":"d8f231843d1c4489794b135278bee47446420452334678ffac2d08d60c44b863"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:51.918993Z","signature_b64":"VHhvHt2cxJTc2SCgZjnabTjlhwOitIwB77PKzH+LdQL70c/MfTj7eJ3moo+uyH6dis2fgrzrbFRFf+5aR93zAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6ebf9491d9168b38697a75f5d862f895308d860ab5abdf824e0c8c88a77aa6b","last_reissued_at":"2026-05-18T00:31:51.918547Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:51.918547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Perfect codes in Cayley graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Binzhou Xia, He Huang, Sanming Zhou","submitted_at":"2016-09-13T10:35:17Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03755","kind":"arxiv","version":3},"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":"1609.03755","created_at":"2026-05-18T00:31:51.918612+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.03755v3","created_at":"2026-05-18T00:31:51.918612+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03755","created_at":"2026-05-18T00:31:51.918612+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y3V7SSI5SFUL","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y3V7SSI5SFULHBUX","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y3V7SSI5","created_at":"2026-05-18T12:30:51.357362+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/Y3V7SSI5SFULHBUXU5PV3BRPRF","json":"https://pith.science/pith/Y3V7SSI5SFULHBUXU5PV3BRPRF.json","graph_json":"https://pith.science/api/pith-number/Y3V7SSI5SFULHBUXU5PV3BRPRF/graph.json","events_json":"https://pith.science/api/pith-number/Y3V7SSI5SFULHBUXU5PV3BRPRF/events.json","paper":"https://pith.science/paper/Y3V7SSI5"},"agent_actions":{"view_html":"https://pith.science/pith/Y3V7SSI5SFULHBUXU5PV3BRPRF","download_json":"https://pith.science/pith/Y3V7SSI5SFULHBUXU5PV3BRPRF.json","view_paper":"https://pith.science/paper/Y3V7SSI5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.03755&json=true","fetch_graph":"https://pith.science/api/pith-number/Y3V7SSI5SFULHBUXU5PV3BRPRF/graph.json","fetch_events":"https://pith.science/api/pith-number/Y3V7SSI5SFULHBUXU5PV3BRPRF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y3V7SSI5SFULHBUXU5PV3BRPRF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y3V7SSI5SFULHBUXU5PV3BRPRF/action/storage_attestation","attest_author":"https://pith.science/pith/Y3V7SSI5SFULHBUXU5PV3BRPRF/action/author_attestation","sign_citation":"https://pith.science/pith/Y3V7SSI5SFULHBUXU5PV3BRPRF/action/citation_signature","submit_replication":"https://pith.science/pith/Y3V7SSI5SFULHBUXU5PV3BRPRF/action/replication_record"}},"created_at":"2026-05-18T00:31:51.918612+00:00","updated_at":"2026-05-18T00:31:51.918612+00:00"}