{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.004917,0.0007165667,0.001163291,0.0006980112,0.0006931265,0.001050695,0.009588621,0.0002402908,0.0002056868],"category_scores_gemma":[0.0004789699,0.0006196654,0.0004725407,0.001674725,0.002862838,0.0005329852,0.01587751,0.001347383,0.00001863383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001369971,"about_ca_system_score_gemma":0.0006272637,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001175375,"about_ca_topic_score_gemma":5.506821e-7,"domain_scores_codex":[0.9932641,0.0003765694,0.001338161,0.001733772,0.002231784,0.001055624],"domain_scores_gemma":[0.993167,0.001645508,0.0009335318,0.00350538,0.0003557123,0.0003928771],"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.000008837,0.0001761801,0.00001207787,0.0002110471,0.00004445015,0.00003147529,0.006192533,0.0005365479,0.0004636076,0.9872062,0.00001052835,0.005106542],"study_design_scores_gemma":[0.0001797541,0.0002372501,0.00003028754,0.0002183253,0.00002405886,0.00001520586,0.0002330637,0.4614064,0.001034084,0.5361714,0.00001129955,0.0004388775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08942302,0.00007768656,0.901688,0.0002980729,0.001595812,0.0006413512,0.00004299678,0.0004128567,0.005820145],"genre_scores_gemma":[0.7513931,0.00001175712,0.2481665,0.0002529489,0.00006096652,0.00005693065,0.00001261746,0.00003750616,0.000007668231],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.66197,"threshold_uncertainty_score":0.9999863,"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."}}