{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QN2D6J7Z34UP6HLS4PBD4TJDCG","short_pith_number":"pith:QN2D6J7Z","schema_version":"1.0","canonical_sha256":"83743f27f9df28ff1d72e3c23e4d23118c97628ed0100ef25b2e125681752026","source":{"kind":"arxiv","id":"1403.3502","version":1},"attestation_state":"computed","paper":{"title":"Deciding the Borel complexity of regular tree languages","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.FL","math.LO"],"primary_cat":"cs.LO","authors_text":"Alessandro Facchini, Henryk Michalewski","submitted_at":"2014-03-14T08:41:02Z","abstract_excerpt":"We show that it is decidable whether a given a regular tree language belongs to the class ${\\bf \\Delta^0_2}$ of the Borel hierarchy, or equivalently whether the Wadge degree of a regular tree language is countable."},"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":"1403.3502","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.LO","submitted_at":"2014-03-14T08:41:02Z","cross_cats_sorted":["cs.FL","math.LO"],"title_canon_sha256":"24ea267dac6d4ceec3c31cd2bb91425344f6f8881fe4da2401f512ac0447d866","abstract_canon_sha256":"c695d5e3b7333bbed9b7a7664dd7003d251cb36a723037213bf13dd6480f5d47"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:20.287620Z","signature_b64":"Ki/OEjHfw2Aybxs1GjSbRyQpdvYQO7dc+28whlB7fCtph0r8qneW12CAkAkHkDq6b6EK2yEVvLlRFyBMB+EnAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83743f27f9df28ff1d72e3c23e4d23118c97628ed0100ef25b2e125681752026","last_reissued_at":"2026-05-18T02:56:20.286918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:20.286918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deciding the Borel complexity of regular tree languages","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.FL","math.LO"],"primary_cat":"cs.LO","authors_text":"Alessandro Facchini, Henryk Michalewski","submitted_at":"2014-03-14T08:41:02Z","abstract_excerpt":"We show that it is decidable whether a given a regular tree language belongs to the class ${\\bf \\Delta^0_2}$ of the Borel hierarchy, or equivalently whether the Wadge degree of a regular tree language is countable."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.3502","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":"1403.3502","created_at":"2026-05-18T02:56:20.287026+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.3502v1","created_at":"2026-05-18T02:56:20.287026+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.3502","created_at":"2026-05-18T02:56:20.287026+00:00"},{"alias_kind":"pith_short_12","alias_value":"QN2D6J7Z34UP","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"QN2D6J7Z34UP6HLS","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"QN2D6J7Z","created_at":"2026-05-18T12:28:46.137349+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/QN2D6J7Z34UP6HLS4PBD4TJDCG","json":"https://pith.science/pith/QN2D6J7Z34UP6HLS4PBD4TJDCG.json","graph_json":"https://pith.science/api/pith-number/QN2D6J7Z34UP6HLS4PBD4TJDCG/graph.json","events_json":"https://pith.science/api/pith-number/QN2D6J7Z34UP6HLS4PBD4TJDCG/events.json","paper":"https://pith.science/paper/QN2D6J7Z"},"agent_actions":{"view_html":"https://pith.science/pith/QN2D6J7Z34UP6HLS4PBD4TJDCG","download_json":"https://pith.science/pith/QN2D6J7Z34UP6HLS4PBD4TJDCG.json","view_paper":"https://pith.science/paper/QN2D6J7Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.3502&json=true","fetch_graph":"https://pith.science/api/pith-number/QN2D6J7Z34UP6HLS4PBD4TJDCG/graph.json","fetch_events":"https://pith.science/api/pith-number/QN2D6J7Z34UP6HLS4PBD4TJDCG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QN2D6J7Z34UP6HLS4PBD4TJDCG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QN2D6J7Z34UP6HLS4PBD4TJDCG/action/storage_attestation","attest_author":"https://pith.science/pith/QN2D6J7Z34UP6HLS4PBD4TJDCG/action/author_attestation","sign_citation":"https://pith.science/pith/QN2D6J7Z34UP6HLS4PBD4TJDCG/action/citation_signature","submit_replication":"https://pith.science/pith/QN2D6J7Z34UP6HLS4PBD4TJDCG/action/replication_record"}},"created_at":"2026-05-18T02:56:20.287026+00:00","updated_at":"2026-05-18T02:56:20.287026+00:00"}