{"id":"W4401976660","doi":"10.1093/comjnl/bxae055","title":"Approximation algorithms for maximum weighted internal spanning trees in regular graphs and subdivisions of graphs","year":2024,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Brock University","funders":"","keywords":"Spanning tree; Subdivision; Computer science; Algorithm; Combinatorics; Mathematics; Geography","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002051276,0.0001472434,0.00021005,0.0006894734,0.0001967808,0.0003767562,0.0009777059,0.00004540732,0.000003182807],"category_scores_gemma":[0.00002343566,0.00009869026,0.000140889,0.0007821877,0.0001644976,0.0006508256,0.0003426243,0.0004507408,0.000001154024],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002908145,"about_ca_system_score_gemma":0.00004644637,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004589366,"about_ca_topic_score_gemma":0.000003224628,"domain_scores_codex":[0.9983851,0.0002554852,0.0004033789,0.0002834039,0.0003493872,0.0003232596],"domain_scores_gemma":[0.9987916,0.0005679427,0.0001111069,0.0003065644,0.0001277947,0.00009498261],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004378992,0.00005531392,0.0004144009,0.00004998523,0.00008909587,0.00005824429,0.002560453,0.0006720028,0.001274336,0.3867813,0.0004428085,0.6075583],"study_design_scores_gemma":[0.0002715198,0.0001114812,0.001267848,0.0001672124,0.00000497706,0.0002441821,0.00002935771,0.476264,0.0004425502,0.5209844,0.0001424012,0.00007002964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07568938,0.001412356,0.9211341,0.0009691827,0.0004916065,0.0002170396,0.000003955804,0.00005336028,0.00002900741],"genre_scores_gemma":[0.6797606,0.0001964064,0.3197763,0.000063199,0.0001242354,0.00001643328,0.000002292339,0.00002090835,0.00003957338],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6074883,"threshold_uncertainty_score":0.4024472,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02779165139718254,"score_gpt":0.3050763644660477,"score_spread":0.2772847130688652,"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."}}