{"id":"W2532634282","doi":"10.1109/globalsip.2013.6736883","title":"Contact graph based routing in opportunistic networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Computer network; Resource consumption; Graph; Bandwidth (computing); Routing (electronic design automation); Distributed computing; Theoretical computer science","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.001908374,0.0005655168,0.0007940438,0.001502395,0.001375559,0.00137395,0.001695079,0.001156361,0.001066824],"category_scores_gemma":[0.007628939,0.0003569062,0.0004461882,0.001704155,0.001178709,0.002461278,0.001496251,0.0006675717,0.0002200973],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001648378,"about_ca_system_score_gemma":0.001156702,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00771209,"about_ca_topic_score_gemma":0.00886113,"domain_scores_codex":[0.9987975,0.0005474767,0.00005724075,0.0001904555,0.0002991551,0.0001080173],"domain_scores_gemma":[0.9942532,0.003926958,0.0005472722,0.0007207038,0.0003730709,0.0001787102],"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.0001088896,0.00008784131,0.002074613,0.0001350722,0.00005940999,0.0002309374,0.0001968908,0.8904408,0.001730021,0.04799896,0.003229859,0.05370674],"study_design_scores_gemma":[0.00001461164,0.00003127126,0.0003666223,0.000008721378,0.00001094692,0.0000961126,0.00005759355,0.9512822,0.0007039954,0.04470818,0.00270624,0.00001345643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07419752,0.0007451127,0.917102,0.0007280437,0.0001005751,0.0003024178,0.0004113041,0.001159857,0.005253227],"genre_scores_gemma":[0.8354725,0.0006168479,0.1604674,0.0001712987,0.00006574994,0.0002490167,0.0004666339,0.00009447931,0.00239612],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00771209,"threshold_uncertainty_score":0.01533443,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01899364720745906,"score_gpt":0.2182953488281543,"score_spread":0.1993017016206953,"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."}}