{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001323162,0.0001442935,0.0001415788,0.0003612496,0.001890922,0.0002601656,0.003401785,0.00002019172,0.00001170389],"category_scores_gemma":[0.0000179673,0.0001376161,0.0001043963,0.001997295,0.0002308979,0.0008686302,0.001617982,0.0001573342,0.00001179928],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005971598,"about_ca_system_score_gemma":0.0001366247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004279865,"about_ca_topic_score_gemma":3.437106e-7,"domain_scores_codex":[0.997777,0.00009442136,0.000231709,0.0008064011,0.0006322006,0.0004582382],"domain_scores_gemma":[0.9985622,0.0001294387,0.0001338936,0.0008755072,0.0001533127,0.0001456085],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001860846,0.0002974888,0.000249679,0.00002066766,0.000008544999,0.000006594324,0.00227732,0.0166428,0.01543755,0.547368,0.002131016,0.4155417],"study_design_scores_gemma":[0.0004762379,0.0002601561,0.001331704,0.000009131615,0.00000270291,0.00003453613,0.00002631847,0.9056288,0.003811209,0.08070928,0.00743597,0.0002739668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008526566,0.00008503625,0.9878089,0.0007601164,0.001963019,0.0004195663,0.00001039025,0.0002643879,0.0001620141],"genre_scores_gemma":[0.6456604,0.000002083154,0.353619,0.0004070188,0.00009159423,0.000139608,0.000004722139,0.000006600941,0.00006896202],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.888986,"threshold_uncertainty_score":0.9994085,"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."}}