{"id":"W3089577182","doi":"10.1007/s00454-003-0012-9","title":"Unavoidable Configurations in Complete Topological Graphs","year":2003,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"Eidgenössische Technische Hochschule Zürich; Deutsche Forschungsgemeinschaft; Hungarian Scientific Research Fund; City University of New York; National Science Foundation","keywords":"Mathematics; Combinatorics; Topological graph; Discrete mathematics; Induced subgraph; Path graph; Graph homomorphism; Topological graph theory; Graph; Topology (electrical circuits); Line graph; Pathwidth; Graph power; Vertex (graph theory)","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.0005635908,0.0002413096,0.0002737627,0.0007273112,0.0002980843,0.0002388262,0.0005004055,0.0001032592,0.0002655296],"category_scores_gemma":[0.0002380998,0.0002426235,0.0001280074,0.002575515,0.00009638308,0.0006352747,0.00009527611,0.0002579637,0.0001567959],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008873449,"about_ca_system_score_gemma":0.0002125556,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002166214,"about_ca_topic_score_gemma":0.00001402552,"domain_scores_codex":[0.9975579,0.0002690586,0.0005469114,0.0006204112,0.0005795419,0.0004262258],"domain_scores_gemma":[0.998604,0.0005530167,0.0001359018,0.0003174296,0.0002271387,0.0001625183],"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.000004755323,0.00009722851,0.001708568,0.000006664237,0.00001486661,0.00001434004,0.00009766682,0.2025409,0.0001970658,0.7938515,0.0003116807,0.001154751],"study_design_scores_gemma":[0.001389012,0.0001745979,0.09754182,0.00002623865,0.000009395672,0.0001059785,0.0001164173,0.2819914,0.0003306142,0.6038411,0.01382504,0.0006483621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1049976,0.0002825602,0.8801593,0.0009455526,0.0004887289,0.0003155175,0.00002329391,0.0001520629,0.01263533],"genre_scores_gemma":[0.9223462,0.0000082267,0.07632601,0.0008177335,0.00003734763,0.00004315987,0.0001574837,0.0000103439,0.0002534756],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8173486,"threshold_uncertainty_score":0.9893901,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02263484183521906,"score_gpt":0.2668587935351035,"score_spread":0.2442239516998845,"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."}}