{"id":"W2580401938","doi":"10.29007/vz48","title":"Proving uniformity and independence by self-composition and coupling","year":2018,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"Horizon 2020 Framework Programme; European Commission; Simons Foundation; National Science Foundation","keywords":"Mathematical proof; Probabilistic logic; Computer science; Theoretical computer science; Probabilistic CTL; Probabilistic argumentation; Independence (probability theory); Markov chain; Abstraction; Probabilistic relevance model; Proof assistant; Programming language; Mathematics; Probabilistic analysis of algorithms; Artificial intelligence; Machine learning","routes":{"ca_aff":true,"ca_fund":false,"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.01038872,0.0009921025,0.001136205,0.001495759,0.001930572,0.003103054,0.00220521,0.001366413,0.004429692],"category_scores_gemma":[0.0412915,0.001503976,0.003293521,0.001110245,0.007397722,0.01139713,0.01084865,0.00537836,0.001051784],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001488808,"about_ca_system_score_gemma":0.002904434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001330853,"about_ca_topic_score_gemma":0.0008133166,"domain_scores_codex":[0.9850627,0.004785087,0.001123624,0.003013011,0.004949792,0.001065792],"domain_scores_gemma":[0.9565127,0.0287632,0.001925631,0.009137384,0.002875275,0.0007857773],"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.0001602454,0.0001276761,0.001173526,0.0002671696,0.00009655161,0.0003612497,0.001244514,0.01103161,0.007982466,0.939568,0.001262916,0.03672403],"study_design_scores_gemma":[0.00009694084,0.00008827439,0.0002922305,0.00006270741,0.0001030842,0.0004079739,0.0001196261,0.05158261,0.03148928,0.9061494,0.009551709,0.00005622578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01581784,0.0001058207,0.9778471,0.0004702648,0.00003996744,0.0001170923,0.00008851095,0.001050264,0.004463236],"genre_scores_gemma":[0.5472808,0.0004204031,0.4445056,0.0007765075,0.0001951383,0.0005133718,0.0003758789,0.0009388746,0.004993337],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01038872,"threshold_uncertainty_score":0.05494142,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01170210460895693,"score_gpt":0.2700041866828466,"score_spread":0.2583020820738897,"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."}}