{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:2NC3XNXN3C6Y43SOSVDCH5T6LX","short_pith_number":"pith:2NC3XNXN","canonical_record":{"source":{"id":"1904.01858","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-03T08:58:35Z","cross_cats_sorted":[],"title_canon_sha256":"41b0f38c5d7ffb66715694b0a320695c416547db3ef35096c3da486e6856590b","abstract_canon_sha256":"71c2715ae966a7686a8423b4f7db2fd410ca4767ad86fc59f68bb15961692fd8"},"schema_version":"1.0"},"canonical_sha256":"d345bbb6edd8bd8e6e4e954623f67e5dcc2c9faee6073f5e536917ab3ae147eb","source":{"kind":"arxiv","id":"1904.01858","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.01858","created_at":"2026-07-05T01:19:35Z"},{"alias_kind":"arxiv_version","alias_value":"1904.01858v2","created_at":"2026-07-05T01:19:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.01858","created_at":"2026-07-05T01:19:35Z"},{"alias_kind":"pith_short_12","alias_value":"2NC3XNXN3C6Y","created_at":"2026-07-05T01:19:35Z"},{"alias_kind":"pith_short_16","alias_value":"2NC3XNXN3C6Y43SO","created_at":"2026-07-05T01:19:35Z"},{"alias_kind":"pith_short_8","alias_value":"2NC3XNXN","created_at":"2026-07-05T01:19:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:2NC3XNXN3C6Y43SOSVDCH5T6LX","target":"record","payload":{"canonical_record":{"source":{"id":"1904.01858","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-03T08:58:35Z","cross_cats_sorted":[],"title_canon_sha256":"41b0f38c5d7ffb66715694b0a320695c416547db3ef35096c3da486e6856590b","abstract_canon_sha256":"71c2715ae966a7686a8423b4f7db2fd410ca4767ad86fc59f68bb15961692fd8"},"schema_version":"1.0"},"canonical_sha256":"d345bbb6edd8bd8e6e4e954623f67e5dcc2c9faee6073f5e536917ab3ae147eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:19:35.345514Z","signature_b64":"ZG6R22UvszLVm6zFGnSwFbeNcKanAXt5J1EpcacfJchJcO0gtVUzrCWLT2KOroRHdZf/JJHMR/tIulNviIYrAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d345bbb6edd8bd8e6e4e954623f67e5dcc2c9faee6073f5e536917ab3ae147eb","last_reissued_at":"2026-07-05T01:19:35.345063Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:19:35.345063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.01858","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-07-05T01:19:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LWCZ0QOtvFzl0RApaNXzo8ipymngE8wVudWfPlPmuh0c78u2vOHHmX1KW8/Ms40fBOS2isD8c5910K4jLBHoAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T17:58:39.769961Z"},"content_sha256":"0c7aae7cdda21e79c8e2a5d42272ce90ed16894534f9c0daebbafbd67d9be063","schema_version":"1.0","event_id":"sha256:0c7aae7cdda21e79c8e2a5d42272ce90ed16894534f9c0daebbafbd67d9be063"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:2NC3XNXN3C6Y43SOSVDCH5T6LX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subgroup perfect codes in Cayley graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gary L. Walls, Kaishun Wang, Sanming Zhou, Xuanlong Ma","submitted_at":"2019-04-03T08:58:35Z","abstract_excerpt":"Let $\\Gamma$ be a graph with vertex set $V(\\Gamma)$. A subset $C$ of $V(\\Gamma)$ is called a perfect code in $\\Gamma$ if $C$ is an independent set of $\\Gamma$ and every vertex in $V(\\Gamma)\\setminus C$ is adjacent to exactly one vertex in $C$. A subset $C$ of a group $G$ is called a perfect code of $G$ if there exists a Cayley graph of $G$ which admits $C$ as a perfect code. A group $G$ is said to be code-perfect if every proper subgroup of $G$ is a perfect code of $G$. In this paper we prove that a group is code-perfect if and only if it has no elements of order $4$. We also prove that a prop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.01858","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/1904.01858/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-07-05T01:19:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lqwMbE+1GnaMfHwscUagxtpniJw+3JGmrzFXqWVP+azro22CkWQZsONyaVkemIEZreULGaF/O3jHT+SkHsPoAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T17:58:39.770471Z"},"content_sha256":"a7b697805237b23d95b12eda6c800d96f8f240575265f969f0d6ffa578788c65","schema_version":"1.0","event_id":"sha256:a7b697805237b23d95b12eda6c800d96f8f240575265f969f0d6ffa578788c65"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2NC3XNXN3C6Y43SOSVDCH5T6LX/bundle.json","state_url":"https://pith.science/pith/2NC3XNXN3C6Y43SOSVDCH5T6LX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2NC3XNXN3C6Y43SOSVDCH5T6LX/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-08-19T17:58:39Z","links":{"resolver":"https://pith.science/pith/2NC3XNXN3C6Y43SOSVDCH5T6LX","bundle":"https://pith.science/pith/2NC3XNXN3C6Y43SOSVDCH5T6LX/bundle.json","state":"https://pith.science/pith/2NC3XNXN3C6Y43SOSVDCH5T6LX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2NC3XNXN3C6Y43SOSVDCH5T6LX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:2NC3XNXN3C6Y43SOSVDCH5T6LX","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":"71c2715ae966a7686a8423b4f7db2fd410ca4767ad86fc59f68bb15961692fd8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-03T08:58:35Z","title_canon_sha256":"41b0f38c5d7ffb66715694b0a320695c416547db3ef35096c3da486e6856590b"},"schema_version":"1.0","source":{"id":"1904.01858","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.01858","created_at":"2026-07-05T01:19:35Z"},{"alias_kind":"arxiv_version","alias_value":"1904.01858v2","created_at":"2026-07-05T01:19:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.01858","created_at":"2026-07-05T01:19:35Z"},{"alias_kind":"pith_short_12","alias_value":"2NC3XNXN3C6Y","created_at":"2026-07-05T01:19:35Z"},{"alias_kind":"pith_short_16","alias_value":"2NC3XNXN3C6Y43SO","created_at":"2026-07-05T01:19:35Z"},{"alias_kind":"pith_short_8","alias_value":"2NC3XNXN","created_at":"2026-07-05T01:19:35Z"}],"graph_snapshots":[{"event_id":"sha256:a7b697805237b23d95b12eda6c800d96f8f240575265f969f0d6ffa578788c65","target":"graph","created_at":"2026-07-05T01:19:35Z","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/1904.01858/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $\\Gamma$ be a graph with vertex set $V(\\Gamma)$. A subset $C$ of $V(\\Gamma)$ is called a perfect code in $\\Gamma$ if $C$ is an independent set of $\\Gamma$ and every vertex in $V(\\Gamma)\\setminus C$ is adjacent to exactly one vertex in $C$. A subset $C$ of a group $G$ is called a perfect code of $G$ if there exists a Cayley graph of $G$ which admits $C$ as a perfect code. A group $G$ is said to be code-perfect if every proper subgroup of $G$ is a perfect code of $G$. In this paper we prove that a group is code-perfect if and only if it has no elements of order $4$. We also prove that a prop","authors_text":"Gary L. Walls, Kaishun Wang, Sanming Zhou, Xuanlong Ma","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-03T08:58:35Z","title":"Subgroup perfect codes in Cayley graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.01858","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:0c7aae7cdda21e79c8e2a5d42272ce90ed16894534f9c0daebbafbd67d9be063","target":"record","created_at":"2026-07-05T01:19:35Z","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":"71c2715ae966a7686a8423b4f7db2fd410ca4767ad86fc59f68bb15961692fd8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-03T08:58:35Z","title_canon_sha256":"41b0f38c5d7ffb66715694b0a320695c416547db3ef35096c3da486e6856590b"},"schema_version":"1.0","source":{"id":"1904.01858","kind":"arxiv","version":2}},"canonical_sha256":"d345bbb6edd8bd8e6e4e954623f67e5dcc2c9faee6073f5e536917ab3ae147eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d345bbb6edd8bd8e6e4e954623f67e5dcc2c9faee6073f5e536917ab3ae147eb","first_computed_at":"2026-07-05T01:19:35.345063Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:19:35.345063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZG6R22UvszLVm6zFGnSwFbeNcKanAXt5J1EpcacfJchJcO0gtVUzrCWLT2KOroRHdZf/JJHMR/tIulNviIYrAA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:19:35.345514Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.01858","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c7aae7cdda21e79c8e2a5d42272ce90ed16894534f9c0daebbafbd67d9be063","sha256:a7b697805237b23d95b12eda6c800d96f8f240575265f969f0d6ffa578788c65"],"state_sha256":"8fb1f5137bb45e59558dfac579e712be708bc8c31111ae50921c4b780f8f4170"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dr60NHkqe9m0YSXTSGgOj3/pj/4paZBGCCE8XoeWeetj7kRdv0s+Kykrlelvd5a0DvEVB72ukMHzWNSek3cBCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T17:58:39.775273Z","bundle_sha256":"3b6885a49088487b18a57f95e6e591a60722b08dce41225078500320bf5f6522"}}