{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ZXBSDK7KUXH6ONSX7IKMTL5ZFU","short_pith_number":"pith:ZXBSDK7K","schema_version":"1.0","canonical_sha256":"cdc321abeaa5cfe73657fa14c9afb92d3ec9481c315b8297ef22f999da77a20e","source":{"kind":"arxiv","id":"1211.5345","version":1},"attestation_state":"computed","paper":{"title":"Covering certain monolithic groups with proper subgroups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Martino Garonzi","submitted_at":"2012-11-22T17:51:48Z","abstract_excerpt":"Given a finite non-cyclic group $G$, call $\\sigma(G)$ the least number of proper subgroups of $G$ needed to cover $G$. In this paper we give lower and upper bounds for $\\sigma(G)$ for $G$ a group with a unique minimal normal subgroup $N$ isomorphic to $A_n^m$ where $n \\geq 5$ and $G/N$ is cyclic. We also show that $\\sigma(A_5 \\wr C_2)=57$."},"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":"1211.5345","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2012-11-22T17:51:48Z","cross_cats_sorted":[],"title_canon_sha256":"b8b2d0381828c78ebf63e11a7422e1e239f43f3c02bdbffcaec3fba284241705","abstract_canon_sha256":"7315ee2d8004f22a430c31f821265c58a835758b81203d3ca803457f9e59d8f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:04.640431Z","signature_b64":"kAW1VhdpUCtYzyi8uNtxkQwEi/9pm5mHdw3/lhAQnPzAPxP0iyTS/+9TD1uy4e+Seb/2HUfvidZDw/F/7bJsCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdc321abeaa5cfe73657fa14c9afb92d3ec9481c315b8297ef22f999da77a20e","last_reissued_at":"2026-05-18T03:40:04.639638Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:04.639638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Covering certain monolithic groups with proper subgroups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Martino Garonzi","submitted_at":"2012-11-22T17:51:48Z","abstract_excerpt":"Given a finite non-cyclic group $G$, call $\\sigma(G)$ the least number of proper subgroups of $G$ needed to cover $G$. In this paper we give lower and upper bounds for $\\sigma(G)$ for $G$ a group with a unique minimal normal subgroup $N$ isomorphic to $A_n^m$ where $n \\geq 5$ and $G/N$ is cyclic. We also show that $\\sigma(A_5 \\wr C_2)=57$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5345","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":"1211.5345","created_at":"2026-05-18T03:40:04.639764+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.5345v1","created_at":"2026-05-18T03:40:04.639764+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5345","created_at":"2026-05-18T03:40:04.639764+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZXBSDK7KUXH6","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZXBSDK7KUXH6ONSX","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZXBSDK7K","created_at":"2026-05-18T12:27:30.460161+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/ZXBSDK7KUXH6ONSX7IKMTL5ZFU","json":"https://pith.science/pith/ZXBSDK7KUXH6ONSX7IKMTL5ZFU.json","graph_json":"https://pith.science/api/pith-number/ZXBSDK7KUXH6ONSX7IKMTL5ZFU/graph.json","events_json":"https://pith.science/api/pith-number/ZXBSDK7KUXH6ONSX7IKMTL5ZFU/events.json","paper":"https://pith.science/paper/ZXBSDK7K"},"agent_actions":{"view_html":"https://pith.science/pith/ZXBSDK7KUXH6ONSX7IKMTL5ZFU","download_json":"https://pith.science/pith/ZXBSDK7KUXH6ONSX7IKMTL5ZFU.json","view_paper":"https://pith.science/paper/ZXBSDK7K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.5345&json=true","fetch_graph":"https://pith.science/api/pith-number/ZXBSDK7KUXH6ONSX7IKMTL5ZFU/graph.json","fetch_events":"https://pith.science/api/pith-number/ZXBSDK7KUXH6ONSX7IKMTL5ZFU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZXBSDK7KUXH6ONSX7IKMTL5ZFU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZXBSDK7KUXH6ONSX7IKMTL5ZFU/action/storage_attestation","attest_author":"https://pith.science/pith/ZXBSDK7KUXH6ONSX7IKMTL5ZFU/action/author_attestation","sign_citation":"https://pith.science/pith/ZXBSDK7KUXH6ONSX7IKMTL5ZFU/action/citation_signature","submit_replication":"https://pith.science/pith/ZXBSDK7KUXH6ONSX7IKMTL5ZFU/action/replication_record"}},"created_at":"2026-05-18T03:40:04.639764+00:00","updated_at":"2026-05-18T03:40:04.639764+00:00"}