{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001179145,0.001020748,0.001162647,0.001432535,0.001026874,0.002424861,0.003132077,0.001369351,0.008305003],"category_scores_gemma":[0.004595984,0.0006866258,0.0014258,0.002370981,0.001146826,0.005349966,0.00317821,0.002023072,0.002582398],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001863189,"about_ca_system_score_gemma":0.001740162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002295803,"about_ca_topic_score_gemma":0.003788669,"domain_scores_codex":[0.9984212,0.0003343368,0.0001100614,0.000473661,0.0003806241,0.0002800835],"domain_scores_gemma":[0.9972301,0.001164378,0.000237131,0.0009383725,0.0002475291,0.0001824302],"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.001611919,0.0008241551,0.004604099,0.0006669557,0.0002658377,0.0002849108,0.0007265476,0.1790592,0.04136457,0.2244568,0.04369753,0.5024374],"study_design_scores_gemma":[0.0003272831,0.0002409184,0.0008158681,0.00004205578,0.00009440064,0.000374294,0.0001369798,0.8438859,0.01329414,0.1314262,0.009308078,0.00005389076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03688057,0.0003749804,0.9529307,0.0007288271,0.00008904629,0.0001515136,0.0002245275,0.002570524,0.006049174],"genre_scores_gemma":[0.2870958,0.0003092383,0.703669,0.0004523931,0.0001500751,0.0003905253,0.001461315,0.0005621359,0.00590956],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008305003,"threshold_uncertainty_score":0.02778304,"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."}}