{"id":"W2753952433","doi":"10.14209/jcis.2017.10","title":"On Multiplicative Matrix Channels over Finite Chain Rings","year":2017,"lang":"en","type":"article","venue":"Journal of Communication and Information Systems","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Multiplicative function; Channel (broadcasting); Coding (social sciences); Matrix (chemical analysis); Mathematics; Transmitter; Channel capacity; Linear network coding; Topology (electrical circuits); Finite field; Chain (unit); Discrete mathematics; Computer science; Telecommunications; Combinatorics; Mathematical analysis; Physics; Statistics","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":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001299728,0.0001083365,0.0002091632,0.0002232945,0.0007804282,0.001211165,0.001824597,0.00005669197,0.000006247521],"category_scores_gemma":[0.0004004617,0.00008936151,0.00005573526,0.0001029527,0.00007242588,0.005396858,0.0004396811,0.0002749416,0.00003049005],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005152913,"about_ca_system_score_gemma":0.00004144951,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007568116,"about_ca_topic_score_gemma":0.000001140806,"domain_scores_codex":[0.9986953,0.0002032007,0.0006653026,0.00006076301,0.0002707365,0.0001047615],"domain_scores_gemma":[0.9959205,0.0003187825,0.001716233,0.001374057,0.0005777079,0.00009274245],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003752697,0.00005300257,0.0004529983,0.00002707146,0.00005091756,4.95077e-7,0.007656177,0.002574165,0.00007749812,0.9377007,0.00337546,0.04799397],"study_design_scores_gemma":[0.002340493,0.0002485021,0.01977472,0.000695163,0.00001010141,0.00006621775,0.0005267317,0.5734304,0.0001963798,0.001107474,0.4012672,0.0003365871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05906225,0.005259447,0.848389,0.02072407,0.001963928,0.001184543,0.00001078664,0.0001649735,0.06324103],"genre_scores_gemma":[0.9943136,0.003443848,0.001576614,0.0004174282,0.00003950061,0.000010828,0.000002755596,0.00000362909,0.0001918183],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9365932,"threshold_uncertainty_score":0.9998257,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03205894422058727,"score_gpt":0.3065044624902132,"score_spread":0.2744455182696259,"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."}}