{"id":"W2949216217","doi":"10.1063/1.3622608","title":"Levinson's theorem for graphs","year":2011,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Graph theory and applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Mitacs","keywords":"Mathematics; Upper and lower bounds; Vertex (graph theory); Combinatorics; Bound state; Scattering; Graph; Path (computing); State (computer science); Discrete mathematics; Mathematical analysis; Physics; Quantum mechanics","routes":{"ca_aff":true,"ca_fund":true,"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.0007840706,0.0001360726,0.0003626582,0.00004746509,0.0000820123,0.00001594028,0.0003197748,0.00005903677,0.0001289588],"category_scores_gemma":[0.0003800087,0.00009641231,0.0004020057,0.0001443582,0.0001177202,0.0001454661,0.0000252258,0.0001726626,0.00002326306],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001179058,"about_ca_system_score_gemma":0.0000262937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.70662e-8,"about_ca_topic_score_gemma":6.920711e-8,"domain_scores_codex":[0.9989467,0.0000447189,0.0005269146,0.00008956697,0.0002088149,0.0001832621],"domain_scores_gemma":[0.9980338,0.0008921105,0.0004578942,0.0002716777,0.0002363463,0.0001082145],"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.00004361521,0.0006130183,0.000008466069,0.0001329725,0.00007713731,0.000001657286,0.0008857715,3.196766e-7,0.0004305384,0.9943761,0.001971227,0.001459239],"study_design_scores_gemma":[0.0003667172,0.0001481672,0.00001758967,0.00007913397,0.0001517927,0.0000346333,0.0002069128,0.00006171943,0.006061809,0.9923624,0.0003993644,0.0001097126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2029617,0.00004059557,0.7714733,0.0002593574,0.0001479849,0.0005177201,0.00001581811,0.00005493048,0.02452866],"genre_scores_gemma":[0.8130476,0.000006768266,0.1864884,0.00007388389,0.0001764943,0.00002104561,4.580955e-7,0.00003360287,0.00015167],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.610086,"threshold_uncertainty_score":0.393158,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1111894829714302,"score_gpt":0.3235141126207051,"score_spread":0.212324629649275,"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."}}