{"id":"W2258418267","doi":"10.1109/isit.2016.7541718","title":"A linearithmic time algorithm for a shortest vector problem in compute-and-forward design","year":2016,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Dimension (graph theory); Algorithm; Computer science; Shortest Path Faster Algorithm; K shortest path routing; Mathematics; Shortest path problem; Theoretical computer science; Combinatorics","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.001103523,0.001791326,0.0009364947,0.001067169,0.001016934,0.001828254,0.001592531,0.001489232,0.01582306],"category_scores_gemma":[0.004302327,0.0006147458,0.00109302,0.001662347,0.0008998973,0.002882869,0.001704096,0.002476657,0.004170441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001556121,"about_ca_system_score_gemma":0.00302196,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002429104,"about_ca_topic_score_gemma":0.005008019,"domain_scores_codex":[0.9983809,0.0003651526,0.0001325468,0.0004186078,0.0005084975,0.0001942295],"domain_scores_gemma":[0.9984254,0.0007563737,0.0001202278,0.0003979205,0.0002389549,0.00006119477],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004852282,0.0004914301,0.0008486468,0.0006715382,0.000147418,0.0001501363,0.0002347954,0.1191801,0.0151736,0.09977722,0.03439304,0.7284468],"study_design_scores_gemma":[0.0005684518,0.0004805478,0.0004621515,0.00009769189,0.0001103952,0.0004940138,0.0001358907,0.7607195,0.01154591,0.1951257,0.03017516,0.00008468715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003824249,0.0002978662,0.9876776,0.0003609747,0.0001423257,0.0002009945,0.000112408,0.001580281,0.005803187],"genre_scores_gemma":[0.07681891,0.0002475349,0.9165829,0.0002243634,0.0001085181,0.0004210179,0.0004603568,0.0002227849,0.004913629],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01582306,"threshold_uncertainty_score":0.05293345,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02251610516122705,"score_gpt":0.2395130119137281,"score_spread":0.2169969067525011,"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."}}