{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001982945,0.0008365569,0.001514257,0.0005986654,0.00215993,0.001831437,0.003045484,0.00173783,0.008151525],"category_scores_gemma":[0.009657968,0.0007991266,0.00156249,0.0009674343,0.001855302,0.005287474,0.003601446,0.001788252,0.003181476],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001578568,"about_ca_system_score_gemma":0.001982524,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001182278,"about_ca_topic_score_gemma":0.003375255,"domain_scores_codex":[0.9966853,0.001355861,0.0001796936,0.0008129278,0.0005637619,0.0004024156],"domain_scores_gemma":[0.9882118,0.004661449,0.0008085121,0.005365433,0.0004731883,0.0004795752],"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.01000321,0.001536148,0.02823687,0.001736457,0.001361706,0.001738367,0.002258179,0.2416027,0.1819028,0.2837276,0.05134298,0.1945532],"study_design_scores_gemma":[0.0009381554,0.0005954286,0.006637657,0.0001050599,0.0004284308,0.001803886,0.0006522254,0.6057988,0.08908811,0.2749964,0.01876549,0.0001904674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4783989,0.0004154646,0.4817372,0.007487141,0.0001995013,0.000905229,0.002844749,0.003481226,0.02453067],"genre_scores_gemma":[0.909412,0.0001930892,0.07681711,0.0006903035,0.00007925551,0.000637033,0.001620631,0.0004309189,0.01011972],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008151525,"threshold_uncertainty_score":0.0272696,"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."}}