{"id":"W4224273243","doi":"10.1007/s42979-022-01141-w","title":"Correction to: Graph Compression for Adjacency-Matrix Multiplication","year":2022,"lang":"en","type":"article","venue":"SN Computer Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Adjacency matrix; Adjacency list; Matrix multiplication; Computer science; Multiplication (music); Compression (physics); Graph; Arithmetic; Mathematics; Combinatorics; Theoretical computer science; Algorithm; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001884569,0.003026786,0.003093456,0.004090303,0.003214398,0.003355138,0.004436368,0.01049665,0.1236309],"category_scores_gemma":[0.05900158,0.001708872,0.002313075,0.00284817,0.002787556,0.002589708,0.002028508,0.009118392,0.06009565],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003329117,"about_ca_system_score_gemma":0.002722334,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00970021,"about_ca_topic_score_gemma":0.00885959,"domain_scores_codex":[0.9954482,0.0005850265,0.0008952721,0.0008347626,0.001662755,0.0005740135],"domain_scores_gemma":[0.9717429,0.008050992,0.001126559,0.002812876,0.01496597,0.001300676],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001587992,0.00002188788,0.0001348619,0.0001786959,0.00003745834,0.001076881,0.00003700507,0.0002317065,0.0002892811,0.001300661,0.9823794,0.01415321],"study_design_scores_gemma":[0.0002593166,0.0001231422,0.001514314,0.0002837988,0.00007180651,0.00400674,0.0001381374,0.004701356,0.003341215,0.009170745,0.9762512,0.000138305],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"other","genre_scores_codex":[0.0007499505,0.0009502801,0.005013175,0.04312221,0.9425396,0.00006563027,0.00164467,0.003546158,0.002368315],"genre_scores_gemma":[0.0997657,0.005942948,0.04499753,0.1028246,0.4898404,0.0007152645,0.006557933,0.007516488,0.2418391],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.1236309,"threshold_uncertainty_score":0.4135864,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0157947102519098,"score_gpt":0.276548543446583,"score_spread":0.2607538331946732,"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."}}