{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:XH6XDPGS7JVD4GSKLOHMGYX2LV","short_pith_number":"pith:XH6XDPGS","schema_version":"1.0","canonical_sha256":"b9fd71bcd2fa6a3e1a4a5b8ec362fa5d50cbc2484615db44189ce7859fdee434","source":{"kind":"arxiv","id":"1103.2265","version":2},"attestation_state":"computed","paper":{"title":"On the number of finite algebraic structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR","math.LO"],"primary_cat":"math.RA","authors_text":"Erhard Aichinger, Peter Mayr, Ralph McKenzie","submitted_at":"2011-03-11T13:42:51Z","abstract_excerpt":"We prove that every clone of operations on a finite set A, if it contains a Malcev operation, is finitely related -- i.e., identical with the clone of all operations respecting R for some finitary relation R over A. It follows that for a fixed finite set A, the set of all such Malcev clones is countable. This completes the solution of a problem that was first formulated in 1980, or earlier: how many Malcev clones can finite sets support? More generally, we prove that every finite algebra with few subpowers has a finitely related clone of term operations. Hence modulo term equivalence and a ren"},"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":"1103.2265","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2011-03-11T13:42:51Z","cross_cats_sorted":["math.GR","math.LO"],"title_canon_sha256":"74c3a973ab66fcb9c37cee2bfbcd81bafc700fb95244b83bcebbfe666f188163","abstract_canon_sha256":"40c7ec03562e19d7634ee1805c48c0cc61a63d316ea7c56b77d53c56d302b058"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:21:10.492235Z","signature_b64":"31p8ERm76WnV1i9tppZh761MQfrPxlgj1HintlYUw1+OqIoi4Ou5ypq0ekPnmAu2b3sOVQpyO/37oDjXH9+iDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9fd71bcd2fa6a3e1a4a5b8ec362fa5d50cbc2484615db44189ce7859fdee434","last_reissued_at":"2026-05-18T04:21:10.491744Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:21:10.491744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the number of finite algebraic structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR","math.LO"],"primary_cat":"math.RA","authors_text":"Erhard Aichinger, Peter Mayr, Ralph McKenzie","submitted_at":"2011-03-11T13:42:51Z","abstract_excerpt":"We prove that every clone of operations on a finite set A, if it contains a Malcev operation, is finitely related -- i.e., identical with the clone of all operations respecting R for some finitary relation R over A. It follows that for a fixed finite set A, the set of all such Malcev clones is countable. This completes the solution of a problem that was first formulated in 1980, or earlier: how many Malcev clones can finite sets support? More generally, we prove that every finite algebra with few subpowers has a finitely related clone of term operations. Hence modulo term equivalence and a ren"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2265","kind":"arxiv","version":2},"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":"1103.2265","created_at":"2026-05-18T04:21:10.491813+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.2265v2","created_at":"2026-05-18T04:21:10.491813+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2265","created_at":"2026-05-18T04:21:10.491813+00:00"},{"alias_kind":"pith_short_12","alias_value":"XH6XDPGS7JVD","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"XH6XDPGS7JVD4GSK","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"XH6XDPGS","created_at":"2026-05-18T12:26:44.992195+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/XH6XDPGS7JVD4GSKLOHMGYX2LV","json":"https://pith.science/pith/XH6XDPGS7JVD4GSKLOHMGYX2LV.json","graph_json":"https://pith.science/api/pith-number/XH6XDPGS7JVD4GSKLOHMGYX2LV/graph.json","events_json":"https://pith.science/api/pith-number/XH6XDPGS7JVD4GSKLOHMGYX2LV/events.json","paper":"https://pith.science/paper/XH6XDPGS"},"agent_actions":{"view_html":"https://pith.science/pith/XH6XDPGS7JVD4GSKLOHMGYX2LV","download_json":"https://pith.science/pith/XH6XDPGS7JVD4GSKLOHMGYX2LV.json","view_paper":"https://pith.science/paper/XH6XDPGS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.2265&json=true","fetch_graph":"https://pith.science/api/pith-number/XH6XDPGS7JVD4GSKLOHMGYX2LV/graph.json","fetch_events":"https://pith.science/api/pith-number/XH6XDPGS7JVD4GSKLOHMGYX2LV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XH6XDPGS7JVD4GSKLOHMGYX2LV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XH6XDPGS7JVD4GSKLOHMGYX2LV/action/storage_attestation","attest_author":"https://pith.science/pith/XH6XDPGS7JVD4GSKLOHMGYX2LV/action/author_attestation","sign_citation":"https://pith.science/pith/XH6XDPGS7JVD4GSKLOHMGYX2LV/action/citation_signature","submit_replication":"https://pith.science/pith/XH6XDPGS7JVD4GSKLOHMGYX2LV/action/replication_record"}},"created_at":"2026-05-18T04:21:10.491813+00:00","updated_at":"2026-05-18T04:21:10.491813+00:00"}