{"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/graph-clustering/papers/ran/1","list_of":"/task/graph-clustering","task":"Graph Clustering","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,33],"of":33,"counts":{"archive_papers_tagged":393,"with_a_code_link":180,"where_syntology_ran_a_sample":33,"not_listed_spam_title":0,"listed":393,"listed_where_code_ran":33,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":31,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":31,"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"},"first_page":"/task/graph-clustering/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/deep-modularity-networks-with-diversity","slug":"deep-modularity-networks-with-diversity","title":"Deep Modularity Networks with Diversity--Preserving Regularization","date":"2025-01-23","arxiv_id":"2501.13451","repositories_listed":0,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"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 1 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; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/deep-modularity-networks-with-diversity#ran","syntology_url":"https://syntology.ai/paper/2501.13451","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.13451"}},"official":null}},{"url":"/paper/one-node-one-model-featuring-the-missing-half","slug":"one-node-one-model-featuring-the-missing-half","title":"One Node One Model: Featuring the Missing-Half for Graph Clustering","date":"2024-12-13","arxiv_id":"2412.09902","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":7,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/one-node-one-model-featuring-the-missing-half#ran","syntology_url":"https://syntology.ai/paper/2412.09902","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.09902"}},"official":{"repos":["xiexuanting/fpgc"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/reliable-node-similarity-matrix-guided","slug":"reliable-node-similarity-matrix-guided","title":"Reliable Node Similarity Matrix Guided Contrastive Graph Clustering","date":"2024-08-07","arxiv_id":"2408.03765","repositories_listed":1,"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":1,"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/reliable-node-similarity-matrix-guided#ran","syntology_url":"https://syntology.ai/paper/2408.03765","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.03765"}},"official":{"repos":["Cloudy1225/NS4GC"],"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/balanced-multi-relational-graph-clustering","slug":"balanced-multi-relational-graph-clustering","title":"Balanced Multi-Relational Graph Clustering","date":"2024-07-23","arxiv_id":"2407.16863","repositories_listed":1,"syntology":{"n":15,"n_ran":15,"n_constructed":0,"n_ran_checked":10,"n_instrument":5,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":8,"n_pointer_only":15,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 2 honoured, 0 violated, 8 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/balanced-multi-relational-graph-clustering#ran","syntology_url":"https://syntology.ai/paper/2407.16863","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.16863"}},"official":{"repos":["zxlearningdeep/bmgc"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/unveiling-global-interactive-patterns-across","slug":"unveiling-global-interactive-patterns-across","title":"Unveiling Global Interactive Patterns across Graphs: Towards Interpretable Graph Neural Networks","date":"2024-07-02","arxiv_id":"2407.01979","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/unveiling-global-interactive-patterns-across#ran","syntology_url":"https://syntology.ai/paper/2407.01979","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.01979"}},"official":{"repos":["Wangyuwen0627/GIP-Framework"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/structure-aware-semantic-node-identifiers-for","slug":"structure-aware-semantic-node-identifiers-for","title":"Node Identifiers: Compact, Discrete Representations for Efficient Graph Learning","date":"2024-05-26","arxiv_id":"2405.16435","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":2,"n_no_contract":7,"n_pointer_only":3,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 2 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/structure-aware-semantic-node-identifiers-for#ran","syntology_url":"https://syntology.ai/paper/2405.16435","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16435"}},"official":{"repos":["LUOyk1999/NodeID"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/every-node-is-different-dynamically-fusing","slug":"every-node-is-different-dynamically-fusing","title":"Every Node is Different: Dynamically Fusing Self-Supervised Tasks for Attributed Graph Clustering","date":"2024-01-12","arxiv_id":"2401.06595","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":10,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/every-node-is-different-dynamically-fusing#ran","syntology_url":"https://syntology.ai/paper/2401.06595","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.06595"}},"official":{"repos":["q086/dyfss"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"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":5,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":8,"phrase":"5 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; 0 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/robust-graph-clustering-via-meta-weighting","slug":"robust-graph-clustering-via-meta-weighting","title":"Robust Graph Clustering via Meta Weighting for Noisy Graphs","date":"2023-11-01","arxiv_id":"2311.00322","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/robust-graph-clustering-via-meta-weighting#ran","syntology_url":"https://syntology.ai/paper/2311.00322","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.00322"}},"official":{"repos":["hyeonsoojo/metagc"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/redundancy-free-self-supervised-relational","slug":"redundancy-free-self-supervised-relational","title":"Redundancy-Free Self-Supervised Relational Learning for Graph Clustering","date":"2023-09-09","arxiv_id":"2309.04694","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/redundancy-free-self-supervised-relational#ran","syntology_url":"https://syntology.ai/paper/2309.04694","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.04694"}},"official":{"repos":["yisiyu95/r2fgc"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/convert-contrastive-graph-clustering-with","slug":"convert-contrastive-graph-clustering-with","title":"CONVERT:Contrastive Graph Clustering with Reliable Augmentation","date":"2023-08-17","arxiv_id":"2308.08963","repositories_listed":2,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":3,"n_pointer_only":7,"phrase":"5 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; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/convert-contrastive-graph-clustering-with#ran","syntology_url":"https://syntology.ai/paper/2308.08963","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.08963"}},"official":{"repos":["xihongyang1999/convert"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/homophily-enhanced-structure-learning-for","slug":"homophily-enhanced-structure-learning-for","title":"Homophily-enhanced Structure Learning for Graph Clustering","date":"2023-08-10","arxiv_id":"2308.05309","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/homophily-enhanced-structure-learning-for#ran","syntology_url":"https://syntology.ai/paper/2308.05309","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.05309"}},"official":{"repos":["galogm/hole"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/dink-net-neural-clustering-on-large-graphs","slug":"dink-net-neural-clustering-on-large-graphs","title":"Dink-Net: Neural Clustering on Large Graphs","date":"2023-05-28","arxiv_id":"2305.18405","repositories_listed":2,"syntology":{"n":17,"n_ran":13,"n_constructed":0,"n_ran_checked":11,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":2,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/dink-net-neural-clustering-on-large-graphs#ran","syntology_url":"https://syntology.ai/paper/2305.18405","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.18405"}},"official":{"repos":["yueliu1999/awesome-deep-graph-clustering","yueliu1999/dink-net"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/cluster-guided-contrastive-graph-clustering","slug":"cluster-guided-contrastive-graph-clustering","title":"Cluster-guided Contrastive Graph Clustering Network","date":"2023-01-03","arxiv_id":"2301.01098","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 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; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/cluster-guided-contrastive-graph-clustering#ran","syntology_url":"https://syntology.ai/paper/2301.01098","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.01098"}},"official":{"repos":["xihongyang1999/ccgc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-survey-of-deep-graph-clustering-taxonomy","slug":"a-survey-of-deep-graph-clustering-taxonomy","title":"A Survey of Deep Graph Clustering: Taxonomy, Challenge, Application, and Open Resource","date":"2022-11-23","arxiv_id":"2211.12875","repositories_listed":2,"syntology":{"n":15,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":0,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-survey-of-deep-graph-clustering-taxonomy#ran","syntology_url":"https://syntology.ai/paper/2211.12875","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.12875"}},"official":{"repos":["marigoldwu/a-unified-framework-for-deep-attribute-graph-clustering","yueliu1999/awesome-deep-graph-clustering"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/simulate-time-integrated-coarse-grained","slug":"simulate-time-integrated-coarse-grained","title":"Simulate Time-integrated Coarse-grained Molecular Dynamics with Multi-Scale Graph Networks","date":"2022-04-21","arxiv_id":"2204.10348","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/simulate-time-integrated-coarse-grained#ran","syntology_url":"https://syntology.ai/paper/2204.10348","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.10348"}},"official":{"repos":["kyonofx/mlcgmd"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/rethinking-graph-autoencoder-models-for","slug":"rethinking-graph-autoencoder-models-for","title":"Rethinking Graph Auto-Encoder Models for Attributed Graph Clustering","date":"2021-07-19","arxiv_id":"2107.08562","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/rethinking-graph-autoencoder-models-for#ran","syntology_url":"https://syntology.ai/paper/2107.08562","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.08562"}},"official":{"repos":["nairouz/R-GAE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/digrac-digraph-clustering-with-flow-imbalance","slug":"digrac-digraph-clustering-with-flow-imbalance","title":"DIGRAC: Digraph Clustering Based on Flow Imbalance","date":"2021-06-09","arxiv_id":"2106.05194","repositories_listed":1,"syntology":{"n":8,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"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) · 5 unverified","sample_list":"/paper/digrac-digraph-clustering-with-flow-imbalance#ran","syntology_url":"https://syntology.ai/paper/2106.05194","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.05194"}},"official":{"repos":["sherylhyx/digrac_directed_clustering"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/local-algorithms-for-finding-densely","slug":"local-algorithms-for-finding-densely","title":"Local Algorithms for Finding Densely Connected Clusters","date":"2021-06-09","arxiv_id":"2106.05245","repositories_listed":1,"syntology":{"n":15,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":10,"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) · 10 unverified","sample_list":"/paper/local-algorithms-for-finding-densely#ran","syntology_url":"https://syntology.ai/paper/2106.05245","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.05245"}},"official":{"repos":["pmacg/local-densely-connected-clusters"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":10,"ran_from_kinds":["official"]}}},{"url":"/paper/structure-aware-face-clustering-on-a-large","slug":"structure-aware-face-clustering-on-a-large","title":"Structure-Aware Face Clustering on a Large-Scale Graph with $\\bf{10^{7}}$ Nodes","date":"2021-03-24","arxiv_id":"2103.13225","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"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) · 0 unverified","sample_list":"/paper/structure-aware-face-clustering-on-a-large#ran","syntology_url":"https://syntology.ai/paper/2103.13225","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.13225"}},"official":{"repos":["sstzal/STAR-FC"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-a-proposal-classifier-for-multiple","slug":"learning-a-proposal-classifier-for-multiple","title":"Learning a Proposal Classifier for Multiple Object Tracking","date":"2021-03-14","arxiv_id":"2103.07889","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/learning-a-proposal-classifier-for-multiple#ran","syntology_url":"https://syntology.ai/paper/2103.07889","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.07889"}},"official":{"repos":["daip13/LPC_MOT"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/accurate-learning-of-graph-representations-1","slug":"accurate-learning-of-graph-representations-1","title":"Accurate Learning of Graph Representations with Graph Multiset Pooling","date":"2021-02-23","arxiv_id":"2102.11533","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":5,"phrase":"4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/accurate-learning-of-graph-representations-1#ran","syntology_url":"https://syntology.ai/paper/2102.11533","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.11533"}},"official":{"repos":["JinheonBaek/GMT"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/knowledge-preserving-incremental-social-event","slug":"knowledge-preserving-incremental-social-event","title":"Knowledge-Preserving Incremental Social Event Detection via Heterogeneous GNNs","date":"2021-01-21","arxiv_id":"2101.08747","repositories_listed":2,"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/knowledge-preserving-incremental-social-event#ran","syntology_url":"https://syntology.ai/paper/2101.08747","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.08747"}},"official":{"repos":["RingBDStack/KPGNN"],"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/laplacian-regularized-few-shot-learning-1","slug":"laplacian-regularized-few-shot-learning-1","title":"Laplacian Regularized Few-Shot Learning","date":"2020-06-28","arxiv_id":"2006.15486","repositories_listed":2,"syntology":{"n":12,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":7,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"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) · 7 unverified","sample_list":"/paper/laplacian-regularized-few-shot-learning-1#ran","syntology_url":"https://syntology.ai/paper/2006.15486","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.15486"}},"official":{"repos":["imtiazziko/LaplacianShot"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["listed","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/balancing-the-tradeoff-between-clustering","slug":"balancing-the-tradeoff-between-clustering","title":"Balancing the Tradeoff Between Clustering Value and Interpretability","date":"2019-12-17","arxiv_id":"1912.07820","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/balancing-the-tradeoff-between-clustering#ran","syntology_url":"https://syntology.ai/paper/1912.07820","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.07820"}},"official":{"repos":["sandysa/Interpretable_Clustering"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/correlation-clustering-with-same-cluster","slug":"correlation-clustering-with-same-cluster","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","date":"2019-08-14","arxiv_id":"1908.04976","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":3,"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/correlation-clustering-with-same-cluster#ran","syntology_url":"https://syntology.ai/paper/1908.04976","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.04976"}},"official":{"repos":["sanjayss34/corr-clust-query-esa2019"],"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/rwr-gae-random-walk-regularization-for-graph","slug":"rwr-gae-random-walk-regularization-for-graph","title":"RWR-GAE: Random Walk Regularization for Graph Auto Encoders","date":"2019-08-12","arxiv_id":"1908.04003","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":5,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 1 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/rwr-gae-random-walk-regularization-for-graph#ran","syntology_url":"https://syntology.ai/paper/1908.04003","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.04003"}},"official":{"repos":["MysteryVaibhav/DW-GAE"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/symmetric-graph-convolutional-autoencoder-for","slug":"symmetric-graph-convolutional-autoencoder-for","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","date":"2019-08-07","arxiv_id":"1908.02441","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":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/symmetric-graph-convolutional-autoencoder-for#ran","syntology_url":"https://syntology.ai/paper/1908.02441","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.02441"}},"official":null}},{"url":"/paper/mincut-pooling-in-graph-neural-networks","slug":"mincut-pooling-in-graph-neural-networks","title":"Spectral Clustering with Graph Neural Networks for Graph Pooling","date":"2019-06-30","arxiv_id":"1907.00481","repositories_listed":4,"syntology":{"n":9,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"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) · 6 unverified","sample_list":"/paper/mincut-pooling-in-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1907.00481","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.00481"}},"official":{"repos":["FilippoMB/Spectral-Clustering-with-Graph-Neural-Networks-for-Graph-Pooling","FilippoMB/Benchmark_dataset_for_graph_classification"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/attributed-graph-clustering-a-deep","slug":"attributed-graph-clustering-a-deep","title":"Attributed Graph Clustering: A Deep Attentional Embedding Approach","date":"2019-06-15","arxiv_id":"1906.06532","repositories_listed":3,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/attributed-graph-clustering-a-deep#ran","syntology_url":"https://syntology.ai/paper/1906.06532","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.06532"}},"official":null}},{"url":"/paper/optimal-transport-for-structured-data-with","slug":"optimal-transport-for-structured-data-with","title":"Optimal Transport for structured data with application on graphs","date":"2018-05-23","arxiv_id":"1805.09114","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"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; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/optimal-transport-for-structured-data-with#ran","syntology_url":"https://syntology.ai/paper/1805.09114","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.09114"}},"official":null}},{"url":"/paper/variational-graph-auto-encoders","slug":"variational-graph-auto-encoders","title":"Variational Graph Auto-Encoders","date":"2016-11-21","arxiv_id":"1611.07308","repositories_listed":22,"syntology":{"n":13,"n_ran":11,"n_constructed":0,"n_ran_checked":7,"n_instrument":4,"n_unverified":2,"n_honours":3,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 3 honoured, 0 violated, 4 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/variational-graph-auto-encoders#ran","syntology_url":"https://syntology.ai/paper/1611.07308","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.07308"}},"official":{"repos":["tkipf/gae"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}],"record_sha256":"f1dfd7df37a8653664aa5edc2099f642e847f44fdc7c0d0ade59ae352378ee42","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}