{"id":"W2165971212","doi":"10.1145/1835804.1835873","title":"Neighbor query friendly compression of social networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Social network (sociolinguistics); Theoretical computer science; Benchmark (surveying); Data mining; Sublinear function; Data compression; k-nearest neighbors algorithm; Compression (physics); Algorithm; Social media; Artificial intelligence; World Wide Web; Mathematics; Discrete mathematics","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":[],"consensus_categories":[],"category_scores_codex":[0.0001937414,0.00006655828,0.00009995981,0.00003796078,0.0001080198,0.00003231435,0.0005219842,0.00007013447,0.0001186682],"category_scores_gemma":[0.000006829692,0.00005132645,0.00006056895,0.000180471,0.00007135059,0.0002135685,0.0001569086,0.0001768632,0.000009523798],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001383132,"about_ca_system_score_gemma":0.00001364289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006990771,"about_ca_topic_score_gemma":0.000004665118,"domain_scores_codex":[0.9994199,0.00003661663,0.0001270904,0.0001555729,0.0001128355,0.0001479526],"domain_scores_gemma":[0.9995667,0.00005853465,0.00005705132,0.0002310202,0.00004217304,0.0000444605],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000349545,0.00004527225,0.0001784392,0.000002280834,0.000004436041,0.000001776569,0.0001858747,0.00003123108,0.005862469,0.9609212,0.00105104,0.03171244],"study_design_scores_gemma":[0.001304707,0.0002479377,0.03588672,0.00002516473,0.00001383108,0.00002379833,0.0001407645,0.7331586,0.04458891,0.1637238,0.02016067,0.0007250762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07083888,0.00001139017,0.911992,0.0002271058,0.0009732559,0.00004916256,8.604538e-7,0.0001059029,0.01580145],"genre_scores_gemma":[0.9770422,6.82259e-7,0.02246292,0.0001198996,0.0001283221,0.000001914823,8.932757e-7,0.000003162257,0.0002400367],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9062033,"threshold_uncertainty_score":0.2093032,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.004371475453233396,"score_gpt":0.2207293016155749,"score_spread":0.2163578261623415,"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."}}