{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DU7YRWPHFIYCHGOPSHKKJGONZG","short_pith_number":"pith:DU7YRWPH","schema_version":"1.0","canonical_sha256":"1d3f88d9e72a302399cf91d4a499cdc98e097166a72ea1d25d05d8d8dd9769fc","source":{"kind":"arxiv","id":"1712.06117","version":1},"attestation_state":"computed","paper":{"title":"A note on finite lattices with many congruences","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.RA","authors_text":"G\\'abor Cz\\'edli","submitted_at":"2017-12-17T14:05:38Z","abstract_excerpt":"By a twenty year old result of Ralph Freese, an $n$-element lattice $L$ has at most $2^{n-1}$ congruences. We prove that if $L$ has less than $2^{n-1}$ congruences, then it has at most $2^{n-2}$ congruences. Also, we describe the $n$-element lattices with exactly $2^{n-2}$ congruences."},"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":"1712.06117","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.RA","submitted_at":"2017-12-17T14:05:38Z","cross_cats_sorted":[],"title_canon_sha256":"e0b87a8465076fbfc5573be9684e0ac879f2020a3febbc27e7c713c367b50188","abstract_canon_sha256":"4de013894000a838604012f159e64242a179a881ba9c11ddad88def350dc7e46"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:51.046279Z","signature_b64":"N3lwacIiWr1CSRbGnyJDzAJ8EPtSK1yNDpVV9WbtZ8gIxyX+DT3oTIbtU+8yht01Snzeyqq3+6l6IvqLmWGMBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d3f88d9e72a302399cf91d4a499cdc98e097166a72ea1d25d05d8d8dd9769fc","last_reissued_at":"2026-05-18T00:27:51.045899Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:51.045899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on finite lattices with many congruences","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.RA","authors_text":"G\\'abor Cz\\'edli","submitted_at":"2017-12-17T14:05:38Z","abstract_excerpt":"By a twenty year old result of Ralph Freese, an $n$-element lattice $L$ has at most $2^{n-1}$ congruences. We prove that if $L$ has less than $2^{n-1}$ congruences, then it has at most $2^{n-2}$ congruences. Also, we describe the $n$-element lattices with exactly $2^{n-2}$ congruences."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06117","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":"1712.06117","created_at":"2026-05-18T00:27:51.045948+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.06117v1","created_at":"2026-05-18T00:27:51.045948+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06117","created_at":"2026-05-18T00:27:51.045948+00:00"},{"alias_kind":"pith_short_12","alias_value":"DU7YRWPHFIYC","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"DU7YRWPHFIYCHGOP","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"DU7YRWPH","created_at":"2026-05-18T12:31:12.930513+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/DU7YRWPHFIYCHGOPSHKKJGONZG","json":"https://pith.science/pith/DU7YRWPHFIYCHGOPSHKKJGONZG.json","graph_json":"https://pith.science/api/pith-number/DU7YRWPHFIYCHGOPSHKKJGONZG/graph.json","events_json":"https://pith.science/api/pith-number/DU7YRWPHFIYCHGOPSHKKJGONZG/events.json","paper":"https://pith.science/paper/DU7YRWPH"},"agent_actions":{"view_html":"https://pith.science/pith/DU7YRWPHFIYCHGOPSHKKJGONZG","download_json":"https://pith.science/pith/DU7YRWPHFIYCHGOPSHKKJGONZG.json","view_paper":"https://pith.science/paper/DU7YRWPH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.06117&json=true","fetch_graph":"https://pith.science/api/pith-number/DU7YRWPHFIYCHGOPSHKKJGONZG/graph.json","fetch_events":"https://pith.science/api/pith-number/DU7YRWPHFIYCHGOPSHKKJGONZG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DU7YRWPHFIYCHGOPSHKKJGONZG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DU7YRWPHFIYCHGOPSHKKJGONZG/action/storage_attestation","attest_author":"https://pith.science/pith/DU7YRWPHFIYCHGOPSHKKJGONZG/action/author_attestation","sign_citation":"https://pith.science/pith/DU7YRWPHFIYCHGOPSHKKJGONZG/action/citation_signature","submit_replication":"https://pith.science/pith/DU7YRWPHFIYCHGOPSHKKJGONZG/action/replication_record"}},"created_at":"2026-05-18T00:27:51.045948+00:00","updated_at":"2026-05-18T00:27:51.045948+00:00"}