{"id":"W2091047457","doi":"10.1002/rsa.20016","title":"A (1 + ϵ)‐approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lovász Local Lemma*","year":2004,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Hypergraph; Lemma (botany); Combinatorics; Mathematics; Time complexity; Speedup; Discrete mathematics; Range (aeronautics); Constant (computer programming); Algorithm; Computer science; Parallel computing","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":[],"consensus_categories":[],"category_scores_codex":[0.0003453537,0.0002061558,0.000306959,0.0001463529,0.0004351517,0.0001051298,0.0005307035,0.00009560096,0.000004992967],"category_scores_gemma":[0.00005399753,0.0001462455,0.0001832727,0.0005458918,0.000258671,0.0004437982,0.0002154885,0.0001835013,5.514693e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006181245,"about_ca_system_score_gemma":0.0001616359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001364125,"about_ca_topic_score_gemma":0.000006044365,"domain_scores_codex":[0.9983833,0.00008569717,0.0003197882,0.0004198071,0.0004136655,0.0003777165],"domain_scores_gemma":[0.9990019,0.0001575825,0.0001778577,0.0003956109,0.0001362455,0.000130843],"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.0001481522,0.00004272098,0.00003870275,0.00006890511,0.00008651359,0.000005001689,0.0008350135,0.02061223,0.004903991,0.06184415,0.00004148605,0.9113731],"study_design_scores_gemma":[0.008921308,0.0001408679,0.0002623503,0.00009006313,0.00003082354,0.00009615641,0.0001307488,0.528718,0.02304521,0.4380481,0.000282524,0.0002338102],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01567725,0.0005682786,0.982418,0.0002469597,0.0003142728,0.0006846611,0.00002687497,0.00004669289,0.00001703719],"genre_scores_gemma":[0.2869523,0.00005264015,0.7126698,0.00007454363,0.0001686848,0.00002189434,0.000008083255,0.00002134293,0.00003069572],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9111393,"threshold_uncertainty_score":0.5963718,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01575715285086902,"score_gpt":0.2712038309664921,"score_spread":0.2554466781156231,"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."}}