{"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-neural-network/papers/11","list_of":"/task/graph-neural-network","task":"Graph Neural Network","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":11,"pages_in_order":36,"rows_per_page":100,"rows":[1001,1100],"of":3598,"counts":{"archive_papers_tagged":3598,"with_a_code_link":1516,"where_syntology_ran_a_sample":350,"not_listed_spam_title":0,"listed":3598,"listed_where_code_ran":350,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":302,"every_run_a_failure_of_syntologys_instrument":48,"listed_with_a_run_with_no_instrument_failure":302,"listed_every_run_a_failure_of_syntologys_instrument":48,"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-neural-network","prev":"/task/graph-neural-network/papers/10","next":"/task/graph-neural-network/papers/12","papers":[{"url":"/paper/long-term-spatio-temporal-forecasting-via","slug":"long-term-spatio-temporal-forecasting-via","title":"Long-term Spatio-temporal Forecasting via Dynamic Multiple-Graph Attention","date":"2022-04-23","arxiv_id":"2204.11008","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":5,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":9,"phrase":"6 ran (of which 5 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) · 3 unverified","sample_list":"/paper/long-term-spatio-temporal-forecasting-via#ran","syntology_url":"https://syntology.ai/paper/2204.11008","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.11008"}},"official":{"repos":["swsamleo/mlstgcn"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":5,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/modelling-graph-dynamics-in-fraud-detection","slug":"modelling-graph-dynamics-in-fraud-detection","title":"Modelling graph dynamics in fraud detection with \"Attention\"","date":"2022-04-22","arxiv_id":"2204.10614","repositories_listed":1,"syntology":null},{"url":"/paper/simulate-time-integrated-coarse-grained","slug":"simulate-time-integrated-coarse-grained","title":"Simulate Time-integrated Coarse-grained Molecular Dynamics with Multi-Scale Graph Networks","date":"2022-04-21","arxiv_id":"2204.10348","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/simulate-time-integrated-coarse-grained#ran","syntology_url":"https://syntology.ai/paper/2204.10348","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.10348"}},"official":{"repos":["kyonofx/mlcgmd"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/openglue-open-source-graph-neural-net-based","slug":"openglue-open-source-graph-neural-net-based","title":"OpenGlue: Open Source Graph Neural Net Based Pipeline for Image Matching","date":"2022-04-19","arxiv_id":"2204.08870","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-graph-neural-network-for","slug":"self-supervised-graph-neural-network-for","title":"Self-Supervised Graph Neural Network for Multi-Source Domain Adaptation","date":"2022-04-08","arxiv_id":"2204.05104","repositories_listed":1,"syntology":null},{"url":"/paper/explicit-feature-interaction-aware-graph","slug":"explicit-feature-interaction-aware-graph","title":"Explicit Feature Interaction-aware Graph Neural Networks","date":"2022-04-07","arxiv_id":"2204.03225","repositories_listed":1,"syntology":null},{"url":"/paper/structure-aware-protein-self-supervised","slug":"structure-aware-protein-self-supervised","title":"Structure-aware Protein Self-supervised Learning","date":"2022-04-06","arxiv_id":"2204.04213","repositories_listed":1,"syntology":null},{"url":"/paper/transition-information-enhanced-disentangled","slug":"transition-information-enhanced-disentangled","title":"Transition Information Enhanced Disentangled Graph Neural Networks for Session-based Recommendation","date":"2022-04-05","arxiv_id":"2204.02119","repositories_listed":1,"syntology":null},{"url":"/paper/synthetic-graph-generation-to-benchmark-graph","slug":"synthetic-graph-generation-to-benchmark-graph","title":"Synthetic Graph Generation to Benchmark Graph Learning","date":"2022-04-04","arxiv_id":"2204.01376","repositories_listed":1,"syntology":null},{"url":"/paper/adagrid-adaptive-grid-search-for-link","slug":"adagrid-adaptive-grid-search-for-link","title":"AdaGrid: Adaptive Grid Search for Link Prediction Training Objective","date":"2022-03-30","arxiv_id":"2203.16162","repositories_listed":1,"syntology":null},{"url":"/paper/graph-similarity-learning-for-change-point","slug":"graph-similarity-learning-for-change-point","title":"Graph similarity learning for change-point detection in dynamic networks","date":"2022-03-29","arxiv_id":"2203.15470","repositories_listed":1,"syntology":null},{"url":"/paper/equivariant-point-cloud-analysis-via-learning","slug":"equivariant-point-cloud-analysis-via-learning","title":"Equivariant Point Cloud Analysis via Learning Orientations for Message Passing","date":"2022-03-28","arxiv_id":"2203.14486","repositories_listed":1,"syntology":{"n":15,"n_ran":14,"n_constructed":0,"n_ran_checked":9,"n_instrument":5,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":6,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/equivariant-point-cloud-analysis-via-learning#ran","syntology_url":"https://syntology.ai/paper/2203.14486","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.14486"}},"official":{"repos":["luost26/equivariant-orientedmp"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-what-you-need-from-what-you-did","slug":"learning-what-you-need-from-what-you-did","title":"Learning What You Need from What You Did: Product Taxonomy Expansion with User Behaviors Supervision","date":"2022-03-28","arxiv_id":"2203.14921","repositories_listed":1,"syntology":null},{"url":"/paper/speqnets-sparsity-aware-permutation","slug":"speqnets-sparsity-aware-permutation","title":"SpeqNets: Sparsity-aware Permutation-equivariant Graph Networks","date":"2022-03-25","arxiv_id":"2203.13913","repositories_listed":1,"syntology":null},{"url":"/paper/fine-tuning-graph-neural-networks-via-graph","slug":"fine-tuning-graph-neural-networks-via-graph","title":"Fine-Tuning Graph Neural Networks via Graph Topology induced Optimal Transport","date":"2022-03-20","arxiv_id":"2203.10453","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/fine-tuning-graph-neural-networks-via-graph#ran","syntology_url":"https://syntology.ai/paper/2203.10453","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.10453"}},"official":{"repos":["youjibiying/gtot-tuning"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/hetermpc-a-heterogeneous-graph-neural-network","slug":"hetermpc-a-heterogeneous-graph-neural-network","title":"HeterMPC: A Heterogeneous Graph Neural Network for Response Generation in Multi-Party Conversations","date":"2022-03-16","arxiv_id":"2203.08500","repositories_listed":1,"syntology":null},{"url":"/paper/learning-the-dynamics-of-physical-systems-1","slug":"learning-the-dynamics-of-physical-systems-1","title":"Learning the Dynamics of Physical Systems from Sparse Observations with Finite Element Networks","date":"2022-03-16","arxiv_id":"2203.08852","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/learning-the-dynamics-of-physical-systems-1#ran","syntology_url":"https://syntology.ai/paper/2203.08852","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.08852"}},"official":{"repos":["martenlienen/finite-element-networks"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/occlusionfusion-occlusion-aware-motion","slug":"occlusionfusion-occlusion-aware-motion","title":"OcclusionFusion: Occlusion-aware Motion Estimation for Real-time Dynamic 3D Reconstruction","date":"2022-03-15","arxiv_id":"2203.07977","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/occlusionfusion-occlusion-aware-motion#ran","syntology_url":"https://syntology.ai/paper/2203.07977","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.07977"}},"official":{"repos":["wenbin-lin/OcclusionFusion"],"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/spatial-commonsense-graph-for-object","slug":"spatial-commonsense-graph-for-object","title":"Spatial Commonsense Graph for Object Localisation in Partial Scenes","date":"2022-03-10","arxiv_id":"2203.05380","repositories_listed":1,"syntology":null},{"url":"/paper/panoramic-human-activity-recognition","slug":"panoramic-human-activity-recognition","title":"Panoramic Human Activity Recognition","date":"2022-03-08","arxiv_id":"2203.03806","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/panoramic-human-activity-recognition#ran","syntology_url":"https://syntology.ai/paper/2203.03806","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.03806"}},"official":{"repos":["ruizehan/par"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/end-to-end-video-instance-segmentation-via-1","slug":"end-to-end-video-instance-segmentation-via-1","title":"End-to-end video instance segmentation via spatial-temporal graph neural networks","date":"2022-03-07","arxiv_id":"2203.03145","repositories_listed":1,"syntology":null},{"url":"/paper/learning-resilient-radio-resource-management","slug":"learning-resilient-radio-resource-management","title":"Learning Resilient Radio Resource Management Policies with Graph Neural Networks","date":"2022-03-07","arxiv_id":"2203.11012","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-network-potential-for-magnetic","slug":"graph-neural-network-potential-for-magnetic","title":"Spin-Dependent Graph Neural Network Potential for Magnetic Materials","date":"2022-03-06","arxiv_id":"2203.02853","repositories_listed":1,"syntology":null},{"url":"/paper/gcnet-graph-completion-network-for-incomplete","slug":"gcnet-graph-completion-network-for-incomplete","title":"GCNet: Graph Completion Network for Incomplete Multimodal Learning in Conversation","date":"2022-03-04","arxiv_id":"2203.02177","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-for-multimodal-single","slug":"graph-neural-networks-for-multimodal-single","title":"Graph Neural Networks for Multimodal Single-Cell Data Integration","date":"2022-03-03","arxiv_id":"2203.01884","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-neural-networks-for-multimodal-single#ran","syntology_url":"https://syntology.ai/paper/2203.01884","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.01884"}},"official":{"repos":["omicsml/dance"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/geobi-gnn-geometry-aware-bi-domain-mesh","slug":"geobi-gnn-geometry-aware-bi-domain-mesh","title":"GeoBi-GNN: Geometry-aware Bi-domain Mesh Denoising via Graph Neural Networks","date":"2022-03-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/game-on-graph-attention-network-based","slug":"game-on-graph-attention-network-based","title":"GAME-ON: Graph Attention Network based Multimodal Fusion for Fake News Detection","date":"2022-02-25","arxiv_id":"2202.12478","repositories_listed":1,"syntology":null},{"url":"/paper/multi-view-graph-representation-for","slug":"multi-view-graph-representation-for","title":"Multi-View Graph Representation for Programming Language Processing: An Investigation into Algorithm Detection","date":"2022-02-25","arxiv_id":"2202.12481","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/multi-view-graph-representation-for#ran","syntology_url":"https://syntology.ai/paper/2202.12481","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.12481"}},"official":{"repos":["githubg0/mvg"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/structured-multi-task-learning-for-molecular","slug":"structured-multi-task-learning-for-molecular","title":"Structured Multi-task Learning for Molecular Property Prediction","date":"2022-02-22","arxiv_id":"2203.04695","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 3 unverified","sample_list":"/paper/structured-multi-task-learning-for-molecular#ran","syntology_url":"https://syntology.ai/paper/2203.04695","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.04695"}},"official":{"repos":["chao1224/sgnn-ebm"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/gnn-surrogate-a-hierarchical-and-adaptive","slug":"gnn-surrogate-a-hierarchical-and-adaptive","title":"GNN-Surrogate: A Hierarchical and Adaptive Graph Neural Network for Parameter Space Exploration of Unstructured-Mesh Ocean Simulations","date":"2022-02-18","arxiv_id":"2202.08956","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/gnn-surrogate-a-hierarchical-and-adaptive#ran","syntology_url":"https://syntology.ai/paper/2202.08956","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.08956"}},"official":{"repos":["trainsn/gnn-surrogate"],"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/space4hgnn-a-novel-modularized-and","slug":"space4hgnn-a-novel-modularized-and","title":"Space4HGNN: A Novel, Modularized and Reproducible Platform to Evaluate Heterogeneous Graph Neural Network","date":"2022-02-18","arxiv_id":"2202.09177","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/space4hgnn-a-novel-modularized-and#ran","syntology_url":"https://syntology.ai/paper/2202.09177","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.09177"}},"official":{"repos":["bupt-gamma/space4hgnn"],"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/learning-and-evaluating-graph-neural-network","slug":"learning-and-evaluating-graph-neural-network","title":"Learning and Evaluating Graph Neural Network Explanations based on Counterfactual and Factual Reasoning","date":"2022-02-17","arxiv_id":"2202.08816","repositories_listed":1,"syntology":null},{"url":"/paper/structural-and-semantic-contrastive-learning","slug":"structural-and-semantic-contrastive-learning","title":"Eliciting Structural and Semantic Global Knowledge in Unsupervised Graph Contrastive Learning","date":"2022-02-17","arxiv_id":"2202.08480","repositories_listed":1,"syntology":null},{"url":"/paper/instance-wise-algorithm-configuration-with","slug":"instance-wise-algorithm-configuration-with","title":"Instance-wise algorithm configuration with graph neural networks","date":"2022-02-10","arxiv_id":"2202.04910","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/instance-wise-algorithm-configuration-with#ran","syntology_url":"https://syntology.ai/paper/2202.04910","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.04910"}},"official":{"repos":["romeov/ml4co-competition"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/large-scale-personalized-video-game","slug":"large-scale-personalized-video-game","title":"Large-scale Personalized Video Game Recommendation via Social-aware Contextualized Graph Neural Network","date":"2022-02-07","arxiv_id":"2202.03392","repositories_listed":1,"syntology":null},{"url":"/paper/molecular-graph-representation-learning-via-1","slug":"molecular-graph-representation-learning-via-1","title":"Molecular Representation Learning via Heterogeneous Motif Graph Neural Networks","date":"2022-02-01","arxiv_id":"2202.00529","repositories_listed":1,"syntology":null},{"url":"/paper/molnet-a-chemically-intuitive-graph-neural","slug":"molnet-a-chemically-intuitive-graph-neural","title":"MolNet: A Chemically Intuitive Graph Neural Network for Prediction of Molecular Properties","date":"2022-02-01","arxiv_id":"2203.09456","repositories_listed":1,"syntology":null},{"url":"/paper/graph-convolution-based-deep-reinforcement","slug":"graph-convolution-based-deep-reinforcement","title":"Graph Convolution-Based Deep Reinforcement Learning for Multi-Agent Decision-Making in Mixed Traffic Environments","date":"2022-01-30","arxiv_id":"2201.12776","repositories_listed":1,"syntology":null},{"url":"/paper/few-shot-transfer-learning-for-device-free","slug":"few-shot-transfer-learning-for-device-free","title":"Few-Shot Transfer Learning for Device-Free Fingerprinting Indoor Localization","date":"2022-01-29","arxiv_id":"2201.12656","repositories_listed":1,"syntology":null},{"url":"/paper/powergear-early-stage-power-estimation-in","slug":"powergear-early-stage-power-estimation-in","title":"PowerGear: Early-Stage Power Estimation in FPGA HLS via Heterogeneous Edge-Centric GNNs","date":"2022-01-25","arxiv_id":"2201.10114","repositories_listed":1,"syntology":null},{"url":"/paper/drugood-out-of-distribution-ood-dataset","slug":"drugood-out-of-distribution-ood-dataset","title":"DrugOOD: Out-of-Distribution (OOD) Dataset Curator and Benchmark for AI-aided Drug Discovery -- A Focus on Affinity Prediction Problems with Noise Annotations","date":"2022-01-24","arxiv_id":"2201.09637","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-diffusion-networks-for-semi","slug":"graph-neural-diffusion-networks-for-semi","title":"Graph Neural Diffusion Networks for Semi-supervised Learning","date":"2022-01-24","arxiv_id":"2201.09698","repositories_listed":1,"syntology":null},{"url":"/paper/trustworthy-knowledge-graph-completion-based","slug":"trustworthy-knowledge-graph-completion-based","title":"Trustworthy Knowledge Graph Completion Based on Multi-sourced Noisy Data","date":"2022-01-21","arxiv_id":"2201.08580","repositories_listed":1,"syntology":null},{"url":"/paper/gengnn-a-generic-fpga-framework-for-graph","slug":"gengnn-a-generic-fpga-framework-for-graph","title":"GenGNN: A Generic FPGA Framework for Graph Neural Network Acceleration","date":"2022-01-20","arxiv_id":"2201.08475","repositories_listed":1,"syntology":null},{"url":"/paper/hybrid-graph-models-for-logic-optimization","slug":"hybrid-graph-models-for-logic-optimization","title":"LOSTIN: Logic Optimization via Spatio-Temporal Information with Hybrid Graph Models","date":"2022-01-20","arxiv_id":"2201.08455","repositories_listed":1,"syntology":null},{"url":"/paper/structure-and-position-aware-graph-neural","slug":"structure-and-position-aware-graph-neural","title":"Structure and position-aware graph neural network for airway labeling","date":"2022-01-12","arxiv_id":"2201.04532","repositories_listed":1,"syntology":null},{"url":"/paper/quasi-framelets-another-improvement-to","slug":"quasi-framelets-another-improvement-to","title":"Quasi-Framelets: Robust Graph Neural Networks via Adaptive Framelet Convolution","date":"2022-01-11","arxiv_id":"2201.04728","repositories_listed":1,"syntology":null},{"url":"/paper/state-estimation-in-electric-power-systems-1","slug":"state-estimation-in-electric-power-systems-1","title":"State Estimation in Electric Power Systems Leveraging Graph Neural Networks","date":"2022-01-11","arxiv_id":"2201.04056","repositories_listed":1,"syntology":null},{"url":"/paper/disentangled-graph-neural-networks-for","slug":"disentangled-graph-neural-networks-for","title":"Disentangled Graph Neural Networks for Session-based Recommendation","date":"2022-01-10","arxiv_id":"2201.03482","repositories_listed":1,"syntology":null},{"url":"/paper/vgaer-graph-neural-network-reconstruction","slug":"vgaer-graph-neural-network-reconstruction","title":"VGAER: Graph Neural Network Reconstruction based Community Detection","date":"2022-01-08","arxiv_id":"2201.04066","repositories_listed":1,"syntology":null},{"url":"/paper/mgae-masked-autoencoders-for-self-supervised","slug":"mgae-masked-autoencoders-for-self-supervised","title":"MGAE: Masked Autoencoders for Self-Supervised Learning on Graphs","date":"2022-01-07","arxiv_id":"2201.02534","repositories_listed":1,"syntology":null},{"url":"/paper/planted-dense-subgraphs-in-dense-random","slug":"planted-dense-subgraphs-in-dense-random","title":"Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning","date":"2022-01-05","arxiv_id":"2201.01825","repositories_listed":1,"syntology":null},{"url":"/paper/a-cluster-based-trip-prediction-graph-neural","slug":"a-cluster-based-trip-prediction-graph-neural","title":"A Cluster-Based Trip Prediction Graph Neural Network Model for Bike Sharing Systems","date":"2022-01-03","arxiv_id":"2201.00720","repositories_listed":1,"syntology":null},{"url":"/paper/multivariate-time-series-regression-with","slug":"multivariate-time-series-regression-with","title":"Graph Neural Networks for Multivariate Time Series Regression with Application to Seismic Data","date":"2022-01-03","arxiv_id":"2201.00818","repositories_listed":1,"syntology":null},{"url":"/paper/financial-time-series-forecasting-with-multi","slug":"financial-time-series-forecasting-with-multi","title":"Financial time series forecasting with multi-modality graph neural network","date":"2022-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/intention-adaptive-graph-neural-network-for","slug":"intention-adaptive-graph-neural-network-for","title":"Intention Adaptive Graph Neural Network for Category-aware Session-based Recommendation","date":"2021-12-31","arxiv_id":"2112.15352","repositories_listed":1,"syntology":null},{"url":"/paper/motif-graph-neural-network","slug":"motif-graph-neural-network","title":"Motif Graph Neural Network","date":"2021-12-30","arxiv_id":"2112.14900","repositories_listed":1,"syntology":null},{"url":"/paper/modeling-multi-granularity-user-intent","slug":"modeling-multi-granularity-user-intent","title":"Learning Multi-granularity User Intent Unit for Session-based Recommendation","date":"2021-12-25","arxiv_id":"2112.13197","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/modeling-multi-granularity-user-intent#ran","syntology_url":"https://syntology.ai/paper/2112.13197","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.13197"}},"official":{"repos":["SpaceLearner/SessionRec-pytorch"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dualgnn-dual-graph-neural-network-for","slug":"dualgnn-dual-graph-neural-network-for","title":"DualGNN: Dual Graph Neural Network for Multimedia Recommendation","date":"2021-12-24","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/lifelong-learning-in-evolving-graphs-with","slug":"lifelong-learning-in-evolving-graphs-with","title":"Lifelong Learning on Evolving Graphs Under the Constraints of Imbalanced Classes and New Classes","date":"2021-12-20","arxiv_id":"2112.10558","repositories_listed":1,"syntology":null},{"url":"/paper/neuromorphic-camera-denoising-using-graph","slug":"neuromorphic-camera-denoising-using-graph","title":"Neuromorphic Camera Denoising using Graph Neural Network-driven Transformers","date":"2021-12-17","arxiv_id":"2112.09685","repositories_listed":1,"syntology":null},{"url":"/paper/two-view-graph-neural-networks-for-knowledge","slug":"two-view-graph-neural-networks-for-knowledge","title":"Two-view Graph Neural Networks for Knowledge Graph Completion","date":"2021-12-16","arxiv_id":"2112.09231","repositories_listed":1,"syntology":null},{"url":"/paper/encoding-protein-dynamic-information-in-graph","slug":"encoding-protein-dynamic-information-in-graph","title":"Encoding protein dynamic information in graph representation for functional residue identification","date":"2021-12-15","arxiv_id":"2112.12033","repositories_listed":1,"syntology":null},{"url":"/paper/shgnn-structure-aware-heterogeneous-graph","slug":"shgnn-structure-aware-heterogeneous-graph","title":"SHGNN: Structure-Aware Heterogeneous Graph Neural Network","date":"2021-12-12","arxiv_id":"2112.06244","repositories_listed":1,"syntology":null},{"url":"/paper/lunar-unifying-local-outlier-detection","slug":"lunar-unifying-local-outlier-detection","title":"LUNAR: Unifying Local Outlier Detection Methods via Graph Neural Networks","date":"2021-12-10","arxiv_id":"2112.05355","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":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/lunar-unifying-local-outlier-detection#ran","syntology_url":"https://syntology.ai/paper/2112.05355","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.05355"}},"official":{"repos":["agoodge/lunar"],"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/adaptive-kernel-graph-neural-network","slug":"adaptive-kernel-graph-neural-network","title":"Adaptive Kernel Graph Neural Network","date":"2021-12-08","arxiv_id":"2112.04575","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adaptive-kernel-graph-neural-network#ran","syntology_url":"https://syntology.ai/paper/2112.04575","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.04575"}},"official":{"repos":["jumxglhf/akgnn"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-neural-networks-accelerated-molecular","slug":"graph-neural-networks-accelerated-molecular","title":"Graph Neural Networks Accelerated Molecular Dynamics","date":"2021-12-06","arxiv_id":"2112.03383","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":0,"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/graph-neural-networks-accelerated-molecular#ran","syntology_url":"https://syntology.ai/paper/2112.03383","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.03383"}},"official":{"repos":["baratilab/gamd"],"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/scalable-geometric-deep-learning-on-molecular-1","slug":"scalable-geometric-deep-learning-on-molecular-1","title":"Scalable Geometric Deep Learning on Molecular Graphs","date":"2021-12-06","arxiv_id":"2112.03364","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":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/scalable-geometric-deep-learning-on-molecular-1#ran","syntology_url":"https://syntology.ai/paper/2112.03364","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.03364"}},"official":{"repos":["ncfrey/litmatter"],"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/autogel-an-automated-graph-neural-network-1","slug":"autogel-an-automated-graph-neural-network-1","title":"AutoGEL: An Automated Graph Neural Network with Explicit Link Information","date":"2021-12-02","arxiv_id":"2112.01064","repositories_listed":1,"syntology":null},{"url":"/paper/graph4rec-a-universal-toolkit-with-graph","slug":"graph4rec-a-universal-toolkit-with-graph","title":"Graph4Rec: A Universal Toolkit with Graph Neural Networks for Recommender Systems","date":"2021-12-02","arxiv_id":"2112.01035","repositories_listed":1,"syntology":null},{"url":"/paper/protgnn-towards-self-explaining-graph-neural","slug":"protgnn-towards-self-explaining-graph-neural","title":"ProtGNN: Towards Self-Explaining Graph Neural Networks","date":"2021-12-02","arxiv_id":"2112.00911","repositories_listed":1,"syntology":null},{"url":"/paper/stationary-diffusion-state-neural-estimation","slug":"stationary-diffusion-state-neural-estimation","title":"Stationary Diffusion State Neural Estimation for Multiview Clustering","date":"2021-12-02","arxiv_id":"2112.01334","repositories_listed":1,"syntology":null},{"url":"/paper/generating-diverse-3d-reconstructions-from-a","slug":"generating-diverse-3d-reconstructions-from-a","title":"Generating Diverse 3D Reconstructions from a Single Occluded Face Image","date":"2021-12-01","arxiv_id":"2112.00879","repositories_listed":1,"syntology":null},{"url":"/paper/group-wise-learning-for-weakly-supervised","slug":"group-wise-learning-for-weakly-supervised","title":"Group-Wise Learning for Weakly Supervised Semantic Segmentation","date":"2021-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/monolith-to-microservices-representing","slug":"monolith-to-microservices-representing","title":"Monolith to Microservices: Representing Application Software through Heterogeneous Graph Neural Network","date":"2021-12-01","arxiv_id":"2112.01317","repositories_listed":1,"syntology":null},{"url":"/paper/slow-learning-and-fast-inference-efficient","slug":"slow-learning-and-fast-inference-efficient","title":"Slow Learning and Fast Inference: Efficient Graph Similarity Computation via Knowledge Distillation","date":"2021-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/solving-graph-based-public-goods-games-with","slug":"solving-graph-based-public-goods-games-with","title":"Solving Graph-based Public Goods Games with Tree Search and Imitation Learning","date":"2021-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/towards-multi-grained-explainability-for","slug":"towards-multi-grained-explainability-for","title":"Towards Multi-Grained Explainability for Graph Neural Networks","date":"2021-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/decoding-the-protein-ligand-interactions","slug":"decoding-the-protein-ligand-interactions","title":"Decoding the Protein-ligand Interactions Using Parallel Graph Neural Networks","date":"2021-11-30","arxiv_id":"2111.15144","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/decoding-the-protein-ligand-interactions#ran","syntology_url":"https://syntology.ai/paper/2111.15144","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.15144"}},"official":{"repos":["nkkchem/pf-gnn_pli"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/polyworld-polygonal-building-extraction-with","slug":"polyworld-polygonal-building-extraction-with","title":"PolyWorld: Polygonal Building Extraction with Graph Neural Networks in Satellite Images","date":"2021-11-30","arxiv_id":"2111.15491","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/polyworld-polygonal-building-extraction-with#ran","syntology_url":"https://syntology.ai/paper/2111.15491","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.15491"}},"official":{"repos":["zorzi-s/polyworldpretrainednetwork"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/p2pgnn-a-decentralized-graph-neural-network","slug":"p2pgnn-a-decentralized-graph-neural-network","title":"p2pGNN: A Decentralized Graph Neural Network for Node Classification in Peer-to-Peer Networks","date":"2021-11-29","arxiv_id":"2111.14837","repositories_listed":1,"syntology":null},{"url":"/paper/benchmarking-accuracy-and-generalizability-of","slug":"benchmarking-accuracy-and-generalizability-of","title":"Benchmarking Accuracy and Generalizability of Four Graph Neural Networks Using Large In Vitro ADME Datasets from Different Chemical Spaces","date":"2021-11-27","arxiv_id":"2111.13964","repositories_listed":1,"syntology":null},{"url":"/paper/graph-based-solutions-with-residuals-for","slug":"graph-based-solutions-with-residuals-for","title":"Graph-based Solutions with Residuals for Intrusion Detection: the Modified E-GraphSAGE and E-ResGAT Algorithms","date":"2021-11-26","arxiv_id":"2111.13597","repositories_listed":1,"syntology":null},{"url":"/paper/representation-learning-of-logic-circuits","slug":"representation-learning-of-logic-circuits","title":"DeepGate: Learning Neural Representations of Logic Gates","date":"2021-11-26","arxiv_id":"2111.14616","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/representation-learning-of-logic-circuits#ran","syntology_url":"https://syntology.ai/paper/2111.14616","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.14616"}},"official":{"repos":["cure-lab/DeepGate"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/particle-graph-autoencoders-and","slug":"particle-graph-autoencoders-and","title":"Particle Graph Autoencoders and Differentiable, Learned Energy Mover's Distance","date":"2021-11-24","arxiv_id":"2111.12849","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/particle-graph-autoencoders-and#ran","syntology_url":"https://syntology.ai/paper/2111.12849","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.12849"}},"official":{"repos":["ucsd-hep-ex/GraphAE"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-neural-networks-with-parallel","slug":"graph-neural-networks-with-parallel","title":"Graph Neural Networks with Parallel Neighborhood Aggregations for Graph Classification","date":"2021-11-22","arxiv_id":"2111.11482","repositories_listed":1,"syntology":null},{"url":"/paper/modeling-hierarchical-syntax-structure-with","slug":"modeling-hierarchical-syntax-structure-with","title":"Modeling Hierarchical Syntax Structure with Triplet Position for Source Code Summarization","date":"2021-11-16","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/multi-task-classification-of-sewer-pipe","slug":"multi-task-classification-of-sewer-pipe","title":"Multi-Task Classification of Sewer Pipe Defects and Properties using a Cross-Task Graph Neural Network Decoder","date":"2021-11-15","arxiv_id":"2111.07846","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-evolve-on-dynamic-graphs","slug":"learning-to-evolve-on-dynamic-graphs","title":"Learning to Evolve on Dynamic Graphs","date":"2021-11-13","arxiv_id":"2111.07032","repositories_listed":1,"syntology":null},{"url":"/paper/simplifying-approach-to-node-classification","slug":"simplifying-approach-to-node-classification","title":"Simplifying approach to Node Classification in Graph Neural Networks","date":"2021-11-12","arxiv_id":"2111.06748","repositories_listed":1,"syntology":null},{"url":"/paper/threatrace-detecting-and-tracing-host-based","slug":"threatrace-detecting-and-tracing-host-based","title":"threaTrace: Detecting and Tracing Host-based Threats in Node Level Through Provenance Graph Learning","date":"2021-11-08","arxiv_id":"2111.04333","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-learning-for-identifying-high","slug":"unsupervised-learning-for-identifying-high","title":"Unsupervised Learning for Identifying High Eigenvector Centrality Nodes: A Graph Neural Network Approach","date":"2021-11-08","arxiv_id":"2111.05264","repositories_listed":1,"syntology":null},{"url":"/paper/manipulation-of-granular-materials-by","slug":"manipulation-of-granular-materials-by","title":"Manipulation of Granular Materials by Learning Particle Interactions","date":"2021-11-03","arxiv_id":"2111.02274","repositories_listed":1,"syntology":null},{"url":"/paper/power-flow-balancing-with-decentralized-graph","slug":"power-flow-balancing-with-decentralized-graph","title":"Power Flow Balancing with Decentralized Graph Neural Networks","date":"2021-11-03","arxiv_id":"2111.02169","repositories_listed":1,"syntology":null},{"url":"/paper/iterative-gnn-based-decoder-for-question","slug":"iterative-gnn-based-decoder-for-question","title":"Iterative GNN-based Decoder for Question Generation","date":"2021-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/time-aware-graph-neural-network-for-entity","slug":"time-aware-graph-neural-network-for-entity","title":"Time-aware Graph Neural Network for Entity Alignment between Temporal Knowledge Graphs","date":"2021-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/fastcover-an-unsupervised-learning-framework","slug":"fastcover-an-unsupervised-learning-framework","title":"FastCover: An Unsupervised Learning Framework for Multi-Hop Influence Maximization in Social Networks","date":"2021-10-31","arxiv_id":"2111.00463","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-heterogeneous-graph","slug":"hierarchical-heterogeneous-graph","title":"Hierarchical Heterogeneous Graph Representation Learning for Short Text Classification","date":"2021-10-30","arxiv_id":"2111.00180","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-person-re-identification-with-2","slug":"unsupervised-person-re-identification-with-2","title":"Unsupervised Person Re-Identification with Wireless Positioning under Weak Scene Labeling","date":"2021-10-29","arxiv_id":"2110.15610","repositories_listed":1,"syntology":null},{"url":"/paper/convergent-boosted-smoothing-for-modeling-1","slug":"convergent-boosted-smoothing-for-modeling-1","title":"Does your graph need a confidence boost? Convergent boosted smoothing on graphs with tabular node features","date":"2021-10-26","arxiv_id":"2110.13413","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/convergent-boosted-smoothing-for-modeling-1#ran","syntology_url":"https://syntology.ai/paper/2110.13413","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.13413"}},"official":{"repos":["JiuhaiChen/EBBS"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}}],"record_sha256":"95fc356c10b21f90d601aaa548a4503b630caba0ba2fe4506e8616ae1cdc5541","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}