{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004026326,0.0001992925,0.0002627955,0.0001357534,0.00009716932,0.0002751573,0.0006715896,0.0001189453,0.000429488],"category_scores_gemma":[0.000008904225,0.0001724071,0.00007982003,0.0004765354,0.00003575874,0.0004378703,0.0001407155,0.0002528502,0.0001035839],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000337036,"about_ca_system_score_gemma":0.0001196484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003845561,"about_ca_topic_score_gemma":0.00003300319,"domain_scores_codex":[0.9982466,0.00008215367,0.0004360805,0.0004312239,0.0002256994,0.0005783087],"domain_scores_gemma":[0.9986892,0.0002939788,0.0001062232,0.0005696346,0.00007453546,0.0002664791],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000015433,0.0003046483,0.03100006,0.00002061249,0.00003175505,0.0004872562,0.0001683276,0.003729479,0.00006133648,0.4822052,0.02369249,0.4582834],"study_design_scores_gemma":[0.0004193969,0.00005011174,0.003983071,0.00003486695,0.000003272711,0.000009062795,0.00002322059,0.9923419,0.000002710687,0.002645361,0.0002487497,0.0002382202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001821383,0.00002865676,0.961343,0.0006799113,0.0003944587,0.0002596562,5.928866e-7,0.0002207121,0.03525166],"genre_scores_gemma":[0.9835582,0.000009227728,0.0130116,0.002766094,0.00007663521,0.00003340673,0.00001050415,0.00001215885,0.0005221384],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9886125,"threshold_uncertainty_score":0.7030558,"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."}}