{"paper":{"title":"Minimal History-Deterministic Co-B\\\"uchi Automata: Congruences and Passive Learning","arxiv_id":"2505.14304","primary_cat":"cs.FL","submitted_at":"2025-05-20T12:55:06+00:00","version_compiled":"v5"},"notice":"Every quoted sentence is the authors' text from the arXiv listing abstract. Labels and probabilities are the outputs of classifier-1.13.0 on the question bank abstract-p1-20260923, exactly as returned. No sentence in this record was written by a language model.","schema":"pith.compiled-record/v0","status":"compiled","abstract":{"source":"arXiv listing abstract v5","sentences":[{"i":0,"p":1.0,"id":"s0","own":false,"role":"background","text":"Abu Radi and Kupferman (2019) demonstrated the efficient minimization of history-deterministic (transition-based) co-B\\\"uchi automata, building on the results of Kuperberg and Skrzypczak (2015).","hedge":{"p":1.0,"label":"asserted"},"own_p":0.03,"main_claim_p":0.05,"quantitative":false,"quantitative_p":0.17,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":1.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":1,"p":1.0,"id":"s1","own":true,"role":"contribution","text":"We give a congruence-based description of these minimal automata, and a self-contained proof of its correctness.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.96,"main_claim_p":0.25,"quantitative":false,"quantitative_p":0.07,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":1.0,"interpretation":0.0}},{"i":2,"p":0.75,"id":"s2","own":true,"role":"contribution","text":"We use this description based on congruences to create a passive learning algorithm that can learn minimal history-deterministic co-B\\\"uchi automata from a set of labeled example words.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.95,"main_claim_p":0.34,"quantitative":false,"quantitative_p":0.05,"role_probabilities":{"gap":0.0,"method":0.25,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.75,"interpretation":0.0}},{"i":3,"p":0.97,"id":"s3","own":true,"role":"result","text":"The algorithm runs in polynomial time on a given set of examples, and there is a characteristic set of examples of polynomial size for each minimal history-deterministic co-B\\\"uchi automaton.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.91,"main_claim_p":0.29,"quantitative":true,"quantitative_p":0.88,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.97,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.03,"interpretation":0.0}}]},"compiled":{"main_claim":{"p":0.63,"text":"We use this description based on congruences to create a passive learning algorithm that can learn minimal history-deterministic co-B\\\"uchi automata from a set of labeled example words.","location":"abstract s2","hedge_strength":{"p":1.0,"label":"asserted"}},"provenance":{"route":{"via":"TypeSafe API","model":"classifier-1.13.0","endpoint":"https://api.typesafe.ai/v1/systemone","provider":"TypeSafe"},"packing":"one request per paper","requests":1,"input_tokens":3704,"cost_usd_reported":0.0},"compiled_at":"2026-09-23","bank_version":"abstract-p1-20260923","model_version":"classifier-1.13.0","abstract_states":{"claims_first":0.07,"states_limitation":0.12,"human_participants":0.02,"controlled_comparison":0.02,"randomized_assignment":0.01,"states_quantitative_result":0.81,"compares_with_prior_results":0.74,"mentions_code_or_data_availability":0.03},"evidential_basis":{"p":1.0,"value":"proof or derivation","probabilities":{"argument":0.0,"literature":0.0,"proof_or_derivation":1.0,"analysis_of_existing_data":0.0,"observation_or_experiment":0.0,"simulation_or_computation":0.0}},"contribution_type":{"p":0.82,"value":"method or tool","probabilities":{"review":0.0,"method_or_tool":0.82,"empirical_study":0.0,"simulation_study":0.0,"theoretical_result":0.18,"dataset_or_benchmark":0.0,"position_or_commentary":0.0}},"contribution_statement":{"p":0.66,"text":"We use this description based on congruences to create a passive learning algorithm that can learn minimal history-deterministic co-B\\\"uchi automata from a set of labeled example words.","location":"abstract s2"}},"coverage":{"tier":"abstract","levels_run":["P abstract"],"not_examined":["full text","figures and tables","references and citing sentences","relations to other papers"],"sources_read":["arXiv listing abstract v5"],"levels_not_run":["S sections","T body sentences","C citations","R cross-paper relations"],"sentences_examined":4,"sentences_in_abstract":4},"measured_accuracy":{"url":"https://pith.science/accuracy","measured_on":"2026-10-02","method":"two independent model families labelled a fresh random sample blind; the figure is how often the published label matches their consensus","sentence_role_agreement":0.92,"main_claim_agreement":0.908,"typed_citation_agreement":0.933,"typed_citation_agreement_95_interval":[0.917,0.945],"review_comments_accurate":0.758,"review_comments_accurate_95_interval":[0.684,0.82],"review_caught_admitted_error_found_or_related":0.448}}