{"id":"W2053082175","doi":"10.1109/ew.2010.5483532","title":"Optimal two-hop routing in delay-tolerant networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"University of Toronto","keywords":"Computer science; Hop (telecommunications); Computer network; Routing protocol; Overhead (engineering); Network routing; Distributed computing; Routing (electronic design automation)","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001281137,0.0004405766,0.0007021647,0.0004790147,0.0004815242,0.0008704197,0.0006269218,0.0006640247,0.0005402922],"category_scores_gemma":[0.003205564,0.0003222902,0.0002498235,0.000653827,0.001013801,0.001146595,0.0007168162,0.0003928589,0.00007388407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001118288,"about_ca_system_score_gemma":0.0006682749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001374615,"about_ca_topic_score_gemma":0.0008110146,"domain_scores_codex":[0.9992688,0.0003333683,0.00003590063,0.0001168695,0.0001598224,0.0000851779],"domain_scores_gemma":[0.9989756,0.000695445,0.0001398615,0.00006590116,0.00007317364,0.00005007867],"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.00004486715,0.00002508834,0.0002802377,0.00004083628,0.00001476048,0.00004076989,0.0000665527,0.9543579,0.001403373,0.03194737,0.0002851697,0.01149311],"study_design_scores_gemma":[0.00001420526,0.00002265539,0.00008335341,0.000003118748,0.000004825167,0.00001603445,0.00002013772,0.9708316,0.0005635713,0.02793791,0.0004969796,0.000005510703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1109834,0.0008222653,0.884939,0.000348583,0.00004400936,0.00004729911,0.00003992476,0.0001991576,0.002576385],"genre_scores_gemma":[0.9184946,0.0003656978,0.07953223,0.00006508525,0.00002512749,0.0000719545,0.00004842268,0.00004326455,0.00135356],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001374615,"threshold_uncertainty_score":0.008113801,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01252868896417625,"score_gpt":0.2417095034150842,"score_spread":0.229180814450908,"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."}}