{"id":"W2153291291","doi":"10.3217/jucs-013-11-1501","title":"Spectral Densest Subgraph and Independence Number of a Graph","year":2020,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Graph theory and applications","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Spectral radius; Independence number; Computer science; Induced subgraph isomorphism problem; Bounded function; Graph; Upper and lower bounds; Induced subgraph; Independence (probability theory); Combinatorics; RADIUS; Mathematics; Theoretical computer science; Physics; Line graph; Eigenvalues and eigenvectors; Statistics; Computer security","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009802866,0.0004819062,0.0006077897,0.001501317,0.0007492186,0.001253946,0.0009873515,0.0007057025,0.005214503],"category_scores_gemma":[0.006362138,0.0004467892,0.000484807,0.001066305,0.001647509,0.002345686,0.001278907,0.001295386,0.0005365124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008145533,"about_ca_system_score_gemma":0.000419955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006559583,"about_ca_topic_score_gemma":0.0006922418,"domain_scores_codex":[0.9989537,0.0003301422,0.00004578879,0.0002888107,0.0002681933,0.0001133235],"domain_scores_gemma":[0.9907932,0.006560193,0.0008742604,0.0006436388,0.0005519653,0.0005768267],"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.001524198,0.0007506976,0.02239288,0.00103916,0.000280002,0.0007391821,0.0008763852,0.2112412,0.07813481,0.5770983,0.01345791,0.09246519],"study_design_scores_gemma":[0.00009560596,0.0001550292,0.006491636,0.00003734633,0.00005600983,0.0008566757,0.0002034686,0.4838482,0.02439058,0.4811471,0.002680175,0.00003825911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6102534,0.0003499252,0.3725452,0.000948874,0.00004046898,0.0001147868,0.0009116587,0.0005538012,0.01428197],"genre_scores_gemma":[0.9401769,0.0001524309,0.05618761,0.0001192143,0.00007478848,0.00008131284,0.0008817735,0.0001214531,0.002204615],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005214503,"threshold_uncertainty_score":0.01744425,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05640157519939652,"score_gpt":0.2837543949453483,"score_spread":0.2273528197459518,"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."}}