{"id":"W4220892078","doi":"10.1007/s42979-022-01084-2","title":"Graph Compression for Adjacency-Matrix Multiplication","year":2022,"lang":"en","type":"article","venue":"SN Computer Science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"Xunta de Galicia; H2020 Marie Skłodowska-Curie Actions; Academy of Finland; European Commission","keywords":"Adjacency matrix; Computer science; Graph energy; Computation; Adjacency list; Matrix multiplication; PageRank; Graph; Theoretical computer science; Algorithm; Line graph; Voltage graph","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.0003859331,0.0007259235,0.0004657568,0.001401109,0.0003813264,0.0008092703,0.0008054855,0.0005169752,0.007028652],"category_scores_gemma":[0.003641714,0.0001604667,0.0003476789,0.002615472,0.0005324117,0.001668267,0.000892227,0.0007588356,0.001279863],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005686721,"about_ca_system_score_gemma":0.0005184456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00203844,"about_ca_topic_score_gemma":0.002381799,"domain_scores_codex":[0.9993535,0.0001465351,0.0000364339,0.0001088672,0.0002880269,0.00006660666],"domain_scores_gemma":[0.9980875,0.0008916894,0.0001212433,0.0005260305,0.0003130088,0.00006050634],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00125736,0.0004039692,0.001613365,0.0005238594,0.00009189203,0.0005408237,0.0003160985,0.1189533,0.04387385,0.104689,0.03699026,0.6907462],"study_design_scores_gemma":[0.000143223,0.0002738062,0.001157063,0.00005096459,0.00003114726,0.0006197633,0.0001548799,0.8192902,0.05467337,0.1085869,0.01498676,0.00003206006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2304276,0.002330381,0.738414,0.001688148,0.0005980041,0.0003314706,0.001740621,0.008649687,0.01582005],"genre_scores_gemma":[0.6009744,0.0006167842,0.3902587,0.0002666753,0.000274055,0.0002186968,0.001774255,0.000292503,0.005323956],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007028652,"threshold_uncertainty_score":0.02351314,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01336203389821897,"score_gpt":0.2675174534668748,"score_spread":0.2541554195686558,"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."}}