{"id":"W2061475873","doi":"10.1007/bf02773960","title":"Forbidden paths and cycles in ordered graphs and matrices","year":2006,"lang":"en","type":"article","venue":"Israel Journal of Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":95,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Adjacency matrix; Conjecture; Bipartite graph; Vertex (graph theory); Adjacency list; Discrete mathematics; 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.0005861578,0.0007087708,0.000581793,0.002182366,0.001680862,0.002915651,0.00102388,0.001155781,0.005051565],"category_scores_gemma":[0.004551358,0.0005912543,0.0006334423,0.0027919,0.002605846,0.003887135,0.001137025,0.001743656,0.0005024577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001155623,"about_ca_system_score_gemma":0.0009451714,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001889719,"about_ca_topic_score_gemma":0.002172014,"domain_scores_codex":[0.9993489,0.0002312734,0.00004197154,0.0001415502,0.0001502426,0.00008610768],"domain_scores_gemma":[0.996267,0.002474143,0.0005144851,0.0002253041,0.0002911825,0.0002278914],"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.00004860955,0.00001934877,0.0002981398,0.00005940898,0.000007644457,0.0001239555,0.0004560626,0.002485175,0.0007284552,0.9863898,0.001031483,0.008351875],"study_design_scores_gemma":[0.000007830962,0.000008135809,0.00006060611,0.000009576431,0.000005247396,0.00008878633,0.00008236978,0.004428021,0.0002421266,0.99336,0.001701593,0.000005647061],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5197709,0.002929765,0.4176337,0.002825866,0.0004378038,0.0001403206,0.0007808985,0.0003552725,0.0551255],"genre_scores_gemma":[0.907597,0.001819287,0.06615461,0.0004218864,0.0003252127,0.0002683856,0.0005084332,0.0001306037,0.02277453],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005051565,"threshold_uncertainty_score":0.01689911,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02162383076554246,"score_gpt":0.2872560561172378,"score_spread":0.2656322253516953,"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."}}