{"id":"W6910511906","doi":"10.48550/arxiv.0909.4277","title":"Sharp Bounds for Sums Associated to Graphs of Matrices","year":2009,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Upper and lower bounds; Simple (philosophy); Graph; Matrix (chemical analysis); Graph theory; Simple 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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005496302,0.0002671229,0.0004256486,0.0004287943,0.0001355025,0.0001093482,0.002236291,0.000261454,0.00001739408],"category_scores_gemma":[0.00007094451,0.0003056307,0.0003457807,0.0009732306,0.00005201091,0.0002504189,0.0009333201,0.0002504389,0.0000193682],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001028982,"about_ca_system_score_gemma":0.0001344365,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000616285,"about_ca_topic_score_gemma":0.00001770876,"domain_scores_codex":[0.9983461,0.000114321,0.0002453946,0.0008312003,0.0001024179,0.0003605759],"domain_scores_gemma":[0.9981861,0.0001851864,0.0003495667,0.0008630818,0.0002485565,0.0001675266],"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.00007020515,0.0002497903,0.0005316174,0.0001494161,0.0001709379,0.00006259468,0.0003134136,0.03468543,0.00007734175,0.9597487,0.00134047,0.002600102],"study_design_scores_gemma":[0.0007861538,0.0003166294,0.001530748,0.0002037866,0.0001269409,0.000001723454,0.00004269035,0.1829104,0.0007257421,0.8110978,0.001544052,0.0007133479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2027362,0.00009680478,0.7931492,0.0001429731,0.0006016077,0.0005955924,0.0001095847,0.0002480159,0.002319975],"genre_scores_gemma":[0.9919947,0.00006646055,0.005988603,0.0001211991,0.00004380931,0.000001560319,0.00002266498,0.00001259581,0.001748422],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7892585,"threshold_uncertainty_score":0.9999396,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05066603107505234,"score_gpt":0.2000545158371362,"score_spread":0.1493884847620839,"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."}}