{"id":"W3082032630","doi":"","title":"Pure pairs. I. Trees and linear anticomplete pairs","year":2020,"lang":"en","type":"article","venue":"Oxford University Research Archive (ORA) (University of Oxford)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Army Research Laboratory; Army Research Office; Air Force Office of Scientific Research; Leverhulme Trust; Office of Naval Research; Princeton University; National Science Foundation","keywords":"Combinatorics; Mathematics; Conjecture; Induced subgraph; Disjoint sets; Graph; Vertex (graph theory); Graph factorization; Existential quantification; Bound graph; Discrete mathematics; Graph power; Line graph","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":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0009650823,0.000312759,0.0005359842,0.0009904945,0.001346817,0.00008050711,0.003791989,0.0001421029,0.0001264944],"category_scores_gemma":[0.000235766,0.0003872859,0.0002551084,0.002358434,0.002045015,0.001602386,0.004606114,0.001161052,0.0000271128],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001187487,"about_ca_system_score_gemma":0.000333245,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001489787,"about_ca_topic_score_gemma":0.000337267,"domain_scores_codex":[0.9953771,0.0009696104,0.0001862742,0.001115708,0.00122129,0.001129985],"domain_scores_gemma":[0.9966344,0.0008024536,0.0001495256,0.0009127302,0.0004875463,0.0010133],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.004351669,0.0008090993,0.04302946,0.0009186969,0.0008150262,0.005653382,0.03151187,0.0008020583,0.01742701,0.7700602,0.01355174,0.1110697],"study_design_scores_gemma":[0.007666849,0.004563822,0.03601639,0.0002737179,0.00008024156,0.0000831878,0.0390849,0.1743814,0.0007499836,0.05956177,0.6758002,0.001737485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3507528,0.0001775387,0.6081885,0.01670009,0.00007427942,0.001212857,0.0003507411,0.000481546,0.02206171],"genre_scores_gemma":[0.9255671,0.002053222,0.07074713,0.0001160616,0.00006154606,2.865554e-7,0.0000430954,0.0000338506,0.001377699],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7104985,"threshold_uncertainty_score":0.9999533,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04194121276914904,"score_gpt":0.2638420115104383,"score_spread":0.2219007987412893,"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."}}