{"id":"W2017256181","doi":"10.1109/isit.2013.6620723","title":"On uniform matroidal networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Matroid; Linear network coding; Computer science; Coding (social sciences); Theoretical computer science; Simple (philosophy); Computational complexity theory; Discrete mathematics; Mathematics; Algorithm; Computer network","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.001335332,0.0005033325,0.0004139949,0.001065006,0.0008353275,0.001371046,0.001013757,0.0007793843,0.004603],"category_scores_gemma":[0.007604649,0.0004249871,0.0005426652,0.001274351,0.00214432,0.004926861,0.002070855,0.001782223,0.0005699617],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00158001,"about_ca_system_score_gemma":0.0005010262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001288257,"about_ca_topic_score_gemma":0.001144689,"domain_scores_codex":[0.9984545,0.0005305996,0.00007852339,0.0003552559,0.0003999027,0.0001811636],"domain_scores_gemma":[0.9935081,0.003910767,0.0005154981,0.0009602251,0.0007185066,0.000386801],"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.00004260181,0.00001852158,0.0002717737,0.00006439666,0.000005835214,0.00005781806,0.0001421464,0.03100511,0.002163636,0.9510379,0.001059196,0.01413114],"study_design_scores_gemma":[0.00001395914,0.00005244244,0.0003888521,0.0000375266,0.00001056527,0.0001598943,0.00006464979,0.1722856,0.002879015,0.8125762,0.01151525,0.00001611833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06315273,0.0005773376,0.9072527,0.0006298018,0.00004098787,0.00006056321,0.0003211368,0.0002147246,0.02775],"genre_scores_gemma":[0.7113656,0.001691515,0.2722213,0.0003919906,0.0002254613,0.0002569208,0.0007724098,0.0001443144,0.01293032],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004603,"threshold_uncertainty_score":0.01539856,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02018578395051388,"score_gpt":0.2451121636118728,"score_spread":0.2249263796613589,"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."}}