{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005222109,0.001063499,0.001860491,0.001892815,0.002933705,0.00326963,0.003745111,0.002511744,0.007286925],"category_scores_gemma":[0.04523541,0.0008915897,0.002075478,0.003221711,0.005181846,0.01443528,0.003326547,0.008259242,0.001119978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00346196,"about_ca_system_score_gemma":0.001008994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006419553,"about_ca_topic_score_gemma":0.003135448,"domain_scores_codex":[0.9949404,0.00163812,0.0001393132,0.001562662,0.001094934,0.0006244811],"domain_scores_gemma":[0.9383795,0.04771869,0.002541108,0.007001902,0.002075958,0.002282875],"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.0005184225,0.0002596642,0.004696952,0.0002820141,0.0001986611,0.000421219,0.001158388,0.04391987,0.005516924,0.8642766,0.03353626,0.04521501],"study_design_scores_gemma":[0.0001146116,0.0002334559,0.003704405,0.0000615317,0.0001305355,0.0002657106,0.0001523335,0.1931247,0.002704988,0.7763664,0.02305098,0.00009043107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2581612,0.01404573,0.5817685,0.06183636,0.002278829,0.0001809896,0.001025844,0.001949118,0.07875346],"genre_scores_gemma":[0.920104,0.004480398,0.04579369,0.00571243,0.004224185,0.00017809,0.0004687996,0.0006023031,0.01843621],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007286925,"threshold_uncertainty_score":0.02761751,"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."}}