{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:HD4CLZBPC7DYJL5UYWLEJARYJY","short_pith_number":"pith:HD4CLZBP","canonical_record":{"source":{"id":"2605.03284","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-05T02:14:44Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"4ffa43c8eed404e06eede2245969f7f9fc38584b88f93713efe68314489d77a6","abstract_canon_sha256":"1e731747584412b5203a2ec09663e29ca7deb9bab1e27dbd635ca57899e52265"},"schema_version":"1.0"},"canonical_sha256":"38f825e42f17c784afb4c5964482384e32ec622a75146740e95d9e0e8fe4a796","source":{"kind":"arxiv","id":"2605.03284","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.03284","created_at":"2026-06-02T01:03:48Z"},{"alias_kind":"arxiv_version","alias_value":"2605.03284v2","created_at":"2026-06-02T01:03:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.03284","created_at":"2026-06-02T01:03:48Z"},{"alias_kind":"pith_short_12","alias_value":"HD4CLZBPC7DY","created_at":"2026-06-02T01:03:48Z"},{"alias_kind":"pith_short_16","alias_value":"HD4CLZBPC7DYJL5U","created_at":"2026-06-02T01:03:48Z"},{"alias_kind":"pith_short_8","alias_value":"HD4CLZBP","created_at":"2026-06-02T01:03:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:HD4CLZBPC7DYJL5UYWLEJARYJY","target":"record","payload":{"canonical_record":{"source":{"id":"2605.03284","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-05T02:14:44Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"4ffa43c8eed404e06eede2245969f7f9fc38584b88f93713efe68314489d77a6","abstract_canon_sha256":"1e731747584412b5203a2ec09663e29ca7deb9bab1e27dbd635ca57899e52265"},"schema_version":"1.0"},"canonical_sha256":"38f825e42f17c784afb4c5964482384e32ec622a75146740e95d9e0e8fe4a796","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:03:48.063330Z","signature_b64":"dZ7G3OjnLPzh5gXmxPkskKfZTD20yodKoySawuONGIfNP8G01GQP22DUYOZaH07k+9fFzYf2mr98NukKXfcuAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38f825e42f17c784afb4c5964482384e32ec622a75146740e95d9e0e8fe4a796","last_reissued_at":"2026-06-02T01:03:48.062910Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:03:48.062910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.03284","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-06-02T01:03:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fyUz9mnob8woTP1bC1CHIx6xNDa8R2sQiHmC+3F9Tt2ii5+xtxpdgVPCNfI9OxXPo9jJucVRC9p3N3qj3JplCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:57:03.916180Z"},"content_sha256":"f94df1b0141555713d7ee7ae3295da4437000449ccbbe0b1d8eb4baa6f7156c7","schema_version":"1.0","event_id":"sha256:f94df1b0141555713d7ee7ae3295da4437000449ccbbe0b1d8eb4baa6f7156c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:HD4CLZBPC7DYJL5UYWLEJARYJY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Characterizing Finite Groups via Subgroup Perfect Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Finite groups have at least as many conjugacy classes of nontrivial subgroup perfect codes as distinct prime divisors of their order, except for three families.","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Binbin Li, Hao Yu, Jingjian Li, Wei Meng","submitted_at":"2026-05-05T02:14:44Z","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 subgroup $H$ of a group $G$ is called a subgroup perfect code of $G$ if it is a perfect code in some Cayley graph of $G$. In this paper, we study the set $\\Delta(G)$ of conjugacy classes of nontrivial subgroup perfect codes of $G$, with a focus on its relation to $|\\pi(G)|$, the number of prime divisors of $|G|$. We prove that $|\\Delta(G)| \\ge |\\pi(G)|$ with only three exceptional families, which leads t"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We prove that |Δ(G)| ≥ |π(G)| with only three exceptional families... We completely classify finite groups G satisfying |Δ(G)| = |π(G)| and |Δ(G)| = |π(G)| + 1, and we further characterize all insolvable groups with |Δ(G)| ≤ 6.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The proofs rely on the completeness and correctness of the classification of primitive groups of odd degree and of primitive groups of square-free degree.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Finite groups satisfy |Δ(G)| ≥ |π(G)| except for three families, with complete classifications of the equality and near-equality cases plus all insoluble groups with |Δ(G)| ≤ 6.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Finite groups have at least as many conjugacy classes of nontrivial subgroup perfect codes as distinct prime divisors of their order, except for three families.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"96cd56b813cd929118b7e89fd3a0461a597a8d7d9ed620db80d48092628f3ae1"},"source":{"id":"2605.03284","kind":"arxiv","version":2},"verdict":{"id":"9a2e4d7a-7d52-488b-a199-6aa46d00db2c","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-07T15:56:21.226881Z","strongest_claim":"We prove that |Δ(G)| ≥ |π(G)| with only three exceptional families... We completely classify finite groups G satisfying |Δ(G)| = |π(G)| and |Δ(G)| = |π(G)| + 1, and we further characterize all insolvable groups with |Δ(G)| ≤ 6.","one_line_summary":"Finite groups satisfy |Δ(G)| ≥ |π(G)| except for three families, with complete classifications of the equality and near-equality cases plus all insoluble groups with |Δ(G)| ≤ 6.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The proofs rely on the completeness and correctness of the classification of primitive groups of odd degree and of primitive groups of square-free degree.","pith_extraction_headline":"Finite groups have at least as many conjugacy classes of nontrivial subgroup perfect codes as distinct prime divisors of their order, except for three families."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.03284/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T14:34:29.486658Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-20T01:31:21.557685Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T15:31:38.345003Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"19c55cde476a4f6617c3c7ebf919f478161a9f5976a8efb38e6422484cec5a9a"},"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":"9a2e4d7a-7d52-488b-a199-6aa46d00db2c"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-02T01:03:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kxqbm+Erf1QinvD2/06YERWmiu+5Jw1EOpks69nEKTa1amf0I1QrhPU+bSKIftNaATfHvbEETwpzH39j7Zv2DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:57:03.916807Z"},"content_sha256":"b05f900715e05fad41aac4d9574ac8b99b65cfe636e3152e149bbd2d40bd2bf5","schema_version":"1.0","event_id":"sha256:b05f900715e05fad41aac4d9574ac8b99b65cfe636e3152e149bbd2d40bd2bf5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HD4CLZBPC7DYJL5UYWLEJARYJY/bundle.json","state_url":"https://pith.science/pith/HD4CLZBPC7DYJL5UYWLEJARYJY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HD4CLZBPC7DYJL5UYWLEJARYJY/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-06-03T18:57:03Z","links":{"resolver":"https://pith.science/pith/HD4CLZBPC7DYJL5UYWLEJARYJY","bundle":"https://pith.science/pith/HD4CLZBPC7DYJL5UYWLEJARYJY/bundle.json","state":"https://pith.science/pith/HD4CLZBPC7DYJL5UYWLEJARYJY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HD4CLZBPC7DYJL5UYWLEJARYJY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:HD4CLZBPC7DYJL5UYWLEJARYJY","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":"1e731747584412b5203a2ec09663e29ca7deb9bab1e27dbd635ca57899e52265","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-05T02:14:44Z","title_canon_sha256":"4ffa43c8eed404e06eede2245969f7f9fc38584b88f93713efe68314489d77a6"},"schema_version":"1.0","source":{"id":"2605.03284","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.03284","created_at":"2026-06-02T01:03:48Z"},{"alias_kind":"arxiv_version","alias_value":"2605.03284v2","created_at":"2026-06-02T01:03:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.03284","created_at":"2026-06-02T01:03:48Z"},{"alias_kind":"pith_short_12","alias_value":"HD4CLZBPC7DY","created_at":"2026-06-02T01:03:48Z"},{"alias_kind":"pith_short_16","alias_value":"HD4CLZBPC7DYJL5U","created_at":"2026-06-02T01:03:48Z"},{"alias_kind":"pith_short_8","alias_value":"HD4CLZBP","created_at":"2026-06-02T01:03:48Z"}],"graph_snapshots":[{"event_id":"sha256:b05f900715e05fad41aac4d9574ac8b99b65cfe636e3152e149bbd2d40bd2bf5","target":"graph","created_at":"2026-06-02T01:03:48Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We prove that |Δ(G)| ≥ |π(G)| with only three exceptional families... We completely classify finite groups G satisfying |Δ(G)| = |π(G)| and |Δ(G)| = |π(G)| + 1, and we further characterize all insolvable groups with |Δ(G)| ≤ 6."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The proofs rely on the completeness and correctness of the classification of primitive groups of odd degree and of primitive groups of square-free degree."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Finite groups satisfy |Δ(G)| ≥ |π(G)| except for three families, with complete classifications of the equality and near-equality cases plus all insoluble groups with |Δ(G)| ≤ 6."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Finite groups have at least as many conjugacy classes of nontrivial subgroup perfect codes as distinct prime divisors of their order, except for three families."}],"snapshot_sha256":"96cd56b813cd929118b7e89fd3a0461a597a8d7d9ed620db80d48092628f3ae1"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-20T14:34:29.486658Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-20T01:31:21.557685Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T15:31:38.345003Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.03284/integrity.json","findings":[],"snapshot_sha256":"19c55cde476a4f6617c3c7ebf919f478161a9f5976a8efb38e6422484cec5a9a","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 subgroup $H$ of a group $G$ is called a subgroup perfect code of $G$ if it is a perfect code in some Cayley graph of $G$. In this paper, we study the set $\\Delta(G)$ of conjugacy classes of nontrivial subgroup perfect codes of $G$, with a focus on its relation to $|\\pi(G)|$, the number of prime divisors of $|G|$. We prove that $|\\Delta(G)| \\ge |\\pi(G)|$ with only three exceptional families, which leads t","authors_text":"Binbin Li, Hao Yu, Jingjian Li, Wei Meng","cross_cats":["math.GR"],"headline":"Finite groups have at least as many conjugacy classes of nontrivial subgroup perfect codes as distinct prime divisors of their order, except for three families.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-05T02:14:44Z","title":"Characterizing Finite Groups via Subgroup Perfect Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.03284","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-07T15:56:21.226881Z","id":"9a2e4d7a-7d52-488b-a199-6aa46d00db2c","model_set":{"reader":"grok-4.3"},"one_line_summary":"Finite groups satisfy |Δ(G)| ≥ |π(G)| except for three families, with complete classifications of the equality and near-equality cases plus all insoluble groups with |Δ(G)| ≤ 6.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Finite groups have at least as many conjugacy classes of nontrivial subgroup perfect codes as distinct prime divisors of their order, except for three families.","strongest_claim":"We prove that |Δ(G)| ≥ |π(G)| with only three exceptional families... We completely classify finite groups G satisfying |Δ(G)| = |π(G)| and |Δ(G)| = |π(G)| + 1, and we further characterize all insolvable groups with |Δ(G)| ≤ 6.","weakest_assumption":"The proofs rely on the completeness and correctness of the classification of primitive groups of odd degree and of primitive groups of square-free degree."}},"verdict_id":"9a2e4d7a-7d52-488b-a199-6aa46d00db2c"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f94df1b0141555713d7ee7ae3295da4437000449ccbbe0b1d8eb4baa6f7156c7","target":"record","created_at":"2026-06-02T01:03:48Z","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":"1e731747584412b5203a2ec09663e29ca7deb9bab1e27dbd635ca57899e52265","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-05T02:14:44Z","title_canon_sha256":"4ffa43c8eed404e06eede2245969f7f9fc38584b88f93713efe68314489d77a6"},"schema_version":"1.0","source":{"id":"2605.03284","kind":"arxiv","version":2}},"canonical_sha256":"38f825e42f17c784afb4c5964482384e32ec622a75146740e95d9e0e8fe4a796","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"38f825e42f17c784afb4c5964482384e32ec622a75146740e95d9e0e8fe4a796","first_computed_at":"2026-06-02T01:03:48.062910Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T01:03:48.062910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dZ7G3OjnLPzh5gXmxPkskKfZTD20yodKoySawuONGIfNP8G01GQP22DUYOZaH07k+9fFzYf2mr98NukKXfcuAQ==","signature_status":"signed_v1","signed_at":"2026-06-02T01:03:48.063330Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.03284","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f94df1b0141555713d7ee7ae3295da4437000449ccbbe0b1d8eb4baa6f7156c7","sha256:b05f900715e05fad41aac4d9574ac8b99b65cfe636e3152e149bbd2d40bd2bf5"],"state_sha256":"735747d3ba10402bedd4d9f77d7d76de259c64fb31e9cb8082b78c20e72a2e1b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZR4z5rSvsFqvNvSKnxId/JN7DKjyMlk1e7OvCVjEsT5L+mTzsh0cXI6E0mDNV+QJXUcW1S23nR9JGTWHn6Z8BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T18:57:03.919562Z","bundle_sha256":"758baa0d26774805b133ca47c68c8225f1e52a782f22a16102baa31be14a2af3"}}