{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007309616,0.0007518833,0.0008472944,0.001274736,0.0005906034,0.001186568,0.001535784,0.0008613507,0.003136283],"category_scores_gemma":[0.004284773,0.000467972,0.00102242,0.001834628,0.0005949453,0.002466895,0.001704289,0.0009470816,0.0006287436],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001240375,"about_ca_system_score_gemma":0.0006896151,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002794268,"about_ca_topic_score_gemma":0.003833809,"domain_scores_codex":[0.9992931,0.0001516324,0.00004194046,0.0001919558,0.0001605657,0.0001608201],"domain_scores_gemma":[0.998825,0.0004374269,0.0001683873,0.0003155551,0.0001371569,0.0001165093],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006176179,0.0004416238,0.005041134,0.0003643704,0.0001899611,0.0003192177,0.0007087564,0.5869964,0.01336757,0.1271956,0.01510003,0.2496577],"study_design_scores_gemma":[0.00004844024,0.00005699524,0.0003813006,0.00002524435,0.0000228955,0.0001025931,0.0001196876,0.9189838,0.001978448,0.07602654,0.002245392,0.000008770554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2607163,0.0007012226,0.7264157,0.0007635684,0.00007939503,0.0002036595,0.0005426711,0.00164237,0.008935137],"genre_scores_gemma":[0.6062272,0.0003331528,0.3873016,0.0001514989,0.00004015592,0.0001854994,0.001936693,0.0002257911,0.003598322],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003136283,"threshold_uncertainty_score":0.01049191,"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."}}