{"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":"/task/graph-regression/papers/2","list_of":"/task/graph-regression","task":"Graph Regression","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":2,"pages_in_order":2,"rows_per_page":100,"rows":[101,145],"of":145,"counts":{"archive_papers_tagged":145,"with_a_code_link":118,"where_syntology_ran_a_sample":64,"not_listed_spam_title":0,"listed":145,"listed_where_code_ran":64,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":56,"every_run_a_failure_of_syntologys_instrument":8,"listed_with_a_run_with_no_instrument_failure":56,"listed_every_run_a_failure_of_syntologys_instrument":8,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/graph-regression","prev":"/task/graph-regression","next":null,"papers":[{"url":"/paper/permute-me-softly-learning-soft-permutations","slug":"permute-me-softly-learning-soft-permutations","title":"Permute Me Softly: Learning Soft Permutations for Graph Representations","date":"2021-10-05","arxiv_id":"2110.01872","repositories_listed":1,"syntology":null},{"url":"/paper/transformers-generalize-deepsets-and-can-be-1","slug":"transformers-generalize-deepsets-and-can-be-1","title":"Transformers Generalize DeepSets and Can be Extended to Graphs & Hypergraphs","date":"2021-05-21","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/ranking-structured-objects-with-graph-neural","slug":"ranking-structured-objects-with-graph-neural","title":"Ranking Structured Objects with Graph Neural Networks","date":"2021-04-18","arxiv_id":"2104.08869","repositories_listed":1,"syntology":null},{"url":"/paper/graph-learning-with-1d-convolutions-on-random","slug":"graph-learning-with-1d-convolutions-on-random","title":"Walking Out of the Weisfeiler Leman Hierarchy: Graph Learning Beyond Message Passing","date":"2021-02-17","arxiv_id":"2102.08786","repositories_listed":1,"syntology":null},{"url":"/paper/an-experimental-study-of-the-transferability","slug":"an-experimental-study-of-the-transferability","title":"An Experimental Study of the Transferability of Spectral Graph Networks","date":"2020-12-18","arxiv_id":"2012.10258","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/an-experimental-study-of-the-transferability#ran","syntology_url":"https://syntology.ai/paper/2012.10258","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.10258"}},"official":{"repos":["Axeln78/Transferability-of-spectral-gnns"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/factorizable-graph-convolutional-networks","slug":"factorizable-graph-convolutional-networks","title":"Factorizable Graph Convolutional Networks","date":"2020-10-12","arxiv_id":"2010.05421","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/factorizable-graph-convolutional-networks#ran","syntology_url":"https://syntology.ai/paper/2010.05421","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.05421"}},"official":{"repos":["ihollywhy/FactorGCN.PyTorch"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-graph-normalization-for-graph-neural","slug":"learning-graph-normalization-for-graph-neural","title":"Learning Graph Normalization for Graph Neural Networks","date":"2020-09-24","arxiv_id":"2009.11746","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-graph-normalization-for-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2009.11746","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.11746"}},"official":{"repos":["cyh1112/GraphNormalization"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/hierarchical-graph-matching-networks-for-deep-1","slug":"hierarchical-graph-matching-networks-for-deep-1","title":"Multilevel Graph Matching Networks for Deep Graph Similarity Learning","date":"2020-07-08","arxiv_id":"2007.04395","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":3,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hierarchical-graph-matching-networks-for-deep-1#ran","syntology_url":"https://syntology.ai/paper/2007.04395","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.04395"}},"official":{"repos":["kleincup/MGMN"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/path-integral-based-convolution-and-pooling","slug":"path-integral-based-convolution-and-pooling","title":"Path Integral Based Convolution and Pooling for Graph Neural Networks","date":"2020-06-29","arxiv_id":"2006.16811","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/path-integral-based-convolution-and-pooling#ran","syntology_url":"https://syntology.ai/paper/2006.16811","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.16811"}},"official":{"repos":["YuGuangWang/PAN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/building-powerful-and-equivariant-graph","slug":"building-powerful-and-equivariant-graph","title":"Building powerful and equivariant graph neural networks with structural message-passing","date":"2020-06-26","arxiv_id":"2006.15107","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-in-tensorflow-and-keras","slug":"graph-neural-networks-in-tensorflow-and-keras","title":"Graph Neural Networks in TensorFlow and Keras with Spektral","date":"2020-06-22","arxiv_id":"2006.12138","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/graph-neural-networks-in-tensorflow-and-keras#ran","syntology_url":"https://syntology.ai/paper/2006.12138","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12138"}},"official":{"repos":["danielegrattarola/spektral"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/molecule-property-prediction-based-on-spatial","slug":"molecule-property-prediction-based-on-spatial","title":"Molecule Property Prediction Based on Spatial Graph Embedding","date":"2019-08-22","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/on-the-equivalence-between-graph-isomorphism","slug":"on-the-equivalence-between-graph-isomorphism","title":"On the equivalence between graph isomorphism testing and function approximation with GNNs","date":"2019-05-29","arxiv_id":"1905.12560","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-the-equivalence-between-graph-isomorphism#ran","syntology_url":"https://syntology.ai/paper/1905.12560","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.12560"}},"official":{"repos":["leichen2018/Ring-GNN"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-a-practical-k-dimensional-weisfeiler","slug":"towards-a-practical-k-dimensional-weisfeiler","title":"Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings","date":"2019-04-02","arxiv_id":"1904.01543","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/towards-a-practical-k-dimensional-weisfeiler#ran","syntology_url":"https://syntology.ai/paper/1904.01543","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.01543"}},"official":{"repos":["chrsmrrs/sparsewl"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/fleet-prognosis-with-physics-informed","slug":"fleet-prognosis-with-physics-informed","title":"Fleet Prognosis with Physics-informed Recurrent Neural Networks","date":"2019-01-16","arxiv_id":"1901.05512","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-with-convolutional-arma","slug":"graph-neural-networks-with-convolutional-arma","title":"Graph Neural Networks with convolutional ARMA filters","date":"2019-01-05","arxiv_id":"1901.01343","repositories_listed":1,"syntology":null},{"url":"/paper/attention-based-graph-neural-network-for-semi","slug":"attention-based-graph-neural-network-for-semi","title":"Attention-based Graph Neural Network for Semi-supervised Learning","date":"2018-03-10","arxiv_id":"1803.03735","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/attention-based-graph-neural-network-for-semi#ran","syntology_url":"https://syntology.ai/paper/1803.03735","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.03735"}},"official":null}},{"url":"/paper/residual-gated-graph-convnets","slug":"residual-gated-graph-convnets","title":"Residual Gated Graph ConvNets","date":"2017-11-20","arxiv_id":"1711.07553","repositories_listed":1,"syntology":null},{"url":null,"slug":"a-benchmark-dataset-for-graph-regression-with","title":"A Benchmark Dataset for Graph Regression with Homogeneous and Multi-Relational Variants","date":"2025-05-29","arxiv_id":"2505.23875","repositories_listed":0,"syntology":null},{"url":null,"slug":"power-spectrum-signatures-of-graphs","title":"Power Spectrum Signatures of Graphs","date":"2025-03-12","arxiv_id":"2503.09660","repositories_listed":0,"syntology":null},{"url":null,"slug":"node-regression-on-latent-position-random","title":"Node Regression on Latent Position Random Graphs via Local Averaging","date":"2024-10-29","arxiv_id":"2410.21987","repositories_listed":0,"syntology":null},{"url":null,"slug":"conditional-local-feature-encoding-for-graph","title":"Conditional Local Feature Encoding for Graph Neural Networks","date":"2024-05-08","arxiv_id":"2405.04755","repositories_listed":0,"syntology":null},{"url":null,"slug":"advancing-graph-neural-networks-with-hl-hgat","title":"Advancing Graph Neural Networks with HL-HGAT: A Hodge-Laplacian and Attention Mechanism Approach for Heterogeneous Graph-Structured Data","date":"2024-03-11","arxiv_id":"2403.06687","repositories_listed":0,"syntology":null},{"url":"/paper/graph-transformers-without-positional","slug":"graph-transformers-without-positional","title":"Graph Transformers without Positional Encodings","date":"2024-01-31","arxiv_id":"2401.17791","repositories_listed":0,"syntology":null},{"url":null,"slug":"out-of-distribution-generalized-dynamic-graph-1","title":"Out-of-Distribution Generalized Dynamic Graph Neural Network for Human Albumin Prediction","date":"2023-11-27","arxiv_id":"2311.15545","repositories_listed":0,"syntology":null},{"url":null,"slug":"advancing-fluid-based-thermal-management","title":"Advancing Fluid-Based Thermal Management Systems Design: Leveraging Graph Neural Networks for Graph Regression and Efficient Enumeration Reduction","date":"2023-11-24","arxiv_id":"2311.14874","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-neural-networks-with-a-distribution-of","title":"Graph Neural Networks with a Distribution of Parametrized Graphs","date":"2023-10-25","arxiv_id":"2310.16401","repositories_listed":0,"syntology":null},{"url":"/paper/equivariant-matrix-function-neural-networks","slug":"equivariant-matrix-function-neural-networks","title":"Equivariant Matrix Function Neural Networks","date":"2023-10-16","arxiv_id":"2310.10434","repositories_listed":0,"syntology":null},{"url":"/paper/generalizing-topological-graph-neural","slug":"generalizing-topological-graph-neural","title":"Weisfeiler and Lehman Go Paths: Learning Topological Features via Path Complexes","date":"2023-08-13","arxiv_id":"2308.06838","repositories_listed":0,"syntology":null},{"url":"/paper/neural-priority-queues-for-graph-neural","slug":"neural-priority-queues-for-graph-neural","title":"Neural Priority Queues for Graph Neural Networks","date":"2023-07-18","arxiv_id":"2307.09660","repositories_listed":0,"syntology":null},{"url":"/paper/diffusing-graph-attention","slug":"diffusing-graph-attention","title":"Diffusing Graph Attention","date":"2023-03-01","arxiv_id":"2303.00613","repositories_listed":0,"syntology":null},{"url":null,"slug":"coordinating-cross-modal-distillation-for","title":"Coordinating Cross-modal Distillation for Molecular Property Prediction","date":"2022-11-30","arxiv_id":"2211.16712","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-ensemble-of-visnet-transformer-m-and","title":"An ensemble of VisNet, Transformer-M, and pretraining models for molecular property prediction in OGB Large-Scale Challenge @ NeurIPS 2022","date":"2022-11-23","arxiv_id":"2211.12791","repositories_listed":0,"syntology":null},{"url":null,"slug":"affinity-aware-graph-networks","title":"Affinity-Aware Graph Networks","date":"2022-06-23","arxiv_id":"2206.11941","repositories_listed":0,"syntology":null},{"url":null,"slug":"edge-but-not-least-cross-view-graph-pooling","title":"Edge but not Least: Cross-View Graph Pooling","date":"2021-09-24","arxiv_id":"2109.11796","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-graph-similarity-for-deep-learning","title":"A graph similarity for deep learning","date":"2020-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"co-embedding-of-nodes-and-edges-with-graph","title":"Co-embedding of Nodes and Edges with Graph Neural Networks","date":"2020-10-25","arxiv_id":"2010.13242","repositories_listed":0,"syntology":null},{"url":null,"slug":"degree-quant-quantization-aware-training-for","title":"Degree-Quant: Quantization-Aware Training for Graph Neural Networks","date":"2020-08-11","arxiv_id":"2008.05000","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-hierarchy-of-graph-neural-networks-based-on-1","title":"A Hierarchy of Graph Neural Networks Based on Learnable Local Features","date":"2019-11-13","arxiv_id":"1911.05256","repositories_listed":0,"syntology":null},{"url":null,"slug":"empowering-graph-representation-learning-with","title":"Empowering Graph Representation Learning with Paired Training and Graph Co-Attention","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/censnet-convolution-with-edge-node-switching","slug":"censnet-convolution-with-edge-node-switching","title":"CensNet: Convolution with Edge-Node Switching in Graph Neural Networks","date":"2019-08-10","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sketch-based-randomized-algorithms-for","title":"Sublinear Update Time Randomized Algorithms for Dynamic Graph Regression","date":"2019-05-28","arxiv_id":"1905.11963","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-theory-of-dynamic-graph-regression","title":"On the Theory of Dynamic Graph Regression Problem","date":"2019-03-26","arxiv_id":"1903.10699","repositories_listed":0,"syntology":null},{"url":"/paper/generalized-graph-convolutional-networks-for","slug":"generalized-graph-convolutional-networks-for","title":"Optimized Skeleton-based Action Recognition via Sparsified Graph Regression","date":"2018-11-29","arxiv_id":"1811.12013","repositories_listed":0,"syntology":null},{"url":null,"slug":"deriving-neural-architectures-from-sequence","title":"Deriving Neural Architectures from Sequence and Graph Kernels","date":"2017-05-25","arxiv_id":"1705.09037","repositories_listed":0,"syntology":null}],"record_sha256":"57f1caab72d1f2bb0951a171fbdd987e2cb8201fe9a7e5bf01d2c3250aab9f7a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}