{"id":"W6959748340","doi":"10.1155/atr/9941645","title":"Efficient Algorithm for the Nonadditive Traffic Assignment Problem With Link Capacity Constraints","year":2025,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Plant Taxonomy and Phylogenetics","field":"Agricultural and Biological Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Convergence (economics); Stability (learning theory); Variational inequality; Augmented Lagrangian method; Lagrangian relaxation; Cartesian product; Decomposition; Traffic flow (computer networking)","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.0001525919,0.00007843779,0.0001182712,0.00001012681,0.000130907,0.00001336688,0.00008574387,0.00003579364,0.00001558741],"category_scores_gemma":[0.000004805451,0.00002485331,0.00007195782,0.0001249273,0.00007171295,0.00003045581,6.956204e-7,0.0001016998,2.309595e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002086439,"about_ca_system_score_gemma":0.00002660324,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000194157,"about_ca_topic_score_gemma":0.0001267886,"domain_scores_codex":[0.9994189,0.00001700229,0.000236713,0.00008531885,0.00013164,0.000110482],"domain_scores_gemma":[0.9992518,0.0003328295,0.0002060485,0.00001506012,0.0001602927,0.00003400561],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0001280848,0.00006955013,0.000113262,0.000007307612,0.00005643021,0.000003373249,0.0001558021,0.1104576,0.008790778,0.0001492196,0.00002782717,0.8800408],"study_design_scores_gemma":[0.005382612,0.004659804,0.8467172,0.0008694784,0.0007592015,0.00006466435,0.006159581,0.01282071,0.03213767,0.001687866,0.08800082,0.0007403399],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9438818,0.0001308999,0.05395809,0.0009791866,0.0001673599,0.0004711844,0.0003422092,0.000007047386,0.00006220739],"genre_scores_gemma":[0.9856029,0.00003199894,0.01411842,0.00008640231,0.00009135449,0.00001866348,0.00003250657,4.319234e-7,0.00001733863],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8793004,"threshold_uncertainty_score":0.1013488,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01254312419035141,"score_gpt":0.2077066390359486,"score_spread":0.1951635148455972,"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."}}