{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001590162,0.0007151394,0.001020261,0.001764974,0.001517795,0.001913838,0.001237265,0.001192386,0.00740389],"category_scores_gemma":[0.006159287,0.0005042593,0.001409905,0.001380475,0.002942462,0.005013369,0.002750674,0.002134802,0.0009044007],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00193825,"about_ca_system_score_gemma":0.000623069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001387256,"about_ca_topic_score_gemma":0.0009893337,"domain_scores_codex":[0.9990325,0.0002223532,0.00005681126,0.0002303139,0.0002301982,0.00022787],"domain_scores_gemma":[0.9965256,0.00219082,0.0002245688,0.0004124157,0.0004211652,0.0002254954],"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.00003112712,0.00001197367,0.0003900628,0.00005938661,0.0000194675,0.00008032724,0.0001838516,0.00218007,0.001277857,0.9881591,0.002075147,0.005531583],"study_design_scores_gemma":[0.00001579915,0.00001487131,0.0002612553,0.0000137367,0.00001161604,0.0001086686,0.00003930988,0.01085578,0.0005583268,0.9844241,0.003688043,0.000008527602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2946247,0.001629065,0.5550002,0.004775224,0.0003542027,0.0001175242,0.0007494481,0.0009372096,0.1418123],"genre_scores_gemma":[0.9330842,0.0009657585,0.04664599,0.001422574,0.0002525502,0.0002243997,0.0004725283,0.0002392201,0.01669275],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00740389,"threshold_uncertainty_score":0.02476847,"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."}}