{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:43G77UWRMLZCVKT7LLLHJK76W7","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":"3d6fa0990901aa13245bc27e6d133fb55d79b9833a80bdd6473762834ee0dc2b","cross_cats_sorted":["math.CT"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.LO","submitted_at":"2026-05-13T20:12:08Z","title_canon_sha256":"96d9641c5a1dfb4656ac51f110b42f2768f8d755c8caadc14a3b42f99878fee1"},"schema_version":"1.0","source":{"id":"2605.14086","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14086","created_at":"2026-05-17T23:39:12Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14086v1","created_at":"2026-05-17T23:39:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14086","created_at":"2026-05-17T23:39:12Z"},{"alias_kind":"pith_short_12","alias_value":"43G77UWRMLZC","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"43G77UWRMLZCVKT7","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"43G77UWR","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:fb2683f4139b4e233493c0d1b2d7894e1dd02753a2e75f8dae2be669e60d8832","target":"graph","created_at":"2026-05-17T23:39:12Z","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":3,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"a computable variant of the gamified Katětov order is isomorphic to the original ≤_LT-order"},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the gamified Katětov order, closed under well-founded iterations of Fubini powers, precisely captures the combinatorial complexity shifts already present in the Lawvere-Tierney order."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A computable variant of the gamified Katětov order on filters is isomorphic to the Lawvere-Tierney order, linking combinatorial complexity measures to computability in topos theory."}],"snapshot_sha256":"798209be55e4d94c2ec44d2d68633834b64c70c9030b2b668cc282c84c9006ba"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"b4e8b40383b97990675ece57ce0118be2e3e27dc4840325e16c1de6ac6cd7726"},"paper":{"abstract_excerpt":"In the 1980s, category theorists introduced the Lawvere-Tierney $(\\leq_{\\mathrm{LT}})$ order in the Effective Topos, known to effectively embed the Turing degrees. Understanding its structure is a longstanding open problem in the area. In particular, there was an informal sense that the $\\leq_{\\mathrm{LT}}$-order reflects certain shifts in combinatorial complexity, but a precise characterisation remained elusive for some time.\n  Recent work by the authors has substantially clarified the picture. In arXiv:2602.08138, the authors introduced a game-theoretic (''gamified'') version of the Kat\\v{e}","authors_text":"Ming Ng, Takayuki Kihara","cross_cats":["math.CT"],"headline":"A computable variant of the gamified Katětov order on filters is isomorphic to the Lawvere-Tierney order, linking combinatorial complexity measures to computability in topos theory.","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.LO","submitted_at":"2026-05-13T20:12:08Z","title":"What can Topology tell us about Logical Complexity?"},"references":{"count":145,"internal_anchors":0,"resolved_work":145,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Orderings of ultrafilters , year =","work_id":"6007f3e8-0f52-4770-9308-c2d8b74cf201","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Partial orders on the types in N , url =","work_id":"4f1a54e2-d720-49b3-9804-412b6cbaaea9","year":1971},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Takayuki Kihara and Ming Ng , date-added =. The","work_id":"e944591f-7236-4ba0-a32d-1ed5e930c23e","year":null},{"cited_arxiv_id":"","doi":"10.1016/j.topol.2013.08.007","is_internal_anchor":false,"ref_index":4,"title":"Filip. On. 2013 , bdsk-url-1 =. doi:10.1016/j.topol.2013.08.007 , journal =","work_id":"bdbd02f6-468a-482d-9e14-3dcb36f7b3e5","year":2013},{"cited_arxiv_id":"","doi":"10.1017/jsl.2024.8","is_internal_anchor":false,"ref_index":5,"title":"A UNIFIED APPROACH TO","work_id":"596aa850-a8cb-46ec-a3da-044e01ac19eb","year":2024}],"snapshot_sha256":"622230e33d46d68e8d86b2b58444a54cf797746a1485ffb6204887ecc94fbead"},"source":{"id":"2605.14086","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T02:17:25.368934Z","id":"739ad3aa-b671-489e-bf1e-2eb202c5363e","model_set":{"reader":"grok-4.3"},"one_line_summary":"A computable variant of the gamified Katětov order on filters is isomorphic to the Lawvere-Tierney order, linking combinatorial complexity measures to computability in topos theory.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"","strongest_claim":"a computable variant of the gamified Katětov order is isomorphic to the original ≤_LT-order","weakest_assumption":"That the gamified Katětov order, closed under well-founded iterations of Fubini powers, precisely captures the combinatorial complexity shifts already present in the Lawvere-Tierney order."}},"verdict_id":"739ad3aa-b671-489e-bf1e-2eb202c5363e"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:57f40ca60dfc3fdf1112837c41f193c605d3d5d2723561a9c849cd48cb36f229","target":"record","created_at":"2026-05-17T23:39:12Z","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":"3d6fa0990901aa13245bc27e6d133fb55d79b9833a80bdd6473762834ee0dc2b","cross_cats_sorted":["math.CT"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.LO","submitted_at":"2026-05-13T20:12:08Z","title_canon_sha256":"96d9641c5a1dfb4656ac51f110b42f2768f8d755c8caadc14a3b42f99878fee1"},"schema_version":"1.0","source":{"id":"2605.14086","kind":"arxiv","version":1}},"canonical_sha256":"e6cdffd2d162f22aaa7f5ad674abfeb7ed6e767e4c6d46746cf5af0ad6686dd0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6cdffd2d162f22aaa7f5ad674abfeb7ed6e767e4c6d46746cf5af0ad6686dd0","first_computed_at":"2026-05-17T23:39:12.261971Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:12.261971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SFDKOSmTF0sfcD65Gu2mODKzxbdVx0Y3bzwK3YQgF3088feoD7bvL7OWlKhzxudeWcpX9OJcArMv0fbQ4akXBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:12.262452Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14086","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57f40ca60dfc3fdf1112837c41f193c605d3d5d2723561a9c849cd48cb36f229","sha256:fb2683f4139b4e233493c0d1b2d7894e1dd02753a2e75f8dae2be669e60d8832"],"state_sha256":"244f07f5fbea4884aa600e346d190d18384a5ac8950161e4e0b52468e6bab234"}