{"id":"W1532975866","doi":"10.1214/16-aop1094","title":"Local algorithms for independent sets are half-optimal","year":2017,"lang":"en","type":"article","venue":"The Annals of Probability","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":85,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Asymptotically optimal algorithm; Infinity; Discrete mathematics; Upper and lower bounds; Random graph; Poisson distribution; Tree (set theory); Algorithm; Statistics; Graph","routes":{"ca_aff":true,"ca_fund":true,"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.002277472,0.0001599474,0.0003283813,0.00002046772,0.000687243,0.00004705911,0.0009378699,0.0001150399,0.00004163524],"category_scores_gemma":[0.001427714,0.00009613564,0.0002535998,0.00002397985,0.0007386091,0.0001174057,0.0003603352,0.0001703949,0.000001764532],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001196699,"about_ca_system_score_gemma":0.00003165406,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003540232,"about_ca_topic_score_gemma":0.00004279398,"domain_scores_codex":[0.9987264,0.0001136823,0.0003484137,0.0002556559,0.0002709581,0.0002849326],"domain_scores_gemma":[0.9971421,0.0004261584,0.0004751569,0.001582517,0.0003102459,0.00006379781],"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.0006155348,0.0004803464,0.003149893,0.0008606079,0.0002939009,0.000003422228,0.002597363,0.0001161438,0.00006459555,0.948722,0.006858041,0.03623817],"study_design_scores_gemma":[0.0002989944,0.00009989676,0.01400758,0.00003451601,0.00003169059,0.000003720413,0.0001399037,0.0005199336,0.005128509,0.9788679,0.0007442593,0.0001230751],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9786025,0.0001087712,0.014648,0.003558472,0.0004119777,0.001069336,0.0001153829,0.00004537292,0.001440153],"genre_scores_gemma":[0.9898924,0.000008149967,0.009682615,0.000118845,0.0001089204,0.00004634203,0.00000158978,0.00001610355,0.0001250044],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0361151,"threshold_uncertainty_score":0.5285787,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2213734033283845,"score_gpt":0.4079639967249845,"score_spread":0.1865905933966001,"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."}}