{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/community-detection","name":"Community Detection","slug":"community-detection","description_markdown":"**Community Detection** is one of the fundamental problems in network analysis, where the goal is to find groups of nodes that are, in some sense, more similar to each other than to the other nodes.\n\n\n<span class=\"description-source\">Source: [Randomized Spectral Clustering in Large-Scale Stochastic Block Models ](https://arxiv.org/abs/2002.00839)</span>","categories":[{"name":"Graphs","url":"/area/graphs"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":919,"papers_with_code":263,"benchmarks":14,"benchmark_tables_in_archive":14,"benchmark_tables_shown":14,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":13,"subtasks":3,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/community-detection-on-amazon","slug":"community-detection-on-amazon","dataset":"Amazon","dataset_url":null,"rows_in_archive":3,"metrics":["F1-score","Accuracy-NE","NMI"],"first_row_in_archive_order":{"model":"CommunityGAN","paper_title":"CommunityGAN: Community Detection with Generative Adversarial Nets","paper_url":"/paper/communitygan-community-detection-with","paper_date":"2019-01-20","arxiv_id":"1901.06631","code_links":[{"title":"SamJia/CommunityGAN","url":"https://github.com/SamJia/CommunityGAN"}],"syntology":null}},{"leaderboard":"/sota/community-detection-on-cora","slug":"community-detection-on-cora","dataset":"Cora","dataset_url":"/dataset/cora","rows_in_archive":2,"metrics":["NMI","ACC"],"first_row_in_archive_order":{"model":"EdMot","paper_title":"EdMot: An Edge Enhancement Approach for Motif-aware Community Detection","paper_url":"/paper/edmot-an-edge-enhancement-approach-for-motif-1","paper_date":"2019-05-30","arxiv_id":"1906.04560","code_links":[{"title":"benedekrozemberczki/EdMot","url":"https://github.com/benedekrozemberczki/EdMot"},{"title":"lipzh5/EdMot_pro","url":"https://github.com/lipzh5/EdMot_pro"}],"syntology":null}},{"leaderboard":"/sota/community-detection-on-citeseer","slug":"community-detection-on-citeseer","dataset":"Citeseer","dataset_url":"/dataset/citeseer","rows_in_archive":1,"metrics":["ACC","NMI"],"first_row_in_archive_order":{"model":"CDNMF","paper_title":"Contrastive Deep Nonnegative Matrix Factorization for Community Detection","paper_url":"/paper/contrastive-deep-nonnegative-matrix","paper_date":"2023-11-04","arxiv_id":"2311.02357","code_links":[{"title":"6lyc/cdnmf","url":"https://github.com/6lyc/cdnmf"}],"syntology":null}},{"leaderboard":"/sota/community-detection-on-dblp","slug":"community-detection-on-dblp","dataset":"DBLP","dataset_url":"/dataset/dblp","rows_in_archive":1,"metrics":["F1-Score"],"first_row_in_archive_order":{"model":"CommunityGAN","paper_title":"CommunityGAN: Community Detection with Generative Adversarial Nets","paper_url":"/paper/communitygan-community-detection-with","paper_date":"2019-01-20","arxiv_id":"1901.06631","code_links":[{"title":"SamJia/CommunityGAN","url":"https://github.com/SamJia/CommunityGAN"}],"syntology":null}},{"leaderboard":"/sota/community-detection-on-facebook-artists","slug":"community-detection-on-facebook-artists","dataset":"Facebook Artists","dataset_url":null,"rows_in_archive":1,"metrics":["Modularity"],"first_row_in_archive_order":{"model":"Smooth GEMSEC 2","paper_title":"GEMSEC: Graph Embedding with Self Clustering","paper_url":"/paper/gemsec-graph-embedding-with-self-clustering","paper_date":"2018-02-12","arxiv_id":"1802.03997","code_links":[{"title":"benedekrozemberczki/karateclub","url":"https://github.com/benedekrozemberczki/karateclub"},{"title":"benedekrozemberczki/GEMSEC","url":"https://github.com/benedekrozemberczki/GEMSEC"},{"title":"benedekrozemberczki/GRAF","url":"https://github.com/benedekrozemberczki/GRAF"}],"syntology":null}},{"leaderboard":"/sota/community-detection-on-facebook-athletes","slug":"community-detection-on-facebook-athletes","dataset":"Facebook Athletes","dataset_url":null,"rows_in_archive":1,"metrics":["Modularity"],"first_row_in_archive_order":{"model":"Smooth GEMSEC 2","paper_title":"GEMSEC: Graph Embedding with Self Clustering","paper_url":"/paper/gemsec-graph-embedding-with-self-clustering","paper_date":"2018-02-12","arxiv_id":"1802.03997","code_links":[{"title":"benedekrozemberczki/karateclub","url":"https://github.com/benedekrozemberczki/karateclub"},{"title":"benedekrozemberczki/GEMSEC","url":"https://github.com/benedekrozemberczki/GEMSEC"},{"title":"benedekrozemberczki/GRAF","url":"https://github.com/benedekrozemberczki/GRAF"}],"syntology":null}},{"leaderboard":"/sota/community-detection-on-facebook-celebrities","slug":"community-detection-on-facebook-celebrities","dataset":"Facebook Celebrities","dataset_url":null,"rows_in_archive":1,"metrics":["Modularity"],"first_row_in_archive_order":{"model":"Smooth GEMSEC 2","paper_title":"GEMSEC: Graph Embedding with Self Clustering","paper_url":"/paper/gemsec-graph-embedding-with-self-clustering","paper_date":"2018-02-12","arxiv_id":"1802.03997","code_links":[{"title":"benedekrozemberczki/karateclub","url":"https://github.com/benedekrozemberczki/karateclub"},{"title":"benedekrozemberczki/GEMSEC","url":"https://github.com/benedekrozemberczki/GEMSEC"},{"title":"benedekrozemberczki/GRAF","url":"https://github.com/benedekrozemberczki/GRAF"}],"syntology":null}},{"leaderboard":"/sota/community-detection-on-facebook-companies","slug":"community-detection-on-facebook-companies","dataset":"Facebook Companies","dataset_url":null,"rows_in_archive":1,"metrics":["Modularity"],"first_row_in_archive_order":{"model":"Smooth GEMSEC 2","paper_title":"GEMSEC: Graph Embedding with Self Clustering","paper_url":"/paper/gemsec-graph-embedding-with-self-clustering","paper_date":"2018-02-12","arxiv_id":"1802.03997","code_links":[{"title":"benedekrozemberczki/karateclub","url":"https://github.com/benedekrozemberczki/karateclub"},{"title":"benedekrozemberczki/GEMSEC","url":"https://github.com/benedekrozemberczki/GEMSEC"},{"title":"benedekrozemberczki/GRAF","url":"https://github.com/benedekrozemberczki/GRAF"}],"syntology":null}},{"leaderboard":"/sota/community-detection-on-facebook-government","slug":"community-detection-on-facebook-government","dataset":"Facebook Government","dataset_url":null,"rows_in_archive":1,"metrics":["Modularity"],"first_row_in_archive_order":{"model":"Smooth GEMSEC 2","paper_title":"GEMSEC: Graph Embedding with Self Clustering","paper_url":"/paper/gemsec-graph-embedding-with-self-clustering","paper_date":"2018-02-12","arxiv_id":"1802.03997","code_links":[{"title":"benedekrozemberczki/karateclub","url":"https://github.com/benedekrozemberczki/karateclub"},{"title":"benedekrozemberczki/GEMSEC","url":"https://github.com/benedekrozemberczki/GEMSEC"},{"title":"benedekrozemberczki/GRAF","url":"https://github.com/benedekrozemberczki/GRAF"}],"syntology":null}},{"leaderboard":"/sota/community-detection-on-facebook-media","slug":"community-detection-on-facebook-media","dataset":"Facebook Media","dataset_url":null,"rows_in_archive":1,"metrics":["Modularity"],"first_row_in_archive_order":{"model":"Smooth GEMSEC 2","paper_title":"GEMSEC: Graph Embedding with Self Clustering","paper_url":"/paper/gemsec-graph-embedding-with-self-clustering","paper_date":"2018-02-12","arxiv_id":"1802.03997","code_links":[{"title":"benedekrozemberczki/karateclub","url":"https://github.com/benedekrozemberczki/karateclub"},{"title":"benedekrozemberczki/GEMSEC","url":"https://github.com/benedekrozemberczki/GEMSEC"},{"title":"benedekrozemberczki/GRAF","url":"https://github.com/benedekrozemberczki/GRAF"}],"syntology":null}},{"leaderboard":"/sota/community-detection-on-facebook-politicians","slug":"community-detection-on-facebook-politicians","dataset":"Facebook Politicians","dataset_url":null,"rows_in_archive":1,"metrics":["Modularity"],"first_row_in_archive_order":{"model":"Smooth GEMSEC 2","paper_title":"GEMSEC: Graph Embedding with Self Clustering","paper_url":"/paper/gemsec-graph-embedding-with-self-clustering","paper_date":"2018-02-12","arxiv_id":"1802.03997","code_links":[{"title":"benedekrozemberczki/karateclub","url":"https://github.com/benedekrozemberczki/karateclub"},{"title":"benedekrozemberczki/GEMSEC","url":"https://github.com/benedekrozemberczki/GEMSEC"},{"title":"benedekrozemberczki/GRAF","url":"https://github.com/benedekrozemberczki/GRAF"}],"syntology":null}},{"leaderboard":"/sota/community-detection-on-facebook-tv-show","slug":"community-detection-on-facebook-tv-show","dataset":"Facebook TV Show","dataset_url":null,"rows_in_archive":1,"metrics":["Modularity"],"first_row_in_archive_order":{"model":"Smooth GEMSEC 2","paper_title":"GEMSEC: Graph Embedding with Self Clustering","paper_url":"/paper/gemsec-graph-embedding-with-self-clustering","paper_date":"2018-02-12","arxiv_id":"1802.03997","code_links":[{"title":"benedekrozemberczki/karateclub","url":"https://github.com/benedekrozemberczki/karateclub"},{"title":"benedekrozemberczki/GEMSEC","url":"https://github.com/benedekrozemberczki/GEMSEC"},{"title":"benedekrozemberczki/GRAF","url":"https://github.com/benedekrozemberczki/GRAF"}],"syntology":null}},{"leaderboard":"/sota/community-detection-on-pubmed","slug":"community-detection-on-pubmed","dataset":"Pubmed","dataset_url":"/dataset/pubmed","rows_in_archive":1,"metrics":["ACC","NMI"],"first_row_in_archive_order":{"model":"CDNMF","paper_title":"Contrastive Deep Nonnegative Matrix Factorization for Community Detection","paper_url":"/paper/contrastive-deep-nonnegative-matrix","paper_date":"2023-11-04","arxiv_id":"2311.02357","code_links":[{"title":"6lyc/cdnmf","url":"https://github.com/6lyc/cdnmf"}],"syntology":null}},{"leaderboard":"/sota/community-detection-on-twitter-hydrug","slug":"community-detection-on-twitter-hydrug","dataset":"Twitter-HyDrug","dataset_url":"/dataset/twitter-hydrug","rows_in_archive":1,"metrics":["Jaccard"],"first_row_in_archive_order":{"model":"HyGCL-DC","paper_title":"Hypergraph Contrastive Learning for Drug Trafficking Community Detection","paper_url":"/paper/hypergraph-contrastive-learning-for-drug","paper_date":"2023-12-01","arxiv_id":null,"code_links":[{"title":"GraphResearcher/HyGCL-DC","url":"https://github.com/GraphResearcher/HyGCL-DC"}],"syntology":null}}],"datasets":[{"url":"/dataset/pubmed","name":"Pubmed","full_name":"","num_papers_in_archive":1236},{"url":"/dataset/cora","name":"Cora","full_name":"","num_papers_in_archive":602},{"url":"/dataset/citeseer","name":"Citeseer","full_name":"","num_papers_in_archive":381},{"url":"/dataset/dblp","name":"DBLP","full_name":"Citation Network Dataset","num_papers_in_archive":218},{"url":"/dataset/snap","name":"SNAP","full_name":"Stanford Large Network Dataset Collection","num_papers_in_archive":174},{"url":"/dataset/orkut","name":"Orkut","full_name":"","num_papers_in_archive":85},{"url":"/dataset/email-eu","name":"Email-EU","full_name":null,"num_papers_in_archive":33},{"url":"/dataset/yeast","name":"Yeast","full_name":"","num_papers_in_archive":18},{"url":"/dataset/hla-chat","name":"HLA-Chat","full_name":"","num_papers_in_archive":4},{"url":"/dataset/placenta","name":"Placenta","full_name":"","num_papers_in_archive":3},{"url":"/dataset/a-collection-of-lfr-benchmark-graphs","name":"A collection of LFR benchmark graphs","full_name":"","num_papers_in_archive":1},{"url":"/dataset/user-reviews-and-perfume-attributes-dataset","name":"Perfume Co-Preference Network","full_name":"","num_papers_in_archive":1},{"url":"/dataset/twitter-hydrug","name":"Twitter-HyDrug","full_name":"","num_papers_in_archive":1}],"subtasks":[{"url":"/task/local-community-detection","name":"Local Community Detection"},{"url":"/task/network-community-partition","name":"Network Community Partition"},{"url":"/task/online-community-detection","name":"Online Community Detection"}],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":10,"rows_per_page":100,"shown":100,"of":919,"of_with_code":263,"tagged_in_all":919,"counts":{"archive_papers_tagged":919,"with_a_code_link":263,"where_syntology_ran_a_sample":16,"not_listed_spam_title":0,"listed":919,"listed_where_code_ran":16,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":14,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":14,"listed_every_run_a_failure_of_syntologys_instrument":2,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/community-detection-in-networks-a-user-guide","slug":"community-detection-in-networks-a-user-guide","title":"Community detection in networks: A user guide","date":"2016-07-30","arxiv_id":"1608.00163","repositories_listed":18,"syntology":null},{"url":"/paper/agglomerative-fast-super-paramagnetic","slug":"agglomerative-fast-super-paramagnetic","title":"Agglomerative Likelihood Clustering","date":"2019-08-02","arxiv_id":"1908.00951","repositories_listed":6,"syntology":null},{"url":"/paper/fast-sequence-based-embedding-with-diffusion-1","slug":"fast-sequence-based-embedding-with-diffusion-1","title":"Fast Sequence-Based Embedding with Diffusion Graphs","date":"2020-01-21","arxiv_id":"2001.07463","repositories_listed":4,"syntology":null},{"url":"/paper/supervised-community-detection-with-line","slug":"supervised-community-detection-with-line","title":"Supervised Community Detection with Line Graph Neural Networks","date":"2017-05-23","arxiv_id":"1705.08415","repositories_listed":4,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/supervised-community-detection-with-line#ran","syntology_url":"https://syntology.ai/paper/1705.08415","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.08415"}},"official":{"repos":["zhengdao-chen/GNN4CD"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/hidden-community-detection-in-social-networks","slug":"hidden-community-detection-in-social-networks","title":"Hidden Community Detection in Social Networks","date":"2017-02-24","arxiv_id":"1702.07462","repositories_listed":4,"syntology":null},{"url":"/paper/boosting-multitask-learning-on-graphs-through","slug":"boosting-multitask-learning-on-graphs-through","title":"Boosting Multitask Learning on Graphs through Higher-Order Task Affinities","date":"2023-06-24","arxiv_id":"2306.14009","repositories_listed":3,"syntology":null},{"url":"/paper/single-image-reflection-removal-through","slug":"single-image-reflection-removal-through","title":"Single Image Reflection Removal through Cascaded Refinement","date":"2019-11-15","arxiv_id":"1911.06634","repositories_listed":3,"syntology":null},{"url":"/paper/subgraph2vec-learning-distributed","slug":"subgraph2vec-learning-distributed","title":"subgraph2vec: Learning Distributed Representations of Rooted Sub-graphs from Large Graphs","date":"2016-06-29","arxiv_id":"1606.08928","repositories_listed":3,"syntology":null},{"url":"/paper/a-spectral-framework-for-tracking-communities","slug":"a-spectral-framework-for-tracking-communities","title":"A Spectral Framework for Tracking Communities in Evolving Networks","date":"2024-12-10","arxiv_id":"2412.07378","repositories_listed":2,"syntology":null},{"url":"/paper/do-anything-now-characterizing-and-evaluating","slug":"do-anything-now-characterizing-and-evaluating","title":"\"Do Anything Now\": Characterizing and Evaluating In-The-Wild Jailbreak Prompts on Large Language Models","date":"2023-08-07","arxiv_id":"2308.03825","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/do-anything-now-characterizing-and-evaluating#ran","syntology_url":"https://syntology.ai/paper/2308.03825","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.03825"}},"official":{"repos":["verazuo/jailbreak_llms"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/region2vec-community-detection-on-spatial","slug":"region2vec-community-detection-on-spatial","title":"Region2Vec: Community Detection on Spatial Networks Using Graph Embedding with Node Attributes and Spatial Interactions","date":"2022-10-10","arxiv_id":"2210.08041","repositories_listed":2,"syntology":null},{"url":"/paper/modularity-of-the-abcd-random-graph-model","slug":"modularity-of-the-abcd-random-graph-model","title":"Modularity of the ABCD Random Graph Model with Community Structure","date":"2022-03-03","arxiv_id":"2203.01480","repositories_listed":2,"syntology":null},{"url":"/paper/vec2gc-a-graph-based-clustering-method-for","slug":"vec2gc-a-graph-based-clustering-method-for","title":"Vec2GC -- A Graph Based Clustering Method for Text Representations","date":"2021-04-15","arxiv_id":"2104.09439","repositories_listed":2,"syntology":null},{"url":"/paper/evaluating-node-embeddings-of-complex","slug":"evaluating-node-embeddings-of-complex","title":"Evaluating Node Embeddings of Complex Networks","date":"2021-02-16","arxiv_id":"2102.08275","repositories_listed":2,"syntology":null},{"url":"/paper/hypergraph-clustering-from-blockmodels-to","slug":"hypergraph-clustering-from-blockmodels-to","title":"Generative hypergraph clustering: from blockmodels to modularity","date":"2021-01-24","arxiv_id":"2101.09611","repositories_listed":2,"syntology":null},{"url":"/paper/synwalk-community-detection-via-random-walk","slug":"synwalk-community-detection-via-random-walk","title":"Synwalk -- Community Detection via Random Walk Modelling","date":"2021-01-21","arxiv_id":"2101.08623","repositories_listed":2,"syntology":null},{"url":"/paper/attentive-clustering-processes","slug":"attentive-clustering-processes","title":"Amortized Probabilistic Detection of Communities in Graphs","date":"2020-10-29","arxiv_id":"2010.15727","repositories_listed":2,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":5,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/attentive-clustering-processes#ran","syntology_url":"https://syntology.ai/paper/2010.15727","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.15727"}},"official":{"repos":["aripakman/amortized_community_detection","aripakman/attentive_clustering_processes"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/p-norm-flow-diffusion-for-local-graph","slug":"p-norm-flow-diffusion-for-local-graph","title":"$p$-Norm Flow Diffusion for Local Graph Clustering","date":"2020-05-20","arxiv_id":"2005.09810","repositories_listed":2,"syntology":{"n":12,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/p-norm-flow-diffusion-for-local-graph#ran","syntology_url":"https://syntology.ai/paper/2005.09810","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.09810"}},"official":{"repos":["s-h-yang/pNormFlowDiffusion"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/flow-based-algorithms-for-improving-clusters","slug":"flow-based-algorithms-for-improving-clusters","title":"Flow-based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance","date":"2020-04-20","arxiv_id":"2004.09608","repositories_listed":2,"syntology":null},{"url":"/paper/an-api-oriented-open-source-python-framework-1","slug":"an-api-oriented-open-source-python-framework-1","title":"Karate Club: An API Oriented Open-source Python Framework for Unsupervised Learning on Graphs","date":"2020-03-10","arxiv_id":"2003.04819","repositories_listed":2,"syntology":null},{"url":"/paper/artificial-benchmark-for-community-detection","slug":"artificial-benchmark-for-community-detection","title":"Artificial Benchmark for Community Detection (ABCD): Fast Random Graph Model with Community Structure","date":"2020-01-14","arxiv_id":"2002.00843","repositories_listed":2,"syntology":null},{"url":"/paper/learning-graph-structured-data-using-poincare","slug":"learning-graph-structured-data-using-poincare","title":"From Node Embedding To Community Embedding : A Hyperbolic Approach","date":"2019-07-02","arxiv_id":"1907.01662","repositories_listed":2,"syntology":null},{"url":"/paper/vgraph-a-generative-model-for-joint-community","slug":"vgraph-a-generative-model-for-joint-community","title":"vGraph: A Generative Model for Joint Community Detection and Node Representation Learning","date":"2019-06-18","arxiv_id":"1906.07159","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/vgraph-a-generative-model-for-joint-community#ran","syntology_url":"https://syntology.ai/paper/1906.07159","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.07159"}},"official":null}},{"url":"/paper/position-aware-graph-neural-networks","slug":"position-aware-graph-neural-networks","title":"Position-aware Graph Neural Networks","date":"2019-06-11","arxiv_id":"1906.04817","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/position-aware-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1906.04817","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.04817"}},"official":{"repos":["JiaxuanYou/P-GNN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/ensemble-clustering-for-graphs-comparisons","slug":"ensemble-clustering-for-graphs-comparisons","title":"Ensemble Clustering for Graphs: Comparisons and Applications","date":"2019-03-19","arxiv_id":"1903.08012","repositories_listed":2,"syntology":null},{"url":"/paper/community-detection-with-graph-neural","slug":"community-detection-with-graph-neural","title":"Community Detection with Graph Neural Networks","date":"2018-10-25","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/streaming-graph-neural-networks","slug":"streaming-graph-neural-networks","title":"Streaming Graph Neural Networks","date":"2018-10-24","arxiv_id":"1810.10627","repositories_listed":2,"syntology":null},{"url":"/paper/deep-autoencoder-like-nonnegative-matrix","slug":"deep-autoencoder-like-nonnegative-matrix","title":"Deep Autoencoder-like Nonnegative Matrix Factorization for Community Detection","date":"2018-10-22","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/fast-sequence-based-embedding-with-diffusion","slug":"fast-sequence-based-embedding-with-diffusion","title":"Fast Sequence Based Embedding with Diffusion Graphs","date":"2018-03-20","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/community-detection-with-spiking-neural","slug":"community-detection-with-spiking-neural","title":"Community detection with spiking neural networks for neuromorphic hardware","date":"2017-11-20","arxiv_id":"1711.07361","repositories_listed":2,"syntology":null},{"url":"/paper/ego-splitting-framework-from-non-overlapping","slug":"ego-splitting-framework-from-non-overlapping","title":"Ego-splitting Framework: from Non-Overlapping to Overlapping Clusters","date":"2017-08-13","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/cayleynets-graph-convolutional-neural","slug":"cayleynets-graph-convolutional-neural","title":"CayleyNets: Graph Convolutional Neural Networks with Complex Rational Spectral Filters","date":"2017-05-22","arxiv_id":"1705.07664","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/cayleynets-graph-convolutional-neural#ran","syntology_url":"https://syntology.ai/paper/1705.07664","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.07664"}},"official":{"repos":["amoliu/CayleyNet"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/font-size-community-preserving-network","slug":"font-size-community-preserving-network","title":"Font Size: Community Preserving Network Embedding","date":"2017-02-10","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/overlapping-community-detection-at-scale-a","slug":"overlapping-community-detection-at-scale-a","title":"Overlapping Community Detection at Scale: A Nonnegative Matrix Factorization Approach","date":"2013-02-04","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/2506-10102","slug":"2506-10102","title":"Learning to Collaborate Over Graphs: A Selective Federated Multi-Task Learning Approach","date":"2025-06-11","arxiv_id":"2506.10102","repositories_listed":1,"syntology":null},{"url":"/paper/identifying-hubs-through-influential-nodes-in","slug":"identifying-hubs-through-influential-nodes-in","title":"Identifying Hubs Through Influential Nodes in Transportation Network by Using a Gravity Centrality Approach","date":"2025-06-10","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/speaker-diarization-with-overlapping","slug":"speaker-diarization-with-overlapping","title":"Speaker Diarization with Overlapping Community Detection Using Graph Attention Networks and Label Propagation Algorithm","date":"2025-06-03","arxiv_id":"2506.02610","repositories_listed":1,"syntology":null},{"url":"/paper/2505-11293","slug":"2505-11293","title":"Breaking the Batch Barrier (B3) of Contrastive Learning via Smart Batch Mining","date":"2025-05-16","arxiv_id":"2505.11293","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/2505-11293#ran","syntology_url":"https://syntology.ai/paper/2505.11293","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.11293"}},"official":{"repos":["raghavlite/b3"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/advancing-community-detection-with-graph","slug":"advancing-community-detection-with-graph","title":"Advancing Community Detection with Graph Convolutional Neural Networks: Bridging Topological and Attributive Cohesion","date":"2025-05-15","arxiv_id":"2505.10197","repositories_listed":1,"syntology":null},{"url":"/paper/graph-based-floor-separation-using-node","slug":"graph-based-floor-separation-using-node","title":"Graph-Based Floor Separation Using Node Embeddings and Clustering of WiFi Trajectories","date":"2025-05-12","arxiv_id":"2505.08088","repositories_listed":1,"syntology":null},{"url":"/paper/community-and-hyperedge-inference-in-multiple","slug":"community-and-hyperedge-inference-in-multiple","title":"Community and hyperedge inference in multiple hypergraphs","date":"2025-05-08","arxiv_id":"2505.04967","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-long-term-embedding-with-denoising","slug":"adaptive-long-term-embedding-with-denoising","title":"Adaptive Long-term Embedding with Denoising and Augmentation for Recommendation","date":"2025-04-18","arxiv_id":"2504.13614","repositories_listed":1,"syntology":null},{"url":"/paper/robust-markov-stability-for-community","slug":"robust-markov-stability-for-community","title":"Robust Markov stability for community detection at a scale learned based on the structure","date":"2025-04-15","arxiv_id":"2504.11621","repositories_listed":1,"syntology":null},{"url":"/paper/communities-in-the-kuramoto-model-dynamics","slug":"communities-in-the-kuramoto-model-dynamics","title":"Communities in the Kuramoto Model: Dynamics and Detection via Path Signatures","date":"2025-03-21","arxiv_id":"2503.17546","repositories_listed":1,"syntology":null},{"url":"/paper/how-low-can-you-go-searching-for-the","slug":"how-low-can-you-go-searching-for-the","title":"How Low Can You Go? Searching for the Intrinsic Dimensionality of Complex Networks using Metric Node Embeddings","date":"2025-03-03","arxiv_id":"2503.01723","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/how-low-can-you-go-searching-for-the#ran","syntology_url":"https://syntology.ai/paper/2503.01723","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.01723"}},"official":{"repos":["AndreasLF/HowLowCanYouGo"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/fast-think-on-graph-wider-deeper-and-faster","slug":"fast-think-on-graph-wider-deeper-and-faster","title":"Fast Think-on-Graph: Wider, Deeper and Faster Reasoning of Large Language Model on Knowledge Graph","date":"2025-01-24","arxiv_id":"2501.14300","repositories_listed":1,"syntology":null},{"url":"/paper/two-way-node-popularity-model-for-directed","slug":"two-way-node-popularity-model-for-directed","title":"Two-way Node Popularity Model for Directed and Bipartite Networks","date":"2024-12-11","arxiv_id":"2412.08051","repositories_listed":1,"syntology":null},{"url":"/paper/geoai-enhanced-community-detection-on-spatial","slug":"geoai-enhanced-community-detection-on-spatial","title":"GeoAI-Enhanced Community Detection on Spatial Networks with Graph Deep Learning","date":"2024-11-23","arxiv_id":"2411.15428","repositories_listed":1,"syntology":null},{"url":"/paper/hacd-harnessing-attribute-semantics-and","slug":"hacd-harnessing-attribute-semantics-and","title":"HACD: Harnessing Attribute Semantics and Mesoscopic Structure for Community Detection","date":"2024-11-04","arxiv_id":"2411.01947","repositories_listed":1,"syntology":null},{"url":"/paper/sentiment-driven-community-detection-in-a","slug":"sentiment-driven-community-detection-in-a","title":"Sentiment-Driven Community Detection in a Network of Perfume Preferences","date":"2024-10-24","arxiv_id":"2410.19177","repositories_listed":1,"syntology":null},{"url":"/paper/reasoning-enhanced-healthcare-predictions","slug":"reasoning-enhanced-healthcare-predictions","title":"Reasoning-Enhanced Healthcare Predictions with Knowledge Graph Community Retrieval","date":"2024-10-06","arxiv_id":"2410.04585","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/reasoning-enhanced-healthcare-predictions#ran","syntology_url":"https://syntology.ai/paper/2410.04585","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.04585"}},"official":{"repos":["pat-jj/KARE"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/masking-the-bias-from-echo-chambers-to-large","slug":"masking-the-bias-from-echo-chambers-to-large","title":"Masking The Bias : From Echo Chambers to Large Scale Aspect-Based Sentiment Analysis","date":"2024-09-02","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/longitudinal-modularity-a-modularity-for-link","slug":"longitudinal-modularity-a-modularity-for-link","title":"Longitudinal Modularity, a Modularity for Link Streams","date":"2024-08-29","arxiv_id":"2408.16877","repositories_listed":1,"syntology":null},{"url":"/paper/modularity-based-community-detection-in-1","slug":"modularity-based-community-detection-in-1","title":"Modularity Based Community Detection in Hypergraphs","date":"2024-06-25","arxiv_id":"2406.17556","repositories_listed":1,"syntology":null},{"url":"/paper/testing-network-clustering-algorithms-with","slug":"testing-network-clustering-algorithms-with","title":"Testing network clustering algorithms with Natural Language Processing","date":"2024-06-24","arxiv_id":"2406.17135","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-modularity-maximization-for-graph","slug":"revisiting-modularity-maximization-for-graph","title":"Revisiting Modularity Maximization for Graph Clustering: A Contrastive Learning Perspective","date":"2024-06-20","arxiv_id":"2406.14288","repositories_listed":1,"syntology":null},{"url":"/paper/faithful-density-peaks-clustering-via-matrix","slug":"faithful-density-peaks-clustering-via-matrix","title":"Faithful Density-Peaks Clustering via Matrix Computations on MPI Parallelization System","date":"2024-06-18","arxiv_id":"2406.12297","repositories_listed":1,"syntology":null},{"url":"/paper/lgde-local-graph-based-dictionary-expansion","slug":"lgde-local-graph-based-dictionary-expansion","title":"LGDE: Local Graph-based Dictionary Expansion","date":"2024-05-13","arxiv_id":"2405.07764","repositories_listed":1,"syntology":null},{"url":"/paper/robustness-of-graph-embedding-methods-for","slug":"robustness-of-graph-embedding-methods-for","title":"Robustness of graph embedding methods for community detection","date":"2024-05-01","arxiv_id":"2405.00636","repositories_listed":1,"syntology":null},{"url":"/paper/vec-sbm-optimal-community-detection-with","slug":"vec-sbm-optimal-community-detection-with","title":"VEC-SBM: Optimal Community Detection with Vectorial Edges Covariates","date":"2024-02-29","arxiv_id":"2402.18805","repositories_listed":1,"syntology":null},{"url":"/paper/learning-dynamic-representations-of-the","slug":"learning-dynamic-representations-of-the","title":"Learning dynamic representations of the functional connectome in neurobiological networks","date":"2024-02-21","arxiv_id":"2402.14102","repositories_listed":1,"syntology":null},{"url":"/paper/explainable-global-wildfire-prediction-models","slug":"explainable-global-wildfire-prediction-models","title":"Explainable Global Wildfire Prediction Models using Graph Neural Networks","date":"2024-02-11","arxiv_id":"2402.07152","repositories_listed":1,"syntology":null},{"url":"/paper/learning-persistent-community-structures-in","slug":"learning-persistent-community-structures-in","title":"Learning Persistent Community Structures in Dynamic Networks via Topological Data Analysis","date":"2024-01-06","arxiv_id":"2401.03194","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":8,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/learning-persistent-community-structures-in#ran","syntology_url":"https://syntology.ai/paper/2401.03194","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.03194"}},"official":{"repos":["kundtx/MFC_TopoReg"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]}}},{"url":"/paper/a-structural-clustering-based-active-learning","slug":"a-structural-clustering-based-active-learning","title":"A Structural-Clustering Based Active Learning for Graph Neural Networks","date":"2023-12-07","arxiv_id":"2312.04307","repositories_listed":1,"syntology":null},{"url":"/paper/hypergraph-contrastive-learning-for-drug","slug":"hypergraph-contrastive-learning-for-drug","title":"Hypergraph Contrastive Learning for Drug Trafficking Community Detection","date":"2023-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/single-cell-multi-view-clustering-via","slug":"single-cell-multi-view-clustering-via","title":"Single-cell Multi-view Clustering via Community Detection with Unknown Number of Clusters","date":"2023-11-28","arxiv_id":"2311.17103","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-segmentation-of-irradiation","slug":"unsupervised-segmentation-of-irradiation","title":"Unsupervised segmentation of irradiation$\\unicode{x2010}$induced order$\\unicode{x2010}$disorder phase transitions in electron microscopy","date":"2023-11-14","arxiv_id":"2311.08585","repositories_listed":1,"syntology":null},{"url":"/paper/hypergraphs-with-node-attributes-structure","slug":"hypergraphs-with-node-attributes-structure","title":"Structure and inference in hypergraphs with node attributes","date":"2023-11-07","arxiv_id":"2311.03857","repositories_listed":1,"syntology":null},{"url":"/paper/contrastive-deep-nonnegative-matrix","slug":"contrastive-deep-nonnegative-matrix","title":"Contrastive Deep Nonnegative Matrix Factorization for Community Detection","date":"2023-11-04","arxiv_id":"2311.02357","repositories_listed":1,"syntology":null},{"url":"/paper/functional-connectivity-modules-in-recurrent","slug":"functional-connectivity-modules-in-recurrent","title":"Modular Boundaries in Recurrent Neural Networks","date":"2023-10-31","arxiv_id":"2310.20601","repositories_listed":1,"syntology":null},{"url":"/paper/explaining-interactions-between-text-spans","slug":"explaining-interactions-between-text-spans","title":"Explaining Interactions Between Text Spans","date":"2023-10-20","arxiv_id":"2310.13506","repositories_listed":1,"syntology":null},{"url":"/paper/the-map-equation-goes-neural","slug":"the-map-equation-goes-neural","title":"The Map Equation Goes Neural: Mapping Network Flows with Graph Neural Networks","date":"2023-10-02","arxiv_id":"2310.01144","repositories_listed":1,"syntology":null},{"url":"/paper/superpixels-algorithms-through-network","slug":"superpixels-algorithms-through-network","title":"Superpixels algorithms through network community detection","date":"2023-08-27","arxiv_id":"2308.14101","repositories_listed":1,"syntology":null},{"url":"/paper/lscpm-communities-in-massive-real-world-link","slug":"lscpm-communities-in-massive-real-world-link","title":"LSCPM: communities in massive real-world Link Streams by Clique Percolation Method","date":"2023-08-21","arxiv_id":"2308.10801","repositories_listed":1,"syntology":null},{"url":"/paper/hypergraph-isomorphism-computation","slug":"hypergraph-isomorphism-computation","title":"Hypergraph Isomorphism Computation","date":"2023-07-26","arxiv_id":"2307.14394","repositories_listed":1,"syntology":null},{"url":"/paper/a-neural-collapse-perspective-on-feature-1","slug":"a-neural-collapse-perspective-on-feature-1","title":"A Neural Collapse Perspective on Feature Evolution in Graph Neural Networks","date":"2023-07-04","arxiv_id":"2307.01951","repositories_listed":1,"syntology":{"n":7,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/a-neural-collapse-perspective-on-feature-1#ran","syntology_url":"https://syntology.ai/paper/2307.01951","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.01951"}},"official":{"repos":["kvignesh1420/gnn_collapse"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/random-walk-on-multiple-networks","slug":"random-walk-on-multiple-networks","title":"Random Walk on Multiple Networks","date":"2023-07-04","arxiv_id":"2307.01637","repositories_listed":1,"syntology":null},{"url":"/paper/normalized-mutual-information-is-a-biased","slug":"normalized-mutual-information-is-a-biased","title":"Normalized mutual information is a biased measure for classification and community detection","date":"2023-07-03","arxiv_id":"2307.01282","repositories_listed":1,"syntology":null},{"url":"/paper/a-fast-maximum-k-plex-algorithm-parameterized","slug":"a-fast-maximum-k-plex-algorithm-parameterized","title":"Fast Maximum $k$-Plex Algorithms Parameterized by Small Degeneracy Gaps","date":"2023-06-23","arxiv_id":"2306.13258","repositories_listed":1,"syntology":null},{"url":"/paper/learning-the-right-layers-a-data-driven-layer","slug":"learning-the-right-layers-a-data-driven-layer","title":"Learning the Right Layers: a Data-Driven Layer-Aggregation Strategy for Semi-Supervised Learning on Multilayer Graphs","date":"2023-05-31","arxiv_id":"2306.00152","repositories_listed":1,"syntology":null},{"url":"/paper/congrat-self-supervised-contrastive","slug":"congrat-self-supervised-contrastive","title":"ConGraT: Self-Supervised Contrastive Pretraining for Joint Graph and Text Embeddings","date":"2023-05-23","arxiv_id":"2305.14321","repositories_listed":1,"syntology":null},{"url":"/paper/matrix-tri-factorization-over-the-tropical","slug":"matrix-tri-factorization-over-the-tropical","title":"Matrix tri-factorization over the tropical semiring","date":"2023-05-11","arxiv_id":"2305.06624","repositories_listed":1,"syntology":null},{"url":"/paper/graph-toolformer-to-empower-llms-with-graph","slug":"graph-toolformer-to-empower-llms-with-graph","title":"Graph-ToolFormer: To Empower LLMs with Graph Reasoning Ability via Prompt Dataset Augmented by ChatGPT","date":"2023-04-10","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/genetic-analysis-of-prostate-cancer-with","slug":"genetic-analysis-of-prostate-cancer-with","title":"Genetic Analysis of Prostate Cancer with Computer Science Methods","date":"2023-03-28","arxiv_id":"2303.15851","repositories_listed":1,"syntology":null},{"url":"/paper/effective-hierarchical-information-threading","slug":"effective-hierarchical-information-threading","title":"Effective Hierarchical Information Threading Using Network Community Detection","date":"2023-03-17","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/graph-encoder-ensemble-for-simultaneous","slug":"graph-encoder-ensemble-for-simultaneous","title":"Graph Encoder Ensemble for Simultaneous Vertex Embedding and Community Detection","date":"2023-01-18","arxiv_id":"2301.11290","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-bayesian-inference-for-community","slug":"hierarchical-bayesian-inference-for-community","title":"Hierarchical Bayesian inference for community detection and connectivity of functional brain networks","date":"2023-01-18","arxiv_id":"2301.07386","repositories_listed":1,"syntology":null},{"url":"/paper/artificial-benchmark-for-community-detection-1","slug":"artificial-benchmark-for-community-detection-1","title":"Artificial Benchmark for Community Detection with Outliers (ABCD+o)","date":"2023-01-13","arxiv_id":"2301.05749","repositories_listed":1,"syntology":null},{"url":"/paper/constraint-induced-symmetric-nonnegative","slug":"constraint-induced-symmetric-nonnegative","title":"Constraint-Induced Symmetric Nonnegative Matrix Factorization for Accurate Community Detection","date":"2023-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/new-frontiers-in-graph-autoencoders-joint","slug":"new-frontiers-in-graph-autoencoders-joint","title":"New Frontiers in Graph Autoencoders: Joint Community Detection and Link Prediction","date":"2022-11-16","arxiv_id":"2211.08972","repositories_listed":1,"syntology":null},{"url":"/paper/mgtcom-community-detection-in-multimodal","slug":"mgtcom-community-detection-in-multimodal","title":"MGTCOM: Community Detection in Multimodal Graphs","date":"2022-11-10","arxiv_id":"2211.06331","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-for-community-detection","slug":"graph-neural-networks-for-community-detection","title":"A Spectral Analysis of Graph Neural Networks on Dense and Sparse Graphs","date":"2022-11-06","arxiv_id":"2211.03231","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-neural-networks-for-community-detection#ran","syntology_url":"https://syntology.ai/paper/2211.03231","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.03231"}},"official":{"repos":["nhuang37/gnn_community_detection"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/hypergraph-artificial-benchmark-for-community","slug":"hypergraph-artificial-benchmark-for-community","title":"Hypergraph Artificial Benchmark for Community Detection (h-ABCD)","date":"2022-10-26","arxiv_id":"2210.15009","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-on-graph-counterfactual-explanations","slug":"a-survey-on-graph-counterfactual-explanations","title":"A Survey on Graph Counterfactual Explanations: Definitions, Methods, Evaluation, and Research Challenges","date":"2022-10-21","arxiv_id":"2210.12089","repositories_listed":1,"syntology":null},{"url":"/paper/overlapping-community-detection-using-dynamic","slug":"overlapping-community-detection-using-dynamic","title":"Overlapping Community Detection using Dynamic Dilated Aggregation in Deep Residual GCN","date":"2022-10-20","arxiv_id":"2210.11174","repositories_listed":1,"syntology":null},{"url":"/paper/detecting-propagators-of-disinformation-on","slug":"detecting-propagators-of-disinformation-on","title":"Detecting Propagators of Disinformation on Twitter Using Quantitative Discursive Analysis","date":"2022-10-11","arxiv_id":"2210.05760","repositories_listed":1,"syntology":null},{"url":"/paper/communities-in-c-elegans-connectome-through-1","slug":"communities-in-c-elegans-connectome-through-1","title":"Communities in C.elegans connectome through the prism of non-backtracking walks","date":"2022-07-22","arxiv_id":"2207.11282","repositories_listed":1,"syntology":null},{"url":"/paper/communities-in-c-elegans-connectome-through","slug":"communities-in-c-elegans-connectome-through","title":"Perspectives and constraints on neural network models of neurobiological processes","date":"2022-07-02","arxiv_id":"2207.00767","repositories_listed":1,"syntology":null},{"url":"/paper/multi-frequency-joint-community-detection-and","slug":"multi-frequency-joint-community-detection-and","title":"Multi-Frequency Joint Community Detection and Phase Synchronization","date":"2022-06-16","arxiv_id":"2206.12276","repositories_listed":1,"syntology":null},{"url":"/paper/an-unsupervised-approach-to-discover-media","slug":"an-unsupervised-approach-to-discover-media","title":"An Unsupervised Approach to Discover Media Frames","date":"2022-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null}],"syntology_records":13,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":3,"papers_placed":0,"judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[{"leaderboard":"/sota/community-detection-on-cora","since_archive":"/sota/community-detection-on-cora#since-judged","papers_judged":3,"placed":0},{"leaderboard":"/sota/community-detection-on-citeseer","since_archive":"/sota/community-detection-on-citeseer#since-judged","papers_judged":2,"placed":0}]},"papers_where_code_ran":16,"papers_where_code_ran_first_page":"/task/community-detection/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":10,"url":"/task/community-detection/papers/2","json":"/task/community-detection/papers/2.json","rows":100},{"order":"archive","page":3,"of":10,"url":"/task/community-detection/papers/3","json":"/task/community-detection/papers/3.json","rows":100},{"order":"archive","page":4,"of":10,"url":"/task/community-detection/papers/4","json":"/task/community-detection/papers/4.json","rows":100},{"order":"archive","page":5,"of":10,"url":"/task/community-detection/papers/5","json":"/task/community-detection/papers/5.json","rows":100},{"order":"archive","page":6,"of":10,"url":"/task/community-detection/papers/6","json":"/task/community-detection/papers/6.json","rows":100},{"order":"archive","page":7,"of":10,"url":"/task/community-detection/papers/7","json":"/task/community-detection/papers/7.json","rows":100},{"order":"archive","page":8,"of":10,"url":"/task/community-detection/papers/8","json":"/task/community-detection/papers/8.json","rows":100},{"order":"archive","page":9,"of":10,"url":"/task/community-detection/papers/9","json":"/task/community-detection/papers/9.json","rows":100},{"order":"archive","page":10,"of":10,"url":"/task/community-detection/papers/10","json":"/task/community-detection/papers/10.json","rows":19},{"order":"ran","page":1,"of":1,"url":"/task/community-detection/papers/ran/1","json":"/task/community-detection/papers/ran/1.json","rows":16}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"61f2282e407cea9f2464948be0b59cecd0474829dc07d75f4a06916388fdfac1","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}