{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001075291,0.001191105,0.001259072,0.001513928,0.0009782028,0.004245464,0.002950202,0.002037711,0.01403275],"category_scores_gemma":[0.01735526,0.0007392066,0.000701295,0.003310583,0.00126616,0.005767712,0.001901077,0.003970567,0.0008671118],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001321737,"about_ca_system_score_gemma":0.0009165193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001156532,"about_ca_topic_score_gemma":0.001360718,"domain_scores_codex":[0.9982402,0.0003643254,0.0001011965,0.0005044463,0.0004238088,0.0003661354],"domain_scores_gemma":[0.9885259,0.006815827,0.001960246,0.0008996428,0.0009502947,0.0008481123],"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.001653946,0.001972121,0.01208759,0.001145656,0.0002046398,0.001526542,0.001167002,0.1786722,0.02237415,0.6418164,0.04528654,0.09209315],"study_design_scores_gemma":[0.0001944266,0.0002820712,0.0029729,0.00007445564,0.00005993586,0.001113896,0.0005405662,0.465663,0.003143413,0.5195127,0.006401321,0.00004130279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.6576467,0.0007307031,0.263505,0.005040442,0.0001812295,0.0003798445,0.002946211,0.0009130871,0.0686568],"genre_scores_gemma":[0.9612772,0.0004347275,0.02413622,0.0005505093,0.0003350451,0.000187124,0.004062824,0.0002866074,0.008729541],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.01403275,"threshold_uncertainty_score":0.0469442,"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."}}