{"id":"W3125391957","doi":"10.1007/s00454-008-9114-6","title":"Minimizing the Stabbing Number of Matchings, Trees, and Triangulations","year":2008,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Spanning tree; Linear programming relaxation; Iterated function; Rounding; Conjecture; Minimum spanning tree; Upper and lower bounds; Relaxation (psychology); Integer programming","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001307999,0.0009567715,0.001530741,0.001621746,0.0009415932,0.001553067,0.002122697,0.002202396,0.01021361],"category_scores_gemma":[0.009880927,0.0008098388,0.0007695884,0.002314925,0.001085284,0.00355095,0.001710515,0.001540667,0.001945358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001332744,"about_ca_system_score_gemma":0.001338007,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00294473,"about_ca_topic_score_gemma":0.005752608,"domain_scores_codex":[0.9988871,0.0003087099,0.00005649672,0.0001985387,0.0003699851,0.0001791891],"domain_scores_gemma":[0.996765,0.001637456,0.0002734071,0.0006548692,0.0004277613,0.0002414589],"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.0007164179,0.0001998688,0.001765324,0.0004158712,0.00006096623,0.0001119997,0.0001935003,0.507547,0.01443391,0.117851,0.01267169,0.3440326],"study_design_scores_gemma":[0.00003328772,0.0001350109,0.000409773,0.00003337517,0.00002540611,0.00009331643,0.00007590408,0.9118503,0.0039229,0.07964849,0.003758188,0.00001416401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.103939,0.0009739418,0.8790023,0.0005623722,0.0001318542,0.0001049479,0.0002549424,0.001088862,0.01394189],"genre_scores_gemma":[0.3926376,0.0007158448,0.5877813,0.0001299203,0.00006619349,0.0001432726,0.0005196902,0.000753684,0.01725262],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01021361,"threshold_uncertainty_score":0.03416795,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0204258950853971,"score_gpt":0.2681112469458681,"score_spread":0.247685351860471,"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."}}