{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:XH6XDPGS7JVD4GSKLOHMGYX2LV","short_pith_number":"pith:XH6XDPGS","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"},"canonical_sha256":"b9fd71bcd2fa6a3e1a4a5b8ec362fa5d50cbc2484615db44189ce7859fdee434","source":{"kind":"arxiv","id":"1103.2265","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.2265","created_at":"2026-05-18T04:21:10Z"},{"alias_kind":"arxiv_version","alias_value":"1103.2265v2","created_at":"2026-05-18T04:21:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2265","created_at":"2026-05-18T04:21:10Z"},{"alias_kind":"pith_short_12","alias_value":"XH6XDPGS7JVD","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"XH6XDPGS7JVD4GSK","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"XH6XDPGS","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:XH6XDPGS7JVD4GSKLOHMGYX2LV","target":"record","payload":{"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"},"canonical_sha256":"b9fd71bcd2fa6a3e1a4a5b8ec362fa5d50cbc2484615db44189ce7859fdee434","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"},"source_kind":"arxiv","source_id":"1103.2265","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:21:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M8Ug0wU5507/6xQn5tbX8j++QtMDi8IHJbxUHjRDFbboZbSj209wqDqiwZKJ9jF9GG21JhI/9DTDu3a2b15/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:44:09.183399Z"},"content_sha256":"4fcbf3c3d955acb3c202bd90efc2c079754fc3ea66c6cc9eac4497c5e00da4ab","schema_version":"1.0","event_id":"sha256:4fcbf3c3d955acb3c202bd90efc2c079754fc3ea66c6cc9eac4497c5e00da4ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:XH6XDPGS7JVD4GSKLOHMGYX2LV","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:21:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zu8q1ak/d8Fq4LbUN4eoQCUPX4uZoLJYl+X0zBf6jWSqEV7z3t2Tpxhqxk3R9NbjmTFwc1Aft+0NakKf88N/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:44:09.183770Z"},"content_sha256":"d966e7af7580eca218821318c12d935428e8063622f9ab766f6373225b3d569f","schema_version":"1.0","event_id":"sha256:d966e7af7580eca218821318c12d935428e8063622f9ab766f6373225b3d569f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XH6XDPGS7JVD4GSKLOHMGYX2LV/bundle.json","state_url":"https://pith.science/pith/XH6XDPGS7JVD4GSKLOHMGYX2LV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XH6XDPGS7JVD4GSKLOHMGYX2LV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T00:44:09Z","links":{"resolver":"https://pith.science/pith/XH6XDPGS7JVD4GSKLOHMGYX2LV","bundle":"https://pith.science/pith/XH6XDPGS7JVD4GSKLOHMGYX2LV/bundle.json","state":"https://pith.science/pith/XH6XDPGS7JVD4GSKLOHMGYX2LV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XH6XDPGS7JVD4GSKLOHMGYX2LV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:XH6XDPGS7JVD4GSKLOHMGYX2LV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"40c7ec03562e19d7634ee1805c48c0cc61a63d316ea7c56b77d53c56d302b058","cross_cats_sorted":["math.GR","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2011-03-11T13:42:51Z","title_canon_sha256":"74c3a973ab66fcb9c37cee2bfbcd81bafc700fb95244b83bcebbfe666f188163"},"schema_version":"1.0","source":{"id":"1103.2265","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.2265","created_at":"2026-05-18T04:21:10Z"},{"alias_kind":"arxiv_version","alias_value":"1103.2265v2","created_at":"2026-05-18T04:21:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2265","created_at":"2026-05-18T04:21:10Z"},{"alias_kind":"pith_short_12","alias_value":"XH6XDPGS7JVD","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"XH6XDPGS7JVD4GSK","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"XH6XDPGS","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:d966e7af7580eca218821318c12d935428e8063622f9ab766f6373225b3d569f","target":"graph","created_at":"2026-05-18T04:21:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Erhard Aichinger, Peter Mayr, Ralph McKenzie","cross_cats":["math.GR","math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2011-03-11T13:42:51Z","title":"On the number of finite algebraic structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2265","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4fcbf3c3d955acb3c202bd90efc2c079754fc3ea66c6cc9eac4497c5e00da4ab","target":"record","created_at":"2026-05-18T04:21:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"40c7ec03562e19d7634ee1805c48c0cc61a63d316ea7c56b77d53c56d302b058","cross_cats_sorted":["math.GR","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2011-03-11T13:42:51Z","title_canon_sha256":"74c3a973ab66fcb9c37cee2bfbcd81bafc700fb95244b83bcebbfe666f188163"},"schema_version":"1.0","source":{"id":"1103.2265","kind":"arxiv","version":2}},"canonical_sha256":"b9fd71bcd2fa6a3e1a4a5b8ec362fa5d50cbc2484615db44189ce7859fdee434","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b9fd71bcd2fa6a3e1a4a5b8ec362fa5d50cbc2484615db44189ce7859fdee434","first_computed_at":"2026-05-18T04:21:10.491744Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:21:10.491744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"31p8ERm76WnV1i9tppZh761MQfrPxlgj1HintlYUw1+OqIoi4Ou5ypq0ekPnmAu2b3sOVQpyO/37oDjXH9+iDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:21:10.492235Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.2265","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4fcbf3c3d955acb3c202bd90efc2c079754fc3ea66c6cc9eac4497c5e00da4ab","sha256:d966e7af7580eca218821318c12d935428e8063622f9ab766f6373225b3d569f"],"state_sha256":"70676244b535c0ccc9a496a79df5d3d595a41fbe2240d41c0684e9f164cb8acf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fjcpKURTjTALviNz4zYN8rNe/eGA0XCed7n0ziMUfbiaNLhetfSPsHarndxe4eQST+oIivx2ZhLdnqdHKB/JBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:44:09.186999Z","bundle_sha256":"47f24da01d78c6a66f651198f900bd1035e55cd8b434dd3cdc15c3ff87e0d4f7"}}