{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:DVISGBZIMWXAYX2GPIATFSKKF6","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":"e1a2d4ebbcefac9961dd631164fd0f8b6771c8394b34f6ac0d2b8ab4e3958a16","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-17T10:37:36Z","title_canon_sha256":"9b228948592c71e5f5b22444c73ffcd69a6b74a193a88c7c5bdec0d2e223b90b"},"schema_version":"1.0","source":{"id":"2605.17376","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17376","created_at":"2026-05-20T00:03:55Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17376v1","created_at":"2026-05-20T00:03:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17376","created_at":"2026-05-20T00:03:55Z"},{"alias_kind":"pith_short_12","alias_value":"DVISGBZIMWXA","created_at":"2026-05-20T00:03:55Z"},{"alias_kind":"pith_short_16","alias_value":"DVISGBZIMWXAYX2G","created_at":"2026-05-20T00:03:55Z"},{"alias_kind":"pith_short_8","alias_value":"DVISGBZI","created_at":"2026-05-20T00:03:55Z"}],"graph_snapshots":[{"event_id":"sha256:1e17611dfb2ad1f7d882e667ba79331327fb56c89c75e8b379c05ed2d3e09996","target":"graph","created_at":"2026-05-20T00:03:55Z","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":"With the help of these results we then obtain necessary conditions for the existence of an (a,b)-perfect set in a normal Cayley graph in terms of the irreducible characters of the underlying group."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The derivations assume the graph is regular and that the equitable partitions exist in a form that allows direct application of character theory to the adjacency matrix or orbital structure of the normal Cayley graph."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Derives necessary conditions for equitable partitions of regular graphs and for (a,b)-perfect sets in normal Cayley graphs using irreducible characters."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Necessary conditions for (a,b)-perfect sets in normal Cayley graphs are expressed using irreducible characters of the group."}],"snapshot_sha256":"fb0e3d1eb2ef919e036719926a2f507859dd9599b791c15ea80cb57e0ba57944"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"57cccba6272b5ee5b72e0d2ecad60683744a332de8a2fb76d2e82163ad4fb041"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T23:31:20.060194Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T23:13:05.437691Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T21:41:57.773832Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.711128Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.17376/integrity.json","findings":[],"snapshot_sha256":"93aa9256c99f353308bca43269634e556a9340b6c7417be7ae332bd7908a1c81","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"An equitable partition of a graph $\\Ga$ is a partition $\\{V_1, \\ldots, V_m\\}$ of its vertex set such that for each pair $i, j$ all vertices in $V_i$ have the same number of neighbours in $V_j$. When $m=2$, $V_1$ is called an $(a, b)$-perfect set in $\\Ga$, where $a$ is the number of neighbours in $V_1$ of each vertex in $V_1$, and $b$ is the number of neighbours in $V_1$ of each vertex in $V_2$. In this paper we first derive general necessary conditions for a regular graph to admit two equitable partitions. As a corollary we obtain necessary conditions for the existence of an $(a,b)$-perfect se","authors_text":"Peter J. Cameron, R. A. Bailey, Sanming Zhou","cross_cats":[],"headline":"Necessary conditions for (a,b)-perfect sets in normal Cayley graphs are expressed using irreducible characters of the group.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-17T10:37:36Z","title":"Equitable partitions of regular graphs, and perfect sets in normal Cayley graphs"},"references":{"count":35,"internal_anchors":0,"resolved_work":35,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"R. A. Bailey, P. J. Cameron, A. L. Gavrilyuk and S. V. Goryainov, Equitable partitions of Latin- square graphs,J. Combin. Des.27 (2019), no. 3, 142–160","work_id":"f8f821f2-5cca-4413-ac87-baf5c6117f56","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"R. A. Bailey, P. J. Cameron, D. Ferreira, S. S. Ferreira and C. Nunes, Designs for half-diallel experiments with commutative orthogonal block structure,J. Statist. Plann. Inference231 (2024), 106139","work_id":"53ad484e-4c1f-4a66-b804-703af408fc59","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"E. A. Bespalov, D. S. Krotov, A. A. Matiushev and K. V. Vorob’ev, Perfect 2-colorings of Hamming graphs,J Combin Des.29 (2021), no. 6, 367–396","work_id":"646c31a4-f378-42b9-94ca-90966688eeb3","year":2021},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"N. L. Biggs, Perfect codes in graphs,J. Combin. Theory Ser. B15 (1973) 289–296","work_id":"ab860b91-9d5c-40ce-970f-b1031f8c17a1","year":1973},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"D. M. Cardoso, An overview of (κ, τ)-regular sets and their applications,Discrete Appl. Math.269 (2019) 2–10","work_id":"37088fba-84ef-4a4a-aa4f-d384360f3747","year":2019}],"snapshot_sha256":"d45c3c5d7bdcd9af1001a71ae99c49aa74b1f7553ef05401b97d870df4bd75fd"},"source":{"id":"2605.17376","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T23:02:47.816668Z","id":"3d489c30-98a2-4045-98bb-7c02186d736e","model_set":{"reader":"grok-4.3"},"one_line_summary":"Derives necessary conditions for equitable partitions of regular graphs and for (a,b)-perfect sets in normal Cayley graphs using irreducible characters.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Necessary conditions for (a,b)-perfect sets in normal Cayley graphs are expressed using irreducible characters of the group.","strongest_claim":"With the help of these results we then obtain necessary conditions for the existence of an (a,b)-perfect set in a normal Cayley graph in terms of the irreducible characters of the underlying group.","weakest_assumption":"The derivations assume the graph is regular and that the equitable partitions exist in a form that allows direct application of character theory to the adjacency matrix or orbital structure of the normal Cayley graph."}},"verdict_id":"3d489c30-98a2-4045-98bb-7c02186d736e"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2f249eefc73dca2428fad04ced5f20e47f6c4200504605252de08ef95e999aeb","target":"record","created_at":"2026-05-20T00:03:55Z","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":"e1a2d4ebbcefac9961dd631164fd0f8b6771c8394b34f6ac0d2b8ab4e3958a16","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-17T10:37:36Z","title_canon_sha256":"9b228948592c71e5f5b22444c73ffcd69a6b74a193a88c7c5bdec0d2e223b90b"},"schema_version":"1.0","source":{"id":"2605.17376","kind":"arxiv","version":1}},"canonical_sha256":"1d5123072865ae0c5f467a0132c94a2f9c81b20654f0388ffe48753b0db8831f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d5123072865ae0c5f467a0132c94a2f9c81b20654f0388ffe48753b0db8831f","first_computed_at":"2026-05-20T00:03:55.422653Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:55.422653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sWP7q8d4HOESeel7uXJmhJmnWTJA6l/gj7Xv7kEtlNs3qYtQgEl86PgtiE3CrQN14bLvYWM53l1LkGh8uguBBw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:55.423529Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.17376","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f249eefc73dca2428fad04ced5f20e47f6c4200504605252de08ef95e999aeb","sha256:1e17611dfb2ad1f7d882e667ba79331327fb56c89c75e8b379c05ed2d3e09996"],"state_sha256":"ca3aab0d44e4fdcf1c1e0ad7e939ca87f85a3aad7e5793b36eb3f7d758c8e8b8"}