{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NZ3PGCQNG64Q7SG67GM4XBEEMO","short_pith_number":"pith:NZ3PGCQN","schema_version":"1.0","canonical_sha256":"6e76f30a0d37b90fc8def999cb848463b2b45d3e2867ff9624110288b5e14716","source":{"kind":"arxiv","id":"1508.06780","version":1},"attestation_state":"computed","paper":{"title":"How unprovable is Rabin's decidability theorem?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.LO"],"primary_cat":"math.LO","authors_text":"Henryk Michalewski, Leszek Aleksander Ko{\\l}odziejczyk","submitted_at":"2015-08-27T09:53:20Z","abstract_excerpt":"We study the strength of set-theoretic axioms needed to prove Rabin's theorem on the decidability of the MSO theory of the infinite binary tree. We first show that the complementation theorem for tree automata, which forms the technical core of typical proofs of Rabin's theorem, is equivalent over the moderately strong second-order arithmetic theory $\\mathsf{ACA}_0$ to a determinacy principle implied by the positional determinacy of all parity games and implying the determinacy of all Gale-Stewart games given by boolean combinations of ${\\bf \\Sigma^0_2}$ sets. It follows that complementation f"},"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":false},"canonical_record":{"source":{"id":"1508.06780","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-08-27T09:53:20Z","cross_cats_sorted":["cs.FL","cs.LO"],"title_canon_sha256":"fb386ce787008ca1a5ea9c1b2631819dff8104034b7cbbdcf8745ad66cd1cf52","abstract_canon_sha256":"d15617b1d5f2e03a0b0db34a9777560255454f984790678347d8a357fbddd60b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:41.084028Z","signature_b64":"3x0lCKauLhc8xoxuRK4licM/nq4PcLj4zA9mg7wumWhvu6RUiKjwvY0Cy6GPZOvnmdAVVaYa8+yuoo7TZXx1AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e76f30a0d37b90fc8def999cb848463b2b45d3e2867ff9624110288b5e14716","last_reissued_at":"2026-05-18T01:34:41.083126Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:41.083126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How unprovable is Rabin's decidability theorem?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.LO"],"primary_cat":"math.LO","authors_text":"Henryk Michalewski, Leszek Aleksander Ko{\\l}odziejczyk","submitted_at":"2015-08-27T09:53:20Z","abstract_excerpt":"We study the strength of set-theoretic axioms needed to prove Rabin's theorem on the decidability of the MSO theory of the infinite binary tree. We first show that the complementation theorem for tree automata, which forms the technical core of typical proofs of Rabin's theorem, is equivalent over the moderately strong second-order arithmetic theory $\\mathsf{ACA}_0$ to a determinacy principle implied by the positional determinacy of all parity games and implying the determinacy of all Gale-Stewart games given by boolean combinations of ${\\bf \\Sigma^0_2}$ sets. It follows that complementation f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.06780","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1508.06780","created_at":"2026-05-18T01:34:41.083291+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.06780v1","created_at":"2026-05-18T01:34:41.083291+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.06780","created_at":"2026-05-18T01:34:41.083291+00:00"},{"alias_kind":"pith_short_12","alias_value":"NZ3PGCQNG64Q","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"NZ3PGCQNG64Q7SG6","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"NZ3PGCQN","created_at":"2026-05-18T12:29:34.919912+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NZ3PGCQNG64Q7SG67GM4XBEEMO","json":"https://pith.science/pith/NZ3PGCQNG64Q7SG67GM4XBEEMO.json","graph_json":"https://pith.science/api/pith-number/NZ3PGCQNG64Q7SG67GM4XBEEMO/graph.json","events_json":"https://pith.science/api/pith-number/NZ3PGCQNG64Q7SG67GM4XBEEMO/events.json","paper":"https://pith.science/paper/NZ3PGCQN"},"agent_actions":{"view_html":"https://pith.science/pith/NZ3PGCQNG64Q7SG67GM4XBEEMO","download_json":"https://pith.science/pith/NZ3PGCQNG64Q7SG67GM4XBEEMO.json","view_paper":"https://pith.science/paper/NZ3PGCQN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.06780&json=true","fetch_graph":"https://pith.science/api/pith-number/NZ3PGCQNG64Q7SG67GM4XBEEMO/graph.json","fetch_events":"https://pith.science/api/pith-number/NZ3PGCQNG64Q7SG67GM4XBEEMO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NZ3PGCQNG64Q7SG67GM4XBEEMO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NZ3PGCQNG64Q7SG67GM4XBEEMO/action/storage_attestation","attest_author":"https://pith.science/pith/NZ3PGCQNG64Q7SG67GM4XBEEMO/action/author_attestation","sign_citation":"https://pith.science/pith/NZ3PGCQNG64Q7SG67GM4XBEEMO/action/citation_signature","submit_replication":"https://pith.science/pith/NZ3PGCQNG64Q7SG67GM4XBEEMO/action/replication_record"}},"created_at":"2026-05-18T01:34:41.083291+00:00","updated_at":"2026-05-18T01:34:41.083291+00:00"}