{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:W4FJEFSV4BP3FUYSCKML5I464W","short_pith_number":"pith:W4FJEFSV","schema_version":"1.0","canonical_sha256":"b70a921655e05fb2d3121298bea39ee598b200e9a618c2f84146432a20994d4d","source":{"kind":"arxiv","id":"0811.2198","version":4},"attestation_state":"computed","paper":{"title":"The Church Problem for Countable Ordinals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alexander Rabinovich","submitted_at":"2008-11-13T18:47:27Z","abstract_excerpt":"A fundamental theorem of Buchi and Landweber shows that the Church synthesis problem is computable. Buchi and Landweber reduced the Church Problem to problems about &#969;-games and used the determinacy of such games as one of the main tools to show its computability. We consider a natural generalization of the Church problem to countable ordinals and investigate games of arbitrary countable length. We prove that determinacy and decidability parts of the Bu}chi and Landweber theorem hold for all countable ordinals and that its full extension holds for all ordinals < \\omega\\^\\omega."},"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":"0811.2198","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2008-11-13T18:47:27Z","cross_cats_sorted":[],"title_canon_sha256":"186c63600595a6cd5f8bceef3203ec989e7d87d12d7a5280fa3f22daa022e66e","abstract_canon_sha256":"de9c5cf95019eaa9b0cc2b1fdc9c1d2595add11f37de904eb48df7ea3402efc7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:40.632215Z","signature_b64":"vWwUeoSexsjAuUV2vmaOVCVepy7G1AK1jt77buXoiyFCwGWL9o/DbBykrbjKAYKKjBfElrkDbzPn38wcfqrdCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b70a921655e05fb2d3121298bea39ee598b200e9a618c2f84146432a20994d4d","last_reissued_at":"2026-05-18T01:37:40.631603Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:40.631603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Church Problem for Countable Ordinals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alexander Rabinovich","submitted_at":"2008-11-13T18:47:27Z","abstract_excerpt":"A fundamental theorem of Buchi and Landweber shows that the Church synthesis problem is computable. Buchi and Landweber reduced the Church Problem to problems about &#969;-games and used the determinacy of such games as one of the main tools to show its computability. We consider a natural generalization of the Church problem to countable ordinals and investigate games of arbitrary countable length. We prove that determinacy and decidability parts of the Bu}chi and Landweber theorem hold for all countable ordinals and that its full extension holds for all ordinals < \\omega\\^\\omega."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.2198","kind":"arxiv","version":4},"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":"0811.2198","created_at":"2026-05-18T01:37:40.631693+00:00"},{"alias_kind":"arxiv_version","alias_value":"0811.2198v4","created_at":"2026-05-18T01:37:40.631693+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.2198","created_at":"2026-05-18T01:37:40.631693+00:00"},{"alias_kind":"pith_short_12","alias_value":"W4FJEFSV4BP3","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"W4FJEFSV4BP3FUYS","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"W4FJEFSV","created_at":"2026-05-18T12:25:58.018023+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/W4FJEFSV4BP3FUYSCKML5I464W","json":"https://pith.science/pith/W4FJEFSV4BP3FUYSCKML5I464W.json","graph_json":"https://pith.science/api/pith-number/W4FJEFSV4BP3FUYSCKML5I464W/graph.json","events_json":"https://pith.science/api/pith-number/W4FJEFSV4BP3FUYSCKML5I464W/events.json","paper":"https://pith.science/paper/W4FJEFSV"},"agent_actions":{"view_html":"https://pith.science/pith/W4FJEFSV4BP3FUYSCKML5I464W","download_json":"https://pith.science/pith/W4FJEFSV4BP3FUYSCKML5I464W.json","view_paper":"https://pith.science/paper/W4FJEFSV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0811.2198&json=true","fetch_graph":"https://pith.science/api/pith-number/W4FJEFSV4BP3FUYSCKML5I464W/graph.json","fetch_events":"https://pith.science/api/pith-number/W4FJEFSV4BP3FUYSCKML5I464W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W4FJEFSV4BP3FUYSCKML5I464W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W4FJEFSV4BP3FUYSCKML5I464W/action/storage_attestation","attest_author":"https://pith.science/pith/W4FJEFSV4BP3FUYSCKML5I464W/action/author_attestation","sign_citation":"https://pith.science/pith/W4FJEFSV4BP3FUYSCKML5I464W/action/citation_signature","submit_replication":"https://pith.science/pith/W4FJEFSV4BP3FUYSCKML5I464W/action/replication_record"}},"created_at":"2026-05-18T01:37:40.631693+00:00","updated_at":"2026-05-18T01:37:40.631693+00:00"}