{"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/graphcroc-cross-correlation-autoencoder-for","title":"GraphCroc: Cross-Correlation Autoencoder for Graph Structural Reconstruction","arxiv_id":"2410.03396","date":"2024-10-04","proceeding":null,"authors":["Shijin Duan","Ruyi Ding","Jiaxing He","Aidong Adam Ding","Yunsi Fei","Xiaolin Xu"],"abstract":"Graph-structured data is integral to many applications, prompting the development of various graph representation methods. Graph autoencoders (GAEs), in particular, reconstruct graph structures from node embeddings. Current GAE models primarily utilize self-correlation to represent graph structures and focus on node-level tasks, often overlooking multi-graph scenarios. Our theoretical analysis indicates that self-correlation generally falls short in accurately representing specific graph features such as islands, symmetrical structures, and directional edges, particularly in smaller or multiple graph contexts. To address these limitations, we introduce a cross-correlation mechanism that significantly enhances the GAE representational capabilities. Additionally, we propose GraphCroc, a new GAE that supports flexible encoder architectures tailored for various downstream tasks and ensures robust structural reconstruction, through a mirrored encoding-decoding process. This model also tackles the challenge of representation bias during optimization by implementing a loss-balancing strategy. Both theoretical analysis and numerical evaluations demonstrate that our methodology significantly outperforms existing self-correlation-based GAEs in graph structure reconstruction.","url_abs":"https://arxiv.org/abs/2410.03396v1","url_pdf":"https://arxiv.org/pdf/2410.03396v1.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":"graphcroc-cross-correlation-autoencoder-for","repo_url":"https://github.com/sjduan/graphcroc","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[],"methods":[{"method_slug":"focus","method_name":"Focus"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2410.03396","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.03396"}},"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":"deterministic:regex_extraction","url":"https://github.com/sjduan/GraphCroc","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/sjduan/graphcroc","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":10,"ran_draft_wrong":1,"unverified":3},"by_repo_kind":{"official":{"samples":14,"ran":11,"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":0,"samples":[{"code_sha256_prefix":"34543d577c83afd2","entry":"Decoder","repo":"sjduan/graphcroc","repo_kind":"official","path":"GraphCroc/UNET.py","file_url":"https://github.com/sjduan/graphcroc/blob/HEAD/GraphCroc/UNET.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"34543d577c83afd2"}},{"code_sha256_prefix":"302c7028eb711ed5","entry":"Encoder","repo":"sjduan/graphcroc","repo_kind":"official","path":"GraphCroc/UNET.py","file_url":"https://github.com/sjduan/graphcroc/blob/HEAD/GraphCroc/UNET.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"302c7028eb711ed5"}},{"code_sha256_prefix":"9740f77d46c19ea2","entry":"GCN","repo":"sjduan/graphcroc","repo_kind":"official","path":"GraphCroc/UNET.py","file_url":"https://github.com/sjduan/graphcroc/blob/HEAD/GraphCroc/UNET.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"9740f77d46c19ea2"}},{"code_sha256_prefix":"855fd8cc32b38520","entry":"Pool","repo":"sjduan/graphcroc","repo_kind":"official","path":"GraphCroc/UNET.py","file_url":"https://github.com/sjduan/graphcroc/blob/HEAD/GraphCroc/UNET.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"855fd8cc32b38520"}},{"code_sha256_prefix":"cfcfbfc18037a032","entry":"Unet","repo":"sjduan/graphcroc","repo_kind":"official","path":"GraphCroc/UNET.py","file_url":"https://github.com/sjduan/graphcroc/blob/HEAD/GraphCroc/UNET.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"cfcfbfc18037a032"}},{"code_sha256_prefix":"10fffd68f36dce6e","entry":"Unpool","repo":"sjduan/graphcroc","repo_kind":"official","path":"GraphCroc/UNET.py","file_url":"https://github.com/sjduan/graphcroc/blob/HEAD/GraphCroc/UNET.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"10fffd68f36dce6e"}},{"code_sha256_prefix":"5b3253c77e503073","entry":"compress_labels","repo":"sjduan/GraphCroc","repo_kind":"official","path":"IMDB_B/wl_test_util.py","file_url":"https://github.com/sjduan/GraphCroc/blob/HEAD/IMDB_B/wl_test_util.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"5b3253c77e503073"}},{"code_sha256_prefix":"f39ca97dcafbfae0","entry":"gen_node_feature","repo":"sjduan/GraphCroc","repo_kind":"official","path":"IMDB_B/reconstructor.py","file_url":"https://github.com/sjduan/GraphCroc/blob/HEAD/IMDB_B/reconstructor.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"f39ca97dcafbfae0"}},{"code_sha256_prefix":"0d3836f3da91b94c","entry":"initialize_labels","repo":"sjduan/GraphCroc","repo_kind":"official","path":"IMDB_B/wl_test_util.py","file_url":"https://github.com/sjduan/GraphCroc/blob/HEAD/IMDB_B/wl_test_util.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"0d3836f3da91b94c"}},{"code_sha256_prefix":"6b9e2a85aa8b8be6","entry":"relabel","repo":"sjduan/GraphCroc","repo_kind":"official","path":"IMDB_B/wl_test_util.py","file_url":"https://github.com/sjduan/GraphCroc/blob/HEAD/IMDB_B/wl_test_util.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"6b9e2a85aa8b8be6"}},{"code_sha256_prefix":"9367ba5047a4d8ac","entry":"top_k_graph","repo":"sjduan/graphcroc","repo_kind":"official","path":"GraphCroc/UNET.py","file_url":"https://github.com/sjduan/graphcroc/blob/HEAD/GraphCroc/UNET.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"9367ba5047a4d8ac"}},{"code_sha256_prefix":"033a97925e132d68","entry":"calculate_metrics","repo":"sjduan/graphcroc","repo_kind":"official","path":"IMDB_B/reconstructor.py","file_url":"https://github.com/sjduan/graphcroc/blob/HEAD/IMDB_B/reconstructor.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"033a97925e132d68"}},{"code_sha256_prefix":"65de7ac45402b8c9","entry":"gen_node_feature","repo":"sjduan/GraphCroc","repo_kind":"official","path":"IMDB_B/gc_train.py","file_url":"https://github.com/sjduan/GraphCroc/blob/HEAD/IMDB_B/gc_train.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"65de7ac45402b8c9"}},{"code_sha256_prefix":"021ac680f9625cd7","entry":"norm_g","repo":"sjduan/graphcroc","repo_kind":"official","path":"GraphCroc/UNET.py","file_url":"https://github.com/sjduan/graphcroc/blob/HEAD/GraphCroc/UNET.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"021ac680f9625cd7"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}