{"id":"W1934623130","doi":"10.1007/s10878-017-0184-3","title":"A characterization of linearizable instances of the quadratic minimum spanning tree problem","year":2017,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Optimization","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Characterization (materials science); Bipartite graph; Minimum spanning tree; Combinatorics; Mathematics; Spanning tree; Discrete mathematics; Quadratic equation; Graph","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.001145244,0.0001938892,0.0006043789,0.0001914369,0.0001412905,0.0002013215,0.001821669,0.0002185552,0.000006593674],"category_scores_gemma":[0.0002909859,0.0001430247,0.0002428962,0.0002424886,0.00009228836,0.0007445331,0.0005242896,0.0004232879,2.612253e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005084243,"about_ca_system_score_gemma":0.0006199868,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005742212,"about_ca_topic_score_gemma":3.037167e-7,"domain_scores_codex":[0.9976383,0.0002852593,0.00112758,0.0001862883,0.0006244861,0.0001380144],"domain_scores_gemma":[0.9925323,0.00008853192,0.005686784,0.0006401516,0.001000729,0.00005149795],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004019471,0.001036942,0.0008224403,0.001579153,0.0004198466,0.00001354452,0.005148201,0.8107003,0.01929955,0.1519992,0.0001154202,0.00846346],"study_design_scores_gemma":[0.002766323,0.0006407097,0.0005348368,0.003528872,0.0002216285,0.00002727459,0.00004182557,0.8188672,0.05003452,0.1224957,0.0003762091,0.0004648847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03492942,0.0001480461,0.9515557,0.0004889712,0.01156243,0.0004612828,0.00000999337,0.00001654601,0.0008276423],"genre_scores_gemma":[0.8636715,0.0002199495,0.1350948,0.00001603256,0.0007905655,0.000006577945,0.00001122751,0.00002343263,0.0001659109],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8287421,"threshold_uncertainty_score":0.5832379,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01362348622236394,"score_gpt":0.2450800323390553,"score_spread":0.2314565461166913,"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."}}