{"id":"W2030099274","doi":"10.1002/rsa.20491","title":"Sets that are connected in two random graphs","year":2013,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; struct; Mathematics; Random graph; Vertex (graph theory); Vertex connectivity; Set (abstract data type); Random regular graph; Discrete mathematics; Graph; Chordal graph; Computer science; 1-planar graph","routes":{"ca_aff":true,"ca_fund":false,"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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003842987,0.0004132437,0.0008377672,0.0002385799,0.000314151,0.000146641,0.0002700644,0.0001552444,0.0004948416],"category_scores_gemma":[0.0002715872,0.0002823699,0.0001900528,0.0002407463,0.0002352822,0.0002098897,0.0001376803,0.0003877739,0.000003158998],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001810031,"about_ca_system_score_gemma":0.00001358251,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002354544,"about_ca_topic_score_gemma":0.00009346172,"domain_scores_codex":[0.9979496,0.0002584335,0.0004685752,0.0004755609,0.0003294502,0.0005183954],"domain_scores_gemma":[0.9980378,0.001054943,0.0002343901,0.0004135615,0.0000827839,0.0001765442],"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.003542504,0.0002706834,0.0781718,0.0009289547,0.00116618,0.0003239846,0.01167523,0.00012424,0.001514419,0.7260953,0.0113259,0.1648608],"study_design_scores_gemma":[0.02321736,0.00003165498,0.0325495,0.00006981068,0.0000531525,0.00008678267,0.0005626936,0.001323687,0.0005101315,0.9409136,0.0002572734,0.0004243534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9952663,0.001184452,0.000557117,0.0001857701,0.0005932044,0.001038075,0.00004128851,0.0001217432,0.001012109],"genre_scores_gemma":[0.9939609,0.0002162873,0.005192754,0.0002660297,0.0001259084,0.00007414677,0.00001224158,0.00004625376,0.0001055407],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2148183,"threshold_uncertainty_score":0.9999629,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02224507679503553,"score_gpt":0.2897099671517167,"score_spread":0.2674648903566812,"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."}}