{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CXQM324I33RHVQFBRAUQWFGKER","short_pith_number":"pith:CXQM324I","schema_version":"1.0","canonical_sha256":"15e0cdeb88dee27ac0a188290b14ca2458d70d1c7dc9c52f732f3f22a9bf9a82","source":{"kind":"arxiv","id":"2507.11871","version":2},"attestation_state":"computed","paper":{"title":"Perfect codes in Cayley graphs of abelian groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Peter J. Cameron, Roro Sihui Yap, Sanming Zhou","submitted_at":"2025-07-16T03:34:24Z","abstract_excerpt":"A perfect code in a graph $\\Gamma = (V, E)$ is a subset $C$ of $V$ such that no two vertices in $C$ are adjacent and every vertex in $V \\setminus C$ is adjacent to exactly one vertex in $C$. A total perfect code in $\\Gamma$ is a subset $C$ of $V$ such that every vertex of $\\Gamma$ is adjacent to exactly one vertex in $C$. In this paper we prove several results on perfect codes and total perfect codes in Cayley graphs of finite abelian groups."},"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":"2507.11871","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-16T03:34:24Z","cross_cats_sorted":[],"title_canon_sha256":"0fd0d6536f03b168bbbca37090552427ead33ec6d8e709f4b6e25b6208286b26","abstract_canon_sha256":"c145dfb60bcf13f4d8134c8be0ad26de8468c642d08f530c01a2327c7ab70274"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:02:52.034524Z","signature_b64":"29HFY+n8/BPWBebik+BjT7bbwpf+liFEcejQKgFaZrqR2eaKCzFkBygGx6GErOtpOCacbOHXCjUXw/XhzSnBBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15e0cdeb88dee27ac0a188290b14ca2458d70d1c7dc9c52f732f3f22a9bf9a82","last_reissued_at":"2026-05-20T00:02:52.033758Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:02:52.033758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Perfect codes in Cayley graphs of abelian groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Peter J. Cameron, Roro Sihui Yap, Sanming Zhou","submitted_at":"2025-07-16T03:34:24Z","abstract_excerpt":"A perfect code in a graph $\\Gamma = (V, E)$ is a subset $C$ of $V$ such that no two vertices in $C$ are adjacent and every vertex in $V \\setminus C$ is adjacent to exactly one vertex in $C$. A total perfect code in $\\Gamma$ is a subset $C$ of $V$ such that every vertex of $\\Gamma$ is adjacent to exactly one vertex in $C$. In this paper we prove several results on perfect codes and total perfect codes in Cayley graphs of finite abelian groups."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.11871","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.11871/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2507.11871","created_at":"2026-05-20T00:02:52.033877+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.11871v2","created_at":"2026-05-20T00:02:52.033877+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.11871","created_at":"2026-05-20T00:02:52.033877+00:00"},{"alias_kind":"pith_short_12","alias_value":"CXQM324I33RH","created_at":"2026-05-20T00:02:52.033877+00:00"},{"alias_kind":"pith_short_16","alias_value":"CXQM324I33RHVQFB","created_at":"2026-05-20T00:02:52.033877+00:00"},{"alias_kind":"pith_short_8","alias_value":"CXQM324I","created_at":"2026-05-20T00:02:52.033877+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/CXQM324I33RHVQFBRAUQWFGKER","json":"https://pith.science/pith/CXQM324I33RHVQFBRAUQWFGKER.json","graph_json":"https://pith.science/api/pith-number/CXQM324I33RHVQFBRAUQWFGKER/graph.json","events_json":"https://pith.science/api/pith-number/CXQM324I33RHVQFBRAUQWFGKER/events.json","paper":"https://pith.science/paper/CXQM324I"},"agent_actions":{"view_html":"https://pith.science/pith/CXQM324I33RHVQFBRAUQWFGKER","download_json":"https://pith.science/pith/CXQM324I33RHVQFBRAUQWFGKER.json","view_paper":"https://pith.science/paper/CXQM324I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.11871&json=true","fetch_graph":"https://pith.science/api/pith-number/CXQM324I33RHVQFBRAUQWFGKER/graph.json","fetch_events":"https://pith.science/api/pith-number/CXQM324I33RHVQFBRAUQWFGKER/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CXQM324I33RHVQFBRAUQWFGKER/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CXQM324I33RHVQFBRAUQWFGKER/action/storage_attestation","attest_author":"https://pith.science/pith/CXQM324I33RHVQFBRAUQWFGKER/action/author_attestation","sign_citation":"https://pith.science/pith/CXQM324I33RHVQFBRAUQWFGKER/action/citation_signature","submit_replication":"https://pith.science/pith/CXQM324I33RHVQFBRAUQWFGKER/action/replication_record"}},"created_at":"2026-05-20T00:02:52.033877+00:00","updated_at":"2026-05-20T00:02:52.033877+00:00"}