{"id":"W2044758810","doi":"10.1109/netcod.2012.6261902","title":"Network coding with unequal size overlapping generations","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Linear network coding; Computer science; Redundancy (engineering); Coding (social sciences); Network topology; Overhead (engineering); Computational complexity theory; Theoretical computer science; Topology (electrical circuits); Algorithm; Computer network; Mathematics; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001001149,0.0004937134,0.0004423496,0.0005739524,0.0004922381,0.0004118711,0.0009341736,0.0005402319,0.001086198],"category_scores_gemma":[0.004426846,0.0001799434,0.0002658224,0.0008865559,0.0008993736,0.001550611,0.001168594,0.0006426785,0.0002116818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008572094,"about_ca_system_score_gemma":0.0005958453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001043666,"about_ca_topic_score_gemma":0.001059328,"domain_scores_codex":[0.9991373,0.0003364478,0.00003507863,0.000135512,0.0002498396,0.0001057182],"domain_scores_gemma":[0.9973466,0.001478968,0.0002457585,0.0005682739,0.0002976612,0.00006259666],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004745709,0.00006755258,0.0007964199,0.0001116779,0.00003896344,0.0003451377,0.000357027,0.537989,0.01918091,0.2772768,0.001812537,0.1615495],"study_design_scores_gemma":[0.00004453015,0.0001007505,0.0001971025,0.00002422037,0.00001656285,0.0002119301,0.00003021105,0.9239367,0.006976564,0.06555875,0.002879888,0.00002283806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05285549,0.0002888171,0.9422245,0.0002248842,0.00004307396,0.00008116171,0.00005867938,0.0001621268,0.004061352],"genre_scores_gemma":[0.8646985,0.0002860017,0.131465,0.0001589926,0.00004250108,0.0002060993,0.00008382702,0.0000390875,0.003019955],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001086198,"threshold_uncertainty_score":0.006219506,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05261758346130263,"score_gpt":0.2718846124719572,"score_spread":0.2192670290106546,"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."}}