{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:CXQM324I33RHVQFBRAUQWFGKER","short_pith_number":"pith:CXQM324I","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"},"canonical_sha256":"15e0cdeb88dee27ac0a188290b14ca2458d70d1c7dc9c52f732f3f22a9bf9a82","source":{"kind":"arxiv","id":"2507.11871","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.11871","created_at":"2026-05-20T00:02:52Z"},{"alias_kind":"arxiv_version","alias_value":"2507.11871v2","created_at":"2026-05-20T00:02:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.11871","created_at":"2026-05-20T00:02:52Z"},{"alias_kind":"pith_short_12","alias_value":"CXQM324I33RH","created_at":"2026-05-20T00:02:52Z"},{"alias_kind":"pith_short_16","alias_value":"CXQM324I33RHVQFB","created_at":"2026-05-20T00:02:52Z"},{"alias_kind":"pith_short_8","alias_value":"CXQM324I","created_at":"2026-05-20T00:02:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:CXQM324I33RHVQFBRAUQWFGKER","target":"record","payload":{"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"},"canonical_sha256":"15e0cdeb88dee27ac0a188290b14ca2458d70d1c7dc9c52f732f3f22a9bf9a82","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"},"source_kind":"arxiv","source_id":"2507.11871","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:02:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zQIxZccCgYxPgTE8Ham8pkka8FqiwKStGQI4zq5f0eXw2f4H/Tf8BmG3+tlV5Ea/+yoNMq4fqthYjFlxOfFNBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:18:51.706694Z"},"content_sha256":"52ee634c0ee596ebadfd6ee83af74f7f73153fba588109aa291538bdd045bdc7","schema_version":"1.0","event_id":"sha256:52ee634c0ee596ebadfd6ee83af74f7f73153fba588109aa291538bdd045bdc7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:CXQM324I33RHVQFBRAUQWFGKER","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:02:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C4ulCE99WgXsyNsltFo5ZAJMEkXwb/xRjQo8aItYsygxfO19qriPvPRtvrpv3tq30zqOqbjFgOVTDQuOzROPCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:18:51.707407Z"},"content_sha256":"be62e7d5ccb649dc8f255cb3a61ac123e976d69d736b6ad01a4d073187a7824f","schema_version":"1.0","event_id":"sha256:be62e7d5ccb649dc8f255cb3a61ac123e976d69d736b6ad01a4d073187a7824f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CXQM324I33RHVQFBRAUQWFGKER/bundle.json","state_url":"https://pith.science/pith/CXQM324I33RHVQFBRAUQWFGKER/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CXQM324I33RHVQFBRAUQWFGKER/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T23:18:51Z","links":{"resolver":"https://pith.science/pith/CXQM324I33RHVQFBRAUQWFGKER","bundle":"https://pith.science/pith/CXQM324I33RHVQFBRAUQWFGKER/bundle.json","state":"https://pith.science/pith/CXQM324I33RHVQFBRAUQWFGKER/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CXQM324I33RHVQFBRAUQWFGKER/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:CXQM324I33RHVQFBRAUQWFGKER","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":"c145dfb60bcf13f4d8134c8be0ad26de8468c642d08f530c01a2327c7ab70274","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-16T03:34:24Z","title_canon_sha256":"0fd0d6536f03b168bbbca37090552427ead33ec6d8e709f4b6e25b6208286b26"},"schema_version":"1.0","source":{"id":"2507.11871","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.11871","created_at":"2026-05-20T00:02:52Z"},{"alias_kind":"arxiv_version","alias_value":"2507.11871v2","created_at":"2026-05-20T00:02:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.11871","created_at":"2026-05-20T00:02:52Z"},{"alias_kind":"pith_short_12","alias_value":"CXQM324I33RH","created_at":"2026-05-20T00:02:52Z"},{"alias_kind":"pith_short_16","alias_value":"CXQM324I33RHVQFB","created_at":"2026-05-20T00:02:52Z"},{"alias_kind":"pith_short_8","alias_value":"CXQM324I","created_at":"2026-05-20T00:02:52Z"}],"graph_snapshots":[{"event_id":"sha256:be62e7d5ccb649dc8f255cb3a61ac123e976d69d736b6ad01a4d073187a7824f","target":"graph","created_at":"2026-05-20T00:02:52Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.11871/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Peter J. Cameron, Roro Sihui Yap, Sanming Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-16T03:34:24Z","title":"Perfect codes in Cayley graphs of abelian groups"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.11871","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:52ee634c0ee596ebadfd6ee83af74f7f73153fba588109aa291538bdd045bdc7","target":"record","created_at":"2026-05-20T00:02:52Z","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":"c145dfb60bcf13f4d8134c8be0ad26de8468c642d08f530c01a2327c7ab70274","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-16T03:34:24Z","title_canon_sha256":"0fd0d6536f03b168bbbca37090552427ead33ec6d8e709f4b6e25b6208286b26"},"schema_version":"1.0","source":{"id":"2507.11871","kind":"arxiv","version":2}},"canonical_sha256":"15e0cdeb88dee27ac0a188290b14ca2458d70d1c7dc9c52f732f3f22a9bf9a82","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"15e0cdeb88dee27ac0a188290b14ca2458d70d1c7dc9c52f732f3f22a9bf9a82","first_computed_at":"2026-05-20T00:02:52.033758Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:02:52.033758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"29HFY+n8/BPWBebik+BjT7bbwpf+liFEcejQKgFaZrqR2eaKCzFkBygGx6GErOtpOCacbOHXCjUXw/XhzSnBBg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:02:52.034524Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.11871","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52ee634c0ee596ebadfd6ee83af74f7f73153fba588109aa291538bdd045bdc7","sha256:be62e7d5ccb649dc8f255cb3a61ac123e976d69d736b6ad01a4d073187a7824f"],"state_sha256":"b025a730a67b892b125eabb9fdcf3b21ad2cf0c17866230a35ed0a91550b836f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fgf8nQTaRQZpYIQGZIsoPde4tSSXRMm7dB+mOBUO3zWEuo1TMO2z9HX3eyx3xx6Zw2OzfQvdT8S2Gd9ozTxECw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T23:18:51.710843Z","bundle_sha256":"b82cb185f1d15c9e30b66ed403fc2d100bf44b47fae65ca237df0ffcd0bd22bd"}}