{"id":"W2949900601","doi":"10.48550/arxiv.1202.0343","title":"How Fast Can Dense Codes Achieve the Min-Cut Capacity of Line Networks?","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Lossless compression; Bernoulli's principle; Computer science; Coding (social sciences); Linear network coding; Poisson distribution; Line (geometry); Algorithm; Mathematics; Mathematical optimization; Data compression; Computer network; Statistics; Engineering","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.001760037,0.0005715826,0.0006830221,0.0006365408,0.0006223317,0.001614639,0.001409879,0.001198476,0.003015653],"category_scores_gemma":[0.02729646,0.0004258083,0.0002585984,0.000701848,0.001627424,0.005450595,0.001120147,0.00199469,0.0005482318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001674936,"about_ca_system_score_gemma":0.0009435199,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002932929,"about_ca_topic_score_gemma":0.0017197,"domain_scores_codex":[0.9992705,0.000228444,0.00001538933,0.0001164885,0.0001760997,0.0001931661],"domain_scores_gemma":[0.9858692,0.01122611,0.0007873308,0.0007679428,0.0009811053,0.0003683732],"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.0003088653,0.00008312649,0.001583614,0.0002675968,0.00004508312,0.0001052264,0.0004460418,0.5479769,0.008082963,0.3789018,0.005431322,0.05676749],"study_design_scores_gemma":[0.0000215861,0.00009952044,0.0002847541,0.00005350269,0.00001074127,0.0001136594,0.0001849911,0.7820612,0.005627739,0.2081266,0.00338786,0.00002787299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2279559,0.002106321,0.7524016,0.001999368,0.000188045,0.00008449616,0.0002964362,0.0006825612,0.01428526],"genre_scores_gemma":[0.9494334,0.001215414,0.04606354,0.0003503039,0.00007217392,0.0001210429,0.0001674941,0.0001709174,0.002405668],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003015653,"threshold_uncertainty_score":0.01215255,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1236487908683867,"score_gpt":0.2037680314800931,"score_spread":0.08011924061170639,"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."}}