{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4K2V4ZIEHJZXOSPO3T6Y4U6ALK","short_pith_number":"pith:4K2V4ZIE","schema_version":"1.0","canonical_sha256":"e2b55e65043a737749eedcfd8e53c05a91518a8fc9c6d738ad5081f56cbc4afe","source":{"kind":"arxiv","id":"1412.6275","version":1},"attestation_state":"computed","paper":{"title":"Irredundant and minimal covers of finite groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Andrea Lucchini, Martino Garonzi","submitted_at":"2014-12-19T10:27:32Z","abstract_excerpt":"A cover of a finite non-cyclic group $G$ is a family $\\mathcal{H}$ of proper subgroups of $G$ whose union equals $G$. A cover of $G$ is called minimal if it has minimal size, and irredundant if it does not properly contain any other cover. We classify the finite non-cyclic groups all of whose irredundant covers are minimal."},"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":"1412.6275","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2014-12-19T10:27:32Z","cross_cats_sorted":[],"title_canon_sha256":"9b22bdcec30eb7ed83162074ffa7763eebb17258512c331b39fba092aba3a056","abstract_canon_sha256":"712cfd09cfebc3bdfe6cf1bafbf72e4ef516986de8646ccedf5e5c2d54e8294c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:53.919060Z","signature_b64":"GB+iQykqUz8FYGUGX/u1Nom5KE48KECGFwXATgMpxXM0S8IQM31dBntIeW5m0Kuvq48SfTuFAyeqTbxv+MJtDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2b55e65043a737749eedcfd8e53c05a91518a8fc9c6d738ad5081f56cbc4afe","last_reissued_at":"2026-05-18T02:30:53.918425Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:53.918425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Irredundant and minimal covers of finite groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Andrea Lucchini, Martino Garonzi","submitted_at":"2014-12-19T10:27:32Z","abstract_excerpt":"A cover of a finite non-cyclic group $G$ is a family $\\mathcal{H}$ of proper subgroups of $G$ whose union equals $G$. A cover of $G$ is called minimal if it has minimal size, and irredundant if it does not properly contain any other cover. We classify the finite non-cyclic groups all of whose irredundant covers are minimal."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6275","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":"1412.6275","created_at":"2026-05-18T02:30:53.918523+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.6275v1","created_at":"2026-05-18T02:30:53.918523+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6275","created_at":"2026-05-18T02:30:53.918523+00:00"},{"alias_kind":"pith_short_12","alias_value":"4K2V4ZIEHJZX","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4K2V4ZIEHJZXOSPO","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4K2V4ZIE","created_at":"2026-05-18T12:28:14.216126+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.06800","citing_title":"Graph Interpolating Activation Improves Both Natural and Robust Accuracies in Data-Efficient Deep Learning","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4K2V4ZIEHJZXOSPO3T6Y4U6ALK","json":"https://pith.science/pith/4K2V4ZIEHJZXOSPO3T6Y4U6ALK.json","graph_json":"https://pith.science/api/pith-number/4K2V4ZIEHJZXOSPO3T6Y4U6ALK/graph.json","events_json":"https://pith.science/api/pith-number/4K2V4ZIEHJZXOSPO3T6Y4U6ALK/events.json","paper":"https://pith.science/paper/4K2V4ZIE"},"agent_actions":{"view_html":"https://pith.science/pith/4K2V4ZIEHJZXOSPO3T6Y4U6ALK","download_json":"https://pith.science/pith/4K2V4ZIEHJZXOSPO3T6Y4U6ALK.json","view_paper":"https://pith.science/paper/4K2V4ZIE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.6275&json=true","fetch_graph":"https://pith.science/api/pith-number/4K2V4ZIEHJZXOSPO3T6Y4U6ALK/graph.json","fetch_events":"https://pith.science/api/pith-number/4K2V4ZIEHJZXOSPO3T6Y4U6ALK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4K2V4ZIEHJZXOSPO3T6Y4U6ALK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4K2V4ZIEHJZXOSPO3T6Y4U6ALK/action/storage_attestation","attest_author":"https://pith.science/pith/4K2V4ZIEHJZXOSPO3T6Y4U6ALK/action/author_attestation","sign_citation":"https://pith.science/pith/4K2V4ZIEHJZXOSPO3T6Y4U6ALK/action/citation_signature","submit_replication":"https://pith.science/pith/4K2V4ZIEHJZXOSPO3T6Y4U6ALK/action/replication_record"}},"created_at":"2026-05-18T02:30:53.918523+00:00","updated_at":"2026-05-18T02:30:53.918523+00:00"}