{"id":"W4406302025","doi":"10.48550/arxiv.2408.00983","title":"Quasi-tree-partitions of graphs with an excluded subgraph","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Center for Theoretical Sciences; National Science Foundation","keywords":"Induced subgraph isomorphism problem; Combinatorics; Mathematics; Tree (set theory); Computer science; Graph; 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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002366199,0.0003074943,0.0003969769,0.0004411225,0.0001400311,0.00003410305,0.0005849315,0.0002402068,0.0001098813],"category_scores_gemma":[0.00001958351,0.0003049295,0.0002960348,0.0009480571,0.0003642486,0.00009548733,0.0003543886,0.0005646172,0.00003906601],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003515784,"about_ca_system_score_gemma":0.0001100935,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007204393,"about_ca_topic_score_gemma":0.0005117927,"domain_scores_codex":[0.9985704,0.0001320883,0.0002541209,0.000708914,0.00008935482,0.0002451243],"domain_scores_gemma":[0.9980074,0.0001835221,0.0002477985,0.001232169,0.0001703779,0.0001587972],"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.00006604414,0.0006599558,0.0005931143,0.0003381633,0.0002347409,0.00004528653,0.000301435,0.000949538,0.0001197072,0.9964249,0.0002346114,0.00003254451],"study_design_scores_gemma":[0.0002564131,0.0001630839,0.0002088414,0.0002237606,0.0006210218,0.000004657563,0.000491116,0.001784059,0.0006536248,0.9951676,0.00009139322,0.0003344613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9840208,0.00003894682,0.00723083,0.00005481209,0.00009123122,0.00045784,0.0001843699,0.000293154,0.007628021],"genre_scores_gemma":[0.9974218,0.00005481066,0.001389024,0.00001344761,0.00002583116,0.00000855727,0.00006234509,0.00004557961,0.0009786088],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.013401,"threshold_uncertainty_score":0.9999403,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1127217736787312,"score_gpt":0.2342680274721694,"score_spread":0.1215462537934382,"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."}}