{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1997:JRAKYTDMYNXKGRO7VNPNYRLIX6","short_pith_number":"pith:JRAKYTDM","schema_version":"1.0","canonical_sha256":"4c40ac4c6cc36ea345dfab5edc4568bfbc84364ecb50a1c3cd421e70f917c338","source":{"kind":"arxiv","id":"math/9707203","version":1},"attestation_state":"computed","paper":{"title":"Order polynomially complete lattices must be LARGE","license":"","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Martin Goldstern, Saharon Shelah","submitted_at":"1997-07-16T00:00:00Z","abstract_excerpt":"If L is an order polynomially complete lattice, (that is: every monotone function from L^n to L is induced by a lattice-theoretic polynomial) then the cardinality of L is a strongly inaccessible cardinal.  In particular, the existence of such lattices is not provable in ZFC, nor from ZFC+GCH.\n  Although the problem originates in algebra, the proof is purely set-theoretical.  The main tools are partition and canonisation theorems.\n  It is still open if the existence of infinite o.p.c. lattices can be refuted in ZFC."},"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":"math/9707203","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.LO","submitted_at":"1997-07-16T00:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"5bd5cb844c510078d77e9973587a2088ebe6e65d608ddf476965b443d7f35a42","abstract_canon_sha256":"5577f2bc90f7203c59cb61232df0ba1a31d54a3d553491cca9d82c743dd42f40"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:35.091199Z","signature_b64":"nSMUZREK3aGuqaAQHDCS4vz20nf6zSOUIJ7g3VfFSBTzIcmUUCvDe/h458/ydYflNuGDFJsubPctntZm8rKiCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c40ac4c6cc36ea345dfab5edc4568bfbc84364ecb50a1c3cd421e70f917c338","last_reissued_at":"2026-05-18T01:05:35.090485Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:35.090485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Order polynomially complete lattices must be LARGE","license":"","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Martin Goldstern, Saharon Shelah","submitted_at":"1997-07-16T00:00:00Z","abstract_excerpt":"If L is an order polynomially complete lattice, (that is: every monotone function from L^n to L is induced by a lattice-theoretic polynomial) then the cardinality of L is a strongly inaccessible cardinal.  In particular, the existence of such lattices is not provable in ZFC, nor from ZFC+GCH.\n  Although the problem originates in algebra, the proof is purely set-theoretical.  The main tools are partition and canonisation theorems.\n  It is still open if the existence of infinite o.p.c. lattices can be refuted in ZFC."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9707203","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":"math/9707203","created_at":"2026-05-18T01:05:35.090562+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/9707203v1","created_at":"2026-05-18T01:05:35.090562+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9707203","created_at":"2026-05-18T01:05:35.090562+00:00"},{"alias_kind":"pith_short_12","alias_value":"JRAKYTDMYNXK","created_at":"2026-05-18T12:25:48.327863+00:00"},{"alias_kind":"pith_short_16","alias_value":"JRAKYTDMYNXKGRO7","created_at":"2026-05-18T12:25:48.327863+00:00"},{"alias_kind":"pith_short_8","alias_value":"JRAKYTDM","created_at":"2026-05-18T12:25:48.327863+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/JRAKYTDMYNXKGRO7VNPNYRLIX6","json":"https://pith.science/pith/JRAKYTDMYNXKGRO7VNPNYRLIX6.json","graph_json":"https://pith.science/api/pith-number/JRAKYTDMYNXKGRO7VNPNYRLIX6/graph.json","events_json":"https://pith.science/api/pith-number/JRAKYTDMYNXKGRO7VNPNYRLIX6/events.json","paper":"https://pith.science/paper/JRAKYTDM"},"agent_actions":{"view_html":"https://pith.science/pith/JRAKYTDMYNXKGRO7VNPNYRLIX6","download_json":"https://pith.science/pith/JRAKYTDMYNXKGRO7VNPNYRLIX6.json","view_paper":"https://pith.science/paper/JRAKYTDM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/9707203&json=true","fetch_graph":"https://pith.science/api/pith-number/JRAKYTDMYNXKGRO7VNPNYRLIX6/graph.json","fetch_events":"https://pith.science/api/pith-number/JRAKYTDMYNXKGRO7VNPNYRLIX6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JRAKYTDMYNXKGRO7VNPNYRLIX6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JRAKYTDMYNXKGRO7VNPNYRLIX6/action/storage_attestation","attest_author":"https://pith.science/pith/JRAKYTDMYNXKGRO7VNPNYRLIX6/action/author_attestation","sign_citation":"https://pith.science/pith/JRAKYTDMYNXKGRO7VNPNYRLIX6/action/citation_signature","submit_replication":"https://pith.science/pith/JRAKYTDMYNXKGRO7VNPNYRLIX6/action/replication_record"}},"created_at":"2026-05-18T01:05:35.090562+00:00","updated_at":"2026-05-18T01:05:35.090562+00:00"}