{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0000714053,0.00047277,0.0006090016,0.0002425817,0.000198765,0.00007042175,0.001058748,0.0001749154,0.0003684625],"category_scores_gemma":[0.000001925218,0.0005698189,0.0005823722,0.0006011277,0.0001461252,0.0001683228,0.001838359,0.0009175374,0.00005221985],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001014362,"about_ca_system_score_gemma":0.0001401654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000446984,"about_ca_topic_score_gemma":0.0000140844,"domain_scores_codex":[0.9980314,0.0001311736,0.0002450798,0.00109849,0.0001146933,0.0003791218],"domain_scores_gemma":[0.998268,0.00006885516,0.000320802,0.0009189479,0.0001472089,0.0002761592],"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.00004318577,0.00009229613,0.0005240608,0.00001844841,0.0003853743,0.00004613763,0.0001044008,0.8024402,0.00001977076,0.193374,0.002740467,0.0002116924],"study_design_scores_gemma":[0.0003092613,0.0000226323,0.00005467064,0.00009273249,0.0003819721,3.453594e-7,0.0001738823,0.6287218,0.00002368458,0.3695082,0.0002446834,0.0004661338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07170051,0.00003970565,0.9104887,0.0001102798,0.0001652956,0.0003940407,0.0001054356,0.0004179033,0.01657816],"genre_scores_gemma":[0.9982373,0.00001155107,0.0004825834,0.00003333571,0.0003102164,0.000001670596,0.0001632181,0.00004428898,0.000715849],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9265368,"threshold_uncertainty_score":0.9996753,"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."}}