{"id":"W7109987506","doi":"10.4230/lipics.icdt.2025.30","title":"An FPRAS for Model Counting for Non-Deterministic Read-Once Branching Programs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Leibniz-Gemeinschaft; University of Toronto; Austrian Science Fund","keywords":"Binary decision diagram; Branching (polymer chemistry); Bounding overwatch; Focus (optics); Binary number; Boolean function; Branching process; Propositional formula","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001164186,0.0005015021,0.0006139321,0.0003611586,0.001149917,0.001350653,0.002279533,0.0002341766,0.00000186444],"category_scores_gemma":[0.0001836479,0.0004978783,0.0004305507,0.0004913535,0.0001592757,0.002631119,0.0004215098,0.0003433029,0.000006040733],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001228738,"about_ca_system_score_gemma":0.0002463079,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001141625,"about_ca_topic_score_gemma":0.00002722554,"domain_scores_codex":[0.9965657,0.0000236165,0.001305534,0.0005655522,0.0003996229,0.001139987],"domain_scores_gemma":[0.997112,0.0004551123,0.0004989429,0.001188475,0.000547319,0.0001981207],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000435693,0.001436645,0.002114631,0.006331587,0.000445358,0.000004132678,0.02142545,0.006056408,0.0003034945,0.3906123,0.003609816,0.5672245],"study_design_scores_gemma":[0.002562795,0.000430629,0.00006211102,0.0004003054,0.00005131266,0.00001198818,0.0003866261,0.9438404,0.0003188571,0.03330102,0.01808305,0.0005508616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01862007,0.00002216837,0.974225,0.0002627079,0.00124896,0.003307976,0.0003682748,0.0003780378,0.001566747],"genre_scores_gemma":[0.3972986,0.000008271154,0.5989412,0.001509103,0.0002048585,0.001202372,0.0004472581,0.00005003816,0.0003383354],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.937784,"threshold_uncertainty_score":0.9997473,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02417305238824984,"score_gpt":0.3103360934267998,"score_spread":0.2861630410385499,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}