{"id":"W4320024124","doi":"10.1109/bigdata55660.2022.10020422","title":"Dynamic Graph Summarization: Optimal and Scalable","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Conference on Big Data (Big Data)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Automatic summarization; Computer science; Scalability; Lossless compression; Graph; Theoretical computer science; Algorithm; Artificial intelligence; Data compression","routes":{"ca_aff":true,"ca_fund":false,"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":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0009428939,0.0002251869,0.0001911905,0.0003333503,0.0005054172,0.000546813,0.008319966,0.00004426768,0.0003776515],"category_scores_gemma":[0.00008134788,0.0002388949,0.00003008136,0.0005438657,0.0001368893,0.001423851,0.006648605,0.0004345763,0.00005050478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005206601,"about_ca_system_score_gemma":0.0001816669,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005410695,"about_ca_topic_score_gemma":0.00005576893,"domain_scores_codex":[0.9969995,0.0001952443,0.0003231668,0.001260124,0.0009213287,0.000300639],"domain_scores_gemma":[0.9967743,0.0001167366,0.0001726773,0.002699526,0.0001096603,0.0001271326],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001501122,0.0005800648,0.0005643301,0.0000241277,0.0002654797,0.0002095167,0.0002991545,0.001046153,0.002230699,0.4530905,0.03444255,0.5070974],"study_design_scores_gemma":[0.000756553,0.0001811652,0.0005770667,0.00002971366,0.00001876725,0.0001135561,0.0001915017,0.9121439,0.0001177813,0.01921738,0.06617222,0.0004804143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01512603,0.000223947,0.9249254,0.006785614,0.01688935,0.000470875,0.02884995,0.0003235827,0.006405284],"genre_scores_gemma":[0.9604231,0.0004219676,0.01008471,0.001250414,0.0003907443,0.00006652655,0.02536394,0.00002913041,0.001969503],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9452971,"threshold_uncertainty_score":0.9970455,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.158207502154851,"score_gpt":0.3135448753019634,"score_spread":0.1553373731471124,"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."}}