{"id":"W1985961648","doi":"10.5555/644108.644165","title":"A (1 + ε)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lovász Local Lemma","year":2003,"lang":"en","type":"article","venue":"","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Hypergraph; Lemma (botany); Combinatorics; Time complexity; Mathematics; Speedup; Approximation algorithm; Algorithm; Range (aeronautics); Running time; Constant (computer programming); Discrete mathematics; 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.0003453443,0.0001345787,0.0001906635,0.00006881375,0.0002997298,0.0000176697,0.000150907,0.00009701737,0.0001048452],"category_scores_gemma":[0.0001628295,0.00008892692,0.0001957826,0.0002315384,0.0001117031,0.0001076808,0.00004426577,0.00009111282,8.581352e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003931294,"about_ca_system_score_gemma":0.00006971985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002950294,"about_ca_topic_score_gemma":0.000005724959,"domain_scores_codex":[0.9990188,0.00008564646,0.0003021007,0.0001725729,0.0002155226,0.0002052798],"domain_scores_gemma":[0.9991919,0.0002097917,0.0001625232,0.0002907788,0.00009472181,0.00005026243],"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.00001900146,0.00006798858,0.0001447324,0.00009464751,0.00007887527,4.758115e-7,0.0007757909,0.000216271,0.001186068,0.957182,0.001626275,0.03860781],"study_design_scores_gemma":[0.0009484292,0.00005503956,0.00003927021,0.00007337313,0.00009922674,0.00002605437,0.0005974886,0.07373594,0.0292886,0.8936014,0.001372895,0.0001623357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06621381,0.00005573908,0.9309227,0.00003797754,0.0003660989,0.0004731864,0.00001192529,0.00003595732,0.001882533],"genre_scores_gemma":[0.4922265,0.000003840032,0.5071767,0.00007350434,0.00006764324,0.00000972718,0.000002924117,0.00002465221,0.0004145154],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4260127,"threshold_uncertainty_score":0.3626334,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03627676619168538,"score_gpt":0.2862338144673004,"score_spread":0.249957048275615,"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."}}