{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007245803,0.003497939,0.006582288,0.005552507,0.005022813,0.01243396,0.01235785,0.005661709,0.02603579],"category_scores_gemma":[0.07158722,0.003793663,0.003785035,0.008049802,0.005842702,0.03746986,0.008409084,0.0136671,0.00448624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005846362,"about_ca_system_score_gemma":0.003910172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007011942,"about_ca_topic_score_gemma":0.00615424,"domain_scores_codex":[0.9872519,0.00207737,0.0005367725,0.004207657,0.00279717,0.003129215],"domain_scores_gemma":[0.8742558,0.08889214,0.003857539,0.01800029,0.005200045,0.009794113],"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.002141235,0.001105365,0.006426974,0.001608884,0.0004788531,0.0007585189,0.003229963,0.1266474,0.02040623,0.7011934,0.0385516,0.09745166],"study_design_scores_gemma":[0.00008940831,0.0001642023,0.001565468,0.000164972,0.0002949758,0.000518647,0.0002834592,0.2402838,0.00496545,0.7402844,0.01127556,0.0001095723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1983246,0.01038936,0.6749588,0.01453521,0.0007884993,0.0003067836,0.005186457,0.006103227,0.08940702],"genre_scores_gemma":[0.8170845,0.00484665,0.1322534,0.003499174,0.002039533,0.0004016222,0.003208047,0.003582948,0.03308415],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02603579,"threshold_uncertainty_score":0.08709836,"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."}}