{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001950247,0.0006432682,0.001322786,0.001106368,0.001228573,0.001505809,0.001524711,0.0009978057,0.004033348],"category_scores_gemma":[0.01431832,0.000821724,0.00076481,0.0007203975,0.001902394,0.003918343,0.003447449,0.0009402743,0.0006360548],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005837924,"about_ca_system_score_gemma":0.0005751114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006348913,"about_ca_topic_score_gemma":0.0007431323,"domain_scores_codex":[0.9982003,0.0004900753,0.0001256032,0.0005242397,0.0003504716,0.0003093148],"domain_scores_gemma":[0.9865676,0.005911055,0.002167158,0.003279057,0.0007285027,0.001346666],"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.00347155,0.0004968914,0.04683886,0.0009868897,0.0006133286,0.003162674,0.002691782,0.1337457,0.1289893,0.5692569,0.007563366,0.1021828],"study_design_scores_gemma":[0.0002243083,0.0009022117,0.009570727,0.0001609505,0.0002535802,0.003867212,0.001016935,0.42417,0.0466673,0.5051424,0.007879406,0.00014499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8594813,0.000383841,0.1347774,0.0004335183,0.00005091305,0.00007452973,0.0001826207,0.0002897088,0.004326196],"genre_scores_gemma":[0.9792435,0.0001067298,0.01870615,0.0001531508,0.00002882132,0.00006299587,0.0001696391,0.00005846515,0.001470528],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004033348,"threshold_uncertainty_score":0.01349294,"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."}}