{"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":"/paper/dink-net-neural-clustering-on-large-graphs","title":"Dink-Net: Neural Clustering on Large Graphs","arxiv_id":"2305.18405","date":"2023-05-28","proceeding":null,"authors":["Yue Liu","Ke Liang","Jun Xia","Sihang Zhou","Xihong Yang","Xinwang Liu","Stan Z. Li"],"abstract":"Deep graph clustering, which aims to group the nodes of a graph into disjoint clusters with deep neural networks, has achieved promising progress in recent years. However, the existing methods fail to scale to the large graph with million nodes. To solve this problem, a scalable deep graph clustering method (Dink-Net) is proposed with the idea of dilation and shrink. Firstly, by discriminating nodes, whether being corrupted by augmentations, representations are learned in a self-supervised manner. Meanwhile, the cluster centres are initialized as learnable neural parameters. Subsequently, the clustering distribution is optimized by minimizing the proposed cluster dilation loss and cluster shrink loss in an adversarial manner. By these settings, we unify the two-step clustering, i.e., representation learning and clustering optimization, into an end-to-end framework, guiding the network to learn clustering-friendly features. Besides, Dink-Net scales well to large graphs since the designed loss functions adopt the mini-batch data to optimize the clustering distribution even without performance drops. Both experimental results and theoretical analyses demonstrate the superiority of our method. Compared to the runner-up, Dink-Net achieves 9.62% NMI improvement on the ogbn-papers100M dataset with 111 million nodes and 1.6 billion edges. The source code is released at https://github.com/yueliu1999/Dink-Net. Besides, a collection (papers, codes, and datasets) of deep graph clustering is shared at https://github.com/yueliu1999/Awesome-Deep-Graph-Clustering.","url_abs":"https://arxiv.org/abs/2305.18405v3","url_pdf":"https://arxiv.org/pdf/2305.18405v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"dink-net-neural-clustering-on-large-graphs","repo_url":"https://github.com/yueliu1999/awesome-deep-graph-clustering","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"dink-net-neural-clustering-on-large-graphs","repo_url":"https://github.com/yueliu1999/dink-net","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"graph-clustering","task_name":"Graph Clustering"},{"task_slug":"representation-learning","task_name":"Representation Learning"}],"methods":[{"method_slug":"fail","method_name":"fail"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2305.18405","atlas_url":"https://app.syntology.ai/?focus=2305.18405","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.18405"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2305.18405"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2305.18405"},"call":"get_harvested_code_for_paper(arxiv_id=\"2305.18405\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2305.18405"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2305.18405\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2305.18405"},"call":"get_concepts_for_paper(arxiv_id=\"2305.18405\")"}],"by_repo":[{"repo":"yueliu1999/awesome-deep-graph-clustering","kind":"official","samples":15,"ran":13,"instrument":2,"unverified":2},{"repo":"yueliu1999/dink-net","kind":"official","samples":2,"ran":0,"instrument":0,"unverified":2}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2305.18405.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2305.18405.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/yueliu1999/dink-net","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/yueliu1999/awesome-deep-graph-clustering","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":11,"ran_draft_wrong":2,"unverified":4},"n_samples":17,"n_ran":13,"n_constructed":0,"n_ran_checked":11,"n_instrument":2,"n_unverified":4,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"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)"},"by_repo_kind":{"official":{"samples":17,"ran":13,"n_ran_checked":11,"n_instrument":2,"repositories":2}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":2,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":2,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":13,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-26","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"3d3e7131c6169f81","code_sha256_prefix":"3d3e7131c6169f81","entry":"add_edge","repo":"yueliu1999/awesome-deep-graph-clustering","repo_kind":"official","path":"dgc/augmentation/augmentation.py","file_url":"https://github.com/yueliu1999/awesome-deep-graph-clustering/blob/HEAD/dgc/augmentation/augmentation.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"adj:ndarray/2/float, add_rate:float/0/float","fixture_out_type":"ndarray","level_recorded_at":"2026-09-26T00:54:16.521071+00:00","retrieve_with":{"tool":"get_code","code_sha256":"3d3e7131c6169f81"},"code_page":"/code/add-edge","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"3d3e7131c6169f81"}},{"code_sha256":"a75ce8e51dcc5015","code_sha256_prefix":"a75ce8e51dcc5015","entry":"diffusion_adj","repo":"yueliu1999/awesome-deep-graph-clustering","repo_kind":"official","path":"dgc/augmentation/augmentation.py","file_url":"https://github.com/yueliu1999/awesome-deep-graph-clustering/blob/HEAD/dgc/augmentation/augmentation.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"adj:ndarray/2/float, self_loop:bool/0/bool, mode:str/0/str, transport_rate:float/0/float","fixture_out_type":"ndarray","level_recorded_at":"2026-09-26T00:54:16.521071+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"a75ce8e51dcc5015"}},{"code_sha256":"bcfbed8a5de42869","code_sha256_prefix":"bcfbed8a5de42869","entry":"drop_edge","repo":"yueliu1999/awesome-deep-graph-clustering","repo_kind":"official","path":"dgc/augmentation/augmentation.py","file_url":"https://github.com/yueliu1999/awesome-deep-graph-clustering/blob/HEAD/dgc/augmentation/augmentation.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"adj:ndarray/2/float, drop_rate:float/0/float","fixture_out_type":"ndarray","level_recorded_at":"2026-09-26T00:54:16.521071+00:00","retrieve_with":{"tool":"get_code","code_sha256":"bcfbed8a5de42869"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"bcfbed8a5de42869"}},{"code_sha256":"0c7778c11aa56956","code_sha256_prefix":"0c7778c11aa56956","entry":"kmeans","repo":"yueliu1999/awesome-deep-graph-clustering","repo_kind":"official","path":"dgc/clustering/kmeans_gpu.py","file_url":"https://github.com/yueliu1999/awesome-deep-graph-clustering/blob/HEAD/dgc/clustering/kmeans_gpu.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"X:Tensor/2/float, num_clusters:int/0/int, distance:str/0/str, tol:float/0/float, init_mode:str/0/str, init_time:int/0/int, device:device/0/?","fixture_out_type":"tuple","level_recorded_at":"2026-09-26T00:54:16.521071+00:00","code_page":"/code/kmeans","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"0c7778c11aa56956"}},{"code_sha256":"8df2d7c9c5130d96","code_sha256_prefix":"8df2d7c9c5130d96","entry":"kmeans_plusplus_init","repo":"yueliu1999/awesome-deep-graph-clustering","repo_kind":"official","path":"dgc/clustering/kmeans_gpu.py","file_url":"https://github.com/yueliu1999/awesome-deep-graph-clustering/blob/HEAD/dgc/clustering/kmeans_gpu.py","link_basis":"plan_row","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"X:Tensor/2/float, num_clusters:int/0/int, device:device/0/?","fixture_out_type":"tuple","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from vege12138/w2, and GitHub detected no licence in that repository when it was checked","mcp_get_code":{"code_sha256":"8df2d7c9c5130d96"}},{"code_sha256":"10814cdc168fabe2","code_sha256_prefix":"10814cdc168fabe2","entry":"load_data","repo":"yueliu1999/awesome-deep-graph-clustering","repo_kind":"official","path":"dgc/utils/data_loader.py","file_url":"https://github.com/yueliu1999/awesome-deep-graph-clustering/blob/HEAD/dgc/utils/data_loader.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"root_path:str/0/str, dataset_name:str/0/str, show_details:bool/0/bool","fixture_out_type":"tuple","level_recorded_at":"2026-09-26T00:54:16.521071+00:00","code_page":"/code/load-data","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"10814cdc168fabe2"}},{"code_sha256":"e1f5acb3d146b48c","code_sha256_prefix":"e1f5acb3d146b48c","entry":"load_graph_data","repo":"yueliu1999/awesome-deep-graph-clustering","repo_kind":"official","path":"dgc/utils/data_loader.py","file_url":"https://github.com/yueliu1999/awesome-deep-graph-clustering/blob/HEAD/dgc/utils/data_loader.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"root_path:str/0/str, dataset_name:str/0/str, show_details:bool/0/bool","fixture_out_type":"tuple","level_recorded_at":"2026-09-26T00:54:16.521071+00:00","code_page":"/code/load-graph-data","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"e1f5acb3d146b48c"}},{"code_sha256":"16475ba069d5a2cd","code_sha256_prefix":"16475ba069d5a2cd","entry":"normalize_adj","repo":"yueliu1999/awesome-deep-graph-clustering","repo_kind":"official","path":"dgc/utils/data_processor.py","file_url":"https://github.com/yueliu1999/awesome-deep-graph-clustering/blob/HEAD/dgc/utils/data_processor.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"adj:ndarray/2/float, self_loop:bool/0/bool, symmetry:bool/0/bool","fixture_out_type":"ndarray","level_recorded_at":"2026-09-26T01:24:49.973517+00:00","code_page":"/code/normalize-adj","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"16475ba069d5a2cd"}},{"code_sha256":"d6b766d2c2a9f3fb","code_sha256_prefix":"d6b766d2c2a9f3fb","entry":"numpy_to_torch","repo":"yueliu1999/awesome-deep-graph-clustering","repo_kind":"official","path":"dgc/utils/data_processor.py","file_url":"https://github.com/yueliu1999/awesome-deep-graph-clustering/blob/HEAD/dgc/utils/data_processor.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"a:ndarray/2/float, is_sparse:bool/0/bool","fixture_out_type":"Tensor","level_recorded_at":"2026-09-26T01:24:49.973517+00:00","code_page":"/code/numpy-to-torch","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"d6b766d2c2a9f3fb"}},{"code_sha256":"984c282b0889b5bf","code_sha256_prefix":"984c282b0889b5bf","entry":"random_init","repo":"yueliu1999/awesome-deep-graph-clustering","repo_kind":"official","path":"dgc/clustering/kmeans_gpu.py","file_url":"https://github.com/yueliu1999/awesome-deep-graph-clustering/blob/HEAD/dgc/clustering/kmeans_gpu.py","link_basis":"plan_row","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"X:Tensor/2/float, num_clusters:int/0/int","fixture_out_type":"Tensor","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"984c282b0889b5bf"},"code_page":"/code/random-init","census":null,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from vege12138/w2, and GitHub detected no licence in that repository when it was checked","mcp_get_code":{"code_sha256":"984c282b0889b5bf"}},{"code_sha256":"3f8ff21e08e80504","code_sha256_prefix":"3f8ff21e08e80504","entry":"similarity_plot","repo":"yueliu1999/awesome-deep-graph-clustering","repo_kind":"official","path":"dgc/visualization/visualization.py","file_url":"https://github.com/yueliu1999/awesome-deep-graph-clustering/blob/HEAD/dgc/visualization/visualization.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"embedding:ndarray/2/float, label:ndarray/1/int, sample_num:int/0/int, show_fig:bool/0/bool","fixture_out_type":"Figure","level_recorded_at":"2026-09-26T01:55:17.694675+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"3f8ff21e08e80504"}},{"code_sha256":"443d6a37168cf414","code_sha256_prefix":"443d6a37168cf414","entry":"t_sne","repo":"yueliu1999/awesome-deep-graph-clustering","repo_kind":"official","path":"dgc/visualization/visualization.py","file_url":"https://github.com/yueliu1999/awesome-deep-graph-clustering/blob/HEAD/dgc/visualization/visualization.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"embeds:ndarray/2/float, labels:ndarray/1/int, sample_num:int/0/int, show_fig:bool/0/bool","fixture_out_type":"Figure","level_recorded_at":"2026-09-26T00:54:16.521071+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"443d6a37168cf414"}},{"code_sha256":"8a030011abbbef71","code_sha256_prefix":"8a030011abbbef71","entry":"torch_to_numpy","repo":"yueliu1999/awesome-deep-graph-clustering","repo_kind":"official","path":"dgc/utils/data_processor.py","file_url":"https://github.com/yueliu1999/awesome-deep-graph-clustering/blob/HEAD/dgc/utils/data_processor.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"t:Tensor/2/float","fixture_out_type":"ndarray","level_recorded_at":"2026-09-26T00:54:16.521071+00:00","code_page":"/code/torch-to-numpy","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"8a030011abbbef71"}},{"code_sha256":"38b7ff211b7c6642","code_sha256_prefix":"38b7ff211b7c6642","entry":"aug_feature_dropout","repo":"yueliu1999/dink-net","repo_kind":"official","path":"utils.py","file_url":"https://github.com/yueliu1999/dink-net/blob/HEAD/utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"38b7ff211b7c6642"}},{"code_sha256":"8e20feda4d89a3d5","code_sha256_prefix":"8e20feda4d89a3d5","entry":"k_means","repo":"yueliu1999/awesome-deep-graph-clustering","repo_kind":"official","path":"dgc/clustering/clustering.py","file_url":"https://github.com/yueliu1999/awesome-deep-graph-clustering/blob/HEAD/dgc/clustering/clustering.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/k-means","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"8e20feda4d89a3d5"}},{"code_sha256":"7060a5d3da293868","code_sha256_prefix":"7060a5d3da293868","entry":"setup_seed","repo":"yueliu1999/awesome-deep-graph-clustering","repo_kind":"official","path":"dgc/rand/random_seed.py","file_url":"https://github.com/yueliu1999/awesome-deep-graph-clustering/blob/HEAD/dgc/rand/random_seed.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/setup-seed","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"7060a5d3da293868"}},{"code_sha256":"3ca9fb001e7b5067","code_sha256_prefix":"3ca9fb001e7b5067","entry":"setup_seed","repo":"yueliu1999/dink-net","repo_kind":"official","path":"utils.py","file_url":"https://github.com/yueliu1999/dink-net/blob/HEAD/utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/setup-seed","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"3ca9fb001e7b5067"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"4c7458e02cf6995636e76583abcffd024a17c35ec3ecf62746a162a9972c6aac","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}