{"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/encoding-robust-representation-for-graph","title":"Encoding Robust Representation for Graph Generation","arxiv_id":"1809.10851","date":"2018-09-28","proceeding":null,"authors":["Dongmian Zou","Gilad Lerman"],"abstract":"Generative networks have made it possible to generate meaningful signals such\nas images and texts from simple noise. Recently, generative methods based on\nGAN and VAE were developed for graphs and graph signals. However, the\nmathematical properties of these methods are unclear, and training good\ngenerative models is difficult. This work proposes a graph generation model\nthat uses a recent adaptation of Mallat's scattering transform to graphs. The\nproposed model is naturally composed of an encoder and a decoder. The encoder\nis a Gaussianized graph scattering transform, which is robust to signal and\ngraph manipulation. The decoder is a simple fully connected network that is\nadapted to specific tasks, such as link prediction, signal generation on graphs\nand full graph and signal generation. The training of our proposed system is\nefficient since it is only applied to the decoder and the hardware requirements\nare moderate. Numerical results demonstrate state-of-the-art performance of the\nproposed system for both link prediction and graph and signal generation.","url_abs":"http://arxiv.org/abs/1809.10851v2","url_pdf":"http://arxiv.org/pdf/1809.10851v2.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":"encoding-robust-representation-for-graph","repo_url":"https://github.com/dmzou/SCAT","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":null}],"tasks":[{"task_slug":"decoder","task_name":"Decoder"},{"task_slug":"graph-generation","task_name":"Graph Generation"},{"task_slug":"link-prediction","task_name":"Link Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/link-prediction-on-citeseer-biased-evaluation","task":"Link Prediction","dataset":"Citeseer (biased evaluation)","model":"SCAT (half of negative examples with 0 features)","rank_in_archive_order":2,"of":2,"metrics":{"AP":"97.57","AUC":"97.27"},"uses_additional_data":false},{"leaderboard":"/sota/link-prediction-on-cora-biased-evaluation","task":"Link Prediction","dataset":"Cora (biased evaluation)","model":"SCAT (half of negative examples with 0 features)","rank_in_archive_order":2,"of":2,"metrics":{"AP":"94.63","AUC":"94.48"},"uses_additional_data":false},{"leaderboard":"/sota/link-prediction-on-pubmed-biased-evaluation","task":"Link Prediction","dataset":"Pubmed (biased evaluation)","model":"SCAT (half of negative examples with 0 features)","rank_in_archive_order":2,"of":2,"metrics":{"AP":"97.19","AUC":"97.52"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"dmzou/SCAT","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1804.00099"],"harvested_for_calls":[{"arxiv_id":"1804.00099","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1804.00099"},"call":"get_harvested_code_for_paper(arxiv_id=\"1804.00099\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"bb937074bb8fa96aa89e9e0116aa07c9f96beb577f7df680142be7a23d89ca6f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}