{"id":"W2802142240","doi":"10.1016/j.jco.2018.06.002","title":"An upper bound on the smallest singular value of a square random matrix","year":2018,"lang":"en","type":"preprint","venue":"Journal of Complexity","topic":"Random Matrices and Applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"National Science Foundation","keywords":"Upper and lower bounds; Combinatorics; Square (algebra); Mathematics; Singular value; Order (exchange); Random matrix; Zero (linguistics); Moment (physics); Unit (ring theory); Matrix (chemical analysis); Second moment of area; Unit square; Value (mathematics); Square matrix; Mathematical analysis; Statistics; Symmetric matrix; Physics; Geometry; Eigenvalues and eigenvectors; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001988875,0.0002665486,0.0008810778,0.0001420611,0.0002091857,0.0001456956,0.000981605,0.0001856711,0.0003866872],"category_scores_gemma":[0.0003541906,0.0001628052,0.0006128827,0.0001220157,0.0002762848,0.00004949103,0.0001796188,0.0007575453,0.00001154539],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007134519,"about_ca_system_score_gemma":0.0002113012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004693066,"about_ca_topic_score_gemma":0.00001257454,"domain_scores_codex":[0.9974967,0.0003543709,0.001116411,0.0001944649,0.0006434729,0.0001946095],"domain_scores_gemma":[0.9952074,0.0009862527,0.002127756,0.0009420303,0.0006234493,0.0001131547],"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.002182505,0.001835622,0.0007024899,0.0009770856,0.001023282,0.00001770842,0.002346213,0.0003567473,0.0008003846,0.9745136,0.01494385,0.0003005039],"study_design_scores_gemma":[0.002193396,0.0002684267,0.001905401,0.0004986047,0.0003477396,0.00005729335,0.0001861298,0.002630099,0.0003572696,0.9890764,0.002281911,0.0001973299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9767638,0.0002642834,0.01855645,0.001742827,0.0003133133,0.0006437705,0.00006809675,0.00001740086,0.001630067],"genre_scores_gemma":[0.9561118,0.00006430994,0.04265295,0.00008342789,0.0009673435,0.00001311361,0.000007200826,0.00003896876,0.00006091057],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0240965,"threshold_uncertainty_score":0.6639004,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1036367221087673,"score_gpt":0.3792191234928621,"score_spread":0.2755824013840948,"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."}}