{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:UXAAMBZ6A52ZWUTWUQIQNU7KSM","short_pith_number":"pith:UXAAMBZ6","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"},"canonical_sha256":"a5c006073e07759b5276a41106d3ea93342a762c7a2c4142df52e3dba059dc1b","source":{"kind":"arxiv","id":"2506.22206","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.22206","created_at":"2026-06-23T03:13:46Z"},{"alias_kind":"arxiv_version","alias_value":"2506.22206v6","created_at":"2026-06-23T03:13:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.22206","created_at":"2026-06-23T03:13:46Z"},{"alias_kind":"pith_short_12","alias_value":"UXAAMBZ6A52Z","created_at":"2026-06-23T03:13:46Z"},{"alias_kind":"pith_short_16","alias_value":"UXAAMBZ6A52ZWUTW","created_at":"2026-06-23T03:13:46Z"},{"alias_kind":"pith_short_8","alias_value":"UXAAMBZ6","created_at":"2026-06-23T03:13:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:UXAAMBZ6A52ZWUTWUQIQNU7KSM","target":"record","payload":{"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"},"canonical_sha256":"a5c006073e07759b5276a41106d3ea93342a762c7a2c4142df52e3dba059dc1b","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"},"source_kind":"arxiv","source_id":"2506.22206","source_version":6,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-23T03:13:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zYSlaOSNiwtP0hy6O55hRuHu72Oq1qI1Z0CL2KqlhxKJi8L2yX6E+aBfhnn7gg4AxGHmvbVbZto/eJ77qZfiBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T11:03:56.973354Z"},"content_sha256":"5616ce4e7274157aaf8323c8ff57445097fb36b28c42268c8e5fc7752fef5338","schema_version":"1.0","event_id":"sha256:5616ce4e7274157aaf8323c8ff57445097fb36b28c42268c8e5fc7752fef5338"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:UXAAMBZ6A52ZWUTWUQIQNU7KSM","target":"graph","payload":{"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"},"verdict_id":"8a7c54d1-7735-42b3-9401-84ab27ac4306"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-23T03:13:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7wF41Cs7Wtp0+At3cCO4qF2DQhMiqeZvJaUzl4lyE+Ca32js2yK22LKjWY7t1DbZZrZeeh7nNleU7ugpktoWAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T11:03:56.973800Z"},"content_sha256":"e9fc4d4ce610f5f5217ef65a56496d96ad6183ac9fefe6aa6632e4b93cc4d7ff","schema_version":"1.0","event_id":"sha256:e9fc4d4ce610f5f5217ef65a56496d96ad6183ac9fefe6aa6632e4b93cc4d7ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UXAAMBZ6A52ZWUTWUQIQNU7KSM/bundle.json","state_url":"https://pith.science/pith/UXAAMBZ6A52ZWUTWUQIQNU7KSM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UXAAMBZ6A52ZWUTWUQIQNU7KSM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-30T11:03:56Z","links":{"resolver":"https://pith.science/pith/UXAAMBZ6A52ZWUTWUQIQNU7KSM","bundle":"https://pith.science/pith/UXAAMBZ6A52ZWUTWUQIQNU7KSM/bundle.json","state":"https://pith.science/pith/UXAAMBZ6A52ZWUTWUQIQNU7KSM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UXAAMBZ6A52ZWUTWUQIQNU7KSM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:UXAAMBZ6A52ZWUTWUQIQNU7KSM","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":"95baa29bd02445a985d65f05fb15848aa9fbe55ab75a34ee3272bae435d80892","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2025-06-27T13:25:04Z","title_canon_sha256":"65f6e34ae258752c2eaf94def43baeb028b5e425dd880edcf88a604fdcd9ab14"},"schema_version":"1.0","source":{"id":"2506.22206","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.22206","created_at":"2026-06-23T03:13:46Z"},{"alias_kind":"arxiv_version","alias_value":"2506.22206v6","created_at":"2026-06-23T03:13:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.22206","created_at":"2026-06-23T03:13:46Z"},{"alias_kind":"pith_short_12","alias_value":"UXAAMBZ6A52Z","created_at":"2026-06-23T03:13:46Z"},{"alias_kind":"pith_short_16","alias_value":"UXAAMBZ6A52ZWUTW","created_at":"2026-06-23T03:13:46Z"},{"alias_kind":"pith_short_8","alias_value":"UXAAMBZ6","created_at":"2026-06-23T03:13:46Z"}],"graph_snapshots":[{"event_id":"sha256:e9fc4d4ce610f5f5217ef65a56496d96ad6183ac9fefe6aa6632e4b93cc4d7ff","target":"graph","created_at":"2026-06-23T03:13:46Z","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":"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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Every valid proof in this ordinal-annotated non-wellfounded system is computable."}],"snapshot_sha256":"993859c9b80efd5d360ec902213a12d3defe29a8dd096fcef2b5565fc5bdd098"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"18f575a99bf3b97985f03bc77a982822c4a40958fb2b6b0962d925d3e46f3aa2"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.22206/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Sebastian Enqvist","cross_cats":[],"headline":"Every valid proof in this ordinal-annotated non-wellfounded system is computable.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2025-06-27T13:25:04Z","title":"Computation by infinite descent made explicit"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.22206","kind":"arxiv","version":6},"verdict":{"created_at":"2026-05-19T08:14:28.907020Z","id":"8a7c54d1-7735-42b3-9401-84ab27ac4306","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"Every valid proof in this ordinal-annotated non-wellfounded system is computable.","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.","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."}},"verdict_id":"8a7c54d1-7735-42b3-9401-84ab27ac4306"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5616ce4e7274157aaf8323c8ff57445097fb36b28c42268c8e5fc7752fef5338","target":"record","created_at":"2026-06-23T03:13:46Z","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":"95baa29bd02445a985d65f05fb15848aa9fbe55ab75a34ee3272bae435d80892","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2025-06-27T13:25:04Z","title_canon_sha256":"65f6e34ae258752c2eaf94def43baeb028b5e425dd880edcf88a604fdcd9ab14"},"schema_version":"1.0","source":{"id":"2506.22206","kind":"arxiv","version":6}},"canonical_sha256":"a5c006073e07759b5276a41106d3ea93342a762c7a2c4142df52e3dba059dc1b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a5c006073e07759b5276a41106d3ea93342a762c7a2c4142df52e3dba059dc1b","first_computed_at":"2026-06-23T03:13:46.016634Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T03:13:46.016634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dw/Uy5y5SYtPpk/HAA9mqn7p8PP/hROPKBZ4gliOR+SaRrsM2zH0RXjkN//5DgW3J3oQfrTMBnl2ht81PJ6JCA==","signature_status":"signed_v1","signed_at":"2026-06-23T03:13:46.017048Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.22206","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5616ce4e7274157aaf8323c8ff57445097fb36b28c42268c8e5fc7752fef5338","sha256:e9fc4d4ce610f5f5217ef65a56496d96ad6183ac9fefe6aa6632e4b93cc4d7ff"],"state_sha256":"41b5dad0faa09983148e71f9f546a6968ad0a1b1cb8ba0344dcf960144966812"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ah2snEfEkBoJi7/HJT2boY+CUUwZYYAjSzdnGznVgGWgNXOkfEX3B5ks8cTdUppJ7kbzOmXSMWbH16mFGJCbBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T11:03:56.975921Z","bundle_sha256":"d33bb627519bfbc7e43ef08848fc0117b1eed3a625cea4c8d770b1ac38889aab"}}