{"id":"W2514907103","doi":"10.1109/tits.2017.2671347","title":"Graph Theoretic Approach to the Robustness of $k$ -Nearest Neighbor Vehicle Platoons","year":2017,"lang":"en","type":"preprint","venue":"IEEE Transactions on Intelligent Transportation Systems","topic":"Traffic control and management","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Platoon; Robustness (evolution); Eigenvalues and eigenvectors; Laplacian matrix; Control theory (sociology); Computer science; Graph theory; Graph; Mathematics; Topology (electrical circuits); Theoretical computer science; Combinatorics; Physics; Artificial intelligence","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003222613,0.0004547445,0.0005702021,0.000330834,0.0002202508,0.0001466543,0.0007709418,0.0002654968,0.00002748994],"category_scores_gemma":[0.000002031569,0.000370366,0.0004047194,0.0001946446,0.00009373898,0.00007721924,0.00000145106,0.0006231537,0.00003227553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008485641,"about_ca_system_score_gemma":0.00004424523,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003030566,"about_ca_topic_score_gemma":0.00047768,"domain_scores_codex":[0.9977593,0.0000625435,0.000857811,0.0004753661,0.0005149066,0.0003300365],"domain_scores_gemma":[0.9983236,0.00008286926,0.0001872866,0.001118608,0.0001453458,0.0001422454],"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.00005413863,0.0001528812,0.000004292488,0.001068092,0.0004195923,0.000002052474,0.001887228,0.989624,0.00004378295,0.001473038,0.0003558221,0.004915058],"study_design_scores_gemma":[0.001036975,0.0001833535,0.0017475,0.001749525,0.001300322,0.00000574616,0.003356908,0.9738191,0.003964195,0.0001401452,0.01119299,0.001503287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02212906,0.0004861986,0.9670573,0.00008959261,0.005709242,0.002218161,0.0007081195,0.0003714574,0.001230902],"genre_scores_gemma":[0.9976201,0.0003560571,0.0001987326,0.00001512878,0.000131288,0.001200015,0.00007055189,0.00008536018,0.0003227479],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.975491,"threshold_uncertainty_score":0.9998748,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02434793723835995,"score_gpt":0.229491720465861,"score_spread":0.205143783227501,"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."}}