{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KGTVYT5FOR5KJGKICYJAZSRY6G","short_pith_number":"pith:KGTVYT5F","schema_version":"1.0","canonical_sha256":"51a75c4fa5747aa4994816120cca38f1990d9232903505bc83d2654c58c4612e","source":{"kind":"arxiv","id":"1907.02898","version":1},"attestation_state":"computed","paper":{"title":"On the Intersection Numbers of Finite Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GR","authors_text":"Humberto Bautista Serrano, Kassie Archer, Kayla Cook, L.-K. Lauderdale, Vincent Villalobos, Yansy Perez","submitted_at":"2019-07-05T15:33:05Z","abstract_excerpt":"The covering number of a nontrivial finite group $G$, denoted $\\sigma(G)$, is the smallest number of proper subgroups of $G$ whose set-theoretic union equals $G$. In this article, we focus on a dual problem to that of covering numbers of groups, which involves maximal subgroups of finite groups. For a nontrivial finite group $G$, we define the intersection number of $G$, denoted $\\iota(G)$, to be the minimum number of maximal subgroups whose intersection equals the Frattini subgroup of $G$. We elucidate some basic properties of this invariant, and give an exact formula for $\\iota(G)$ when $G$ "},"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":"1907.02898","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2019-07-05T15:33:05Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8177051e8c62b2d9c6c53263ad12eedb5c837959af623ab0c5f4f5385fa3c8d5","abstract_canon_sha256":"cf86fad020ff7038fe2f934067c4d3cb3f1ee0c48a6e66b4259983514f1a4546"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:22.679298Z","signature_b64":"fWBCgMNA79sa9g7dwldMzBllmB3Z6WG0XMelQpayBry2iq7AWbQ8Yd99Qg5lkCywXcPHWnQZJGycZXRbB/W+Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51a75c4fa5747aa4994816120cca38f1990d9232903505bc83d2654c58c4612e","last_reissued_at":"2026-05-17T23:41:22.678462Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:22.678462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Intersection Numbers of Finite Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GR","authors_text":"Humberto Bautista Serrano, Kassie Archer, Kayla Cook, L.-K. Lauderdale, Vincent Villalobos, Yansy Perez","submitted_at":"2019-07-05T15:33:05Z","abstract_excerpt":"The covering number of a nontrivial finite group $G$, denoted $\\sigma(G)$, is the smallest number of proper subgroups of $G$ whose set-theoretic union equals $G$. In this article, we focus on a dual problem to that of covering numbers of groups, which involves maximal subgroups of finite groups. For a nontrivial finite group $G$, we define the intersection number of $G$, denoted $\\iota(G)$, to be the minimum number of maximal subgroups whose intersection equals the Frattini subgroup of $G$. We elucidate some basic properties of this invariant, and give an exact formula for $\\iota(G)$ when $G$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02898","kind":"arxiv","version":1},"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":"1907.02898","created_at":"2026-05-17T23:41:22.678607+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.02898v1","created_at":"2026-05-17T23:41:22.678607+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02898","created_at":"2026-05-17T23:41:22.678607+00:00"},{"alias_kind":"pith_short_12","alias_value":"KGTVYT5FOR5K","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"KGTVYT5FOR5KJGKI","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"KGTVYT5F","created_at":"2026-05-18T12:33:21.387695+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/KGTVYT5FOR5KJGKICYJAZSRY6G","json":"https://pith.science/pith/KGTVYT5FOR5KJGKICYJAZSRY6G.json","graph_json":"https://pith.science/api/pith-number/KGTVYT5FOR5KJGKICYJAZSRY6G/graph.json","events_json":"https://pith.science/api/pith-number/KGTVYT5FOR5KJGKICYJAZSRY6G/events.json","paper":"https://pith.science/paper/KGTVYT5F"},"agent_actions":{"view_html":"https://pith.science/pith/KGTVYT5FOR5KJGKICYJAZSRY6G","download_json":"https://pith.science/pith/KGTVYT5FOR5KJGKICYJAZSRY6G.json","view_paper":"https://pith.science/paper/KGTVYT5F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.02898&json=true","fetch_graph":"https://pith.science/api/pith-number/KGTVYT5FOR5KJGKICYJAZSRY6G/graph.json","fetch_events":"https://pith.science/api/pith-number/KGTVYT5FOR5KJGKICYJAZSRY6G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KGTVYT5FOR5KJGKICYJAZSRY6G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KGTVYT5FOR5KJGKICYJAZSRY6G/action/storage_attestation","attest_author":"https://pith.science/pith/KGTVYT5FOR5KJGKICYJAZSRY6G/action/author_attestation","sign_citation":"https://pith.science/pith/KGTVYT5FOR5KJGKICYJAZSRY6G/action/citation_signature","submit_replication":"https://pith.science/pith/KGTVYT5FOR5KJGKICYJAZSRY6G/action/replication_record"}},"created_at":"2026-05-17T23:41:22.678607+00:00","updated_at":"2026-05-17T23:41:22.678607+00:00"}