{"id":"W2178989601","doi":"10.5539/jmr.v7n4p162","title":"A Strong Class of Lifted Valid Inequalities for the Shortest Path Problem in Digraphs with Negative Cost Cycles","year":2015,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Inequality; Class (philosophy); Combinatorics; Path (computing); Integer (computer science); Vertex (graph theory); Simple (philosophy); Shortest path problem; Discrete mathematics; Graph; Mathematical analysis; Computer science","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"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.006240984,0.0001149577,0.0003448499,0.0004427526,0.0001093883,0.0001793074,0.001276386,0.00004402938,0.000002499279],"category_scores_gemma":[0.0007544613,0.00006543795,0.00009640166,0.0008911282,0.0003260561,0.0003593144,0.0002305856,0.0005049608,6.717987e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006943139,"about_ca_system_score_gemma":0.000456655,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000509427,"about_ca_topic_score_gemma":0.00009890545,"domain_scores_codex":[0.9972892,0.0002582726,0.0006441637,0.0001290812,0.001335112,0.0003441906],"domain_scores_gemma":[0.9940977,0.003602671,0.0003757498,0.0003636058,0.001436238,0.0001240067],"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.0003189435,0.002087634,0.005871402,0.0006630915,0.0003937181,0.00008325067,0.07383968,0.004965504,0.0002651754,0.8951566,0.002832203,0.01352279],"study_design_scores_gemma":[0.002668589,0.002577292,0.001706029,0.001397421,0.00002655581,0.0001490427,0.03424793,0.2712776,0.002057067,0.6830406,0.0006008632,0.0002510731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2064748,0.0005360594,0.787203,0.002583783,0.000135476,0.001628156,0.0000310143,0.00002123232,0.001386542],"genre_scores_gemma":[0.8166769,0.00005363291,0.1830848,0.00001247011,0.00005972883,0.00004642627,4.691717e-7,0.00001272865,0.00005288532],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6102021,"threshold_uncertainty_score":0.2668482,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2788467139699767,"score_gpt":0.4143046310150679,"score_spread":0.1354579170450912,"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."}}