{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003750028,0.0001567403,0.00019805,0.0002210105,0.0005021174,0.00008397112,0.0003647961,0.00004804822,0.00003753034],"category_scores_gemma":[0.0001043189,0.0001278713,0.00009363021,0.001110504,0.0001336697,0.0005040295,0.0001969665,0.000133214,0.00001625385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002472471,"about_ca_system_score_gemma":0.0001267142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003081486,"about_ca_topic_score_gemma":0.000002806171,"domain_scores_codex":[0.9984052,0.0001108173,0.0004206171,0.000328664,0.0005375514,0.0001971117],"domain_scores_gemma":[0.998544,0.0007208855,0.0002075583,0.0002408069,0.000205674,0.0000811262],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004284418,0.0001705474,0.02837957,0.00005011103,0.0001812855,0.00002167089,0.004765464,0.3996883,0.0005058844,0.5298302,0.00187756,0.03448651],"study_design_scores_gemma":[0.001073614,0.0000616293,0.4038779,0.00003983704,0.00002594316,0.0004124474,0.0002076969,0.5418955,0.0002797302,0.0495573,0.002180005,0.0003883677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4301428,0.0002661005,0.5677369,0.000767227,0.0001489013,0.000124411,0.00001291246,0.0000493612,0.000751467],"genre_scores_gemma":[0.9045215,0.00002008493,0.09485216,0.0002381403,0.00009321675,0.000009904516,0.00005980232,0.000009066538,0.0001960936],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4802729,"threshold_uncertainty_score":0.5214441,"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."}}