{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:MRYUBYLEMPPPHDR23FTHWN5RF7","short_pith_number":"pith:MRYUBYLE","schema_version":"1.0","canonical_sha256":"647140e16463def38e3ad9667b37b12ff545c000a737157168230c77c64a1de6","source":{"kind":"arxiv","id":"2605.16032","version":1},"attestation_state":"computed","paper":{"title":"Greedy bases and relational complexity of diagonal type groups","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Primitive groups of diagonal type satisfy Cameron's conjecture on greedy base sizes and have relational complexity at least 4 that is unbounded.","cross_cats":[],"primary_cat":"math.GR","authors_text":"Colva M. Roney-Dougal, Hong Yi Huang","submitted_at":"2026-05-15T15:07:34Z","abstract_excerpt":"A base for a subgroup $G$ of $\\mathrm{Sym}(\\Omega)$ is a sequence of elements of $\\Omega$ with trivial pointwise stabiliser. The size of the smallest base for $G$ is denoted $b(G)$. There is a natural greedy algorithm to compute a base for $G$, and it was conjectured by Cameron in 1999 that there exists an absolute constant $c$ such that if $G$ is primitive then any base returned by this algorithm has size at most $cb(G)$. In this paper we determine the size of every base returned by the greedy algorithm when $G$ is a primitive group of diagonal type, and hence prove Cameron's conjecture for t"},"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":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.16032","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GR","submitted_at":"2026-05-15T15:07:34Z","cross_cats_sorted":[],"title_canon_sha256":"a2e1dd1127b9fa043d5f863775129227f19537b338ac58f148dc8b371c05a81c","abstract_canon_sha256":"6aca950624da861a471db57371dbd9558c7d2038b426369f43b2805a1a93c32b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:50.022269Z","signature_b64":"P3WYX1H+ko2JJdeZ+DjW+thQpl8xqt0xC0gqWLwY1YHvXb9Z2VhM228YGRHAcK2EHzfkc4IsMzgAbBWfW3nWAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"647140e16463def38e3ad9667b37b12ff545c000a737157168230c77c64a1de6","last_reissued_at":"2026-05-20T00:01:50.021688Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:50.021688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Greedy bases and relational complexity of diagonal type groups","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Primitive groups of diagonal type satisfy Cameron's conjecture on greedy base sizes and have relational complexity at least 4 that is unbounded.","cross_cats":[],"primary_cat":"math.GR","authors_text":"Colva M. Roney-Dougal, Hong Yi Huang","submitted_at":"2026-05-15T15:07:34Z","abstract_excerpt":"A base for a subgroup $G$ of $\\mathrm{Sym}(\\Omega)$ is a sequence of elements of $\\Omega$ with trivial pointwise stabiliser. The size of the smallest base for $G$ is denoted $b(G)$. There is a natural greedy algorithm to compute a base for $G$, and it was conjectured by Cameron in 1999 that there exists an absolute constant $c$ such that if $G$ is primitive then any base returned by this algorithm has size at most $cb(G)$. In this paper we determine the size of every base returned by the greedy algorithm when $G$ is a primitive group of diagonal type, and hence prove Cameron's conjecture for t"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We determine the size of every base returned by the greedy algorithm when G is a primitive group of diagonal type, and hence prove Cameron's conjecture for these groups. We prove that if G is primitive of diagonal type then RC(G) ≥ 4, that this lower bound is attained by infinitely many such G, and that the relational complexity of the groups of diagonal type is unbounded.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The analysis relies on the known structural description of primitive diagonal type groups (socle T^k acting on cosets of a diagonal subgroup) and on the fact that the greedy choice can be tracked via the orbits on the product space; if this structural description or the orbit calculations contain an undetected gap, the exact base sizes and the RC lower bound would not follow.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"For primitive diagonal type groups the greedy base sizes are computed exactly, proving Cameron's conjecture, while relational complexity is shown to be at least 4 with no upper bound.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Primitive groups of diagonal type satisfy Cameron's conjecture on greedy base sizes and have relational complexity at least 4 that is unbounded.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"826ac004653c026c1fcf90e4e6f423310a87dc2374a70ba2d0b772abe6927699"},"source":{"id":"2605.16032","kind":"arxiv","version":1},"verdict":{"id":"8776bfd6-2420-4be7-ba7f-637e2f934efa","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T18:58:50.233697Z","strongest_claim":"We determine the size of every base returned by the greedy algorithm when G is a primitive group of diagonal type, and hence prove Cameron's conjecture for these groups. We prove that if G is primitive of diagonal type then RC(G) ≥ 4, that this lower bound is attained by infinitely many such G, and that the relational complexity of the groups of diagonal type is unbounded.","one_line_summary":"For primitive diagonal type groups the greedy base sizes are computed exactly, proving Cameron's conjecture, while relational complexity is shown to be at least 4 with no upper bound.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The analysis relies on the known structural description of primitive diagonal type groups (socle T^k acting on cosets of a diagonal subgroup) and on the fact that the greedy choice can be tracked via the orbits on the product space; if this structural description or the orbit calculations contain an undetected gap, the exact base sizes and the RC lower bound would not follow.","pith_extraction_headline":"Primitive groups of diagonal type satisfy Cameron's conjecture on greedy base sizes and have relational complexity at least 4 that is unbounded."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16032/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T19:31:19.011766Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T19:10:49.334956Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:41.565680Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T16:41:55.542451Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"1dc400e6dd78e1f96c89a0c1eb6efb3f90de8bd18d098fc9ac77f29e07e92576"},"references":{"count":31,"sample":[{"doi":"","year":2024,"title":"M. Anagnostopoulou-Merkouri and T.C. Burness,On the regularity number of a finite group and other base-related invariants, J. Lond. Math. Soc.110(2024), Paper No. e70035, 65 pp","work_id":"444a455d-55e7-44b4-b79b-fc0b8c950b45","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1992,"title":"K.D. Blaha,Minimum bases for permutation groups: the greedy approximation, J. Algorithms13 (1992), no. 2, 297–306","work_id":"5180ffe8-8251-4637-814b-48588399110d","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2013,"title":"J.N. Bray, D.F. Holt and C.M. Roney-Dougal,The maximal subgroups of the low-dimensional finite classical groups, Lond. Math. Soc. Lecture Note Ser., vol. 407, Cambridge Univ. Press, Cambridge, 2013","work_id":"6a1ee44f-3fd1-4026-9d61-9c86322c6c30","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1997,"title":"W. Bosma, J. Cannon and C. Playoust,TheMagmaalgebra system I: The user language, J. Symb. Comput.24(1997), 235–265","work_id":"4492b43c-3030-4198-b07e-adf78d32e223","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"S. Brenner, C. del Valle and C.M. Roney-Dougal,Irredundant bases for soluble groups, Bull. Lond. Math. Soc.57(2025), 3013–3023","work_id":"6582883d-b371-4f7e-9f6d-b90af436ed6e","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":31,"snapshot_sha256":"c2db939435781545a36aae30151348eecf6a090a960c6ab031d3e2213d948604","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":"2605.16032","created_at":"2026-05-20T00:01:50.021782+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.16032v1","created_at":"2026-05-20T00:01:50.021782+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16032","created_at":"2026-05-20T00:01:50.021782+00:00"},{"alias_kind":"pith_short_12","alias_value":"MRYUBYLEMPPP","created_at":"2026-05-20T00:01:50.021782+00:00"},{"alias_kind":"pith_short_16","alias_value":"MRYUBYLEMPPPHDR2","created_at":"2026-05-20T00:01:50.021782+00:00"},{"alias_kind":"pith_short_8","alias_value":"MRYUBYLE","created_at":"2026-05-20T00:01:50.021782+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/MRYUBYLEMPPPHDR23FTHWN5RF7","json":"https://pith.science/pith/MRYUBYLEMPPPHDR23FTHWN5RF7.json","graph_json":"https://pith.science/api/pith-number/MRYUBYLEMPPPHDR23FTHWN5RF7/graph.json","events_json":"https://pith.science/api/pith-number/MRYUBYLEMPPPHDR23FTHWN5RF7/events.json","paper":"https://pith.science/paper/MRYUBYLE"},"agent_actions":{"view_html":"https://pith.science/pith/MRYUBYLEMPPPHDR23FTHWN5RF7","download_json":"https://pith.science/pith/MRYUBYLEMPPPHDR23FTHWN5RF7.json","view_paper":"https://pith.science/paper/MRYUBYLE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.16032&json=true","fetch_graph":"https://pith.science/api/pith-number/MRYUBYLEMPPPHDR23FTHWN5RF7/graph.json","fetch_events":"https://pith.science/api/pith-number/MRYUBYLEMPPPHDR23FTHWN5RF7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MRYUBYLEMPPPHDR23FTHWN5RF7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MRYUBYLEMPPPHDR23FTHWN5RF7/action/storage_attestation","attest_author":"https://pith.science/pith/MRYUBYLEMPPPHDR23FTHWN5RF7/action/author_attestation","sign_citation":"https://pith.science/pith/MRYUBYLEMPPPHDR23FTHWN5RF7/action/citation_signature","submit_replication":"https://pith.science/pith/MRYUBYLEMPPPHDR23FTHWN5RF7/action/replication_record"}},"created_at":"2026-05-20T00:01:50.021782+00:00","updated_at":"2026-05-20T00:01:50.021782+00:00"}