{"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/copt-coordinated-optimal-transport-on-graphs","title":"COPT: Coordinated Optimal Transport for Graph Sketching","arxiv_id":"2003.03892","date":"2020-03-09","proceeding":null,"authors":["Yihe Dong","Will Sawin"],"abstract":"We introduce COPT, a novel distance metric between graphs defined via an optimization routine, computing a coordinated pair of optimal transport maps simultaneously. This gives an unsupervised way to learn general-purpose graph representation, applicable to both graph sketching and graph comparison. COPT involves simultaneously optimizing dual transport plans, one between the vertices of two graphs, and another between graph signal probability distributions. We show theoretically that our method preserves important global structural information on graphs, in particular spectral information, and analyze connections to existing studies. Empirically, COPT outperforms state of the art methods in graph classification on both synthetic and real datasets.","url_abs":"https://arxiv.org/abs/2003.03892v2","url_pdf":"https://arxiv.org/pdf/2003.03892v2.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":"copt-coordinated-optimal-transport-on-graphs","repo_url":"https://github.com/twistedcubic/copt","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"graph-classification","task_name":"Graph Classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2003.03892","atlas_url":"https://app.syntology.ai/?focus=2003.03892","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.03892"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+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/twistedcubic/copt","reach":null}],"summary":{"ran_honours":4,"ran_draft_wrong":1,"unverified":1},"by_repo_kind":{"official":{"samples":6,"ran":5,"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":6,"samples":[{"code_sha256_prefix":"731e5a3fa90ddde6","entry":"create_graph_lap","repo":"twistedcubic/copt","repo_kind":"official","path":"utils.py","file_url":"https://github.com/twistedcubic/copt/blob/HEAD/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"731e5a3fa90ddde6"}},{"code_sha256_prefix":"c7843233389623a9","entry":"graph_to_lap","repo":"twistedcubic/copt","repo_kind":"official","path":"utils.py","file_url":"https://github.com/twistedcubic/copt/blob/HEAD/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"c7843233389623a9"}},{"code_sha256_prefix":"eeb7f67fe2a5981b","entry":"lap_to_graph","repo":"twistedcubic/copt","repo_kind":"official","path":"utils.py","file_url":"https://github.com/twistedcubic/copt/blob/HEAD/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"eeb7f67fe2a5981b"}},{"code_sha256_prefix":"6e4c4e1670b21d91","entry":"mx_inv","repo":"twistedcubic/copt","repo_kind":"official","path":"graph.py","file_url":"https://github.com/twistedcubic/copt/blob/HEAD/graph.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"6e4c4e1670b21d91"}},{"code_sha256_prefix":"43cda63f18aa6233","entry":"mx_inv_sqrt","repo":"twistedcubic/copt","repo_kind":"official","path":"graph.py","file_url":"https://github.com/twistedcubic/copt/blob/HEAD/graph.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"43cda63f18aa6233"}},{"code_sha256_prefix":"af719b1dcadd3be6","entry":"realize_upper","repo":"twistedcubic/copt","repo_kind":"official","path":"graph.py","file_url":"https://github.com/twistedcubic/copt/blob/HEAD/graph.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"af719b1dcadd3be6"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}