{"id":"W2125063528","doi":"10.1007/s00037-013-0059-7","title":"Is Valiant–Vazirani’s isolation probability improvable?","year":2013,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"Alexander von Humboldt-Stiftung; National Science Foundation","keywords":"Lemma (botany); Combinatorics; Randomized algorithm; Discrete mathematics; Time complexity; Isolation (microbiology); Upper and lower bounds; Mathematics; Satisfiability; Computer science","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003959254,0.0002827485,0.0002919518,0.0001615519,0.0005366795,0.0004875415,0.00120698,0.00008986174,0.0007870561],"category_scores_gemma":[0.00006219008,0.0002850769,0.0001938334,0.0007852116,0.0002901052,0.001340584,0.0004995295,0.0002792636,0.0007663555],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001070523,"about_ca_system_score_gemma":0.0001452599,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000274514,"about_ca_topic_score_gemma":0.00001347712,"domain_scores_codex":[0.9974001,0.0001646094,0.0005325418,0.0007836371,0.0006556235,0.0004634968],"domain_scores_gemma":[0.9979873,0.0002483663,0.0001867893,0.0007407529,0.0006344562,0.0002023568],"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.00001132002,0.0004807067,0.005029404,0.00009035014,0.00007200299,0.000003993822,0.0009441577,0.005314471,0.0002247762,0.9398738,0.01428334,0.03367168],"study_design_scores_gemma":[0.0002174774,0.0000441214,0.07492627,0.0000074675,0.000002622082,0.00001166578,0.000005288907,0.4216278,0.00005464512,0.5022903,0.0006244151,0.0001879796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0744851,0.00005145455,0.9154986,0.004828207,0.0004833503,0.0007097003,0.00002428863,0.0004956978,0.003423603],"genre_scores_gemma":[0.6180466,9.36517e-7,0.3803858,0.001233413,0.00009493266,0.00005114231,0.00003610721,0.00001073591,0.0001402852],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5435615,"threshold_uncertainty_score":0.9999601,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07230848095357204,"score_gpt":0.2775123517321614,"score_spread":0.2052038707785894,"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."}}