{"id":"W2056191455","doi":"10.1002/rsa.20543","title":"Sandwiching a densest subgraph by consecutive cores","year":2014,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Vertex (graph theory); Core (optical fiber); Mathematics; Induced subgraph; Graph; Set (abstract data type); Induced subgraph isomorphism problem; Random graph; Integer (computer science); Discrete mathematics; Computer science; Line 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":[],"consensus_categories":[],"category_scores_codex":[0.0004373072,0.0003374609,0.0005625404,0.0000994962,0.0006120253,0.0001114524,0.0002108699,0.0001619384,0.0000861357],"category_scores_gemma":[0.0004252275,0.0002352229,0.0001524476,0.0001182814,0.0003594726,0.00008466164,0.0001099561,0.0002886684,8.244367e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001000383,"about_ca_system_score_gemma":0.00001236006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005129357,"about_ca_topic_score_gemma":0.00001199019,"domain_scores_codex":[0.9983485,0.0002268612,0.0003511629,0.0004081456,0.0002761044,0.000389238],"domain_scores_gemma":[0.997962,0.001321099,0.0001691836,0.0003149923,0.00006343056,0.0001692822],"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.0007690024,0.00004969268,0.003372251,0.0002042784,0.0004368996,0.00002107488,0.004074463,0.000005783991,0.001923956,0.9127183,0.016676,0.05974831],"study_design_scores_gemma":[0.005488193,0.0001127999,0.001943039,0.00003987356,0.0001138365,0.0001322446,0.0002610792,0.0008037218,0.001748632,0.9825357,0.006381934,0.0004389352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9753753,0.001576214,0.01891639,0.0001246936,0.0006385767,0.0004132366,0.00009950669,0.0001583383,0.002697777],"genre_scores_gemma":[0.991716,0.0001640186,0.007263009,0.0003526713,0.0002618651,0.00001294696,0.00001366721,0.00003970684,0.0001761486],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06981742,"threshold_uncertainty_score":0.9592113,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01196335535864054,"score_gpt":0.2657602499152009,"score_spread":0.2537968945565604,"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."}}