{"id":"W4390214413","doi":"10.48550/arxiv.2312.14295","title":"On Separating Path and Tree Systems in Graphs","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS; National Science Foundation","keywords":"Vertex (graph theory); Combinatorics; Mathematics; Path (computing); Tree (set theory); Graph; Pathwidth; Discrete mathematics; Computer science; Line graph","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001309727,0.0008717846,0.0009287493,0.00300719,0.00190178,0.002458443,0.00112069,0.001195908,0.007546481],"category_scores_gemma":[0.007499393,0.0004780028,0.0007978981,0.004823485,0.003837347,0.01034998,0.003332276,0.002200736,0.000838342],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00167818,"about_ca_system_score_gemma":0.0006067771,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00203671,"about_ca_topic_score_gemma":0.001267777,"domain_scores_codex":[0.9986504,0.0003747827,0.00007365383,0.0003777182,0.000302029,0.0002214884],"domain_scores_gemma":[0.9929897,0.004975577,0.0006975675,0.0004927597,0.0004463259,0.0003980877],"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.00005279323,0.00002625114,0.0007597147,0.0001537057,0.00001535518,0.00008564808,0.0004781268,0.009263989,0.001771554,0.9695394,0.003019838,0.01483355],"study_design_scores_gemma":[0.00001195749,0.00002630214,0.0004066695,0.0000214194,0.000009518374,0.0001216363,0.0001102734,0.01626408,0.0004577165,0.9756581,0.00689804,0.00001430584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3534938,0.01179989,0.5540333,0.003455956,0.0004965424,0.0001929884,0.001613531,0.000653698,0.07426043],"genre_scores_gemma":[0.8090628,0.007150576,0.1684052,0.0008873988,0.001245929,0.0003527571,0.001786061,0.00038549,0.01072386],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007546481,"threshold_uncertainty_score":0.02524549,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1067545792850852,"score_gpt":0.2346040540878764,"score_spread":0.1278494748027912,"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."}}