{"id":"W1637847238","doi":"10.1007/11499169_4","title":"Overlay Networks with Linear Capacity Constraints","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Overlay; Overlay network; Computer science; Path (computing); Node (physics); Distributed computing; Context (archaeology); Graph; Computer network; Linear programming; Theoretical computer science; Measure (data warehouse); Algorithm; The Internet; Data mining; Programming language; World Wide Web","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","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008892927,0.0008552348,0.0007908456,0.0009827528,0.0002979074,0.0005587883,0.00627919,0.0006417028,0.00002812162],"category_scores_gemma":[0.0001120287,0.000722473,0.000125688,0.001334441,0.002351133,0.0006378612,0.002346431,0.001766563,0.00008680869],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005055524,"about_ca_system_score_gemma":0.0005457044,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001898512,"about_ca_topic_score_gemma":0.0002530559,"domain_scores_codex":[0.9944264,0.00003264389,0.0005782561,0.00228175,0.001374081,0.001306822],"domain_scores_gemma":[0.9960018,0.0004773862,0.0003215918,0.002515628,0.0003549068,0.0003287358],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006315732,0.00002055129,0.00006490967,0.000008906622,0.00001631043,0.0001307104,0.0001921416,0.3514388,0.00001218116,0.0238973,0.0001414318,0.6240705],"study_design_scores_gemma":[0.0004557243,0.0005339961,0.0002758606,0.0007739107,0.00001510381,0.000413729,2.008869e-7,0.9499899,0.0008105317,0.03329667,0.01170217,0.001732158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001328119,0.000286529,0.9895607,0.002357783,0.001224447,0.0005831533,0.000007483024,0.000866731,0.00498031],"genre_scores_gemma":[0.165541,0.00002650925,0.830097,0.003124425,0.0007965294,0.00001548483,0.000003285243,0.00005037566,0.0003453888],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6223383,"threshold_uncertainty_score":0.9995226,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01639281026646935,"score_gpt":0.226857980310047,"score_spread":0.2104651700435776,"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."}}