{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:QYFIF5VUQ2Z6JDXNTBMZONPG5A","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":"2fb1d475a8792b7d910c495d7a6c9728350ab302fb5e67e811e7e6fdded57b3f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-15T06:38:43Z","title_canon_sha256":"a39d5c07f055380908aa3ae0f884aa3cbb9d4b912d58011a286ac22eb74c139a"},"schema_version":"1.0","source":{"id":"2605.15664","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15664","created_at":"2026-05-20T00:01:11Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15664v1","created_at":"2026-05-20T00:01:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15664","created_at":"2026-05-20T00:01:11Z"},{"alias_kind":"pith_short_12","alias_value":"QYFIF5VUQ2Z6","created_at":"2026-05-20T00:01:11Z"},{"alias_kind":"pith_short_16","alias_value":"QYFIF5VUQ2Z6JDXN","created_at":"2026-05-20T00:01:11Z"},{"alias_kind":"pith_short_8","alias_value":"QYFIF5VU","created_at":"2026-05-20T00:01:11Z"}],"graph_snapshots":[{"event_id":"sha256:9ac3e371f46d4bd8a77fd012f8a111a91412cd04266c519c501a688550c8d7c4","target":"graph","created_at":"2026-05-20T00:01:11Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"A coalgebra satisfies the GTC if and only if its image under a suitable adjoint is recursive; under an appropriate assumption on the given semantic algebra this yields soundness, that is, every proof admits a unique coalgebra-to-algebra morphism."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The paper relies on an appropriate assumption on the given semantic algebra that guarantees the existence of the unique coalgebra-to-algebra morphism once recursiveness is established (stated in the paragraph following the main theorem on recursive coalgebras)."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The paper shows that a derivation graph satisfies the global trace condition if and only if its image under a suitable adjoint is a recursive coalgebra, yielding soundness under an assumption on the semantic algebra."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Non-wellfounded proofs satisfy the global trace condition exactly when a related coalgebra is recursive, which ensures soundness through a unique semantic morphism."}],"snapshot_sha256":"740f1dd0f2c32a9cda143ab4e336117d2f81aef52d77340800ae750c520693e0"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"604aaffaae8a7e4e1562e666f2fec96f94fafe7cae75566c84b9fd190cef9b4b"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T20:01:19.245559Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T19:41:03.326421Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T19:33:35.307236Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T17:21:56.071008Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.15664/integrity.json","findings":[],"snapshot_sha256":"fed011e264beaa182296917c1693b4639d80d0fe4ed68fc7cde3396233cd1327","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Non-wellfounded proof systems impose a global condition called the global trace condition (GTC) on a derivation tree to ensure soundness. Providing a categorical characterisation of the GTC that guarantees soundness remains challenging due to the global, non-compositional nature of these conditions and the infinitary structure of non-wellfounded proofs. We develop a coalgebraic framework for non-wellfounded proof systems where derivation trees are modelled as coalgebras of generalised polynomial functors on presheaves. Since the GTC is a constraint on infinite paths in derivation graphs, we em","authors_text":"Mayuko Kori","cross_cats":[],"headline":"Non-wellfounded proofs satisfy the global trace condition exactly when a related coalgebra is recursive, which ensures soundness through a unique semantic morphism.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-15T06:38:43Z","title":"Coalgebraic Non-Wellfounded Proofs: Recursiveness and GTC"},"references":{"count":38,"internal_anchors":0,"resolved_work":38,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Free algebras and automata realizations in the language of categories","work_id":"fd3ffabd-e095-4268-bf23-1ec2942845b0","year":1974},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Bahareh Afshari and Graham E. Leigh. Cut-free completeness for modal mu-calculus. In LICS , pages 1--12. IEEE Computer Society, 2017","work_id":"1b51fb9d-dbf1-410d-a9f4-f606270c157a","year":2017},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Recursive coalgebras of finitary functors","work_id":"01dc864f-15e1-41c3-97e4-1ca9897433f8","year":2007},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Jir \\' Ad \\' a mek, Stefan Milius, and Lawrence S. Moss. Fixed points of functors. J. Log. Algebraic Methods Program. , 95:41--81, 2018","work_id":"96f20124-b2bd-4eb4-970b-d2865503158a","year":2018},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Jir \\' Ad \\' a mek, Stefan Milius, and Lawrence S. Moss. On well-founded and recursive coalgebras. In Jean Goubault - Larrecq and Barbara K \\\" o nig, editors, Foundations of Software Science and Compu","work_id":"0825a2a0-6b4d-435b-bcd6-66d87985912a","year":2020}],"snapshot_sha256":"88aa7d2e55ed8d12c5785dfe56fc0ec0ff31add08e6a156d9d8547d500ca018a"},"source":{"id":"2605.15664","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T19:33:32.130039Z","id":"3708fd6b-4756-4c28-93fd-3acdf521dd24","model_set":{"reader":"grok-4.3"},"one_line_summary":"The paper shows that a derivation graph satisfies the global trace condition if and only if its image under a suitable adjoint is a recursive coalgebra, yielding soundness under an assumption on the semantic algebra.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Non-wellfounded proofs satisfy the global trace condition exactly when a related coalgebra is recursive, which ensures soundness through a unique semantic morphism.","strongest_claim":"A coalgebra satisfies the GTC if and only if its image under a suitable adjoint is recursive; under an appropriate assumption on the given semantic algebra this yields soundness, that is, every proof admits a unique coalgebra-to-algebra morphism.","weakest_assumption":"The paper relies on an appropriate assumption on the given semantic algebra that guarantees the existence of the unique coalgebra-to-algebra morphism once recursiveness is established (stated in the paragraph following the main theorem on recursive coalgebras)."}},"verdict_id":"3708fd6b-4756-4c28-93fd-3acdf521dd24"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8613c2da0a8e304c9eae0d581e15b2569e68d6e4d752910a7ce78e1c9daad7f2","target":"record","created_at":"2026-05-20T00:01:11Z","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":"2fb1d475a8792b7d910c495d7a6c9728350ab302fb5e67e811e7e6fdded57b3f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-15T06:38:43Z","title_canon_sha256":"a39d5c07f055380908aa3ae0f884aa3cbb9d4b912d58011a286ac22eb74c139a"},"schema_version":"1.0","source":{"id":"2605.15664","kind":"arxiv","version":1}},"canonical_sha256":"860a82f6b486b3e48eed98599735e6e80f2f06bef13e5551b210a430c6437f28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"860a82f6b486b3e48eed98599735e6e80f2f06bef13e5551b210a430c6437f28","first_computed_at":"2026-05-20T00:01:11.064670Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:11.064670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gFMWSydTJUPuZI8UiekApzS+MWlTSjfDxbjvg/DhT+IrrMZ3s2JLuHhL4ju7ZJpLY8sj4nf3P7ZXu9/2Vn3AAg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:11.065627Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15664","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8613c2da0a8e304c9eae0d581e15b2569e68d6e4d752910a7ce78e1c9daad7f2","sha256:9ac3e371f46d4bd8a77fd012f8a111a91412cd04266c519c501a688550c8d7c4"],"state_sha256":"17dd66b0b6bc7597926d0369e2dbd7299b10d474f23e0dd3e909e645a30a6894"}