{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.008082079,0.0006654471,0.0007677808,0.0009696173,0.00138998,0.0003135834,0.0008816588,0.0005694071,0.0001141276],"category_scores_gemma":[0.00006371798,0.0007281569,0.0003466282,0.002241535,0.0004032733,0.0009354549,0.00000457209,0.001588852,0.00004500652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002942068,"about_ca_system_score_gemma":0.0001739462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006908254,"about_ca_topic_score_gemma":0.01208018,"domain_scores_codex":[0.9903861,0.0008136438,0.001638223,0.001393505,0.003118694,0.002649873],"domain_scores_gemma":[0.9939964,0.0009918683,0.0001709859,0.000835005,0.003137297,0.0008684015],"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.001073867,0.002039959,0.02457964,0.002644247,0.0003437458,0.00008110454,0.02920656,0.7924495,0.02278715,0.02375074,0.01666197,0.08438147],"study_design_scores_gemma":[0.00400039,0.002859032,0.1601316,0.0009861126,0.0001527126,0.000001037271,0.005457476,0.740102,0.01174468,0.007270065,0.06528579,0.002009086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2713107,0.0002547303,0.7209317,0.0002113304,0.0002943337,0.003450108,0.001709926,0.001431742,0.0004054564],"genre_scores_gemma":[0.9328774,0.0003113092,0.05834757,0.00005371339,0.0006594748,0.002672642,0.004666189,0.000281517,0.0001302521],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6625841,"threshold_uncertainty_score":0.9999101,"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."}}