{"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/multi-scale-attributed-node-embedding","title":"Multi-scale Attributed Node Embedding","arxiv_id":"1909.13021","date":"2019-09-28","proceeding":null,"authors":["Benedek Rozemberczki","Carl Allen","Rik Sarkar"],"abstract":"We present network embedding algorithms that capture information about a node from the local distribution over node attributes around it, as observed over random walks following an approach similar to Skip-gram. Observations from neighborhoods of different sizes are either pooled (AE) or encoded distinctly in a multi-scale approach (MUSAE). Capturing attribute-neighborhood relationships over multiple scales is useful for a diverse range of applications, including latent feature identification across disconnected networks with similar attributes. We prove theoretically that matrices of node-feature pointwise mutual information are implicitly factorized by the embeddings. Experiments show that our algorithms are robust, computationally efficient and outperform comparable models on social networks and web graphs.","url_abs":"https://arxiv.org/abs/1909.13021v3","url_pdf":"https://arxiv.org/pdf/1909.13021v3.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":"multi-scale-attributed-node-embedding","repo_url":"https://github.com/benedekrozemberczki/MUSAE","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"GPL-3.0"}},{"paper_slug":"multi-scale-attributed-node-embedding","repo_url":"https://github.com/Awadelrahman/GNN4SocialNWTutorial","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"multi-scale-attributed-node-embedding","repo_url":"https://github.com/benedekrozemberczki/karateclub","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"GPL-3.0"}},{"paper_slug":"multi-scale-attributed-node-embedding","repo_url":"https://github.com/ftheberge/GraphMiningNotebooks","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"multi-scale-attributed-node-embedding","repo_url":"https://github.com/zehong-wang/subgraph-pooling","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"attribute","task_name":"Attribute"},{"task_slug":"network-embedding","task_name":"Network Embedding"}],"methods":[],"datasets_introduced":[{"slug":"wiki-squirrel","name":"Wiki Squirrel","full_name":"Wikipedia Squirrel"}],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1909.13021","atlas_url":"https://app.syntology.ai/?focus=1909.13021","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.13021"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1909.13021"},"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":"1909.13021"},"call":"get_harvested_code_for_paper(arxiv_id=\"1909.13021\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"1909.13021"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1909.13021\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1909.13021"},"call":"get_concepts_for_paper(arxiv_id=\"1909.13021\")"}],"by_repo":[{"repo":"benedekrozemberczki/MUSAE","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Awadelrahman/GNN4SocialNWTutorial","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"benedekrozemberczki/karateclub","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"ftheberge/GraphMiningNotebooks","kind":"listed","samples":6,"ran":6,"instrument":0,"unverified":0},{"repo":"zehong-wang/subgraph-pooling","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2402.08907"],"harvested_for_calls":[{"arxiv_id":"2402.08907","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2402.08907"},"call":"get_harvested_code_for_paper(arxiv_id=\"2402.08907\")"}]}],"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","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/1909.13021.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/1909.13021.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/Awadelrahman/GNN4SocialNWTutorial","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/zehong-wang/subgraph-pooling","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/ftheberge/GraphMiningNotebooks","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/benedekrozemberczki/MUSAE","reach":{"status":"ok","spdx":"GPL-3.0"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/benedekrozemberczki/karateclub","reach":{"status":"ok","spdx":"GPL-3.0"}}],"summary":{"ran":6},"n_samples":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"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":{"listed":{"samples":6,"ran":6,"n_ran_checked":6,"n_instrument":0,"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"},"official_not_harvested":{"repositories":["benedekrozemberczki/MUSAE"],"harvested_for_other_papers":[0],"samples_from_other_repositories":6,"other_repositories":1,"samples_unlocated":0},"n_pointer_only_for_licence":0,"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":0,"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":6,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-24","last":"2026-09-24","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":"0347e4f37b712ccb","code_sha256_prefix":"0347e4f37b712ccb","entry":"components","repo":"ftheberge/GraphMiningNotebooks","repo_kind":"listed","path":"Python_Notebooks_Second_Edition/growth_experiment.py","file_url":"https://github.com/ftheberge/GraphMiningNotebooks/blob/HEAD/Python_Notebooks_Second_Edition/growth_experiment.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"vertices:list/1/int, edges:list/1/list","fixture_out_type":"list","level_recorded_at":"2026-09-24T22:55:07.240920+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"0347e4f37b712ccb"}},{"code_sha256":"1072250e7474ddf4","code_sha256_prefix":"1072250e7474ddf4","entry":"degrees","repo":"ftheberge/GraphMiningNotebooks","repo_kind":"listed","path":"Python_Notebooks_Second_Edition/growth_experiment.py","file_url":"https://github.com/ftheberge/GraphMiningNotebooks/blob/HEAD/Python_Notebooks_Second_Edition/growth_experiment.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"V:list/1/int, E:list/1/tuple","fixture_out_type":"dict","level_recorded_at":"2026-09-24T22:55:07.240920+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"1072250e7474ddf4"}},{"code_sha256":"c0565e2cc3d8804d","code_sha256_prefix":"c0565e2cc3d8804d","entry":"get_simplicial_fraction","repo":"ftheberge/GraphMiningNotebooks","repo_kind":"listed","path":"Julia_Notebooks_2nd/simpliciality.py","file_url":"https://github.com/ftheberge/GraphMiningNotebooks/blob/HEAD/Julia_Notebooks_2nd/simpliciality.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"V:list/1/int, E:list/1/tuple","fixture_out_type":"float","level_recorded_at":"2026-09-24T22:24:42.659479+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"c0565e2cc3d8804d"}},{"code_sha256":"0171f406a6992c25","code_sha256_prefix":"0171f406a6992c25","entry":"is_power_of_two","repo":"ftheberge/GraphMiningNotebooks","repo_kind":"listed","path":"Julia_Notebooks_2nd/simpliciality.py","file_url":"https://github.com/ftheberge/GraphMiningNotebooks/blob/HEAD/Julia_Notebooks_2nd/simpliciality.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"n:int/0/int","fixture_out_type":"bool","level_recorded_at":"2026-09-24T22:24:42.659479+00:00","retrieve_with":{"tool":"get_code","code_sha256":"0171f406a6992c25"},"code_page":"/code/is-power-of-two","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"0171f406a6992c25"}},{"code_sha256":"f30b49cf70f831c4","code_sha256_prefix":"f30b49cf70f831c4","entry":"max_subsets","repo":"ftheberge/GraphMiningNotebooks","repo_kind":"listed","path":"Julia_Notebooks_2nd/simpliciality.py","file_url":"https://github.com/ftheberge/GraphMiningNotebooks/blob/HEAD/Julia_Notebooks_2nd/simpliciality.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"E:list/1/set","fixture_out_type":"list","level_recorded_at":"2026-09-24T22:24:42.659479+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"f30b49cf70f831c4"}},{"code_sha256":"316d6d7e013dca0a","code_sha256_prefix":"316d6d7e013dca0a","entry":"sort_edges","repo":"ftheberge/GraphMiningNotebooks","repo_kind":"listed","path":"Python_Notebooks_Second_Edition/growth_experiment.py","file_url":"https://github.com/ftheberge/GraphMiningNotebooks/blob/HEAD/Python_Notebooks_Second_Edition/growth_experiment.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"E:list/1/list","fixture_out_type":"dict","level_recorded_at":"2026-09-24T22:24:42.659479+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"316d6d7e013dca0a"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"4c6b8b6eb17fd8caa86b5a745b1d549bdc55b31000fd35111473e206dd9a63aa","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}