{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:CRS7O6MVF7BHFEKKWK5NKDHAQY","short_pith_number":"pith:CRS7O6MV","canonical_record":{"source":{"id":"2602.10844","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-02-11T13:31:03Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"7495732a5c66a02602c17f68061ee20505d0146e99542adeaf853673e5fced8e","abstract_canon_sha256":"2eb98fce30c3b193f756f46999c1ceadede533833590168e24ab9b2b5a444d09"},"schema_version":"1.0"},"canonical_sha256":"1465f779952fc272914ab2bad50ce0860cc19202bd6b776d3da1a59ada402ada","source":{"kind":"arxiv","id":"2602.10844","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.10844","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"arxiv_version","alias_value":"2602.10844v2","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.10844","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"pith_short_12","alias_value":"CRS7O6MVF7BH","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"CRS7O6MVF7BHFEKK","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"CRS7O6MV","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:CRS7O6MVF7BHFEKKWK5NKDHAQY","target":"record","payload":{"canonical_record":{"source":{"id":"2602.10844","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-02-11T13:31:03Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"7495732a5c66a02602c17f68061ee20505d0146e99542adeaf853673e5fced8e","abstract_canon_sha256":"2eb98fce30c3b193f756f46999c1ceadede533833590168e24ab9b2b5a444d09"},"schema_version":"1.0"},"canonical_sha256":"1465f779952fc272914ab2bad50ce0860cc19202bd6b776d3da1a59ada402ada","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:31.225189Z","signature_b64":"H8lbz38y8e7eTORr+bJQ0wE577jyjR6x7MvGEicy0veubfoOyzpt+xXIyxoYFCsQpSH+ifUcMsNo/R3Rtf/DCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1465f779952fc272914ab2bad50ce0860cc19202bd6b776d3da1a59ada402ada","last_reissued_at":"2026-05-18T02:44:31.224621Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:31.224621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2602.10844","source_version":2,"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-05-18T02:44:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K5hTXsAHIVAR/3V0Dwc/fclXBP/b21/ZbxpoLj00gIkiQ9tOgJTyipJ4tNU7yB1sJtSSPwSvbqNadaCPNFv7AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:09:03.502556Z"},"content_sha256":"92c4e35461ae1966da0ed0d787bf19cf0709e7c455104442c711b3ceeeebc985","schema_version":"1.0","event_id":"sha256:92c4e35461ae1966da0ed0d787bf19cf0709e7c455104442c711b3ceeeebc985"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:CRS7O6MVF7BHFEKKWK5NKDHAQY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized Decidability via Brouwer Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Using Brouwer trees, countable meets of semidecidable properties are ω²-decidable in homotopy type theory.","cross_cats":["math.LO"],"primary_cat":"cs.LO","authors_text":"Aref Mohammadzadeh, Fredrik Nordvall Forsberg, Nicolai Kraus, Tom de Jong","submitted_at":"2026-02-11T13:31:03Z","abstract_excerpt":"In the setting of constructive mathematics, we suggest and study a framework for decidability of properties, which allows for finer distinctions than just \"decidable, semidecidable, or undecidable\". We work in homotopy type theory and use Brouwer ordinals to specify the level of decidability of a property. In this framework, we express the property that a proposition is $\\alpha$-decidable, for a Brouwer ordinal $\\alpha$, and show that it generalizes decidability and semidecidability. Further generalizing known results, we show that $\\alpha$-decidable propositions are closed under binary conjun"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We prove that if each P(i) is semidecidable, then the countable meet ∀i∈ℕ. P(i) is ω²-decidable, and similar results for countable joins and iterated quantifiers.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The specific definition of α-decidability via Brouwer trees captures a meaningful and useful hierarchy of decidability levels within the constructive setting of homotopy type theory.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Propositions are α-decidable for Brouwer ordinals α, generalizing decidability with closure under conjunction and ω²-decidability for countable meets of semidecidable properties.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Using Brouwer trees, countable meets of semidecidable properties are ω²-decidable in homotopy type theory.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"efcdd2e4cf41945cb890bbf9a77b5dc243e63c0a8692330d4603adbc2aeff581"},"source":{"id":"2602.10844","kind":"arxiv","version":2},"verdict":{"id":"b3329d8a-fc45-4a72-a711-bbc87f8c2210","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-16T03:05:59.825423Z","strongest_claim":"We prove that if each P(i) is semidecidable, then the countable meet ∀i∈ℕ. P(i) is ω²-decidable, and similar results for countable joins and iterated quantifiers.","one_line_summary":"Propositions are α-decidable for Brouwer ordinals α, generalizing decidability with closure under conjunction and ω²-decidability for countable meets of semidecidable properties.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The specific definition of α-decidability via Brouwer trees captures a meaningful and useful hierarchy of decidability levels within the constructive setting of homotopy type theory.","pith_extraction_headline":"Using Brouwer trees, countable meets of semidecidable properties are ω²-decidable in homotopy type theory."},"references":{"count":37,"sample":[{"doi":"","year":2010,"title":"Notes on constructive set theory","work_id":"2c836b4f-43e3-4211-ae89-c0bdf88bd5d5","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"Quotient inductive-inductive types","work_id":"c2c8bd85-d0ec-48c1-991d-02f4def7c71e","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1016/j.entcs.2005.11.049","year":2006,"title":"First steps in synthetic computability theory","work_id":"6ec06f69-e165-4a62-be34-40220480db17","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2009,"title":"Toward the interpretation of non-constructive reasoning as non-monotonic learning","work_id":"c7cc48d9-40a7-4bc0-b057-3b3612fe5e38","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1017/s0960129505004822","year":2005,"title":"Modelling general recursion in type theory","work_id":"0f61c221-5314-4960-9de4-04e1cddec1c9","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":37,"snapshot_sha256":"2e3fffe23202e72cf4ecb36561e79651fef81dfa3af15cefa8ce0b691af11933","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"b3329d8a-fc45-4a72-a711-bbc87f8c2210"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:44:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q/nzf4XsPTi7U9nS8xGGCWtVwln9gSnr6HzabQU9/XyNuZf50JUF3/BFrm2mgfoWaqU/vJmBhiRZUF+/pf/RDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:09:03.503172Z"},"content_sha256":"241f7b9d9ab43c52c5efe3ecb6e8f1dbf2c78197edc623e8fcf338b2ccd1b653","schema_version":"1.0","event_id":"sha256:241f7b9d9ab43c52c5efe3ecb6e8f1dbf2c78197edc623e8fcf338b2ccd1b653"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CRS7O6MVF7BHFEKKWK5NKDHAQY/bundle.json","state_url":"https://pith.science/pith/CRS7O6MVF7BHFEKKWK5NKDHAQY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CRS7O6MVF7BHFEKKWK5NKDHAQY/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-01T17:09:03Z","links":{"resolver":"https://pith.science/pith/CRS7O6MVF7BHFEKKWK5NKDHAQY","bundle":"https://pith.science/pith/CRS7O6MVF7BHFEKKWK5NKDHAQY/bundle.json","state":"https://pith.science/pith/CRS7O6MVF7BHFEKKWK5NKDHAQY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CRS7O6MVF7BHFEKKWK5NKDHAQY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:CRS7O6MVF7BHFEKKWK5NKDHAQY","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":"2eb98fce30c3b193f756f46999c1ceadede533833590168e24ab9b2b5a444d09","cross_cats_sorted":["math.LO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-02-11T13:31:03Z","title_canon_sha256":"7495732a5c66a02602c17f68061ee20505d0146e99542adeaf853673e5fced8e"},"schema_version":"1.0","source":{"id":"2602.10844","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.10844","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"arxiv_version","alias_value":"2602.10844v2","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.10844","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"pith_short_12","alias_value":"CRS7O6MVF7BH","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"CRS7O6MVF7BHFEKK","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"CRS7O6MV","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:241f7b9d9ab43c52c5efe3ecb6e8f1dbf2c78197edc623e8fcf338b2ccd1b653","target":"graph","created_at":"2026-05-18T02:44:31Z","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":"We prove that if each P(i) is semidecidable, then the countable meet ∀i∈ℕ. P(i) is ω²-decidable, and similar results for countable joins and iterated quantifiers."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The specific definition of α-decidability via Brouwer trees captures a meaningful and useful hierarchy of decidability levels within the constructive setting of homotopy type theory."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Propositions are α-decidable for Brouwer ordinals α, generalizing decidability with closure under conjunction and ω²-decidability for countable meets of semidecidable properties."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Using Brouwer trees, countable meets of semidecidable properties are ω²-decidable in homotopy type theory."}],"snapshot_sha256":"efcdd2e4cf41945cb890bbf9a77b5dc243e63c0a8692330d4603adbc2aeff581"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In the setting of constructive mathematics, we suggest and study a framework for decidability of properties, which allows for finer distinctions than just \"decidable, semidecidable, or undecidable\". We work in homotopy type theory and use Brouwer ordinals to specify the level of decidability of a property. In this framework, we express the property that a proposition is $\\alpha$-decidable, for a Brouwer ordinal $\\alpha$, and show that it generalizes decidability and semidecidability. Further generalizing known results, we show that $\\alpha$-decidable propositions are closed under binary conjun","authors_text":"Aref Mohammadzadeh, Fredrik Nordvall Forsberg, Nicolai Kraus, Tom de Jong","cross_cats":["math.LO"],"headline":"Using Brouwer trees, countable meets of semidecidable properties are ω²-decidable in homotopy type theory.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-02-11T13:31:03Z","title":"Generalized Decidability via Brouwer Trees"},"references":{"count":37,"internal_anchors":0,"resolved_work":37,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Notes on constructive set theory","work_id":"2c836b4f-43e3-4211-ae89-c0bdf88bd5d5","year":2010},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Quotient inductive-inductive types","work_id":"c2c8bd85-d0ec-48c1-991d-02f4def7c71e","year":2018},{"cited_arxiv_id":"","doi":"10.1016/j.entcs.2005.11.049","is_internal_anchor":false,"ref_index":3,"title":"First steps in synthetic computability theory","work_id":"6ec06f69-e165-4a62-be34-40220480db17","year":2006},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Toward the interpretation of non-constructive reasoning as non-monotonic learning","work_id":"c7cc48d9-40a7-4bc0-b057-3b3612fe5e38","year":2009},{"cited_arxiv_id":"","doi":"10.1017/s0960129505004822","is_internal_anchor":false,"ref_index":5,"title":"Modelling general recursion in type theory","work_id":"0f61c221-5314-4960-9de4-04e1cddec1c9","year":2005}],"snapshot_sha256":"2e3fffe23202e72cf4ecb36561e79651fef81dfa3af15cefa8ce0b691af11933"},"source":{"id":"2602.10844","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-16T03:05:59.825423Z","id":"b3329d8a-fc45-4a72-a711-bbc87f8c2210","model_set":{"reader":"grok-4.3"},"one_line_summary":"Propositions are α-decidable for Brouwer ordinals α, generalizing decidability with closure under conjunction and ω²-decidability for countable meets of semidecidable properties.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Using Brouwer trees, countable meets of semidecidable properties are ω²-decidable in homotopy type theory.","strongest_claim":"We prove that if each P(i) is semidecidable, then the countable meet ∀i∈ℕ. P(i) is ω²-decidable, and similar results for countable joins and iterated quantifiers.","weakest_assumption":"The specific definition of α-decidability via Brouwer trees captures a meaningful and useful hierarchy of decidability levels within the constructive setting of homotopy type theory."}},"verdict_id":"b3329d8a-fc45-4a72-a711-bbc87f8c2210"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:92c4e35461ae1966da0ed0d787bf19cf0709e7c455104442c711b3ceeeebc985","target":"record","created_at":"2026-05-18T02:44:31Z","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":"2eb98fce30c3b193f756f46999c1ceadede533833590168e24ab9b2b5a444d09","cross_cats_sorted":["math.LO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-02-11T13:31:03Z","title_canon_sha256":"7495732a5c66a02602c17f68061ee20505d0146e99542adeaf853673e5fced8e"},"schema_version":"1.0","source":{"id":"2602.10844","kind":"arxiv","version":2}},"canonical_sha256":"1465f779952fc272914ab2bad50ce0860cc19202bd6b776d3da1a59ada402ada","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1465f779952fc272914ab2bad50ce0860cc19202bd6b776d3da1a59ada402ada","first_computed_at":"2026-05-18T02:44:31.224621Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:31.224621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H8lbz38y8e7eTORr+bJQ0wE577jyjR6x7MvGEicy0veubfoOyzpt+xXIyxoYFCsQpSH+ifUcMsNo/R3Rtf/DCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:31.225189Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.10844","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92c4e35461ae1966da0ed0d787bf19cf0709e7c455104442c711b3ceeeebc985","sha256:241f7b9d9ab43c52c5efe3ecb6e8f1dbf2c78197edc623e8fcf338b2ccd1b653"],"state_sha256":"a976b33866e9f1b06bba23df5a1f1966cc478b070b1aea4f4b92b7d0a8ec6b0f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V6BKqpixgZEr0vdn4FAAiv/+1lD3qqUlafyx/D9RDWM8kxrOO5l2iac9TrUfBRGyEvTI5DOF+1nxoxCLYarYAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T17:09:03.505818Z","bundle_sha256":"6f15005c7cc402eefb8fb14a76c5d51f70053995f97ac8a00ec72db97a3e3874"}}