{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:UXAAMBZ6A52ZWUTWUQIQNU7KSM","short_pith_number":"pith:UXAAMBZ6","schema_version":"1.0","canonical_sha256":"a5c006073e07759b5276a41106d3ea93342a762c7a2c4142df52e3dba059dc1b","source":{"kind":"arxiv","id":"2506.22206","version":6},"attestation_state":"computed","paper":{"title":"Computation by infinite descent made explicit","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Every valid proof in this ordinal-annotated non-wellfounded system is computable.","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Sebastian Enqvist","submitted_at":"2025-06-27T13:25:04Z","abstract_excerpt":"We introduce a non-wellfounded proof system for intuitionistic logic extended with inductive and co-inductive definitions, based on a syntax in which fixpoint formulas are annotated with explicit variables for ordinals. We explore the computational content of this system, in particular we introduce a notion of computability and show that every valid proof is computable. As a consequence, we obtain a normalization result for proofs of what we call finitary formulas. A special case of this result is that every proof of a sequent of the appropriate form represents a unique function on natural num"},"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":false,"formal_links_present":true},"canonical_record":{"source":{"id":"2506.22206","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2025-06-27T13:25:04Z","cross_cats_sorted":[],"title_canon_sha256":"65f6e34ae258752c2eaf94def43baeb028b5e425dd880edcf88a604fdcd9ab14","abstract_canon_sha256":"95baa29bd02445a985d65f05fb15848aa9fbe55ab75a34ee3272bae435d80892"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T03:13:46.017048Z","signature_b64":"dw/Uy5y5SYtPpk/HAA9mqn7p8PP/hROPKBZ4gliOR+SaRrsM2zH0RXjkN//5DgW3J3oQfrTMBnl2ht81PJ6JCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5c006073e07759b5276a41106d3ea93342a762c7a2c4142df52e3dba059dc1b","last_reissued_at":"2026-06-23T03:13:46.016634Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T03:13:46.016634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computation by infinite descent made explicit","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Every valid proof in this ordinal-annotated non-wellfounded system is computable.","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Sebastian Enqvist","submitted_at":"2025-06-27T13:25:04Z","abstract_excerpt":"We introduce a non-wellfounded proof system for intuitionistic logic extended with inductive and co-inductive definitions, based on a syntax in which fixpoint formulas are annotated with explicit variables for ordinals. We explore the computational content of this system, in particular we introduce a notion of computability and show that every valid proof is computable. As a consequence, we obtain a normalization result for proofs of what we call finitary formulas. A special case of this result is that every proof of a sequent of the appropriate form represents a unique function on natural num"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Every valid proof in the system is computable; as a consequence, every proof of a sequent of the appropriate form represents a unique function on natural numbers for finitary formulas.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The definition of computability for proofs in the non-wellfounded system with ordinal annotations is sufficient to capture the computational content without additional restrictions on the ordinal variables or the interaction between inductive and co-inductive rules.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Presents an ordinal-annotated non-wellfounded proof system for intuitionistic logic with fixpoints, establishes computability and normalization results for finitary formulas, and derives a categorical semantics with algebras and coalgebras.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Every valid proof in this ordinal-annotated non-wellfounded system is computable.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"993859c9b80efd5d360ec902213a12d3defe29a8dd096fcef2b5565fc5bdd098"},"source":{"id":"2506.22206","kind":"arxiv","version":6},"verdict":{"id":"8a7c54d1-7735-42b3-9401-84ab27ac4306","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T08:14:28.907020Z","strongest_claim":"Every valid proof in the system is computable; as a consequence, every proof of a sequent of the appropriate form represents a unique function on natural numbers for finitary formulas.","one_line_summary":"Presents an ordinal-annotated non-wellfounded proof system for intuitionistic logic with fixpoints, establishes computability and normalization results for finitary formulas, and derives a categorical semantics with algebras and coalgebras.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The definition of computability for proofs in the non-wellfounded system with ordinal annotations is sufficient to capture the computational content without additional restrictions on the ordinal variables or the interaction between inductive and co-inductive rules.","pith_extraction_headline":"Every valid proof in this ordinal-annotated non-wellfounded system is computable."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.22206/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"18f575a99bf3b97985f03bc77a982822c4a40958fb2b6b0962d925d3e46f3aa2"},"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":"2506.22206","created_at":"2026-06-23T03:13:46.016692+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.22206v6","created_at":"2026-06-23T03:13:46.016692+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.22206","created_at":"2026-06-23T03:13:46.016692+00:00"},{"alias_kind":"pith_short_12","alias_value":"UXAAMBZ6A52Z","created_at":"2026-06-23T03:13:46.016692+00:00"},{"alias_kind":"pith_short_16","alias_value":"UXAAMBZ6A52ZWUTW","created_at":"2026-06-23T03:13:46.016692+00:00"},{"alias_kind":"pith_short_8","alias_value":"UXAAMBZ6","created_at":"2026-06-23T03:13:46.016692+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/UXAAMBZ6A52ZWUTWUQIQNU7KSM","json":"https://pith.science/pith/UXAAMBZ6A52ZWUTWUQIQNU7KSM.json","graph_json":"https://pith.science/api/pith-number/UXAAMBZ6A52ZWUTWUQIQNU7KSM/graph.json","events_json":"https://pith.science/api/pith-number/UXAAMBZ6A52ZWUTWUQIQNU7KSM/events.json","paper":"https://pith.science/paper/UXAAMBZ6"},"agent_actions":{"view_html":"https://pith.science/pith/UXAAMBZ6A52ZWUTWUQIQNU7KSM","download_json":"https://pith.science/pith/UXAAMBZ6A52ZWUTWUQIQNU7KSM.json","view_paper":"https://pith.science/paper/UXAAMBZ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.22206&json=true","fetch_graph":"https://pith.science/api/pith-number/UXAAMBZ6A52ZWUTWUQIQNU7KSM/graph.json","fetch_events":"https://pith.science/api/pith-number/UXAAMBZ6A52ZWUTWUQIQNU7KSM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UXAAMBZ6A52ZWUTWUQIQNU7KSM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UXAAMBZ6A52ZWUTWUQIQNU7KSM/action/storage_attestation","attest_author":"https://pith.science/pith/UXAAMBZ6A52ZWUTWUQIQNU7KSM/action/author_attestation","sign_citation":"https://pith.science/pith/UXAAMBZ6A52ZWUTWUQIQNU7KSM/action/citation_signature","submit_replication":"https://pith.science/pith/UXAAMBZ6A52ZWUTWUQIQNU7KSM/action/replication_record"}},"created_at":"2026-06-23T03:13:46.016692+00:00","updated_at":"2026-06-23T03:13:46.016692+00:00"}