{"id":"W2766744273","doi":"10.1109/isit.2018.8437698","title":"On the List-Decodability of Random Linear Rank-Metric Codes","year":2018,"lang":"en","type":"preprint","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Rank (graph theory); Mathematics; Metric (unit); Hamming distance; Constant (computer programming); RADIUS; Discrete mathematics; Computer science","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"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.004963229,0.001849675,0.001316841,0.002756125,0.002236427,0.002979496,0.002217514,0.002143407,0.005688414],"category_scores_gemma":[0.04823447,0.0008344738,0.0009965412,0.002380405,0.00565501,0.006533215,0.004876463,0.004056585,0.00190917],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003226543,"about_ca_system_score_gemma":0.003527471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004249503,"about_ca_topic_score_gemma":0.002344643,"domain_scores_codex":[0.9934564,0.002117762,0.0002436519,0.0007208876,0.002235881,0.001225471],"domain_scores_gemma":[0.9525517,0.03461488,0.003205177,0.004655809,0.003895462,0.001077042],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007751319,0.00008878383,0.001446503,0.000401078,0.00009298044,0.0004933625,0.0007521489,0.1449039,0.009828754,0.8014957,0.007231979,0.03248963],"study_design_scores_gemma":[0.0001225645,0.0003546482,0.0007653965,0.0001979969,0.00006608479,0.0006767476,0.0002022002,0.5912899,0.0126159,0.388954,0.004528732,0.0002258283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2166796,0.003041795,0.7201483,0.004362612,0.0003700525,0.0002058863,0.001195334,0.001139558,0.05285698],"genre_scores_gemma":[0.9293613,0.002908341,0.0497644,0.0008104011,0.0005516016,0.0004338579,0.001019691,0.0002623733,0.01488801],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005688414,"threshold_uncertainty_score":0.0262484,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02531693207324356,"score_gpt":0.2669588836877031,"score_spread":0.2416419516144595,"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."}}