{"id":"W1994798111","doi":"10.1109/lcnw.2014.6927728","title":"Optimal encounter-based routing via objects with periodic behaviours","year":2014,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Node (physics); Routing (electronic design automation); Constraint (computer-aided design); Routing protocol; Context (archaeology); Set (abstract data type); Computer network; Distributed computing; Link-state routing protocol; Graph; Theoretical computer science; Domain (mathematical analysis); Time complexity; Algorithm; Mathematics","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002959493,0.0001788257,0.0001859348,0.00005908078,0.0001905512,0.0002509846,0.000533536,0.00006771848,0.00007235357],"category_scores_gemma":[0.000002537907,0.0001345955,0.0000518586,0.0001922308,0.00007622006,0.0002404631,0.00009242233,0.0001527623,0.0000420281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002555763,"about_ca_system_score_gemma":0.0001287653,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000087466,"about_ca_topic_score_gemma":0.00003185207,"domain_scores_codex":[0.9986317,0.00004843147,0.0001920392,0.0004032486,0.0003227142,0.0004018905],"domain_scores_gemma":[0.9990628,0.00008454303,0.00008564055,0.0005142361,0.0000735713,0.0001791783],"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.0002340657,0.001096078,0.08245286,0.00006826019,0.0001163256,0.000863355,0.004779692,0.02645524,0.0006426068,0.05530341,0.005607217,0.8223809],"study_design_scores_gemma":[0.0004509178,0.0003170961,0.0008199867,0.00002962957,0.00001182295,0.00004307709,0.00003376877,0.9976109,0.0001336121,0.00004324281,0.0002673348,0.0002386431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05841714,0.000008863032,0.9245325,0.0001971114,0.0002077387,0.00009154868,6.766593e-7,0.0002550169,0.01628936],"genre_scores_gemma":[0.9059548,3.204119e-7,0.09266517,0.0009074925,0.00008520672,0.000006930121,0.00000486827,0.00001154798,0.0003637095],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9711556,"threshold_uncertainty_score":0.5488647,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01009143422124053,"score_gpt":0.2128861051823651,"score_spread":0.2027946709611246,"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."}}