{"id":"W2953288228","doi":"10.48550/arxiv.1508.02471","title":"Time Versus Cost Tradeoffs for Deterministic Rendezvous in Networks","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Rendezvous; Benchmark (surveying); Upper and lower bounds; Node (physics); Computer science; Integer (computer science); Enhanced Data Rates for GSM Evolution; Binary logarithm; Set (abstract data type); Mathematics; Combinatorics; Discrete mathematics; Algorithm; Physics; Artificial intelligence","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005789165,0.001304787,0.001502334,0.001480555,0.001851808,0.003816359,0.002575927,0.002446368,0.005009697],"category_scores_gemma":[0.03434842,0.0009945083,0.001152544,0.001750899,0.003454044,0.009372331,0.002713939,0.001704164,0.0005474398],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004685615,"about_ca_system_score_gemma":0.002144895,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003882556,"about_ca_topic_score_gemma":0.004557546,"domain_scores_codex":[0.9943622,0.002288056,0.0002544744,0.0008016468,0.0011893,0.001104307],"domain_scores_gemma":[0.9594308,0.03354693,0.002025818,0.003030897,0.0008486278,0.001116943],"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.001242455,0.0001537273,0.001351716,0.0002693014,0.00006664247,0.0001039162,0.0003886218,0.8479661,0.008378031,0.1077139,0.00152962,0.03083595],"study_design_scores_gemma":[0.00008878604,0.0001722361,0.0005321521,0.00003282795,0.0000383026,0.0001020167,0.0002033407,0.9160268,0.003143999,0.07821673,0.001406753,0.0000360432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4376532,0.00275623,0.5284455,0.004032409,0.0001067863,0.0003251098,0.0006633822,0.001311218,0.02470608],"genre_scores_gemma":[0.8787882,0.00108005,0.1143189,0.0001859099,0.00007213459,0.0002904314,0.0002932524,0.0004073642,0.004563804],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005789165,"threshold_uncertainty_score":0.03399664,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1666037019603933,"score_gpt":0.2324804439662062,"score_spread":0.06587674200581295,"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."}}