{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:L6UMFTTWYMVTADP3CRQG5JB7CE","short_pith_number":"pith:L6UMFTTW","schema_version":"1.0","canonical_sha256":"5fa8c2ce76c32b300dfb14606ea43f1105445bd9ef3ae7376f260a875e8f4c10","source":{"kind":"arxiv","id":"1503.07986","version":1},"attestation_state":"computed","paper":{"title":"Generating clones with conservative near-unanimity operation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Johannes Greiner","submitted_at":"2015-03-27T08:13:33Z","abstract_excerpt":"Due to the Baker-Pixley theorem we know that every clone over a finite domain $A$ containing a near-unanimity operation $g$ is finitely generated. Therefore there exists an integer $k$ such that the clone is generated by its $k$-ary part. In this paper we are interested in the size of $k$ for a fixed $A$ and fixed arity of a conservative $g$. We obtain lower bounds for all arities and they turn out to be sharp for arity three."},"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":"1503.07986","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-03-27T08:13:33Z","cross_cats_sorted":[],"title_canon_sha256":"e25e34ad4e0b88fa54db37661b45238ecc63c10004bfb75fd8581ad169a45f25","abstract_canon_sha256":"3a21862478e66e2da12aad92e0941d49bc14436fa0e65ce71b757cc6f6c261da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:11.783047Z","signature_b64":"DZZifeOLyPQGIL45YohIQtoN6JOy78OlAMR2oCof3djk8bGwVp6W9Yii7qnXT1tReIl4CzEPIhWxorE9fNYpAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fa8c2ce76c32b300dfb14606ea43f1105445bd9ef3ae7376f260a875e8f4c10","last_reissued_at":"2026-05-18T02:20:11.782601Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:11.782601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generating clones with conservative near-unanimity operation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Johannes Greiner","submitted_at":"2015-03-27T08:13:33Z","abstract_excerpt":"Due to the Baker-Pixley theorem we know that every clone over a finite domain $A$ containing a near-unanimity operation $g$ is finitely generated. Therefore there exists an integer $k$ such that the clone is generated by its $k$-ary part. In this paper we are interested in the size of $k$ for a fixed $A$ and fixed arity of a conservative $g$. We obtain lower bounds for all arities and they turn out to be sharp for arity three."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07986","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":"1503.07986","created_at":"2026-05-18T02:20:11.782663+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.07986v1","created_at":"2026-05-18T02:20:11.782663+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07986","created_at":"2026-05-18T02:20:11.782663+00:00"},{"alias_kind":"pith_short_12","alias_value":"L6UMFTTWYMVT","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"L6UMFTTWYMVTADP3","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"L6UMFTTW","created_at":"2026-05-18T12:29:29.992203+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/L6UMFTTWYMVTADP3CRQG5JB7CE","json":"https://pith.science/pith/L6UMFTTWYMVTADP3CRQG5JB7CE.json","graph_json":"https://pith.science/api/pith-number/L6UMFTTWYMVTADP3CRQG5JB7CE/graph.json","events_json":"https://pith.science/api/pith-number/L6UMFTTWYMVTADP3CRQG5JB7CE/events.json","paper":"https://pith.science/paper/L6UMFTTW"},"agent_actions":{"view_html":"https://pith.science/pith/L6UMFTTWYMVTADP3CRQG5JB7CE","download_json":"https://pith.science/pith/L6UMFTTWYMVTADP3CRQG5JB7CE.json","view_paper":"https://pith.science/paper/L6UMFTTW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.07986&json=true","fetch_graph":"https://pith.science/api/pith-number/L6UMFTTWYMVTADP3CRQG5JB7CE/graph.json","fetch_events":"https://pith.science/api/pith-number/L6UMFTTWYMVTADP3CRQG5JB7CE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L6UMFTTWYMVTADP3CRQG5JB7CE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L6UMFTTWYMVTADP3CRQG5JB7CE/action/storage_attestation","attest_author":"https://pith.science/pith/L6UMFTTWYMVTADP3CRQG5JB7CE/action/author_attestation","sign_citation":"https://pith.science/pith/L6UMFTTWYMVTADP3CRQG5JB7CE/action/citation_signature","submit_replication":"https://pith.science/pith/L6UMFTTWYMVTADP3CRQG5JB7CE/action/replication_record"}},"created_at":"2026-05-18T02:20:11.782663+00:00","updated_at":"2026-05-18T02:20:11.782663+00:00"}