{"id":"W1821109783","doi":"10.37236/3357","title":"A Note on the Acquaintance Time of Random Graphs","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Conjecture; Upper and lower bounds; Random graph; Graph; Vertex (graph theory); Binary logarithm; Discrete mathematics","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.00134107,0.000140806,0.0003592607,0.00004893995,0.0001050083,0.00002458931,0.0006293114,0.0000536455,0.0001193558],"category_scores_gemma":[0.002133717,0.00006728352,0.0001493649,0.0003015616,0.00007438631,0.00005709453,0.00003560994,0.0006138313,0.00003144776],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009265421,"about_ca_system_score_gemma":0.0001975776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002594885,"about_ca_topic_score_gemma":5.189179e-7,"domain_scores_codex":[0.9983969,0.0001321006,0.0005039194,0.00007495982,0.0005125302,0.0003795478],"domain_scores_gemma":[0.9944094,0.004259288,0.0005837247,0.0002872414,0.0004061284,0.00005423954],"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.0001099285,0.0001136546,6.503242e-7,0.0000184053,0.00006947678,0.000001349891,0.0002171262,0.000004862495,0.0003581191,0.9971877,0.001339168,0.000579505],"study_design_scores_gemma":[0.0009773779,0.0007945792,0.000005281936,0.0000676709,0.00008700573,0.0000487273,0.00007502633,0.001906043,0.001539137,0.9942943,0.0001288463,0.0000759429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1481398,0.00138594,0.8428301,0.004972041,0.0004148611,0.0006331425,0.000003939855,0.00002107842,0.001599148],"genre_scores_gemma":[0.999289,0.0001601465,0.0001321925,0.0001559176,0.00003359659,0.000008001395,1.146267e-7,0.00001857678,0.0002024378],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8511492,"threshold_uncertainty_score":0.2743742,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01223750526682406,"score_gpt":0.2604109990754838,"score_spread":0.2481734938086598,"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."}}