{"id":"W1530791066","doi":"10.1023/a:1011453115618","title":"Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Hypergraph; Mathematics; Combinatorics; Satisfiability; Discrete mathematics; Theory of computation; Approximation algorithm; Upper and lower bounds; Heuristic; Algorithm; Mathematical optimization","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.00121436,0.0001027323,0.0002143859,0.0002313853,0.0001497407,0.0001354612,0.0003715739,0.00007563421,0.000006498075],"category_scores_gemma":[0.0004643262,0.00009268585,0.00008216761,0.0005331115,0.00005861138,0.001263674,0.00007049081,0.0001346855,4.208783e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006404694,"about_ca_system_score_gemma":0.00007390562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001258959,"about_ca_topic_score_gemma":1.165236e-7,"domain_scores_codex":[0.9987416,0.000129546,0.0004128139,0.0001750543,0.0003507604,0.0001902199],"domain_scores_gemma":[0.9982784,0.0002678549,0.0003399724,0.0002076428,0.0007926208,0.0001135187],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009868774,0.0006643388,0.003206427,0.00007620524,0.00009459782,0.00001801387,0.0005596728,0.291913,0.0009160208,0.6253567,0.0003733294,0.07583483],"study_design_scores_gemma":[0.002187543,0.0006821593,0.0003059789,0.00001070025,0.00001186474,0.00005131961,0.00002560118,0.5111997,0.0006234267,0.4836172,0.001162913,0.0001215985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01366536,0.0001050102,0.984367,0.000408516,0.001027436,0.0003066551,0.000001306974,0.00002617787,0.00009249854],"genre_scores_gemma":[0.422845,0.0001781664,0.5765918,0.00004606478,0.0002841296,0.000016535,0.000004648506,0.00001526052,0.00001838981],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4091796,"threshold_uncertainty_score":0.3779619,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02127682984858473,"score_gpt":0.297354183519847,"score_spread":0.2760773536712622,"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."}}