{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007839297,0.0006868908,0.0008851004,0.001700179,0.0006899672,0.001315907,0.001418527,0.0007005589,0.002205898],"category_scores_gemma":[0.01029125,0.0003037969,0.0005104454,0.00292289,0.0008800165,0.005118994,0.001860562,0.001030617,0.0009892475],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009583425,"about_ca_system_score_gemma":0.0009555821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001778827,"about_ca_topic_score_gemma":0.002238595,"domain_scores_codex":[0.9987265,0.0002757485,0.0001191786,0.0002408429,0.0005238554,0.0001138372],"domain_scores_gemma":[0.9944504,0.001780936,0.0005075255,0.002461505,0.0006577326,0.0001419327],"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.001111441,0.0003351942,0.009551226,0.000713153,0.0001568368,0.000654117,0.001944448,0.1651927,0.04786123,0.1140675,0.0296659,0.6287462],"study_design_scores_gemma":[0.00009662106,0.000280528,0.00254653,0.00007746651,0.00007284492,0.0008977454,0.0009556459,0.7982685,0.0470785,0.1295214,0.0201415,0.00006269589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2449386,0.002628683,0.7296799,0.003302114,0.0002588956,0.0004666625,0.004826611,0.004977799,0.008920666],"genre_scores_gemma":[0.7630053,0.001373714,0.2241555,0.0004625519,0.0002532181,0.0003885706,0.005484811,0.0002651348,0.004611304],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002205898,"threshold_uncertainty_score":0.007379472,"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."}}