{"id":"W2949931668","doi":"","title":"Optimal Distributed Broadcasting with Per-neighbor Queues in Acyclic Overlay Networks with Arbitrary Underlay Capacity Constraints","year":2013,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Underlay; Computer science; Broadcasting (networking); Overlay; Distributed computing; Queue; Overlay network; Computer network; Convergence (economics); The Internet; Telecommunications; Signal-to-noise ratio (imaging)","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001757113,0.0003821886,0.0003724389,0.0002922005,0.0001971223,0.0002087721,0.001500624,0.0001917077,0.00003344131],"category_scores_gemma":[0.00003996591,0.0003440242,0.00005995131,0.002019281,0.0005499648,0.001250694,0.0005040905,0.0005956079,0.00005404276],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002616069,"about_ca_system_score_gemma":0.0001226863,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004861074,"about_ca_topic_score_gemma":0.0003978758,"domain_scores_codex":[0.9976422,0.0001050501,0.0002202472,0.001011011,0.0001603596,0.0008611455],"domain_scores_gemma":[0.9983276,0.0002222523,0.0001607602,0.000879129,0.00015884,0.0002513838],"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.00008762531,0.0001808874,0.08148752,0.00001722438,0.0001067699,0.0007757879,0.0003175752,0.869517,0.0001263045,0.0439566,0.0006354095,0.00279124],"study_design_scores_gemma":[0.00153648,0.0004984664,0.07580219,0.0002126437,0.00003183204,0.000107988,0.000630224,0.9178067,0.0002874539,0.001967945,0.0001616453,0.0009564077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5454851,0.00001108884,0.4528252,0.0002627564,0.00003999084,0.0002725009,0.000005290089,0.0004458613,0.0006521511],"genre_scores_gemma":[0.9742067,0.000008657146,0.02542147,0.0002005138,0.00002977289,0.000004890103,0.000008349833,0.00002159514,0.00009798018],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4287217,"threshold_uncertainty_score":0.9999012,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03317148566267457,"score_gpt":0.1624512904249227,"score_spread":0.1292798047622482,"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."}}