{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005679813,0.0001993919,0.0002731041,0.0002054669,0.0001017265,0.0001410264,0.0006765408,0.00007947718,0.00002831078],"category_scores_gemma":[0.00003061834,0.0001378925,0.00008430958,0.0003881421,0.00009266836,0.0004097415,0.0003012965,0.00008818771,0.00005584642],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004531585,"about_ca_system_score_gemma":0.00008330755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003207092,"about_ca_topic_score_gemma":0.000009547424,"domain_scores_codex":[0.9984221,0.00006816704,0.0003114702,0.0005629005,0.0001920708,0.0004433081],"domain_scores_gemma":[0.9987144,0.0006462617,0.00005601803,0.0003693578,0.0000832385,0.0001307203],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007797647,0.0001244372,0.00006269837,0.000009696949,0.00002142167,0.00001188403,0.0001535226,0.00002675661,0.0005983493,0.02376059,0.001408374,0.9738145],"study_design_scores_gemma":[0.001131431,0.000342903,0.000547484,0.00007448368,0.000004614404,0.00003734603,0.000003023903,0.9537191,0.001098407,0.03903598,0.003693021,0.0003122183],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000172637,0.00005821285,0.9965221,0.001904596,0.000118302,0.0007419415,0.00001201993,0.0002454364,0.0002247261],"genre_scores_gemma":[0.005049309,0.00001535157,0.9935802,0.0002419093,0.00009533334,0.0001276186,0.000001652823,0.00001438164,0.0008742645],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9735023,"threshold_uncertainty_score":0.5623091,"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."}}