{"id":"W3033055443","doi":"10.48550/arxiv.2006.02643","title":"Universal Graph Compression: Stochastic Block Models","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Lossless compression; Adjacency matrix; Computer science; Stochastic block model; Theoretical computer science; Data compression; Graph; Cluster analysis; Algorithm; Data mining; Artificial intelligence","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001005322,0.0005422059,0.0006541428,0.0007542015,0.0003264252,0.0006837829,0.001160907,0.0006972409,0.001789091],"category_scores_gemma":[0.005379559,0.0002530941,0.0004320038,0.0011964,0.0009159921,0.002090917,0.0009400038,0.001132932,0.0004134049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001020309,"about_ca_system_score_gemma":0.0008081556,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003412455,"about_ca_topic_score_gemma":0.003122267,"domain_scores_codex":[0.9993926,0.0001965202,0.00002380378,0.0001079818,0.0002084099,0.00007066769],"domain_scores_gemma":[0.997766,0.00127479,0.0002630057,0.0004086386,0.0002075695,0.00008001225],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001723624,0.00007324907,0.0007402524,0.0001171317,0.00003567526,0.0001429398,0.0001155984,0.6883071,0.00657085,0.2306219,0.003753179,0.06934974],"study_design_scores_gemma":[0.000005355629,0.00001662297,0.0000814997,0.000005055272,0.000003817037,0.00002355789,0.000006914431,0.9747785,0.001118571,0.02331687,0.0006386747,0.000004591694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0303295,0.0006151189,0.9651102,0.0005530245,0.00004701113,0.00005553589,0.0002947111,0.0003678403,0.002626935],"genre_scores_gemma":[0.7944748,0.001814374,0.1945484,0.0003528186,0.0001988492,0.0002729016,0.001083637,0.0001717118,0.00708251],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003412455,"threshold_uncertainty_score":0.007402897,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08069557717156832,"score_gpt":0.1988825933070925,"score_spread":0.1181870161355241,"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."}}