{"id":"W4386634662","doi":"10.1109/tit.2023.3314048","title":"Universal Graph Compression: Stochastic Block Models","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Adjacency matrix; Lossless compression; Computer science; Cluster analysis; Adjacency list; Data compression; Asymptotically optimal algorithm; Algorithm; Discrete mathematics; Graph; Theoretical computer science; Mathematics; Combinatorics; 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.0009799798,0.0005418399,0.0006737967,0.000733562,0.0003235589,0.0006833464,0.001160632,0.0007026286,0.001778298],"category_scores_gemma":[0.005153129,0.0002429707,0.0004313514,0.001182537,0.0008889451,0.002038348,0.0009070854,0.001093045,0.0004107031],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001006024,"about_ca_system_score_gemma":0.0008167572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003531089,"about_ca_topic_score_gemma":0.003301875,"domain_scores_codex":[0.9994102,0.0001835493,0.00002343445,0.0001050399,0.0002049434,0.00007283611],"domain_scores_gemma":[0.9978981,0.001195005,0.0002430445,0.0003819662,0.0002057701,0.00007605607],"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.0001718303,0.00007035422,0.0006762136,0.0001125045,0.00003233711,0.0001453351,0.0001053053,0.7090557,0.006300185,0.2111226,0.003715171,0.06849245],"study_design_scores_gemma":[0.000004982391,0.00001735533,0.00007353345,0.000004753428,0.000003644263,0.00002403474,0.000006434866,0.9788118,0.001016258,0.01945159,0.0005811436,0.000004479751],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03145587,0.0006646274,0.9637144,0.0005425752,0.00005180645,0.00006074784,0.0003038927,0.0003911378,0.002814943],"genre_scores_gemma":[0.8030279,0.001847633,0.186023,0.0003646779,0.0001930395,0.0002683827,0.001090309,0.0001622004,0.007022854],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003531089,"threshold_uncertainty_score":0.007299244,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01266118923064728,"score_gpt":0.2365463749894418,"score_spread":0.2238851857587946,"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."}}