{"id":"W612637280","doi":"","title":"An Efficient Shortest Distance Decomposition Algorithm for Large-Scale Transportation Network Problems","year":2014,"lang":"en","type":"article","venue":"Transportation Research Board 93rd Annual MeetingTransportation Research Board","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Graph partition; Algorithm; Partition (number theory); Computer science; Flow network; Heuristic; Domain (mathematical analysis); Boundary (topology); Scale (ratio); Graph; Mathematical optimization; Mathematics; Theoretical computer science; Combinatorics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"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.0007512906,0.001023304,0.0008852864,0.0008622676,0.0006631997,0.0008557045,0.0009451084,0.000766673,0.002274217],"category_scores_gemma":[0.001964553,0.0003910793,0.0006920241,0.001139694,0.0004002704,0.001175361,0.001012944,0.001324609,0.0006929283],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009874151,"about_ca_system_score_gemma":0.001742439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004754491,"about_ca_topic_score_gemma":0.00513115,"domain_scores_codex":[0.9995604,0.0001294727,0.00002563012,0.0000795898,0.0001607102,0.00004416207],"domain_scores_gemma":[0.9994497,0.0002499123,0.00005581942,0.0000544932,0.0001449743,0.00004508757],"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.0001048781,0.00008895423,0.0004379568,0.0001327028,0.00002881978,0.00006099018,0.0001121319,0.7583537,0.004786981,0.02029509,0.00435201,0.2112457],"study_design_scores_gemma":[0.00001662457,0.00002124817,0.00004914648,0.000004793812,0.000003399708,0.00002248906,0.00001692419,0.9935043,0.0006147747,0.004175421,0.001567201,0.000003704275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008209363,0.0002087896,0.9888837,0.0001098626,0.00003607255,0.00006929362,0.00006625905,0.0003887552,0.002027921],"genre_scores_gemma":[0.1178654,0.0002527662,0.8789377,0.00004810369,0.00003070391,0.0001731034,0.0003864068,0.0001042419,0.002201535],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004754491,"threshold_uncertainty_score":0.009453595,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02439158448157264,"score_gpt":0.3393346375088095,"score_spread":0.3149430530272369,"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."}}