{"id":"W2537496845","doi":"10.1109/lcomm.2016.2619706","title":"Generic Linear Network Code Construction Using Transversal Matroids","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Matroid; Transversal (combinatorics); Linear network coding; Code (set theory); Computer science; Dual code; Algorithm; Representation (politics); Systematic code; Matrix (chemical analysis); Coding (social sciences); Theoretical computer science; Independence (probability theory); Discrete mathematics; Mathematics; Low-density parity-check code; Decoding methods; Programming language","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.0003629533,0.0001771783,0.0001830282,0.0001141141,0.000726724,0.00009878991,0.003021133,0.00006058041,0.00002403493],"category_scores_gemma":[0.00002112519,0.0001501191,0.0001017581,0.0007062135,0.0003632297,0.0005876408,0.0004590735,0.0002096804,0.00006972803],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001568086,"about_ca_system_score_gemma":0.00007043085,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007664015,"about_ca_topic_score_gemma":0.00004141031,"domain_scores_codex":[0.998347,0.000477879,0.0003688382,0.0002913644,0.0001792824,0.000335674],"domain_scores_gemma":[0.9960309,0.0002994183,0.0001511866,0.003294731,0.0001261356,0.00009759333],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002142184,0.0001577583,0.003152096,0.00001215588,0.0001811726,0.000005450587,0.001170664,0.01021163,0.6125661,0.1225872,0.01673168,0.2332027],"study_design_scores_gemma":[0.002755244,0.0001014461,0.0024462,0.0004438393,0.00009736264,0.0002386805,0.00007538169,0.6949748,0.01025545,0.00160485,0.2853107,0.001696028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02693974,0.0006115173,0.9418839,0.02917363,0.0005060265,0.0001750344,0.000005355096,0.0002865839,0.0004181935],"genre_scores_gemma":[0.582059,0.001963445,0.4132189,0.002485923,0.0001711083,0.00002901367,0.000005213495,0.00002011893,0.00004727195],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6847632,"threshold_uncertainty_score":0.6121678,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07720417784015142,"score_gpt":0.2965778877077936,"score_spread":0.2193737098676422,"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."}}