{"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003125357,0.00009062784,0.0001260693,0.00006772702,0.0006053388,0.0001212301,0.0004221563,0.00004496328,0.003715096],"category_scores_gemma":[0.0004462862,0.00009358543,0.00004421123,0.0005221723,0.0002082844,0.0001106778,0.0003285709,0.0001847412,0.0006372039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009331195,"about_ca_system_score_gemma":0.000001748763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003896851,"about_ca_topic_score_gemma":1.905698e-7,"domain_scores_codex":[0.9990422,0.0001408161,0.0001929233,0.0002396674,0.0002125004,0.0001718673],"domain_scores_gemma":[0.9992691,0.00004792404,0.00009104166,0.0002326561,0.000212337,0.0001468921],"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.00006155573,0.0001292949,0.0001154806,0.0001416143,0.00004489119,0.000006390513,0.002389794,0.000002159968,0.009639192,0.96174,0.02066519,0.005064472],"study_design_scores_gemma":[0.001517745,0.0004466054,0.004258372,0.00008689437,0.0001092999,0.0004585526,0.001965349,0.0002468971,0.01098065,0.6278934,0.3514414,0.0005947983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9321264,0.00003553769,0.005812573,0.001148974,0.00001907874,0.0004204706,0.0001463672,0.0005230595,0.05976755],"genre_scores_gemma":[0.9981307,0.00003717565,0.001233266,0.00008567598,0.0000337144,3.507341e-8,0.00005708851,0.0003520164,0.00007033188],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3338465,"threshold_uncertainty_score":0.9971957,"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."}}