{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002787079,0.00300004,0.00308772,0.002674308,0.002079914,0.005720101,0.007628185,0.003673064,0.02229566],"category_scores_gemma":[0.01519767,0.001685338,0.003393052,0.006370382,0.002318158,0.01177305,0.005206977,0.005742049,0.002652849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005934219,"about_ca_system_score_gemma":0.004055464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006514159,"about_ca_topic_score_gemma":0.01526294,"domain_scores_codex":[0.9971858,0.0007490406,0.000138165,0.0006734685,0.0007047871,0.000548822],"domain_scores_gemma":[0.9915901,0.00480478,0.0005500169,0.001868251,0.0006422883,0.0005445637],"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.001880278,0.001314849,0.002709818,0.001106246,0.0003334802,0.0001955839,0.0006457289,0.2906888,0.005143859,0.2434624,0.04367165,0.4088472],"study_design_scores_gemma":[0.0002848397,0.0001086689,0.0005076889,0.00005356552,0.0001127705,0.0001244477,0.0001520701,0.6064076,0.002060079,0.3851767,0.004971311,0.00004017845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0855244,0.001767292,0.8758386,0.003126621,0.0004551022,0.0004915692,0.001838277,0.004022934,0.02693512],"genre_scores_gemma":[0.3516878,0.001029475,0.6262089,0.0007722141,0.0005469132,0.0005912846,0.002664741,0.001097066,0.0154016],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02229566,"threshold_uncertainty_score":0.07458639,"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."}}