{"id":"W2088655945","doi":"10.1109/icdcs.2014.69","title":"Achieving Absolutely Optimal Block Pipelining in Organized Network Coded Gossip","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Linear network coding; Random permutation; Gossip; Computer science; Permutation (music); Network topology; Random graph; Block (permutation group theory); Limit (mathematics); Topology (electrical circuits); Theoretical computer science; Mathematics; Discrete mathematics; Combinatorics; Computer network; Graph","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.0008241966,0.0002968577,0.0003267478,0.0003174525,0.000340827,0.0004583863,0.0006682309,0.0003578496,0.0005903426],"category_scores_gemma":[0.003918416,0.0002174581,0.0001812611,0.0003180514,0.001006158,0.0009811532,0.0006705649,0.0004325698,0.0001537174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006243846,"about_ca_system_score_gemma":0.0008547336,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001486216,"about_ca_topic_score_gemma":0.001876201,"domain_scores_codex":[0.9995899,0.0001491452,0.0000203716,0.00005977219,0.0001154778,0.00006541829],"domain_scores_gemma":[0.9978242,0.001225394,0.0002917884,0.0003485582,0.0001858447,0.000124312],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004508515,0.0001122119,0.000832914,0.0001286977,0.00003102017,0.0002472937,0.0003951776,0.7831204,0.06642935,0.1134365,0.0009874373,0.03382813],"study_design_scores_gemma":[0.00003036445,0.0001061439,0.0001330015,0.000004727434,0.000007124372,0.00003880174,0.00003283342,0.9652142,0.01282605,0.02112487,0.0004721449,0.000009761934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2616472,0.00006953519,0.7340657,0.0001391006,0.00001598597,0.00007033539,0.0000665335,0.0004569413,0.003468712],"genre_scores_gemma":[0.9393717,0.00004376006,0.05926771,0.00002993115,0.00000701616,0.00006842074,0.00004953219,0.00003826431,0.001123617],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001486216,"threshold_uncertainty_score":0.004530251,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02627270934567993,"score_gpt":0.2622243757566287,"score_spread":0.2359516664109488,"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."}}