{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:UMGLI6RQWUFKY4J3FFV7Y6HQ3M","short_pith_number":"pith:UMGLI6RQ","schema_version":"1.0","canonical_sha256":"a30cb47a30b50aac713b296bfc78f0db3b5e72e536c05cb785fd004c0d16b486","source":{"kind":"arxiv","id":"1108.2061","version":2},"attestation_state":"computed","paper":{"title":"Clones above the unary clone","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"math.RA","authors_text":"G\\'abor S\\'agi, Martin Goldstern, Saharon Shelah","submitted_at":"2011-08-09T22:20:17Z","abstract_excerpt":"Let c be the cardinality of the continuum.\n  We give a family of pairwise incomparable clones (on a countable base set) 2^c members, all with the same unary fragment, namely the set of all unary operations.\n  We also give, for each n, a family of 2^c clones all with the same n-ary fragment, and all containing the set of all unary operations."},"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":"1108.2061","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2011-08-09T22:20:17Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"b1f7eb80c620e0c428c681c49c81ea1df9a610e2aea488718c4230125ce89064","abstract_canon_sha256":"a98b1769343531031456d85c77ecae24171769ef4fe4f6cf014fef6e847631e2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:35.774752Z","signature_b64":"OMoY+nfizYRK/+L24fSGsfw1BupXKsFPQV45kYWQc33BDLxOaIz6I0fcsNF+dmaDXzR/tLekukyYdcroRjwiAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a30cb47a30b50aac713b296bfc78f0db3b5e72e536c05cb785fd004c0d16b486","last_reissued_at":"2026-05-18T04:15:35.774352Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:35.774352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clones above the unary clone","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"math.RA","authors_text":"G\\'abor S\\'agi, Martin Goldstern, Saharon Shelah","submitted_at":"2011-08-09T22:20:17Z","abstract_excerpt":"Let c be the cardinality of the continuum.\n  We give a family of pairwise incomparable clones (on a countable base set) 2^c members, all with the same unary fragment, namely the set of all unary operations.\n  We also give, for each n, a family of 2^c clones all with the same n-ary fragment, and all containing the set of all unary operations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.2061","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":"1108.2061","created_at":"2026-05-18T04:15:35.774412+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.2061v2","created_at":"2026-05-18T04:15:35.774412+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2061","created_at":"2026-05-18T04:15:35.774412+00:00"},{"alias_kind":"pith_short_12","alias_value":"UMGLI6RQWUFK","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"UMGLI6RQWUFKY4J3","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"UMGLI6RQ","created_at":"2026-05-18T12:26:42.757692+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/UMGLI6RQWUFKY4J3FFV7Y6HQ3M","json":"https://pith.science/pith/UMGLI6RQWUFKY4J3FFV7Y6HQ3M.json","graph_json":"https://pith.science/api/pith-number/UMGLI6RQWUFKY4J3FFV7Y6HQ3M/graph.json","events_json":"https://pith.science/api/pith-number/UMGLI6RQWUFKY4J3FFV7Y6HQ3M/events.json","paper":"https://pith.science/paper/UMGLI6RQ"},"agent_actions":{"view_html":"https://pith.science/pith/UMGLI6RQWUFKY4J3FFV7Y6HQ3M","download_json":"https://pith.science/pith/UMGLI6RQWUFKY4J3FFV7Y6HQ3M.json","view_paper":"https://pith.science/paper/UMGLI6RQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.2061&json=true","fetch_graph":"https://pith.science/api/pith-number/UMGLI6RQWUFKY4J3FFV7Y6HQ3M/graph.json","fetch_events":"https://pith.science/api/pith-number/UMGLI6RQWUFKY4J3FFV7Y6HQ3M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UMGLI6RQWUFKY4J3FFV7Y6HQ3M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UMGLI6RQWUFKY4J3FFV7Y6HQ3M/action/storage_attestation","attest_author":"https://pith.science/pith/UMGLI6RQWUFKY4J3FFV7Y6HQ3M/action/author_attestation","sign_citation":"https://pith.science/pith/UMGLI6RQWUFKY4J3FFV7Y6HQ3M/action/citation_signature","submit_replication":"https://pith.science/pith/UMGLI6RQWUFKY4J3FFV7Y6HQ3M/action/replication_record"}},"created_at":"2026-05-18T04:15:35.774412+00:00","updated_at":"2026-05-18T04:15:35.774412+00:00"}