{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003043179,0.0002568467,0.0004414417,0.0003010464,0.0001427126,0.0001197708,0.002729626,0.0001889484,0.0003522304],"category_scores_gemma":[0.0008122773,0.000150889,0.000474937,0.0008383489,0.0003273537,0.00006475881,0.001593522,0.00046908,0.0000502734],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002023789,"about_ca_system_score_gemma":0.00009170042,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006161867,"about_ca_topic_score_gemma":0.00001059156,"domain_scores_codex":[0.9977743,0.0005349795,0.0004298498,0.0006256363,0.0004054047,0.0002298553],"domain_scores_gemma":[0.9943581,0.002762089,0.0002579497,0.002322044,0.0002330034,0.00006681289],"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.0004098077,0.0004297899,0.0006116417,0.0001720993,0.0002092689,0.0000025043,0.0007997491,0.0004880095,0.00008011649,0.9713919,0.006512229,0.01889291],"study_design_scores_gemma":[0.0009485671,0.0002956308,0.0009108885,0.0001375635,0.00004113492,0.000002302982,0.00001683952,0.03060239,0.007246103,0.9570968,0.002292331,0.0004094472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1632662,0.0001411735,0.7981163,0.001152708,0.001334956,0.000688647,0.00002076172,0.0002953626,0.03498396],"genre_scores_gemma":[0.9891924,0.00004888744,0.01003652,0.0003850675,0.0001308033,0.00003266753,0.000002696819,0.000009320971,0.0001616994],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8259262,"threshold_uncertainty_score":0.6153073,"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."}}