{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/graph-encoder-embedding","title":"One-Hot Graph Encoder Embedding","arxiv_id":"2109.13098","date":"2021-09-27","proceeding":null,"authors":["Cencheng Shen","Qizhe Wang","Carey E. Priebe"],"abstract":"In this paper we propose a lightning fast graph embedding method called one-hot graph encoder embedding. It has a linear computational complexity and the capacity to process billions of edges within minutes on standard PC -- making it an ideal candidate for huge graph processing. It is applicable to either adjacency matrix or graph Laplacian, and can be viewed as a transformation of the spectral embedding. Under random graph models, the graph encoder embedding is approximately normally distributed per vertex, and asymptotically converges to its mean. We showcase three applications: vertex classification, vertex clustering, and graph bootstrap. In every case, the graph encoder embedding exhibits unrivalled computational advantages.","url_abs":"https://arxiv.org/abs/2109.13098v3","url_pdf":"https://arxiv.org/pdf/2109.13098v3.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":"graph-encoder-embedding","repo_url":"https://github.com/cshen6/graphemd","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null},{"paper_slug":"graph-encoder-embedding","repo_url":"https://github.com/cshen6/graphnn","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"LGPL-3.0"}},{"paper_slug":"graph-encoder-embedding","repo_url":"https://github.com/ariellubonja/ligra","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"graph-embedding","task_name":"Graph Embedding"},{"task_slug":"stochastic-block-model","task_name":"Stochastic Block Model"}],"methods":[{"method_slug":"pc","method_name":"pc"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2109.13098","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.13098"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","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/cshen6/graphnn","reach":{"status":"ok","spdx":"LGPL-3.0"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/ariellubonja/ligra","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/cshen6/graphemd","reach":null}],"summary":{"ran_draft_wrong":2},"by_repo_kind":{"official":{"samples":2,"ran":2,"repositories":1}},"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,"samples":[{"code_sha256_prefix":"8b2bcaa279e58aff","entry":"graph_encoder_embed","repo":"cshen6/graphemd","repo_kind":"official","path":"Experiments/Python/Numba/Encode.py","file_url":"https://github.com/cshen6/graphemd/blob/HEAD/Experiments/Python/Numba/Encode.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"LGPL-3.0","inline_ok":false,"mcp_get_code":{"code_sha256":"8b2bcaa279e58aff"}},{"code_sha256_prefix":"1f0b6634ba1b10fe","entry":"multi_graph_encoder_embed","repo":"cshen6/graphemd","repo_kind":"official","path":"Experiments/Python/Numba/Encode.py","file_url":"https://github.com/cshen6/graphemd/blob/HEAD/Experiments/Python/Numba/Encode.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"LGPL-3.0","inline_ok":false,"mcp_get_code":{"code_sha256":"1f0b6634ba1b10fe"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}