{"id":"W2555769812","doi":"10.1002/dac.3232","title":"An altruism‐based trust‐dependent message forwarding protocol for opportunistic networks","year":2016,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Node (physics); Routing protocol; Overhead (engineering); Routing (electronic design automation); Altruism (biology); Protocol (science); Computer security; Distributed computing","routes":{"ca_aff":true,"ca_fund":true,"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.001359729,0.0003300448,0.000394532,0.0004585085,0.0008081698,0.0006043242,0.001155644,0.0004633627,0.0006838249],"category_scores_gemma":[0.003763842,0.000171435,0.0003366178,0.0003508583,0.000530534,0.0007875477,0.001665031,0.0005439576,0.0001417579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007993212,"about_ca_system_score_gemma":0.001195377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002003761,"about_ca_topic_score_gemma":0.002200484,"domain_scores_codex":[0.9991996,0.0002657188,0.00006739279,0.00008955236,0.0002781505,0.00009968428],"domain_scores_gemma":[0.9979887,0.0008632041,0.0003432175,0.0002658918,0.0003646871,0.0001743222],"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.001347877,0.0004259616,0.007208609,0.0004653384,0.0002568991,0.001615329,0.002718484,0.4079498,0.06789957,0.2215534,0.01049123,0.2780674],"study_design_scores_gemma":[0.00005714467,0.0001869491,0.0005743645,0.00002240072,0.00005986117,0.0003355684,0.0001527182,0.9528642,0.008663595,0.02805168,0.008983399,0.00004800389],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.100593,0.0001942933,0.8921022,0.0003849221,0.0001007975,0.0002243155,0.000103902,0.0005086616,0.005787923],"genre_scores_gemma":[0.9190159,0.0000940605,0.07722404,0.00007348599,0.00002006512,0.0001679713,0.000109634,0.00002447605,0.003270366],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002003761,"threshold_uncertainty_score":0.007191002,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05598276550066567,"score_gpt":0.3529024678468463,"score_spread":0.2969197023461806,"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."}}