{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:64YR4RE6KU4W27D3PO7C72WLQJ","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":"c1f36638adc08ff993f75a817ee7af2c779625cee9bf9f40eed941b7be5c2c6c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.MA","submitted_at":"2022-10-14T21:54:15Z","title_canon_sha256":"7e3d7de29376a0457fba00184164080fcc31c6c10bbcb86bd71e65589f2e127c"},"schema_version":"1.0","source":{"id":"2210.08128","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.08128","created_at":"2026-07-05T05:10:17Z"},{"alias_kind":"arxiv_version","alias_value":"2210.08128v2","created_at":"2026-07-05T05:10:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.08128","created_at":"2026-07-05T05:10:17Z"},{"alias_kind":"pith_short_12","alias_value":"64YR4RE6KU4W","created_at":"2026-07-05T05:10:17Z"},{"alias_kind":"pith_short_16","alias_value":"64YR4RE6KU4W27D3","created_at":"2026-07-05T05:10:17Z"},{"alias_kind":"pith_short_8","alias_value":"64YR4RE6","created_at":"2026-07-05T05:10:17Z"}],"graph_snapshots":[{"event_id":"sha256:56f5377f761fabcd30c722ee89c2f660838da7f345765a826646ac6b2699158a","target":"graph","created_at":"2026-07-05T05:10:17Z","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/2210.08128/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $L$ be a finite lattice and $\\mathcal{E}(L)$ be the set of join endomorphisms of $L$. We consider the problem of given $L$ and $f,g \\in \\mathcal{E}(L)$, finding the greatest lower bound $f \\sqcap_{{\\scriptsize \\mathcal{E}(L)}} g$ in the lattice $\\mathcal{E}(L)$. (1) We show that if $L$ is distributive, the problem can be solved in time $O(n)$ where $n=| L |$. The previous upper bound was $O(n^2)$. (2) We provide new algorithms for arbitrary lattices and give experimental evidence that they are significantly faster than the existing algorithm. (3) We characterize the standard notion of dist","authors_text":"Carlos Pinz\\'on, Frank Valencia, Santiago Quintero, Sergio Ram\\'irez","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.MA","submitted_at":"2022-10-14T21:54:15Z","title":"On the Computation of Distributed Knowledge as the Greatest Lower Bound of Knowledge"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.08128","kind":"arxiv","version":2},"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:2f6c4fe5588080a7c0547238a141488a1e241afbe5a6fe12ea9fe7cd737eacad","target":"record","created_at":"2026-07-05T05:10:17Z","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":"c1f36638adc08ff993f75a817ee7af2c779625cee9bf9f40eed941b7be5c2c6c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.MA","submitted_at":"2022-10-14T21:54:15Z","title_canon_sha256":"7e3d7de29376a0457fba00184164080fcc31c6c10bbcb86bd71e65589f2e127c"},"schema_version":"1.0","source":{"id":"2210.08128","kind":"arxiv","version":2}},"canonical_sha256":"f7311e449e55396d7c7b7bbe2feacb8241b59955be773ae795df0cb2b0e3b438","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7311e449e55396d7c7b7bbe2feacb8241b59955be773ae795df0cb2b0e3b438","first_computed_at":"2026-07-05T05:10:17.434489Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:10:17.434489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t/XWPIoRNeXJBTrtuTxdjSIS00+BVL8yT6zQ0EiFoUJMGrOUISMqsbWx6Gg6CMAfET8me+WsjNHZZfJ3Tz6FCA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:10:17.434972Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.08128","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f6c4fe5588080a7c0547238a141488a1e241afbe5a6fe12ea9fe7cd737eacad","sha256:56f5377f761fabcd30c722ee89c2f660838da7f345765a826646ac6b2699158a"],"state_sha256":"0e4cb142cd89e8fa01a65cf536c5426124688a62e5dbfdd2944fa5e04ca3c3bb"}