{"id":"W4388964502","doi":"10.48550/arxiv.2311.12976","title":"Fast Deterministic Rendezvous in Labeled Lines","year":2023,"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":"","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Rendezvous; Upper and lower bounds; Node (physics); Combinatorics; Matching (statistics); Path (computing); Binary logarithm; Integer (computer science); Mathematics; Time complexity; Discrete mathematics; Line (geometry); Position (finance); Computer science; Physics; Computer network; Geometry; Mathematical analysis","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008768101,0.0009287578,0.0009657757,0.0006763012,0.001568318,0.001748372,0.002378381,0.001714658,0.005722536],"category_scores_gemma":[0.005162407,0.0006020106,0.000889148,0.001331229,0.001811144,0.004335186,0.002683416,0.001282588,0.001717048],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002173389,"about_ca_system_score_gemma":0.000950261,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006039602,"about_ca_topic_score_gemma":0.005352935,"domain_scores_codex":[0.997736,0.000486583,0.0001044855,0.000693101,0.0003922802,0.000587666],"domain_scores_gemma":[0.9960705,0.001958365,0.0005584079,0.0008979735,0.0003006051,0.0002140118],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001566143,0.0002469765,0.002169175,0.0003344663,0.0001315407,0.0006740927,0.001074301,0.7105246,0.03308204,0.1472554,0.006252952,0.09668838],"study_design_scores_gemma":[0.0001676946,0.0001645449,0.0002995578,0.00003507151,0.00002543305,0.0002245674,0.0002599735,0.8579023,0.01990774,0.1118289,0.009130431,0.00005366608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.170986,0.0003932653,0.8131027,0.0005737306,0.00005842973,0.0001921214,0.0003785728,0.003525184,0.01078996],"genre_scores_gemma":[0.7281204,0.0002537851,0.2570208,0.0002508791,0.00003283786,0.0002100202,0.0008317698,0.0005107158,0.01276879],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006039602,"threshold_uncertainty_score":0.01914376,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1485900232893051,"score_gpt":0.22110459024088,"score_spread":0.07251456695157488,"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."}}