{"id":"W4407934871","doi":"10.1007/978-3-031-81010-7_14","title":"Navigating Smart Order Routing in Fixed Income Trading with Linear Programming and Dijkstra’s Algorithm","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University; Wilfrid Laurier University","funders":"","keywords":"Dijkstra's algorithm; Computer science; Order (exchange); Linear programming; Routing (electronic design automation); Algorithm; Routing algorithm; Theoretical computer science; Shortest path problem; Computer network; Finance; Routing protocol; Economics","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.001044079,0.0009610137,0.002123962,0.001275119,0.001153635,0.00255061,0.00221853,0.002034365,0.007218767],"category_scores_gemma":[0.004117337,0.001545747,0.001338322,0.002536798,0.0013635,0.003059599,0.002287879,0.001644591,0.0009929924],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00139945,"about_ca_system_score_gemma":0.001620904,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01794962,"about_ca_topic_score_gemma":0.01714791,"domain_scores_codex":[0.9993873,0.0001992846,0.00003646398,0.0001881422,0.0001093239,0.00007942454],"domain_scores_gemma":[0.9986009,0.001036534,0.00007617361,0.0001169397,0.000108336,0.0000611382],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001124707,0.00007579567,0.0004075676,0.00007979824,0.00003720737,0.00007328497,0.000105869,0.9028024,0.0006743163,0.04013355,0.002427997,0.05306976],"study_design_scores_gemma":[0.000008178301,0.000006370234,0.00001873559,0.000003538587,0.000003293673,0.000006925825,0.000009254044,0.9850144,0.00009786619,0.01441841,0.0004090036,0.000004001248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03014833,0.0004242221,0.9614493,0.0002455748,0.00007399507,0.00005929952,0.0001881189,0.000770202,0.006640946],"genre_scores_gemma":[0.3074552,0.0003382478,0.6810964,0.0001184828,0.00004208985,0.0001447621,0.0004667132,0.0003639443,0.009974211],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01794962,"threshold_uncertainty_score":0.03569025,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01623944311210834,"score_gpt":0.2284828618306988,"score_spread":0.2122434187185905,"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."}}