{"id":"W3107248454","doi":"10.1007/s11786-020-00495-9","title":"Mathematics in Computer Science volume / Common Factors in Fraction-Free Matrix Decompositions","year":2021,"lang":"en","type":"article","venue":"University Library Linz repository (Johannes Kepler Universitat Linz)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University","funders":"","keywords":"Fraction (chemistry); Mathematics; Matrix (chemical analysis); LU decomposition; Reduction (mathematics); Computation; QR decomposition; Sparse matrix; Matrix decomposition; Triangular matrix; Combinatorics; Eigenvalues and eigenvectors; Algorithm; Pure mathematics; Computational chemistry; Gaussian; Geometry; Physics","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.0002055333,0.000325076,0.0004199814,0.0016064,0.0007879924,0.0003821921,0.002556668,0.0001845295,0.00007800172],"category_scores_gemma":[0.00002021664,0.0004052866,0.0002390917,0.003974826,0.000410073,0.005744318,0.001941179,0.0005106332,0.00002440647],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002871514,"about_ca_system_score_gemma":0.0004730657,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008975356,"about_ca_topic_score_gemma":0.0001082858,"domain_scores_codex":[0.997407,0.0003066385,0.0003689717,0.0008975411,0.0004524648,0.0005674537],"domain_scores_gemma":[0.9977055,0.0003906737,0.0001919537,0.001287727,0.0001391034,0.000285058],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002853783,0.004350273,0.4878519,0.0002702421,0.0002275415,0.01222608,0.02025828,0.01348289,0.005268427,0.4496431,0.004454289,0.00168157],"study_design_scores_gemma":[0.01441991,0.001794975,0.3447466,0.002467381,0.0003851595,0.000901072,0.04546468,0.3726807,0.06446424,0.09069552,0.05480136,0.007178444],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9177397,0.0001086755,0.06701483,0.001159681,0.001001245,0.000254872,0.0000276049,0.0004940929,0.01219926],"genre_scores_gemma":[0.9399933,0.00005865168,0.05797835,0.0001224968,0.00008821792,5.019914e-7,0.00003216234,0.00002401065,0.001702332],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3591978,"threshold_uncertainty_score":0.9998399,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006337564556684981,"score_gpt":0.1919840487641199,"score_spread":0.1856464842074349,"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."}}