{"id":"W3096500228","doi":"10.46298/dmtcs.6915","title":"Graphs containing finite induced paths of unbounded length","year":2022,"lang":"en","type":"preprint","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Royal Military College of Canada; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Lyon; Agence Nationale de la Recherche; Canadian Defence Academy","keywords":"Antichain; Mathematics; Combinatorics; Lexicographical order; Induced subgraph; Comparability graph; Pairwise comparison; Discrete mathematics; Graph; Finite set; Path (computing); Partially ordered set; Pathwidth; Line graph; Computer science","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022663,0.0002551725,0.0002393975,0.0006724374,0.0005191982,0.0006898301,0.0005087073,0.0003332762,0.002111313],"category_scores_gemma":[0.0012722,0.0002604428,0.0003124102,0.000438154,0.0006563697,0.001553588,0.0007834014,0.0005324942,0.0003932902],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000507098,"about_ca_system_score_gemma":0.0003852039,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003910429,"about_ca_topic_score_gemma":0.001022381,"domain_scores_codex":[0.9997349,0.00004837219,0.00001979668,0.00008611704,0.00005638356,0.00005444823],"domain_scores_gemma":[0.9984144,0.0006532756,0.0003147721,0.0002226154,0.000216184,0.0001787267],"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.0003488196,0.00007310862,0.005458174,0.0002084503,0.00003634877,0.0009684829,0.0008702143,0.01031107,0.1177984,0.8335154,0.001377915,0.02903353],"study_design_scores_gemma":[0.00003799067,0.0001347233,0.004982843,0.00007281014,0.00008638103,0.001070679,0.0004067376,0.04013522,0.0677869,0.8626983,0.02254401,0.00004343465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8314678,0.0002712563,0.1483589,0.0002171663,0.00003897174,0.00004800413,0.0008035389,0.0005934346,0.01820097],"genre_scores_gemma":[0.9462894,0.0001694091,0.04608679,0.00006615822,0.00002585612,0.00007400104,0.001108024,0.0001014486,0.006078899],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002111313,"threshold_uncertainty_score":0.007063031,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0235248393676885,"score_gpt":0.2737261727694102,"score_spread":0.2502013334017217,"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."}}