{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001812118,0.0001333451,0.0001331281,0.0004215033,0.0002831131,0.00004989304,0.0001625521,0.00003747414,0.0005415087],"category_scores_gemma":[4.413233e-7,0.0001301979,0.0001563721,0.0006254596,0.00005043735,0.0007668775,0.000002467075,0.0001903087,0.0003915475],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002516773,"about_ca_system_score_gemma":0.00002563519,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001937881,"about_ca_topic_score_gemma":0.000001045526,"domain_scores_codex":[0.9992182,0.00005810157,0.0002543707,0.00009691664,0.0001892614,0.0001831166],"domain_scores_gemma":[0.9994059,0.0001104436,0.00009120072,0.0002566582,0.00007151572,0.00006430501],"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.00004448479,0.00003887542,0.000001249718,0.000004690954,0.00008767613,1.775795e-7,0.0008196027,0.8861665,0.00002374967,0.06835015,0.001907444,0.04255535],"study_design_scores_gemma":[0.0007750543,0.00007114215,0.00002978297,0.00007348888,0.0001320261,0.000001571682,0.002833915,0.6838936,0.002312302,0.3077857,0.00165724,0.0004341738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004409064,0.000001651098,0.982403,0.00005609058,0.0001607142,0.0001676695,0.00006075851,0.0004613191,0.01227972],"genre_scores_gemma":[0.9991053,0.00000234028,0.0002195051,0.00005692826,0.00003823826,0.00004914152,0.0000457928,0.000009813734,0.0004729732],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9946962,"threshold_uncertainty_score":0.5929141,"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."}}