{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:32IANEKAPOEVZOPAN5BXJSSIIP","short_pith_number":"pith:32IANEKA","schema_version":"1.0","canonical_sha256":"de900691407b895cb9e06f4374ca4843f50e269b0871a2a4255a8389c3e48b61","source":{"kind":"arxiv","id":"1810.06407","version":1},"attestation_state":"computed","paper":{"title":"On lattices with a smallest set of aggregation functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.RA","authors_text":"Jozef P\\'ocs, Radom\\'ir Hala\\v{s}","submitted_at":"2018-10-09T07:49:58Z","abstract_excerpt":"Given a bounded lattice $L$ with bounds $0$ and $1$, it is well known that the set $\\mathsf{Pol}_{0,1}(L)$ of all $0,1$-preserving polynomials of $L$ forms a natural subclass of the set $\\mathsf{C}(L)$ of aggregation functions on $L$. The main aim of this paper is to characterize all finite lattices $L$ for which these two classes coincide, i.e. when the set $\\mathsf{C}(L)$ is as small as possible. These lattices are shown to be completely determined by their tolerances, also several sufficient purely lattice-theoretical conditions are presented. In particular, all simple relatively complement"},"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":"1810.06407","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2018-10-09T07:49:58Z","cross_cats_sorted":[],"title_canon_sha256":"4c6970503c3473e4388b672a9f615681e2c3af2979c2f76bb02b24f9e071b87c","abstract_canon_sha256":"060a291d425dfcfa647d2d370a766b17c27bc3d46cc940b363e9e50130c32161"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:20.570292Z","signature_b64":"QRj2uvySunJQsiqdEO6Eez0UjzrZG1wy/zHLwJJ28Pafx7eya1Z4jjPJ7pAtx0V1spiDrKhFKMQPTGaFKP84Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de900691407b895cb9e06f4374ca4843f50e269b0871a2a4255a8389c3e48b61","last_reissued_at":"2026-05-18T00:03:20.569851Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:20.569851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On lattices with a smallest set of aggregation functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.RA","authors_text":"Jozef P\\'ocs, Radom\\'ir Hala\\v{s}","submitted_at":"2018-10-09T07:49:58Z","abstract_excerpt":"Given a bounded lattice $L$ with bounds $0$ and $1$, it is well known that the set $\\mathsf{Pol}_{0,1}(L)$ of all $0,1$-preserving polynomials of $L$ forms a natural subclass of the set $\\mathsf{C}(L)$ of aggregation functions on $L$. The main aim of this paper is to characterize all finite lattices $L$ for which these two classes coincide, i.e. when the set $\\mathsf{C}(L)$ is as small as possible. These lattices are shown to be completely determined by their tolerances, also several sufficient purely lattice-theoretical conditions are presented. In particular, all simple relatively complement"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06407","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":"1810.06407","created_at":"2026-05-18T00:03:20.569916+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.06407v1","created_at":"2026-05-18T00:03:20.569916+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06407","created_at":"2026-05-18T00:03:20.569916+00:00"},{"alias_kind":"pith_short_12","alias_value":"32IANEKAPOEV","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"32IANEKAPOEVZOPA","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"32IANEKA","created_at":"2026-05-18T12:32:02.567920+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/32IANEKAPOEVZOPAN5BXJSSIIP","json":"https://pith.science/pith/32IANEKAPOEVZOPAN5BXJSSIIP.json","graph_json":"https://pith.science/api/pith-number/32IANEKAPOEVZOPAN5BXJSSIIP/graph.json","events_json":"https://pith.science/api/pith-number/32IANEKAPOEVZOPAN5BXJSSIIP/events.json","paper":"https://pith.science/paper/32IANEKA"},"agent_actions":{"view_html":"https://pith.science/pith/32IANEKAPOEVZOPAN5BXJSSIIP","download_json":"https://pith.science/pith/32IANEKAPOEVZOPAN5BXJSSIIP.json","view_paper":"https://pith.science/paper/32IANEKA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.06407&json=true","fetch_graph":"https://pith.science/api/pith-number/32IANEKAPOEVZOPAN5BXJSSIIP/graph.json","fetch_events":"https://pith.science/api/pith-number/32IANEKAPOEVZOPAN5BXJSSIIP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/32IANEKAPOEVZOPAN5BXJSSIIP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/32IANEKAPOEVZOPAN5BXJSSIIP/action/storage_attestation","attest_author":"https://pith.science/pith/32IANEKAPOEVZOPAN5BXJSSIIP/action/author_attestation","sign_citation":"https://pith.science/pith/32IANEKAPOEVZOPAN5BXJSSIIP/action/citation_signature","submit_replication":"https://pith.science/pith/32IANEKAPOEVZOPAN5BXJSSIIP/action/replication_record"}},"created_at":"2026-05-18T00:03:20.569916+00:00","updated_at":"2026-05-18T00:03:20.569916+00:00"}