{"id":"W2772369882","doi":"10.1109/iccke.2017.8167918","title":"Congestion- and selfishness-aware social routing in delay tolerant networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Selfishness; Computer network; Computer science; Relay; Routing protocol; Node (physics); Delay-tolerant networking; Overhead (engineering); Network congestion; Routing (electronic design automation); Distributed computing; Network packet; Wireless Routing Protocol","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.0004294853,0.0001552081,0.0002383034,0.0000420358,0.0007438632,0.0006716914,0.0006478922,0.0001471167,0.00001917167],"category_scores_gemma":[0.000008414687,0.0001405565,0.00003763118,0.00007367216,0.0001084991,0.0005554439,0.0004146218,0.0002310685,0.000006193434],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002281041,"about_ca_system_score_gemma":0.00005729128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001682953,"about_ca_topic_score_gemma":0.0001638885,"domain_scores_codex":[0.9987456,0.00004611728,0.0002694715,0.0003898737,0.0001665895,0.0003823304],"domain_scores_gemma":[0.9991444,0.00009866658,0.0001503488,0.0004317056,0.00006050438,0.000114382],"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.00002835164,0.00009370919,0.08814764,0.00001677001,0.00003165259,0.0004992405,0.00135749,0.0007513994,0.00000296126,0.1633574,0.00373232,0.7419811],"study_design_scores_gemma":[0.0004738101,0.0000177297,0.03868055,0.00002981866,0.000004726765,0.00003438322,0.00004343365,0.9591764,9.874772e-7,0.001043523,0.0002951945,0.0001994183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03186481,0.00005266447,0.9540427,0.001822065,0.0005440268,0.000126856,0.000001173741,0.0001150464,0.01143063],"genre_scores_gemma":[0.9966075,0.00002608539,0.00228088,0.0004647376,0.0002562792,0.000007693809,0.000002771421,0.0000085124,0.0003455111],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9647427,"threshold_uncertainty_score":0.6477136,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02449010914390757,"score_gpt":0.2631220102490908,"score_spread":0.2386319011051832,"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."}}