{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ZT3ID2TKJEOJRG7XYYVEUOK2WF","short_pith_number":"pith:ZT3ID2TK","schema_version":"1.0","canonical_sha256":"ccf681ea6a491c989bf7c62a4a395ab17a040526e5cabda895ea6bb3f715b0ab","source":{"kind":"arxiv","id":"1602.07829","version":4},"attestation_state":"computed","paper":{"title":"The number of composition factors of order $p$ in completely reducible groups of characteristic $p$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Cai Heng Li, Gabriel Verret, Michael Giudici, S. P. Glasby","submitted_at":"2016-02-25T07:35:56Z","abstract_excerpt":"Let $q$ be a power of a prime $p$ and let $G$ be a completely reducible subgroup of $\\mathrm{GL}(d,q)$. We prove that the number of composition factors of $G$ that have prime order $p$ is at most $(\\varepsilon_q d-1)/(p-1)$, where $\\varepsilon_q$ is a function of $q$ satisfying $1\\leqslant\\varepsilon_q\\leqslant 3/2$. For every $q$, we give examples showing this bound is sharp infinitely often."},"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":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1602.07829","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2016-02-25T07:35:56Z","cross_cats_sorted":[],"title_canon_sha256":"865aa8b84e47cee3588c1bb1a59896ebb56f6243d163c6760116c0fe933ac302","abstract_canon_sha256":"2c115866c8db9b5d4147e7fb6ba816f56faa82f14090c2eb1c7be577098d0581"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:21.419553Z","signature_b64":"PbmD6feKhfsnjid25JkgKqofEn5E8DF0pFqT00HPtBCsdaB20Rj7bgh3NozGh+PWoM4XB6rVT9FEpe/lEv7SBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccf681ea6a491c989bf7c62a4a395ab17a040526e5cabda895ea6bb3f715b0ab","last_reissued_at":"2026-05-18T00:38:21.418873Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:21.418873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The number of composition factors of order $p$ in completely reducible groups of characteristic $p$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Cai Heng Li, Gabriel Verret, Michael Giudici, S. P. Glasby","submitted_at":"2016-02-25T07:35:56Z","abstract_excerpt":"Let $q$ be a power of a prime $p$ and let $G$ be a completely reducible subgroup of $\\mathrm{GL}(d,q)$. We prove that the number of composition factors of $G$ that have prime order $p$ is at most $(\\varepsilon_q d-1)/(p-1)$, where $\\varepsilon_q$ is a function of $q$ satisfying $1\\leqslant\\varepsilon_q\\leqslant 3/2$. For every $q$, we give examples showing this bound is sharp infinitely often."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07829","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.07829","created_at":"2026-05-18T00:38:21.418960+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.07829v4","created_at":"2026-05-18T00:38:21.418960+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07829","created_at":"2026-05-18T00:38:21.418960+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZT3ID2TKJEOJ","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZT3ID2TKJEOJRG7X","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZT3ID2TK","created_at":"2026-05-18T12:30:55.937587+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/ZT3ID2TKJEOJRG7XYYVEUOK2WF","json":"https://pith.science/pith/ZT3ID2TKJEOJRG7XYYVEUOK2WF.json","graph_json":"https://pith.science/api/pith-number/ZT3ID2TKJEOJRG7XYYVEUOK2WF/graph.json","events_json":"https://pith.science/api/pith-number/ZT3ID2TKJEOJRG7XYYVEUOK2WF/events.json","paper":"https://pith.science/paper/ZT3ID2TK"},"agent_actions":{"view_html":"https://pith.science/pith/ZT3ID2TKJEOJRG7XYYVEUOK2WF","download_json":"https://pith.science/pith/ZT3ID2TKJEOJRG7XYYVEUOK2WF.json","view_paper":"https://pith.science/paper/ZT3ID2TK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.07829&json=true","fetch_graph":"https://pith.science/api/pith-number/ZT3ID2TKJEOJRG7XYYVEUOK2WF/graph.json","fetch_events":"https://pith.science/api/pith-number/ZT3ID2TKJEOJRG7XYYVEUOK2WF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZT3ID2TKJEOJRG7XYYVEUOK2WF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZT3ID2TKJEOJRG7XYYVEUOK2WF/action/storage_attestation","attest_author":"https://pith.science/pith/ZT3ID2TKJEOJRG7XYYVEUOK2WF/action/author_attestation","sign_citation":"https://pith.science/pith/ZT3ID2TKJEOJRG7XYYVEUOK2WF/action/citation_signature","submit_replication":"https://pith.science/pith/ZT3ID2TKJEOJRG7XYYVEUOK2WF/action/replication_record"}},"created_at":"2026-05-18T00:38:21.418960+00:00","updated_at":"2026-05-18T00:38:21.418960+00:00"}