{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002140317,0.0003718157,0.001103661,0.003122868,0.001559029,0.003620493,0.00120541,0.001831637,0.003732036],"category_scores_gemma":[0.02052412,0.0007399371,0.0006499558,0.001296766,0.003773825,0.003602153,0.002505242,0.001137474,0.0002498976],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001251221,"about_ca_system_score_gemma":0.0003715536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005363774,"about_ca_topic_score_gemma":0.0004503578,"domain_scores_codex":[0.997937,0.0007045207,0.0001254616,0.0003762679,0.0005497053,0.0003070466],"domain_scores_gemma":[0.9732369,0.01848429,0.00323164,0.001435955,0.001087769,0.002523458],"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.001980294,0.000495291,0.03326693,0.0004430051,0.0003011998,0.002598771,0.002511567,0.0589291,0.01596569,0.8616514,0.003716811,0.01814001],"study_design_scores_gemma":[0.0002968255,0.0002219727,0.01487282,0.0001382262,0.0001630568,0.001665661,0.001257622,0.2306524,0.007841263,0.7399623,0.002803495,0.0001245371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9768456,0.000138499,0.01693472,0.0005651197,0.00002001112,0.00004046462,0.0001120956,0.0001210392,0.005222403],"genre_scores_gemma":[0.9959249,0.00003875382,0.003334447,0.00008179981,0.0000187198,0.00004925317,0.0001331947,0.00001463843,0.0004041065],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003732036,"threshold_uncertainty_score":0.01248485,"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."}}