{"id":"W1516152095","doi":"10.1007/s101079900110","title":"Restricted 2-factor polytopes","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polytope; Combinatorics; Mathematics; Travelling salesman problem; Facet (psychology); Uniform k 21 polytope; Birkhoff polytope; Graph; Discrete mathematics; Complete graph; Mathematical optimization; Geometry; Convex optimization; Regular polygon","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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001970973,0.0001437246,0.0001841443,0.00009540927,0.0001527171,0.0002504399,0.0009437698,0.00005936336,0.0007982387],"category_scores_gemma":[0.0001867253,0.0001161172,0.00007982561,0.0007311865,0.0001116201,0.000412498,0.0001487631,0.0002161773,0.001078235],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002726594,"about_ca_system_score_gemma":0.00002454197,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001908235,"about_ca_topic_score_gemma":3.546641e-7,"domain_scores_codex":[0.9983359,0.00008267597,0.000256578,0.0003466507,0.0004282355,0.000549986],"domain_scores_gemma":[0.9987974,0.0002819567,0.00003213042,0.0006494955,0.00004285817,0.0001962094],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006124243,0.0001092476,0.00002656196,0.00002466921,0.000008516973,0.00002580832,0.0002583629,0.00000377986,0.0002131307,0.2362622,0.00003400747,0.7630275],"study_design_scores_gemma":[0.0006641208,0.0003112573,0.0005829551,0.000112364,0.000008355286,0.0001123494,0.00005798387,0.02689925,0.003210344,0.9061683,0.06121799,0.0006546768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06735173,0.0001478759,0.9090989,0.000962974,0.00005156188,0.0006301419,0.000001467066,0.001125015,0.02063036],"genre_scores_gemma":[0.4882364,0.000008965004,0.5082201,0.0001089021,0.00005631512,0.00007626446,0.000001176025,0.00002490581,0.003266966],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7623729,"threshold_uncertainty_score":0.9996995,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02963231020225384,"score_gpt":0.3049506351782155,"score_spread":0.2753183249759616,"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."}}