{"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/stochastic-block-model","name":"Stochastic Block Model","slug":"stochastic-block-model","description_markdown":null,"categories":[{"name":"Graphs","url":"/area/graphs"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":370,"papers_with_code":95,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"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":0,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[],"subtasks":[],"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":4,"rows_per_page":100,"shown":100,"of":370,"of_with_code":95,"tagged_in_all":370,"counts":{"archive_papers_tagged":370,"with_a_code_link":95,"where_syntology_ran_a_sample":14,"not_listed_spam_title":0,"listed":370,"listed_where_code_ran":14,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":11,"every_run_a_failure_of_syntologys_instrument":3,"listed_with_a_run_with_no_instrument_failure":11,"listed_every_run_a_failure_of_syntologys_instrument":3,"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/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/graph-encoder-embedding","slug":"graph-encoder-embedding","title":"One-Hot Graph Encoder Embedding","date":"2021-09-27","arxiv_id":"2109.13098","repositories_listed":3,"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/graph-encoder-embedding#ran","syntology_url":"https://syntology.ai/paper/2109.13098","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.13098"}},"official":{"repos":["cshen6/graphemd","cshen6/graphnn"],"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/spectral-clustering-of-graphs-with-the-bethe","slug":"spectral-clustering-of-graphs-with-the-bethe","title":"Spectral Clustering of Graphs with the Bethe Hessian","date":"2014-06-07","arxiv_id":"1406.1880","repositories_listed":3,"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":1,"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/spectral-clustering-of-graphs-with-the-bethe#ran","syntology_url":"https://syntology.ai/paper/1406.1880","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1406.1880"}},"official":null}},{"url":"/paper/graph-convolution-for-semi-supervised","slug":"graph-convolution-for-semi-supervised","title":"Graph Convolution for Semi-Supervised Classification: Improved Linear Separability and Out-of-Distribution Generalization","date":"2021-02-13","arxiv_id":"2102.06966","repositories_listed":2,"syntology":null},{"url":"/paper/latent-space-models-for-multiplex-networks","slug":"latent-space-models-for-multiplex-networks","title":"Latent space models for multiplex networks with shared structure","date":"2020-12-28","arxiv_id":"2012.14409","repositories_listed":2,"syntology":null},{"url":"/paper/interpretable-clustering-on-dynamic-graphs","slug":"interpretable-clustering-on-dynamic-graphs","title":"Interpretable Clustering on Dynamic Graphs with Recurrent Graph Neural Networks","date":"2020-12-16","arxiv_id":"2012.08740","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/partition-wise-graph-filtering-a-unified","slug":"partition-wise-graph-filtering-a-unified","title":"Partition-wise Graph Filtering: A Unified Perspective Through the Lens of Graph Coarsening","date":"2025-05-20","arxiv_id":"2505.14033","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/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/a-semidefinite-relaxation-approach-for-fair","slug":"a-semidefinite-relaxation-approach-for-fair","title":"A Semidefinite Relaxation Approach for Fair Graph Clustering","date":"2024-10-19","arxiv_id":"2410.15233","repositories_listed":1,"syntology":null},{"url":"/paper/what-is-missing-in-homophily-disentangling","slug":"what-is-missing-in-homophily-disentangling","title":"What Is Missing In Homophily? Disentangling Graph Homophily For Graph Neural Networks","date":"2024-06-27","arxiv_id":"2406.18854","repositories_listed":1,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":5,"n_instrument":5,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/what-is-missing-in-homophily-disentangling#ran","syntology_url":"https://syntology.ai/paper/2406.18854","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.18854"}},"official":{"repos":["zylmozart/disentangle_graphhom"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/csa-trans-code-structure-aware-transformer","slug":"csa-trans-code-structure-aware-transformer","title":"CSA-Trans: Code Structure Aware Transformer for AST","date":"2024-04-07","arxiv_id":"2404.05767","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":1,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/csa-trans-code-structure-aware-transformer#ran","syntology_url":"https://syntology.ai/paper/2404.05767","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.05767"}},"official":{"repos":["saeyoon17/code-structure-aware-transformer"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/maximum-likelihood-estimation-on-stochastic","slug":"maximum-likelihood-estimation-on-stochastic","title":"Spectral Clustering for Directed Graphs via Likelihood Estimation on Stochastic Block Models","date":"2024-03-28","arxiv_id":"2403.19516","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-network-outputs-are-almost","slug":"graph-neural-network-outputs-are-almost","title":"Almost Surely Asymptotically Constant Graph Neural Networks","date":"2024-03-06","arxiv_id":"2403.03880","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/inferring-community-structure-in-attributed","slug":"inferring-community-structure-in-attributed","title":"Inference and Visualization of Community Structure in Attributed Hypergraphs Using Mixed-Membership Stochastic Block Models","date":"2024-01-01","arxiv_id":"2401.00688","repositories_listed":1,"syntology":null},{"url":"/paper/non-backtracking-graph-neural-networks","slug":"non-backtracking-graph-neural-networks","title":"Non-backtracking Graph Neural Networks","date":"2023-10-11","arxiv_id":"2310.07430","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":5,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/non-backtracking-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2310.07430","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.07430"}},"official":{"repos":["seonghyun26/nba-gnn"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/an-investigation-of-representation-and","slug":"an-investigation-of-representation-and","title":"An Investigation of Representation and Allocation Harms in Contrastive Learning","date":"2023-10-02","arxiv_id":"2310.01583","repositories_listed":1,"syntology":null},{"url":"/paper/graph-topological-property-recovery-with-heat","slug":"graph-topological-property-recovery-with-heat","title":"DYMAG: Rethinking Message Passing Using Dynamical-systems-based Waveforms","date":"2023-09-18","arxiv_id":"2309.09924","repositories_listed":1,"syntology":null},{"url":"/paper/examining-the-effects-of-degree-distribution","slug":"examining-the-effects-of-degree-distribution","title":"Examining the Effects of Degree Distribution and Homophily in Graph Learning Models","date":"2023-07-17","arxiv_id":"2307.08881","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/structured-cooperative-learning-with","slug":"structured-cooperative-learning-with","title":"Structured Cooperative Learning with Graphical Model Priors","date":"2023-06-16","arxiv_id":"2306.09595","repositories_listed":1,"syntology":{"n":27,"n_ran":17,"n_constructed":0,"n_ran_checked":10,"n_instrument":7,"n_unverified":10,"n_honours":6,"n_violates":0,"n_no_contract":4,"n_pointer_only":27,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 6 honoured, 0 violated, 4 with no contract checked; 7 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/structured-cooperative-learning-with#ran","syntology_url":"https://syntology.ai/paper/2306.09595","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.09595"}},"official":{"repos":["shuangtongli/scool"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":10,"ran_from_kinds":["official"]}}},{"url":"/paper/when-do-graph-neural-networks-help-with-node","slug":"when-do-graph-neural-networks-help-with-node","title":"When Do Graph Neural Networks Help with Node Classification? Investigating the Impact of Homophily Principle on Node Distinguishability","date":"2023-04-25","arxiv_id":"2304.14274","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":3,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 1 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/when-do-graph-neural-networks-help-with-node#ran","syntology_url":"https://syntology.ai/paper/2304.14274","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.14274"}},"official":{"repos":["SitaoLuan/When-Do-GNNs-Help"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/synergistic-graph-fusion-via-encoder","slug":"synergistic-graph-fusion-via-encoder","title":"Synergistic Graph Fusion via Encoder Embedding","date":"2023-03-31","arxiv_id":"2303.18051","repositories_listed":1,"syntology":null},{"url":"/paper/rmultinet-an-r-package-for-multilayer","slug":"rmultinet-an-r-package-for-multilayer","title":"rMultiNet: An R Package For Multilayer Networks Analysis","date":"2023-02-09","arxiv_id":"2302.04437","repositories_listed":1,"syntology":null},{"url":"/paper/differentially-private-hierarchical","slug":"differentially-private-hierarchical","title":"Differentially-Private Hierarchical Clustering with Provable Approximation Guarantees","date":"2023-01-31","arxiv_id":"2302.00037","repositories_listed":1,"syntology":null},{"url":"/paper/statistical-mechanics-of-generalization-in-1","slug":"statistical-mechanics-of-generalization-in-1","title":"Homophily modulates double descent generalization in graph convolution networks","date":"2022-12-26","arxiv_id":"2212.13069","repositories_listed":1,"syntology":null},{"url":"/paper/disc-differential-spectral-clustering-of","slug":"disc-differential-spectral-clustering-of","title":"DiSC: Differential Spectral Clustering of Features","date":"2022-11-10","arxiv_id":"2211.05314","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 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; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/disc-differential-spectral-clustering-of#ran","syntology_url":"https://syntology.ai/paper/2211.05314","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.05314"}},"official":{"repos":["Mishne-Lab/DiSC"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/scalable-spectral-clustering-with-group","slug":"scalable-spectral-clustering-with-group","title":"Scalable Spectral Clustering with Group Fairness Constraints","date":"2022-10-28","arxiv_id":"2210.16435","repositories_listed":1,"syntology":null},{"url":"/paper/transformers-meet-stochastic-block-models","slug":"transformers-meet-stochastic-block-models","title":"Transformers meet Stochastic Block Models: Attention with Data-Adaptive Sparsity and Cost","date":"2022-10-27","arxiv_id":"2210.15541","repositories_listed":1,"syntology":null},{"url":"/paper/representation-power-of-graph-convolutions","slug":"representation-power-of-graph-convolutions","title":"Analysis of Convolutions, Non-linearity and Depth in Graph Neural Networks using Neural Tangent Kernel","date":"2022-10-18","arxiv_id":"2210.09809","repositories_listed":1,"syntology":null},{"url":"/paper/serialized-interacting-mixed-membership","slug":"serialized-interacting-mixed-membership","title":"Serialized Interacting Mixed Membership Stochastic Block Model","date":"2022-09-16","arxiv_id":"2209.07813","repositories_listed":1,"syntology":null},{"url":"/paper/msgnn-a-spectral-graph-neural-network-based","slug":"msgnn-a-spectral-graph-neural-network-based","title":"MSGNN: A Spectral Graph Neural Network Based on a Novel Magnetic Signed Laplacian","date":"2022-09-01","arxiv_id":"2209.00546","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":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/msgnn-a-spectral-graph-neural-network-based#ran","syntology_url":"https://syntology.ai/paper/2209.00546","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.00546"}},"official":{"repos":["sherylhyx/msgnn"],"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/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/the-multivariate-community-hawkes-model-for","slug":"the-multivariate-community-hawkes-model-for","title":"The Multivariate Community Hawkes Model for Dependent Relational Events in Continuous-time Networks","date":"2022-05-02","arxiv_id":"2205.00639","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-multivariate-community-hawkes-model-for#ran","syntology_url":"https://syntology.ai/paper/2205.00639","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.00639"}},"official":{"repos":["ideaslabut/multivariate-community-hawkes"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/sparse-random-hypergraphs-non-backtracking","slug":"sparse-random-hypergraphs-non-backtracking","title":"Sparse random hypergraphs: Non-backtracking spectra and community detection","date":"2022-03-14","arxiv_id":"2203.07346","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-community-detection-for-networks","slug":"bayesian-community-detection-for-networks","title":"Bayesian community detection for networks with covariates","date":"2022-03-04","arxiv_id":"2203.02090","repositories_listed":1,"syntology":null},{"url":"/paper/graph-attention-retrospective","slug":"graph-attention-retrospective","title":"Graph Attention Retrospective","date":"2022-02-26","arxiv_id":"2202.13060","repositories_listed":1,"syntology":null},{"url":"/paper/a-least-square-approach-to-semi-supervised","slug":"a-least-square-approach-to-semi-supervised","title":"A Compressed Sensing Based Least Squares Approach to Semi-supervised Local Cluster Extraction","date":"2022-02-07","arxiv_id":"2202.02904","repositories_listed":1,"syntology":null},{"url":"/paper/systematic-assessment-of-the-quality-of-fit","slug":"systematic-assessment-of-the-quality-of-fit","title":"Systematic assessment of the quality of fit of the stochastic block model for empirical networks","date":"2022-01-05","arxiv_id":"2201.01658","repositories_listed":1,"syntology":null},{"url":"/paper/an-iterative-clustering-algorithm-for-the","slug":"an-iterative-clustering-algorithm-for-the","title":"An iterative clustering algorithm for the Contextual Stochastic Block Model with optimality guarantees","date":"2021-12-20","arxiv_id":"2112.10467","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/an-iterative-clustering-algorithm-for-the#ran","syntology_url":"https://syntology.ai/paper/2112.10467","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.10467"}},"official":{"repos":["glmbraun/csbm"],"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/sssnet-semi-supervised-signed-network","slug":"sssnet-semi-supervised-signed-network","title":"SSSNET: Semi-Supervised Signed Network Clustering","date":"2021-10-13","arxiv_id":"2110.06623","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/sssnet-semi-supervised-signed-network#ran","syntology_url":"https://syntology.ai/paper/2110.06623","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.06623"}},"official":{"repos":["sherylhyx/sssnet_signed_clustering"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/modeling-sense-structure-in-word-usage-graphs","slug":"modeling-sense-structure-in-word-usage-graphs","title":"Modeling Sense Structure in Word Usage Graphs with the Weighted Stochastic Block Model","date":"2021-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/the-decomposition-of-the-higher-order","slug":"the-decomposition-of-the-higher-order","title":"The decomposition of the higher-order homology embedding constructed from the $k$-Laplacian","date":"2021-07-23","arxiv_id":"2107.10970","repositories_listed":1,"syntology":{"n":16,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":0,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/the-decomposition-of-the-higher-order#ran","syntology_url":"https://syntology.ai/paper/2107.10970","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.10970"}},"official":null}},{"url":"/paper/spectral-goodness-of-fit-tests-for-complete","slug":"spectral-goodness-of-fit-tests-for-complete","title":"Spectral goodness-of-fit tests for complete and partial network data","date":"2021-06-17","arxiv_id":"2106.09702","repositories_listed":1,"syntology":null},{"url":"/paper/spectral-embedding-for-dynamic-networks-with","slug":"spectral-embedding-for-dynamic-networks-with","title":"Spectral embedding for dynamic networks with stability guarantees","date":"2021-06-02","arxiv_id":"2106.01282","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-universality-of-graph-neural-networks","slug":"on-the-universality-of-graph-neural-networks","title":"On the Universality of Graph Neural Networks on Large Random Graphs","date":"2021-05-27","arxiv_id":"2105.13099","repositories_listed":1,"syntology":null},{"url":"/paper/joint-community-detection-and-rotational","slug":"joint-community-detection-and-rotational","title":"Joint Community Detection and Rotational Synchronization via Semidefinite Programming","date":"2021-05-13","arxiv_id":"2105.06031","repositories_listed":1,"syntology":null},{"url":"/paper/semi-supervised-clustering-with-inaccurate","slug":"semi-supervised-clustering-with-inaccurate","title":"Semi-Supervised Clustering with Inaccurate Pairwise Annotations","date":"2021-04-05","arxiv_id":"2104.02146","repositories_listed":1,"syntology":null},{"url":"/paper/graph-community-detection-from-coarse","slug":"graph-community-detection-from-coarse","title":"Graph Community Detection from Coarse Measurements: Recovery Conditions for the Coarsened Weighted Stochastic Block Model","date":"2021-02-25","arxiv_id":"2102.13135","repositories_listed":1,"syntology":null},{"url":"/paper/community-detection-in-the-stochastic-block","slug":"community-detection-in-the-stochastic-block","title":"Community Detection in the Stochastic Block Model by Mixed Integer Programming","date":"2021-01-26","arxiv_id":"2101.12336","repositories_listed":1,"syntology":null},{"url":"/paper/disentangling-homophily-community-structure","slug":"disentangling-homophily-community-structure","title":"Disentangling homophily, community structure and triadic closure in networks","date":"2021-01-07","arxiv_id":"2101.02510","repositories_listed":1,"syntology":null},{"url":"/paper/fast-network-community-detection-with-profile","slug":"fast-network-community-detection-with-profile","title":"Fast Network Community Detection with Profile-Pseudo Likelihood Methods","date":"2020-11-01","arxiv_id":"2011.00647","repositories_listed":1,"syntology":null},{"url":"/paper/overlapping-community-detection-in-networks-1","slug":"overlapping-community-detection-in-networks-1","title":"Overlapping community detection in networks via sparse spectral decomposition","date":"2020-09-20","arxiv_id":"2009.10641","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-community-structure-in-networks","slug":"hierarchical-community-structure-in-networks","title":"Hierarchical community structure in networks","date":"2020-09-15","arxiv_id":"2009.07196","repositories_listed":1,"syntology":null},{"url":"/paper/estimation-of-static-community-memberships","slug":"estimation-of-static-community-memberships","title":"Community recovery in non-binary and temporal stochastic block models","date":"2020-08-11","arxiv_id":"2008.04790","repositories_listed":1,"syntology":null},{"url":"/paper/almost-exact-recovery-in-noisy-semi","slug":"almost-exact-recovery-in-noisy-semi","title":"Almost exact recovery in noisy semi-supervised learning","date":"2020-07-29","arxiv_id":"2007.14717","repositories_listed":1,"syntology":null},{"url":"/paper/the-multilayer-random-dot-product-graph","slug":"the-multilayer-random-dot-product-graph","title":"The multilayer random dot product graph","date":"2020-07-20","arxiv_id":"2007.10455","repositories_listed":1,"syntology":null},{"url":"/paper/non-convex-exact-community-recovery-in","slug":"non-convex-exact-community-recovery-in","title":"Non-Convex Exact Community Recovery in Stochastic Block Model","date":"2020-06-29","arxiv_id":"2006.15843","repositories_listed":1,"syntology":null},{"url":"/paper/statistical-inference-of-assortative","slug":"statistical-inference-of-assortative","title":"Statistical inference of assortative community structures","date":"2020-06-25","arxiv_id":"2006.14493","repositories_listed":1,"syntology":null},{"url":"/paper/joint-adaptive-feature-smoothing-and-topology","slug":"joint-adaptive-feature-smoothing-and-topology","title":"Adaptive Universal Generalized PageRank Graph Neural Network","date":"2020-06-14","arxiv_id":"2006.07988","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/joint-adaptive-feature-smoothing-and-topology#ran","syntology_url":"https://syntology.ai/paper/2006.07988","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.07988"}},"official":{"repos":["jianhao2016/GPRGNN"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/community-detection-in-sparse-time-evolving","slug":"community-detection-in-sparse-time-evolving","title":"Community detection in sparse time-evolving graphs with a dynamical Bethe-Hessian","date":"2020-06-03","arxiv_id":"2006.04510","repositories_listed":1,"syntology":null},{"url":"/paper/assortative-constrained-stochastic-block","slug":"assortative-constrained-stochastic-block","title":"Assortative-Constrained Stochastic Block Models","date":"2020-04-21","arxiv_id":"2004.11890","repositories_listed":1,"syntology":null},{"url":"/paper/inference-in-the-stochastic-block-model-with","slug":"inference-in-the-stochastic-block-model-with","title":"Reliable Time Prediction in the Markov Stochastic Block Model","date":"2020-04-09","arxiv_id":"2004.04402","repositories_listed":1,"syntology":null},{"url":"/paper/interactions-in-information-spread","slug":"interactions-in-information-spread","title":"Interactions in information spread: quantification and interpretation using stochastic block models","date":"2020-04-09","arxiv_id":"2004.04552","repositories_listed":1,"syntology":null},{"url":"/paper/merge-split-markov-chain-monte-carlo-for","slug":"merge-split-markov-chain-monte-carlo-for","title":"Merge-split Markov chain Monte Carlo for community detection","date":"2020-03-16","arxiv_id":"2003.07070","repositories_listed":1,"syntology":null},{"url":"/paper/simultaneous-prediction-and-community","slug":"simultaneous-prediction-and-community","title":"Simultaneous prediction and community detection for networks with application to neuroimaging","date":"2020-02-05","arxiv_id":"2002.01645","repositories_listed":1,"syntology":null},{"url":"/paper/community-detection-in-bipartite-networks","slug":"community-detection-in-bipartite-networks","title":"Community Detection in Bipartite Networks with Stochastic Blockmodels","date":"2020-01-22","arxiv_id":"2001.11818","repositories_listed":1,"syntology":null},{"url":"/paper/optimal-sampling-and-clustering-in-the","slug":"optimal-sampling-and-clustering-in-the","title":"Optimal Sampling and Clustering in the Stochastic Block Model","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/multilateration-of-random-networks-with","slug":"multilateration-of-random-networks-with","title":"Multilateration of Random Networks with Community Structure","date":"2019-11-04","arxiv_id":"1911.01521","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-in-partially-labeled-stochastic","slug":"clustering-in-partially-labeled-stochastic","title":"Clustering in Partially Labeled Stochastic Block Models via Total Variation Minimization","date":"2019-11-03","arxiv_id":"1911.00958","repositories_listed":1,"syntology":null},{"url":"/paper/targeted-sampling-from-massive-blockmodel","slug":"targeted-sampling-from-massive-blockmodel","title":"Targeted sampling from massive block model graphs with personalized PageRank","date":"2019-10-04","arxiv_id":"1910.12937","repositories_listed":1,"syntology":null},{"url":"/paper/testing-for-association-in-multi-view-network","slug":"testing-for-association-in-multi-view-network","title":"Testing for Association in Multi-View Network Data","date":"2019-09-25","arxiv_id":"1909.11640","repositories_listed":1,"syntology":null},{"url":"/paper/sponge-a-generalized-eigenproblem-for","slug":"sponge-a-generalized-eigenproblem-for","title":"SPONGE: A generalized eigenproblem for clustering signed networks","date":"2019-04-18","arxiv_id":"1904.08575","repositories_listed":1,"syntology":null},{"url":"/paper/simultaneous-dimensionality-and-complexity","slug":"simultaneous-dimensionality-and-complexity","title":"Simultaneous Dimensionality and Complexity Model Selection for Spectral Graph Clustering","date":"2019-04-05","arxiv_id":"1904.02926","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-stochastic-block-model-for","slug":"hierarchical-stochastic-block-model-for","title":"Hierarchical Stochastic Block Model for Community Detection in Multiplex Networks","date":"2019-03-30","arxiv_id":"1904.05330","repositories_listed":1,"syntology":null},{"url":"/paper/guarantees-for-spectral-clustering-with","slug":"guarantees-for-spectral-clustering-with","title":"Guarantees for Spectral Clustering with Fairness Constraints","date":"2019-01-24","arxiv_id":"1901.08668","repositories_listed":1,"syntology":null},{"url":"/paper/reconstructing-networks-with-unknown-and","slug":"reconstructing-networks-with-unknown-and","title":"Reconstructing networks with unknown and heterogeneous errors","date":"2018-06-09","arxiv_id":"1806.07956","repositories_listed":1,"syntology":null},{"url":"/paper/generative-models-for-local-network-community","slug":"generative-models-for-local-network-community","title":"Generative models for local network community detection","date":"2018-04-12","arxiv_id":"1804.04469","repositories_listed":1,"syntology":null},{"url":"/paper/multi-view-banded-spectral-clustering-with","slug":"multi-view-banded-spectral-clustering-with","title":"Multi-view Banded Spectral Clustering with Application to ICD9 Clustering","date":"2018-04-06","arxiv_id":"1804.02097","repositories_listed":1,"syntology":null},{"url":"/paper/the-power-mean-laplacian-for-multilayer-graph","slug":"the-power-mean-laplacian-for-multilayer-graph","title":"The Power Mean Laplacian for Multilayer Graph Clustering","date":"2018-03-01","arxiv_id":"1803.00491","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-overfit-and-underfit-in-models-of","slug":"evaluating-overfit-and-underfit-in-models-of","title":"Evaluating Overfit and Underfit in Models of Network Community Structure","date":"2018-02-28","arxiv_id":"1802.10582","repositories_listed":1,"syntology":null},{"url":"/paper/a-bayesian-method-for-joint-clustering-of","slug":"a-bayesian-method-for-joint-clustering-of","title":"A Bayesian Method for Joint Clustering of Vectorial Data and Network Data","date":"2017-10-24","arxiv_id":"1710.08846","repositories_listed":1,"syntology":null},{"url":"/paper/a-network-approach-to-topic-models","slug":"a-network-approach-to-topic-models","title":"A network approach to topic models","date":"2017-08-04","arxiv_id":"1708.01677","repositories_listed":1,"syntology":null},{"url":"/paper/semiparametric-spectral-modeling-of-the","slug":"semiparametric-spectral-modeling-of-the","title":"Semiparametric spectral modeling of the Drosophila connectome","date":"2017-05-09","arxiv_id":"1705.03297","repositories_listed":1,"syntology":null},{"url":"/paper/nonparametric-bayesian-inference-of-the","slug":"nonparametric-bayesian-inference-of-the","title":"Nonparametric Bayesian inference of the microcanonical stochastic block model","date":"2016-10-09","arxiv_id":"1610.02703","repositories_listed":1,"syntology":null},{"url":"/paper/mmse-of-probabilistic-low-rank-matrix","slug":"mmse-of-probabilistic-low-rank-matrix","title":"MMSE of probabilistic low-rank matrix estimation: Universality with respect to the output channel","date":"2015-07-14","arxiv_id":"1507.03857","repositories_listed":1,"syntology":null},{"url":"/paper/stochastic-block-transition-models-for","slug":"stochastic-block-transition-models-for","title":"Stochastic Block Transition Models for Dynamic Networks","date":"2014-11-19","arxiv_id":"1411.5404","repositories_listed":1,"syntology":null},{"url":"/paper/on-semidefinite-relaxations-for-the-block","slug":"on-semidefinite-relaxations-for-the-block","title":"On semidefinite relaxations for the block model","date":"2014-06-21","arxiv_id":"1406.5647","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-detection-of-statistically","slug":"scalable-detection-of-statistically","title":"Scalable detection of statistically significant communities and hierarchies, using message-passing for modularity","date":"2014-03-23","arxiv_id":"1403.5787","repositories_listed":1,"syntology":null},{"url":"/paper/efficiently-inferring-community-structure-in","slug":"efficiently-inferring-community-structure-in","title":"Efficiently inferring community structure in bipartite networks","date":"2014-03-12","arxiv_id":"1403.2933","repositories_listed":1,"syntology":null},{"url":"/paper/stochastic-blockmodel-approximation-of-a-1","slug":"stochastic-blockmodel-approximation-of-a-1","title":"Stochastic blockmodel approximation of a graphon: Theory and consistent estimation","date":"2013-11-07","arxiv_id":"1311.1731","repositories_listed":1,"syntology":null},{"url":"/paper/spectral-clustering-for-divide-and-conquer","slug":"spectral-clustering-for-divide-and-conquer","title":"Spectral Clustering for Divide-and-Conquer Graph Matching","date":"2013-10-04","arxiv_id":"1310.1297","repositories_listed":1,"syntology":null},{"url":null,"slug":"effective-stimulus-propagation-in-neural","title":"Effective Stimulus Propagation in Neural Circuits: Driver Node Selection","date":"2025-06-16","arxiv_id":"2506.13615","repositories_listed":0,"syntology":null},{"url":null,"slug":"spectral-clustering-for-dependent-community","title":"Spectral clustering for dependent community Hawkes process models of temporal networks","date":"2025-05-28","arxiv_id":"2505.21845","repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-learning-for-optimal-transport","title":"Unsupervised Learning for Optimal Transport plan prediction between unbalanced graphs","date":"2025-05-21","arxiv_id":"2506.12025","repositories_listed":0,"syntology":null},{"url":null,"slug":"consensus-on-open-multi-agent-systems-over","title":"Consensus on Open Multi-Agent Systems Over Graphs Sampled from Graphons","date":"2025-03-31","arxiv_id":"2503.24025","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-agent-q-learning-dynamics-in-random","title":"Multi-Agent Q-Learning Dynamics in Random Networks: Convergence due to Exploration and Sparsity","date":"2025-03-13","arxiv_id":"2503.10186","repositories_listed":0,"syntology":null}],"syntology_records":16,"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":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"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":[]},"papers_where_code_ran":14,"papers_where_code_ran_first_page":"/task/stochastic-block-model/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":4,"url":"/task/stochastic-block-model/papers/2","json":"/task/stochastic-block-model/papers/2.json","rows":100},{"order":"archive","page":3,"of":4,"url":"/task/stochastic-block-model/papers/3","json":"/task/stochastic-block-model/papers/3.json","rows":100},{"order":"archive","page":4,"of":4,"url":"/task/stochastic-block-model/papers/4","json":"/task/stochastic-block-model/papers/4.json","rows":70},{"order":"ran","page":1,"of":1,"url":"/task/stochastic-block-model/papers/ran/1","json":"/task/stochastic-block-model/papers/ran/1.json","rows":14}],"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":"666e18bcc74b1da7883915aef3d3ea6edb7131a75505161e49b0679921e9adc6","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}