{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004535434,0.0002566576,0.0003291534,0.0002779669,0.00008893672,0.0001434322,0.001573256,0.0003154473,0.00001856053],"category_scores_gemma":[0.00009150253,0.0003108951,0.0001332125,0.0005232796,0.0001029073,0.000254458,0.0009633548,0.0004732755,0.00005370614],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003514614,"about_ca_system_score_gemma":0.000384004,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000280654,"about_ca_topic_score_gemma":0.00006121976,"domain_scores_codex":[0.9981665,0.0001508762,0.000224444,0.0008988137,0.00008898945,0.0004703718],"domain_scores_gemma":[0.9983118,0.0002609049,0.0001647128,0.0008306731,0.000180807,0.0002510649],"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.0001213075,0.00006680855,0.00004610469,0.00002639937,0.00002532586,0.0001196261,0.0001579985,0.9803368,7.038664e-7,0.01628607,0.001442824,0.001370011],"study_design_scores_gemma":[0.001837055,0.0001332465,0.00003605568,0.00004814112,0.00002067728,0.000001807885,0.00001973171,0.9899926,0.000001767359,0.006098134,0.001478335,0.0003324086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003131899,0.00004573664,0.990559,0.0001305636,0.0009007789,0.0009514968,0.00002301666,0.000207055,0.004050385],"genre_scores_gemma":[0.9915965,0.00009742925,0.004658936,0.00007579974,0.00009208629,0.000008800488,0.00007589129,0.00002626627,0.003368298],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9884646,"threshold_uncertainty_score":0.9999343,"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."}}