{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00138317,0.001458378,0.001365051,0.001635929,0.001410835,0.00293507,0.003591925,0.00198669,0.008034089],"category_scores_gemma":[0.006421494,0.0009215982,0.001973208,0.002615523,0.00159539,0.008161169,0.004006587,0.003409022,0.003359064],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002303967,"about_ca_system_score_gemma":0.002222749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003008674,"about_ca_topic_score_gemma":0.004239401,"domain_scores_codex":[0.9980915,0.0003349121,0.0001219189,0.0006731462,0.0004828317,0.0002956158],"domain_scores_gemma":[0.99723,0.001178391,0.0001932769,0.0009801923,0.0002466586,0.0001714012],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001059865,0.0006700262,0.00291709,0.0007053296,0.000268025,0.0002785794,0.0007875463,0.1131861,0.03713004,0.2952726,0.04280724,0.5049176],"study_design_scores_gemma":[0.0003489529,0.0003434902,0.0009791565,0.00008049687,0.0001600879,0.0006892759,0.0002482919,0.6560179,0.01612215,0.303124,0.02178894,0.00009720644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01839048,0.0004468971,0.9691541,0.0007556998,0.0001088211,0.0001355206,0.0001834721,0.002422813,0.008402247],"genre_scores_gemma":[0.1888434,0.0005097486,0.7988243,0.0006750909,0.0001775395,0.0004059324,0.0013363,0.0006843096,0.008543408],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008034089,"threshold_uncertainty_score":0.02687669,"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."}}