{"id":"W2975606440","doi":"10.48550/arxiv.1909.11147","title":"Random $k$-out subgraph leaves only $O(n/k)$ inter-component edges","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Vertex connectivity; Mathematics; Randomness; Graph; Conjecture; Binary logarithm; Vertex (graph theory); Simple graph; Connected component; Discrete mathematics; Statistics","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.0004234614,0.0006214898,0.0007732268,0.0007023788,0.000256185,0.0003603536,0.00446263,0.0003896842,0.00007197612],"category_scores_gemma":[0.00003451901,0.000691928,0.0007814498,0.0006436117,0.0003139082,0.0005251457,0.004842423,0.001156612,0.0004378341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001744185,"about_ca_system_score_gemma":0.0003119257,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002042314,"about_ca_topic_score_gemma":0.0001350303,"domain_scores_codex":[0.9966146,0.0003015854,0.0003854165,0.001845653,0.00020155,0.0006512208],"domain_scores_gemma":[0.9963363,0.0003284574,0.0003785852,0.002491788,0.0002064333,0.0002584564],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004922188,0.001217595,0.02004716,0.0007274212,0.001312797,0.001425161,0.003411071,0.0992341,0.0002099893,0.8373877,0.006952077,0.02758273],"study_design_scores_gemma":[0.005893478,0.0003382841,0.006972222,0.0009284908,0.000284917,0.00005785955,0.0003518851,0.6809342,0.001363057,0.2843243,0.01530173,0.003249568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1506397,0.000245661,0.8386034,0.0002562939,0.003791885,0.0005454911,0.00003469761,0.000530916,0.005352001],"genre_scores_gemma":[0.9920809,0.0003752284,0.003217076,0.0001797084,0.0001830447,0.000001600625,0.00002633282,0.00003073009,0.003905326],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8414413,"threshold_uncertainty_score":0.9995532,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0752443634174639,"score_gpt":0.1953759112142259,"score_spread":0.120131547796762,"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."}}