{"id":"W1494111593","doi":"10.1007/s00373-016-1700-4","title":"A Tight Upper Bound on Acquaintance Time of Graphs","year":2016,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Conjecture; Upper and lower bounds; Multiplicative function; Vertex (graph theory); Graph; Discrete mathematics; Mathematical analysis","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.0002584286,0.000201398,0.0003140642,0.0001674288,0.0001849002,0.00001686447,0.0002183298,0.0001241373,0.00009835814],"category_scores_gemma":[0.00010355,0.0001206801,0.0001438256,0.0002763522,0.0002564876,0.00007416007,0.00008085969,0.0001019592,0.000006315213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001485218,"about_ca_system_score_gemma":0.00001309809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002124125,"about_ca_topic_score_gemma":4.393981e-7,"domain_scores_codex":[0.9988769,0.00006064202,0.0002791343,0.0002583142,0.0002704342,0.000254606],"domain_scores_gemma":[0.9987611,0.0004647653,0.000147529,0.0004444319,0.00008675711,0.0000954158],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004237848,0.00009556022,0.003173462,0.00004234009,0.0000514941,0.000003924079,0.0002728908,2.124478e-8,0.0006462942,0.9920178,0.001782349,0.001871509],"study_design_scores_gemma":[0.0007243805,0.0002327115,0.002631418,0.00009638194,0.00003141377,0.000007390898,0.0000256566,0.000004830776,0.00226258,0.9923782,0.001411372,0.0001936499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9926606,0.0003624126,0.0001089366,0.0001402458,0.0003738507,0.0001525714,0.00002215185,0.00006524409,0.006113932],"genre_scores_gemma":[0.9982413,0.0002746329,0.0001603155,0.0001030241,0.00001016479,0.000008897402,7.590028e-7,0.00002520406,0.00117567],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005580678,"threshold_uncertainty_score":0.4921193,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01348302932144404,"score_gpt":0.2449193589234375,"score_spread":0.2314363296019934,"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."}}