{"id":"W254961257","doi":"10.1007/978-3-319-09284-3_28","title":"Approximating Highly Satisfiable Random 2-SAT","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Window (computing); Connection (principal bundle); Image (mathematics); Distribution (mathematics); Combinatorics; Polynomial; Computer science; Time complexity; Algorithm; Mathematics; Discrete mathematics; Set (abstract data type); Uniform distribution (continuous); Probability distribution; Artificial intelligence; Statistics; Geometry; Mathematical analysis","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.003476552,0.00214956,0.002292859,0.001507494,0.0007055885,0.002422287,0.004043347,0.002271706,0.014919],"category_scores_gemma":[0.01961798,0.001312508,0.001979413,0.002964535,0.001703393,0.004077613,0.00385523,0.003308628,0.002179969],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002880708,"about_ca_system_score_gemma":0.001893663,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003030755,"about_ca_topic_score_gemma":0.007551117,"domain_scores_codex":[0.9955463,0.001835966,0.0001696818,0.0006699886,0.00131303,0.0004649154],"domain_scores_gemma":[0.9877101,0.009266169,0.0004746309,0.001740216,0.0005068784,0.0003020245],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001211404,0.0003245385,0.002514204,0.0006641907,0.0002012349,0.0002017091,0.0001466086,0.7553265,0.003687731,0.08835164,0.02290206,0.1244681],"study_design_scores_gemma":[0.00007954628,0.00006323786,0.000224949,0.00002870866,0.00002369512,0.00006979522,0.00002217312,0.9431612,0.0007074845,0.05419029,0.001420112,0.000008899925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1271515,0.003112211,0.825473,0.002633709,0.0005394121,0.0002581009,0.001595804,0.005652352,0.03358387],"genre_scores_gemma":[0.596097,0.001052132,0.3775811,0.001075853,0.0004617299,0.0004817119,0.003746336,0.001651358,0.01785276],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.014919,"threshold_uncertainty_score":0.04990906,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01037263065041899,"score_gpt":0.2176377306963465,"score_spread":0.2072651000459275,"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."}}