{"id":"W3193902159","doi":"10.1109/isit45174.2021.9517737","title":"Universal Graph Compression: Stochastic Block Models","year":2021,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; National Science Foundation","keywords":"Sublinear function; Adjacency matrix; Entropy (arrow of time); Computer science; Cluster analysis; Graph; Theoretical computer science; Discrete mathematics; Mathematics; Combinatorics; Algorithm; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"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.001009698,0.0007519664,0.0009203434,0.001109053,0.0004153694,0.000936691,0.001645012,0.0009303059,0.003462445],"category_scores_gemma":[0.0068067,0.0004000141,0.0006014947,0.001862387,0.0009118757,0.002845409,0.00141635,0.001367238,0.0009535422],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001247238,"about_ca_system_score_gemma":0.001038945,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004384603,"about_ca_topic_score_gemma":0.004013509,"domain_scores_codex":[0.9991581,0.0002321079,0.00003943815,0.0001526667,0.0003120417,0.0001056178],"domain_scores_gemma":[0.9971686,0.001479176,0.0002708096,0.0006828292,0.0002991778,0.00009938446],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003281537,0.0001355645,0.0009510032,0.0002290419,0.00005780006,0.0002408826,0.0002133847,0.5722259,0.008677008,0.2328838,0.009598533,0.1744588],"study_design_scores_gemma":[0.000009809137,0.0000261583,0.00009359137,0.0000110503,0.000007924433,0.00005620714,0.00001318493,0.9628413,0.002109336,0.03323255,0.001590695,0.000008074719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02754733,0.001052715,0.9650343,0.0005434437,0.00007858072,0.00009174584,0.0003634766,0.0009428278,0.004345446],"genre_scores_gemma":[0.7056563,0.003170971,0.2744298,0.0006063721,0.0003330594,0.0003958253,0.001790924,0.0004536226,0.01316304],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004384603,"threshold_uncertainty_score":0.01158297,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02018587975636338,"score_gpt":0.2281725035859688,"score_spread":0.2079866238296054,"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."}}