{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:KAJQGJRPNJMIHT2UQWXIRFVNJC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3a8700319d27614a1ccc3c80f9756994de5e64826a7236d35c2412afb2ea28b1","cross_cats_sorted":["math.RA"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.MA","submitted_at":"2022-11-01T22:56:47Z","title_canon_sha256":"43a267150eea61cfa199d63b3de0b1f4eda44ed00333ae412482545e971a446e"},"schema_version":"1.0","source":{"id":"2211.00781","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.00781","created_at":"2026-07-05T05:12:34Z"},{"alias_kind":"arxiv_version","alias_value":"2211.00781v1","created_at":"2026-07-05T05:12:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.00781","created_at":"2026-07-05T05:12:34Z"},{"alias_kind":"pith_short_12","alias_value":"KAJQGJRPNJMI","created_at":"2026-07-05T05:12:34Z"},{"alias_kind":"pith_short_16","alias_value":"KAJQGJRPNJMIHT2U","created_at":"2026-07-05T05:12:34Z"},{"alias_kind":"pith_short_8","alias_value":"KAJQGJRP","created_at":"2026-07-05T05:12:34Z"}],"graph_snapshots":[{"event_id":"sha256:46404383c0753f3e45185205ce6e4fbb57c8ec09f0c3d7c1c94567abc5620c5c","target":"graph","created_at":"2026-07-05T05:12:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2211.00781/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Structures involving a lattice and join-endomorphisms on it are ubiquitous in computer science. We study the cardinality of the set $\\mathcal{E}(L)$ of all join-endomorphisms of a given finite lattice $L$. In particular, we show for $\\mathbf{M}_n$, the discrete order of $n$ elements extended with top and bottom, $| \\mathcal{E}(\\mathbf{M}_n) | =n!\\mathcal{L}_n(-1)+(n+1)^2$ where $\\mathcal{L}_n(x)$ is the Laguerre polynomial of degree $n$. We also study the following problem: Given a lattice $L$ of size $n$ and a set $S\\subseteq \\mathcal{E}(L)$ of size $m$, find the greatest lower bound ${\\large","authors_text":"Camilo Rueda, Carlos Pinz\\'on, Frank Valencia, Santiago Quintero, Sergio Ram\\'irez","cross_cats":["math.RA"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.MA","submitted_at":"2022-11-01T22:56:47Z","title":"Counting and Computing Join-Endomorphisms in Lattices (Revisited)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.00781","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fd22fa6d01136441983f9827497af58ae6e4fefb2e237861fe632da4eaf1f272","target":"record","created_at":"2026-07-05T05:12:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3a8700319d27614a1ccc3c80f9756994de5e64826a7236d35c2412afb2ea28b1","cross_cats_sorted":["math.RA"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.MA","submitted_at":"2022-11-01T22:56:47Z","title_canon_sha256":"43a267150eea61cfa199d63b3de0b1f4eda44ed00333ae412482545e971a446e"},"schema_version":"1.0","source":{"id":"2211.00781","kind":"arxiv","version":1}},"canonical_sha256":"501303262f6a5883cf5485ae8896ad48a47f29f11a2197223f88c637ebe3a9f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"501303262f6a5883cf5485ae8896ad48a47f29f11a2197223f88c637ebe3a9f3","first_computed_at":"2026-07-05T05:12:34.803391Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:12:34.803391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9+7HKXKs+EgU3TFESDwPKyNBcFUcDdqiuTnQAU7m+gCfyacBz6CSUTQOrATLKaRJwKpKV0iHPdPYApT8go/vDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:12:34.803880Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.00781","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd22fa6d01136441983f9827497af58ae6e4fefb2e237861fe632da4eaf1f272","sha256:46404383c0753f3e45185205ce6e4fbb57c8ec09f0c3d7c1c94567abc5620c5c"],"state_sha256":"b631e791023342b6e231613e242ca58c55fb77092af61c873a2e64cca3a7c392"}