{"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/the-multiscale-laplacian-graph-kernel","title":"The Multiscale Laplacian Graph Kernel","arxiv_id":"1603.06186","date":"2016-03-20","proceeding":"NeurIPS 2016 12","authors":["Risi Kondor","Horace Pan"],"abstract":"Many real world graphs, such as the graphs of molecules, exhibit structure at\nmultiple different scales, but most existing kernels between graphs are either\npurely local or purely global in character. In contrast, by building a\nhierarchy of nested subgraphs, the Multiscale Laplacian Graph kernels (MLG\nkernels) that we define in this paper can account for structure at a range of\ndifferent scales. At the heart of the MLG construction is another new graph\nkernel, called the Feature Space Laplacian Graph kernel (FLG kernel), which has\nthe property that it can lift a base kernel defined on the vertices of two\ngraphs to a kernel between the graphs. The MLG kernel applies such FLG kernels\nto subgraphs recursively. To make the MLG kernel computationally feasible, we\nalso introduce a randomized projection procedure, similar to the Nystr\\\"om\nmethod, but for RKHS operators.","url_abs":"http://arxiv.org/abs/1603.06186v2","url_pdf":"http://arxiv.org/pdf/1603.06186v2.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":[],"tasks":[{"task_slug":"graph-classification","task_name":"Graph Classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/graph-classification-on-proteins","task":"Graph Classification","dataset":"PROTEINS","model":"MLG","rank_in_archive_order":49,"of":103,"metrics":{"Accuracy":"76.34%"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1603.06186","atlas_url":"https://app.syntology.ai/?focus=1603.06186","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1603.06186"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1603.06186\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1603.06186"},"call":"get_concepts_for_paper(arxiv_id=\"1603.06186\")"}],"by_repo":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"61c0d343caa39eb0c95e727ba8f85d7f07286fbe2571d610c8f43b35827a12b8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}