{"id":"W4411725783","doi":"10.1109/iscas56072.2025.11044080","title":"MATSORT: Fast and Efficient Approximate Matrix Sorting Algorithm for DNN Applications","year":2025,"lang":"en","type":"article","venue":"","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Computer science; Sorting; Algorithm; Matrix (chemical analysis); Sorting algorithm; Parallel computing; Algorithm design","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.0004179494,0.001104044,0.0005250638,0.001107525,0.000629999,0.0009421029,0.001519205,0.0006563976,0.006623131],"category_scores_gemma":[0.001505453,0.0003892393,0.0005036579,0.001222641,0.0003512559,0.001589718,0.0009337034,0.0007988784,0.002310776],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000870971,"about_ca_system_score_gemma":0.002104098,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007072781,"about_ca_topic_score_gemma":0.01776763,"domain_scores_codex":[0.9996423,0.00004269669,0.00003704582,0.00005401919,0.0001827106,0.00004127328],"domain_scores_gemma":[0.9995968,0.000113737,0.00004181006,0.00005804143,0.0001586166,0.00003102003],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005675613,0.0001274926,0.001296501,0.0003675672,0.0001147662,0.0002410048,0.0001623676,0.1180403,0.03129001,0.0206432,0.0312476,0.7959016],"study_design_scores_gemma":[0.00008084963,0.0001193534,0.0002504295,0.00003102839,0.00002195133,0.0001605397,0.00006911268,0.9464846,0.02212638,0.01213345,0.01849369,0.0000286379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0222658,0.0008713705,0.9573384,0.0002996349,0.000228309,0.0001580708,0.0004953653,0.01191213,0.006430861],"genre_scores_gemma":[0.1078536,0.0004901844,0.8831862,0.000246241,0.00007233959,0.0002344513,0.001557917,0.0006109063,0.005748232],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007072781,"threshold_uncertainty_score":0.02215654,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00837458434797329,"score_gpt":0.2776335451684636,"score_spread":0.2692589608204903,"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."}}