{"id":"W2292182108","doi":"10.48550/arxiv.1112.5052","title":"A method to rigorously enclose eigendecompositions of interval matrices","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"","keywords":"Interval (graph theory); Mathematics; Nonlinear system; Argument (complex analysis); Interval arithmetic; Set (abstract data type); Contraction (grammar); Applied mathematics; Pure mathematics; Algebra over a field; Mathematical analysis; Computer science; Combinatorics; Physics; Philosophy; Quantum mechanics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001717137,0.0006720172,0.0007162669,0.0006104259,0.0004564216,0.000903155,0.001185596,0.000815725,0.002597918],"category_scores_gemma":[0.005433781,0.000429144,0.0006878134,0.0003656712,0.001317111,0.001328482,0.001988468,0.002325673,0.001270155],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002897205,"about_ca_system_score_gemma":0.0007879955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005269839,"about_ca_topic_score_gemma":0.000531106,"domain_scores_codex":[0.9991297,0.0002940012,0.00004484208,0.00009370176,0.0003898447,0.00004797718],"domain_scores_gemma":[0.9978412,0.001278414,0.000172798,0.000327877,0.0003132523,0.0000663654],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001000382,0.00009057743,0.0006672922,0.0002617687,0.00005166708,0.0001755824,0.0003348801,0.3112037,0.04191197,0.5163369,0.002681034,0.1261846],"study_design_scores_gemma":[0.00001565375,0.00006569155,0.00007894775,0.00002406953,0.000005018662,0.0000829073,0.00002594094,0.9444026,0.006547162,0.04096715,0.007764554,0.00002045289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001173965,0.00001731553,0.9983152,0.0000158561,0.00001088941,0.00001041923,0.000007297698,0.00003932109,0.0004097692],"genre_scores_gemma":[0.06106626,0.0001104536,0.9366801,0.00007121367,0.00004374796,0.0001664708,0.000087527,0.0002444756,0.001529814],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002597918,"threshold_uncertainty_score":0.009081185,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1044123029806388,"score_gpt":0.2526498949516118,"score_spread":0.1482375919709731,"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."}}