{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00213856,0.00186867,0.001139779,0.001396088,0.0009948896,0.002879139,0.002332196,0.001366279,0.008124624],"category_scores_gemma":[0.01225629,0.0007755957,0.002912119,0.001716192,0.001352178,0.005088513,0.002477245,0.006515946,0.0009811948],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001360319,"about_ca_system_score_gemma":0.001921198,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00252602,"about_ca_topic_score_gemma":0.00268758,"domain_scores_codex":[0.9965506,0.0007539896,0.0002527511,0.0007439308,0.001070842,0.0006278523],"domain_scores_gemma":[0.991836,0.005532285,0.0007334156,0.0006594918,0.0008870386,0.000351748],"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.000738382,0.0004139237,0.004404082,0.002076583,0.0004173371,0.001870271,0.0005537461,0.2713379,0.01580228,0.5050028,0.01648631,0.1808963],"study_design_scores_gemma":[0.0001083475,0.000300556,0.001499082,0.0003037129,0.0001477231,0.0006725445,0.0001971543,0.5175505,0.005311386,0.4547491,0.01906251,0.00009740341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05818536,0.001943444,0.9068968,0.001690601,0.0005082561,0.0004759951,0.00179727,0.0003715798,0.02813066],"genre_scores_gemma":[0.6237699,0.002857445,0.3539123,0.001832681,0.000971589,0.0009556848,0.004654303,0.0003925928,0.01065334],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008124624,"threshold_uncertainty_score":0.02717954,"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."}}