{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0113069,0.003066963,0.003897721,0.003404291,0.002578377,0.008284046,0.00689343,0.003743325,0.009635045],"category_scores_gemma":[0.06685082,0.001566793,0.006192682,0.003818278,0.006333241,0.01641213,0.007900475,0.01726262,0.002286798],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.008598394,"about_ca_system_score_gemma":0.006465085,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004583161,"about_ca_topic_score_gemma":0.005078044,"domain_scores_codex":[0.985949,0.004148619,0.0005459822,0.004081168,0.003528821,0.00174643],"domain_scores_gemma":[0.9227874,0.05920541,0.002687511,0.01006448,0.003251087,0.002004059],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000697993,0.0003930399,0.002817111,0.0005987334,0.0002302134,0.0002209688,0.0005910413,0.1167224,0.004836676,0.7609698,0.01882048,0.09310152],"study_design_scores_gemma":[0.00004509072,0.00007030719,0.0002350972,0.00007414399,0.0001054162,0.0001226543,0.00005350332,0.5030086,0.002188888,0.4902433,0.003794415,0.00005852254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01709821,0.0007717365,0.9668394,0.004265311,0.0002060198,0.0001509318,0.0006592657,0.002524757,0.007484358],"genre_scores_gemma":[0.4186061,0.001370248,0.5592067,0.003627635,0.001144567,0.00092047,0.001842166,0.001792304,0.01148994],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0113069,"threshold_uncertainty_score":0.06238598,"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."}}