{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001052061,0.001154013,0.001691033,0.003427726,0.003353099,0.006213417,0.001438857,0.002639723,0.01210401],"category_scores_gemma":[0.00293556,0.001061372,0.001256054,0.006151651,0.007049305,0.007830324,0.002582509,0.003645211,0.003758182],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001853297,"about_ca_system_score_gemma":0.0007988822,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008249843,"about_ca_topic_score_gemma":0.0006987792,"domain_scores_codex":[0.9988527,0.0003575395,0.00008358015,0.0002585645,0.0002676055,0.00018004],"domain_scores_gemma":[0.9980867,0.001110093,0.00029393,0.0001655871,0.0001872808,0.0001564966],"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.00001606617,0.00001225164,0.00008183639,0.00009554603,0.000004133902,0.00003966103,0.0001852648,0.0001836703,0.0001887796,0.987757,0.003406981,0.008028836],"study_design_scores_gemma":[0.000004650278,0.000008826773,0.00007020629,0.00002405572,0.000005895688,0.0001169147,0.00005919499,0.0005129566,0.0001310381,0.9938213,0.005237574,0.00000737032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1111511,0.0989622,0.2263688,0.016347,0.007740614,0.0001936512,0.001906973,0.0009071729,0.5364225],"genre_scores_gemma":[0.8479924,0.02060215,0.03719866,0.003337711,0.006959819,0.0004021413,0.001297776,0.0004727635,0.08173663],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01210401,"threshold_uncertainty_score":0.04049194,"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."}}