{"id":"W1542970106","doi":"10.48550/arxiv.1005.5522","title":"Shrink-Wrapping trajectories for Linear Programming","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"National Science Foundation","keywords":"Mathematics; Linear programming; Convexity; Affine transformation; Interior point method; Second-order cone programming; Convex cone; Sequence (biology); Path (computing); Affine space; Linear space; Linear-fractional programming; Regular polygon; Convex optimization; Algorithm; Computer science; Geometry; Convex analysis","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.0007849901,0.0008901186,0.0005792947,0.0009887287,0.0008316371,0.001393796,0.0005994973,0.0007362174,0.003793666],"category_scores_gemma":[0.005326384,0.0004121676,0.0008016404,0.0008005488,0.001906121,0.002339699,0.00189125,0.002680491,0.0006973895],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001290331,"about_ca_system_score_gemma":0.0005450186,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00122884,"about_ca_topic_score_gemma":0.0006268579,"domain_scores_codex":[0.9995734,0.000161912,0.00001936711,0.0000853763,0.0001158337,0.0000440052],"domain_scores_gemma":[0.9984616,0.0008306645,0.0002294899,0.0001343861,0.000192652,0.0001512232],"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.0001017347,0.00004196776,0.0008422685,0.0001014121,0.00003074459,0.0001793865,0.0002914772,0.1624384,0.003006161,0.8057839,0.00390578,0.02327665],"study_design_scores_gemma":[0.00001408443,0.00004408779,0.0002731099,0.00002520436,0.00000553129,0.00007461889,0.00009121378,0.4207451,0.001061992,0.5732262,0.004424904,0.00001398298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0936816,0.001458858,0.8867761,0.001380384,0.00007753244,0.00006221257,0.0002516099,0.0003991596,0.01591247],"genre_scores_gemma":[0.7786899,0.002465779,0.201689,0.0003037845,0.0001984979,0.0003205878,0.0008059116,0.0005693247,0.01495722],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003793666,"threshold_uncertainty_score":0.01269102,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09761090265019441,"score_gpt":0.242826310292295,"score_spread":0.1452154076421006,"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."}}