{"id":"W2024228560","doi":"10.1109/isit.2012.6283958","title":"How fast can dense codes achieve the min-cut capacity of line networks?","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Lossless compression; Bernoulli's principle; Computer science; Linear network coding; Coding (social sciences); Poisson distribution; Line (geometry); Algorithm; Mathematics; Data compression; Computer network; 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.001617179,0.0005240439,0.0006219604,0.0005867204,0.000550545,0.001415754,0.001289693,0.001076864,0.002850768],"category_scores_gemma":[0.02429671,0.000393626,0.0002386395,0.0006219267,0.001452093,0.005041315,0.001018894,0.001758974,0.000515127],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001534053,"about_ca_system_score_gemma":0.0008829446,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00280199,"about_ca_topic_score_gemma":0.001699699,"domain_scores_codex":[0.9993564,0.0002040348,0.00001303975,0.00009307166,0.0001553382,0.0001781722],"domain_scores_gemma":[0.9879969,0.009475799,0.0006942782,0.0006457421,0.0008620875,0.0003251349],"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.0003072069,0.00008072682,0.001577683,0.0002521479,0.00004157324,0.000101791,0.0003906601,0.5667489,0.008228486,0.3545905,0.005181213,0.06249904],"study_design_scores_gemma":[0.00002033846,0.00009919374,0.0002862256,0.00005002022,0.000009918036,0.0001081387,0.0001732046,0.809765,0.005812256,0.18038,0.003269923,0.00002575916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2251062,0.002117102,0.7560365,0.001835299,0.0001747959,0.00007667969,0.0002444484,0.0006696903,0.01373936],"genre_scores_gemma":[0.94836,0.001244179,0.04730384,0.0003328124,0.00006493809,0.0001115048,0.0001526455,0.0001556104,0.002274559],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002850768,"threshold_uncertainty_score":0.01113045,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05920949760973222,"score_gpt":0.2634234295883816,"score_spread":0.2042139319786494,"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."}}