{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4WZ36X3JMUYXXNBRIWSOVTCJ5G","short_pith_number":"pith:4WZ36X3J","schema_version":"1.0","canonical_sha256":"e5b3bf5f6965317bb43145a4eacc49e9aaa3544bd62aba170768bd7eb7287ff7","source":{"kind":"arxiv","id":"1505.03852","version":1},"attestation_state":"computed","paper":{"title":"Counting Branches in Trees Using Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Arnaud Carayol, Axel Haddad, Olivier Serre","submitted_at":"2015-05-14T19:48:57Z","abstract_excerpt":"We study finite automata running over infinite binary trees. A run of such an automaton is usually said to be accepting if all its branches are accepting. In this article, we relax the notion of accepting run by allowing a certain quantity of rejecting branches.\n  More precisely we study the following criteria for a run to be accepting: - it contains at most finitely (resp countably) many rejecting branches; - it contains infinitely (resp uncountably) many accepting branches; - the set of accepting branches is topologically \"big\".\n  In all situations we provide a simple acceptance game that la"},"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":"1505.03852","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-05-14T19:48:57Z","cross_cats_sorted":[],"title_canon_sha256":"721bdae11746022d0023dbe9b0c3dcbe708f3437e8c77de7b3e2751ed3a83abd","abstract_canon_sha256":"1135541cb377a1d5b9caaaf9b96f1c688e040fe0953b76122769bdb2fc250889"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:09:52.817428Z","signature_b64":"m1Ygpt+tTfVJK2F8Vsd0IEgHE1HCvZ9nnSnRm8CkPeAd4Au+Dt0hFzwGApHgjDVB9W/JcQDHpLerFA0P5YE7Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5b3bf5f6965317bb43145a4eacc49e9aaa3544bd62aba170768bd7eb7287ff7","last_reissued_at":"2026-05-18T02:09:52.816776Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:09:52.816776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting Branches in Trees Using Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Arnaud Carayol, Axel Haddad, Olivier Serre","submitted_at":"2015-05-14T19:48:57Z","abstract_excerpt":"We study finite automata running over infinite binary trees. A run of such an automaton is usually said to be accepting if all its branches are accepting. In this article, we relax the notion of accepting run by allowing a certain quantity of rejecting branches.\n  More precisely we study the following criteria for a run to be accepting: - it contains at most finitely (resp countably) many rejecting branches; - it contains infinitely (resp uncountably) many accepting branches; - the set of accepting branches is topologically \"big\".\n  In all situations we provide a simple acceptance game that la"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03852","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":"1505.03852","created_at":"2026-05-18T02:09:52.816866+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.03852v1","created_at":"2026-05-18T02:09:52.816866+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03852","created_at":"2026-05-18T02:09:52.816866+00:00"},{"alias_kind":"pith_short_12","alias_value":"4WZ36X3JMUYX","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4WZ36X3JMUYXXNBR","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4WZ36X3J","created_at":"2026-05-18T12:29:05.191682+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/4WZ36X3JMUYXXNBRIWSOVTCJ5G","json":"https://pith.science/pith/4WZ36X3JMUYXXNBRIWSOVTCJ5G.json","graph_json":"https://pith.science/api/pith-number/4WZ36X3JMUYXXNBRIWSOVTCJ5G/graph.json","events_json":"https://pith.science/api/pith-number/4WZ36X3JMUYXXNBRIWSOVTCJ5G/events.json","paper":"https://pith.science/paper/4WZ36X3J"},"agent_actions":{"view_html":"https://pith.science/pith/4WZ36X3JMUYXXNBRIWSOVTCJ5G","download_json":"https://pith.science/pith/4WZ36X3JMUYXXNBRIWSOVTCJ5G.json","view_paper":"https://pith.science/paper/4WZ36X3J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.03852&json=true","fetch_graph":"https://pith.science/api/pith-number/4WZ36X3JMUYXXNBRIWSOVTCJ5G/graph.json","fetch_events":"https://pith.science/api/pith-number/4WZ36X3JMUYXXNBRIWSOVTCJ5G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4WZ36X3JMUYXXNBRIWSOVTCJ5G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4WZ36X3JMUYXXNBRIWSOVTCJ5G/action/storage_attestation","attest_author":"https://pith.science/pith/4WZ36X3JMUYXXNBRIWSOVTCJ5G/action/author_attestation","sign_citation":"https://pith.science/pith/4WZ36X3JMUYXXNBRIWSOVTCJ5G/action/citation_signature","submit_replication":"https://pith.science/pith/4WZ36X3JMUYXXNBRIWSOVTCJ5G/action/replication_record"}},"created_at":"2026-05-18T02:09:52.816866+00:00","updated_at":"2026-05-18T02:09:52.816866+00:00"}