{"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/papers/ran/1","list_of":"/task/stochastic-block-model","task":"Stochastic Block Model","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","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.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,14],"of":14,"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"},"first_page":"/task/stochastic-block-model/papers/ran/1","prev":null,"next":null,"papers":[{"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":10,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 0 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":10,"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":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":5,"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) · 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":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"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":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 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":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"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":6,"n_instrument":2,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":4,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 1 violated, 4 with no contract checked; 2 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":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"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/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/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/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/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/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/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}}],"record_sha256":"f702c955b739ac73d3051c4f638bdbade25018399ba2d18e43dd85474e10cbde","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}