{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007553489,0.0002464369,0.0002962304,0.0001171093,0.000149793,0.0002711523,0.001001335,0.0001795872,0.0001618686],"category_scores_gemma":[0.000007379472,0.000216355,0.0000915062,0.0005021914,0.00007223749,0.0004579033,0.0003951,0.0008203106,0.0000703687],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000223155,"about_ca_system_score_gemma":0.0001096633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001748323,"about_ca_topic_score_gemma":0.0002575169,"domain_scores_codex":[0.9978285,0.0000561328,0.0004965929,0.0005793116,0.0002856512,0.0007538056],"domain_scores_gemma":[0.9986355,0.0001920372,0.0001065394,0.0007409562,0.00007007775,0.0002548406],"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.00004756768,0.0003244358,0.01183156,0.000008736945,0.00003717677,0.001136862,0.00101443,0.07473117,0.0003236858,0.3605129,0.004248741,0.5457827],"study_design_scores_gemma":[0.0006154045,0.00003358336,0.0004133985,0.0000165022,0.000003920095,0.000120069,0.00002737688,0.9969403,0.00002035907,0.0005180059,0.0009874757,0.0003036704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07518156,0.00003310443,0.8942347,0.0003801238,0.001414733,0.0001501768,5.285694e-7,0.0002512847,0.02835383],"genre_scores_gemma":[0.9137434,0.000007791874,0.08440286,0.0008993964,0.0003725226,0.00001153326,0.000004076088,0.00001646436,0.0005419648],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9222091,"threshold_uncertainty_score":0.8822699,"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."}}