{"id":"W2171555797","doi":"10.1002/dac.2989","title":"An energy‐efficient history‐based routing scheme for opportunistic networks","year":2015,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Energy consumption; Computer network; Overhead (engineering); Routing protocol; Routing (electronic design automation); Network packet; Energy (signal processing); Efficient energy use; Bandwidth (computing); Electrical engineering; Mathematics; Statistics","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.002133254,0.0001398942,0.0002630316,0.0002090573,0.00007750124,0.0002571236,0.002764777,0.00009020908,0.000004683117],"category_scores_gemma":[0.00005302326,0.0001305707,0.0001222635,0.00009958394,0.00005988102,0.0004150025,0.0001302732,0.0001852067,0.000002093623],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005235172,"about_ca_system_score_gemma":0.0007025266,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004864121,"about_ca_topic_score_gemma":0.000002372715,"domain_scores_codex":[0.9977186,0.0002829604,0.0009127078,0.000162145,0.0007403413,0.0001832117],"domain_scores_gemma":[0.9949638,0.0003507905,0.001233407,0.00073414,0.00241118,0.000306703],"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.0002026255,0.0004999221,0.0004114521,0.00000431328,0.0001819368,0.00005349387,0.0007313369,0.4506699,0.00005830611,0.4915203,0.02436543,0.03130091],"study_design_scores_gemma":[0.0008226033,0.0001205671,0.00001260008,0.0001197786,0.00001126699,0.00009338752,0.0001187809,0.9261401,0.000003358593,0.0002899532,0.07214034,0.0001272271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004206877,0.001648419,0.9916766,0.0007191877,0.003459918,0.0001001258,0.000004638639,0.00004663484,0.001923805],"genre_scores_gemma":[0.9744884,0.00004393496,0.02431234,0.0004328091,0.0005041352,0.00001497514,0.00004187629,0.00001471747,0.0001468344],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9740677,"threshold_uncertainty_score":0.5324517,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09001436105111163,"score_gpt":0.3074328118247264,"score_spread":0.2174184507736148,"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."}}