{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:43G77UWRMLZCVKT7LLLHJK76W7","short_pith_number":"pith:43G77UWR","schema_version":"1.0","canonical_sha256":"e6cdffd2d162f22aaa7f5ad674abfeb7ed6e767e4c6d46746cf5af0ad6686dd0","source":{"kind":"arxiv","id":"2605.14086","version":1},"attestation_state":"computed","paper":{"title":"What can Topology tell us about Logical Complexity?","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","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.","cross_cats":["math.CT"],"primary_cat":"math.LO","authors_text":"Ming Ng, Takayuki Kihara","submitted_at":"2026-05-13T20:12:08Z","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}"},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.14086","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.LO","submitted_at":"2026-05-13T20:12:08Z","cross_cats_sorted":["math.CT"],"title_canon_sha256":"96d9641c5a1dfb4656ac51f110b42f2768f8d755c8caadc14a3b42f99878fee1","abstract_canon_sha256":"3d6fa0990901aa13245bc27e6d133fb55d79b9833a80bdd6473762834ee0dc2b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:12.262452Z","signature_b64":"SFDKOSmTF0sfcD65Gu2mODKzxbdVx0Y3bzwK3YQgF3088feoD7bvL7OWlKhzxudeWcpX9OJcArMv0fbQ4akXBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6cdffd2d162f22aaa7f5ad674abfeb7ed6e767e4c6d46746cf5af0ad6686dd0","last_reissued_at":"2026-05-17T23:39:12.261971Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:12.261971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"What can Topology tell us about Logical Complexity?","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","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.","cross_cats":["math.CT"],"primary_cat":"math.LO","authors_text":"Ming Ng, Takayuki Kihara","submitted_at":"2026-05-13T20:12:08Z","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}"},"claims":{"count":3,"items":[{"kind":"strongest_claim","text":"a computable variant of the gamified Katětov order is isomorphic to the original ≤_LT-order","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","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.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","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.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"}],"snapshot_sha256":"798209be55e4d94c2ec44d2d68633834b64c70c9030b2b668cc282c84c9006ba"},"source":{"id":"2605.14086","kind":"arxiv","version":1},"verdict":{"id":"739ad3aa-b671-489e-bf1e-2eb202c5363e","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T02:17:25.368934Z","strongest_claim":"a computable variant of the gamified Katětov order is isomorphic to the original ≤_LT-order","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","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.","pith_extraction_headline":""},"references":{"count":145,"sample":[{"doi":"","year":null,"title":"Orderings of ultrafilters , year =","work_id":"6007f3e8-0f52-4770-9308-c2d8b74cf201","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1971,"title":"Partial orders on the types in N , url =","work_id":"4f1a54e2-d720-49b3-9804-412b6cbaaea9","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Takayuki Kihara and Ming Ng , date-added =. The","work_id":"e944591f-7236-4ba0-a32d-1ed5e930c23e","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1016/j.topol.2013.08.007","year":2013,"title":"Filip. On. 2013 , bdsk-url-1 =. doi:10.1016/j.topol.2013.08.007 , journal =","work_id":"bdbd02f6-468a-482d-9e14-3dcb36f7b3e5","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1017/jsl.2024.8","year":2024,"title":"A UNIFIED APPROACH TO","work_id":"596aa850-a8cb-46ec-a3da-044e01ac19eb","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":145,"snapshot_sha256":"622230e33d46d68e8d86b2b58444a54cf797746a1485ffb6204887ecc94fbead","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"b4e8b40383b97990675ece57ce0118be2e3e27dc4840325e16c1de6ac6cd7726"},"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":"2605.14086","created_at":"2026-05-17T23:39:12.262034+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.14086v1","created_at":"2026-05-17T23:39:12.262034+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14086","created_at":"2026-05-17T23:39:12.262034+00:00"},{"alias_kind":"pith_short_12","alias_value":"43G77UWRMLZC","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"43G77UWRMLZCVKT7","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"43G77UWR","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/43G77UWRMLZCVKT7LLLHJK76W7","json":"https://pith.science/pith/43G77UWRMLZCVKT7LLLHJK76W7.json","graph_json":"https://pith.science/api/pith-number/43G77UWRMLZCVKT7LLLHJK76W7/graph.json","events_json":"https://pith.science/api/pith-number/43G77UWRMLZCVKT7LLLHJK76W7/events.json","paper":"https://pith.science/paper/43G77UWR"},"agent_actions":{"view_html":"https://pith.science/pith/43G77UWRMLZCVKT7LLLHJK76W7","download_json":"https://pith.science/pith/43G77UWRMLZCVKT7LLLHJK76W7.json","view_paper":"https://pith.science/paper/43G77UWR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.14086&json=true","fetch_graph":"https://pith.science/api/pith-number/43G77UWRMLZCVKT7LLLHJK76W7/graph.json","fetch_events":"https://pith.science/api/pith-number/43G77UWRMLZCVKT7LLLHJK76W7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/43G77UWRMLZCVKT7LLLHJK76W7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/43G77UWRMLZCVKT7LLLHJK76W7/action/storage_attestation","attest_author":"https://pith.science/pith/43G77UWRMLZCVKT7LLLHJK76W7/action/author_attestation","sign_citation":"https://pith.science/pith/43G77UWRMLZCVKT7LLLHJK76W7/action/citation_signature","submit_replication":"https://pith.science/pith/43G77UWRMLZCVKT7LLLHJK76W7/action/replication_record"}},"created_at":"2026-05-17T23:39:12.262034+00:00","updated_at":"2026-05-17T23:39:12.262034+00:00"}