{"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/8","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":8,"pages_in_order":36,"rows_per_page":100,"rows":[701,800],"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/7","next":"/task/graph-neural-network/papers/9","papers":[{"url":"/paper/bemap-balanced-message-passing-for-fair-graph","slug":"bemap-balanced-message-passing-for-fair-graph","title":"BeMap: Balanced Message Passing for Fair Graph Neural Network","date":"2023-06-07","arxiv_id":"2306.04107","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/bemap-balanced-message-passing-for-fair-graph#ran","syntology_url":"https://syntology.ai/paper/2306.04107","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.04107"}},"official":{"repos":["xiaolin-cs/bemap"],"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/permutaion-equivariant-graph-framelets-for","slug":"permutaion-equivariant-graph-framelets-for","title":"Permutation Equivariant Graph Framelets for Heterophilous Graph Learning","date":"2023-06-07","arxiv_id":"2306.04265","repositories_listed":1,"syntology":null},{"url":"/paper/structural-re-weighting-improves-graph-domain","slug":"structural-re-weighting-improves-graph-domain","title":"Structural Re-weighting Improves Graph Domain Adaptation","date":"2023-06-05","arxiv_id":"2306.03221","repositories_listed":1,"syntology":{"n":7,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"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) · 5 unverified","sample_list":"/paper/structural-re-weighting-improves-graph-domain#ran","syntology_url":"https://syntology.ai/paper/2306.03221","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.03221"}},"official":{"repos":["graph-com/strurw"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/reconstructing-graph-diffusion-history-from-a","slug":"reconstructing-graph-diffusion-history-from-a","title":"Reconstructing Graph Diffusion History from a Single Snapshot","date":"2023-06-01","arxiv_id":"2306.00488","repositories_listed":1,"syntology":{"n":11,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":9,"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) · 9 unverified","sample_list":"/paper/reconstructing-graph-diffusion-history-from-a#ran","syntology_url":"https://syntology.ai/paper/2306.00488","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.00488"}},"official":{"repos":["q-rz/kdd23-ditto"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-neural-networks-for-contextual-asr-with","slug":"graph-neural-networks-for-contextual-asr-with","title":"Graph Neural Networks for Contextual ASR with the Tree-Constrained Pointer Generator","date":"2023-05-30","arxiv_id":"2305.18824","repositories_listed":1,"syntology":null},{"url":"/paper/gazegnn-a-gaze-guided-graph-neural-network","slug":"gazegnn-a-gaze-guided-graph-neural-network","title":"GazeGNN: A Gaze-Guided Graph Neural Network for Chest X-ray Classification","date":"2023-05-29","arxiv_id":"2305.18221","repositories_listed":1,"syntology":null},{"url":"/paper/chatgpt-informed-graph-neural-network-for","slug":"chatgpt-informed-graph-neural-network-for","title":"ChatGPT Informed Graph Neural Network for Stock Movement Prediction","date":"2023-05-28","arxiv_id":"2306.03763","repositories_listed":1,"syntology":null},{"url":"/paper/inferring-causal-effects-under-heterogeneous","slug":"inferring-causal-effects-under-heterogeneous","title":"Inferring Individual Direct Causal Effects Under Heterogeneous Peer Influence","date":"2023-05-27","arxiv_id":"2305.17479","repositories_listed":1,"syntology":null},{"url":"/paper/exploiting-abstract-meaning-representation","slug":"exploiting-abstract-meaning-representation","title":"Exploiting Abstract Meaning Representation for Open-Domain Question Answering","date":"2023-05-26","arxiv_id":"2305.17050","repositories_listed":1,"syntology":null},{"url":"/paper/gvdoc-graph-based-visual-document","slug":"gvdoc-graph-based-visual-document","title":"GVdoc: Graph-based Visual Document Classification","date":"2023-05-26","arxiv_id":"2305.17219","repositories_listed":1,"syntology":null},{"url":"/paper/deepgate2-functionality-aware-circuit","slug":"deepgate2-functionality-aware-circuit","title":"DeepGate2: Functionality-Aware Circuit Representation Learning","date":"2023-05-25","arxiv_id":"2305.16373","repositories_listed":1,"syntology":null},{"url":"/paper/reversible-graph-neural-network-based","slug":"reversible-graph-neural-network-based","title":"Reversible Graph Neural Network-based Reaction Distribution Learning for Multiple Appropriate Facial Reactions Generation","date":"2023-05-24","arxiv_id":"2305.15270","repositories_listed":1,"syntology":null},{"url":"/paper/stochastic-unrolled-federated-learning","slug":"stochastic-unrolled-federated-learning","title":"Stochastic Unrolled Federated Learning","date":"2023-05-24","arxiv_id":"2305.15371","repositories_listed":1,"syntology":null},{"url":"/paper/towards-few-shot-entity-recognition-in-2","slug":"towards-few-shot-entity-recognition-in-2","title":"Towards Few-shot Entity Recognition in Document Images: A Graph Neural Network Approach Robust to Image Manipulation","date":"2023-05-24","arxiv_id":"2305.14828","repositories_listed":1,"syntology":null},{"url":"/paper/2305-14562","slug":"2305-14562","title":"GiPH: Generalizable Placement Learning for Adaptive Heterogeneous Computing","date":"2023-05-23","arxiv_id":"2305.14562","repositories_listed":1,"syntology":null},{"url":"/paper/congrat-self-supervised-contrastive","slug":"congrat-self-supervised-contrastive","title":"ConGraT: Self-Supervised Contrastive Pretraining for Joint Graph and Text Embeddings","date":"2023-05-23","arxiv_id":"2305.14321","repositories_listed":1,"syntology":null},{"url":"/paper/instant-representation-learning-for","slug":"instant-representation-learning-for","title":"Instant Representation Learning for Recommendation over Large Dynamic Graphs","date":"2023-05-22","arxiv_id":"2305.18622","repositories_listed":1,"syntology":null},{"url":"/paper/multi-behavior-self-supervised-learning-for","slug":"multi-behavior-self-supervised-learning-for","title":"Multi-behavior Self-supervised Learning for Recommendation","date":"2023-05-22","arxiv_id":"2305.18238","repositories_listed":1,"syntology":null},{"url":"/paper/road-planning-for-slums-via-deep","slug":"road-planning-for-slums-via-deep","title":"Road Planning for Slums via Deep Reinforcement Learning","date":"2023-05-22","arxiv_id":"2305.13060","repositories_listed":1,"syntology":null},{"url":"/paper/graphfc-customs-fraud-detection-with-label","slug":"graphfc-customs-fraud-detection-with-label","title":"GraphFC: Customs Fraud Detection with Label Scarcity","date":"2023-05-19","arxiv_id":"2305.11377","repositories_listed":1,"syntology":null},{"url":"/paper/seq-hgnn-learning-sequential-node","slug":"seq-hgnn-learning-sequential-node","title":"Seq-HGNN: Learning Sequential Node Representation on Heterogeneous Graph","date":"2023-05-18","arxiv_id":"2305.10771","repositories_listed":1,"syntology":null},{"url":"/paper/edge-directionality-improves-learning-on","slug":"edge-directionality-improves-learning-on","title":"Edge Directionality Improves Learning on Heterophilic Graphs","date":"2023-05-17","arxiv_id":"2305.10498","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"4 ran (of which 0 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","sample_list":"/paper/edge-directionality-improves-learning-on#ran","syntology_url":"https://syntology.ai/paper/2305.10498","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.10498"}},"official":{"repos":["emalgorithm/directed-graph-neural-network"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/predicting-tweet-engagement-with-graph-neural","slug":"predicting-tweet-engagement-with-graph-neural","title":"Predicting Tweet Engagement with Graph Neural Networks","date":"2023-05-17","arxiv_id":"2305.10103","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-causal-explanation-based-diffusion","slug":"dynamic-causal-explanation-based-diffusion","title":"Dynamic Causal Explanation Based Diffusion-Variational Graph Neural Network for Spatio-temporal Forecasting","date":"2023-05-16","arxiv_id":"2305.09703","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-keyphrase-extraction-from-long","slug":"enhancing-keyphrase-extraction-from-long","title":"Enhancing Keyphrase Extraction from Long Scientific Documents using Graph Embeddings","date":"2023-05-16","arxiv_id":"2305.09316","repositories_listed":1,"syntology":null},{"url":"/paper/decoupled-graph-neural-networks-for-large","slug":"decoupled-graph-neural-networks-for-large","title":"Decoupled Graph Neural Networks for Large Dynamic Graphs","date":"2023-05-14","arxiv_id":"2305.08273","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-based-user-pairing-in","slug":"graph-neural-networks-based-user-pairing-in","title":"Graph Neural Networks-Based User Pairing in Wireless Communication Systems","date":"2023-05-14","arxiv_id":"2306.00717","repositories_listed":1,"syntology":null},{"url":"/paper/cuts-high-dimensional-causal-discovery-from","slug":"cuts-high-dimensional-causal-discovery-from","title":"CUTS+: High-dimensional Causal Discovery from Irregular Time-series","date":"2023-05-10","arxiv_id":"2305.05890","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":2,"n_instrument":6,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"8 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; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/cuts-high-dimensional-causal-discovery-from#ran","syntology_url":"https://syntology.ai/paper/2305.05890","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.05890"}},"official":{"repos":["jarrycyx/unn"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dual-intent-enhanced-graph-neural-network-for","slug":"dual-intent-enhanced-graph-neural-network-for","title":"Dual Intent Enhanced Graph Neural Network for Session-based New Item Recommendation","date":"2023-05-10","arxiv_id":"2305.05848","repositories_listed":1,"syntology":null},{"url":"/paper/towards-scalable-adaptive-learning-with-graph","slug":"towards-scalable-adaptive-learning-with-graph","title":"Towards Scalable Adaptive Learning with Graph Neural Networks and Reinforcement Learning","date":"2023-05-10","arxiv_id":"2305.06398","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-network-based-surrogate-model","slug":"graph-neural-network-based-surrogate-model","title":"Graph Neural Network-based surrogate model for granular flows","date":"2023-05-09","arxiv_id":"2305.05218","repositories_listed":1,"syntology":null},{"url":"/paper/language-independent-neuro-symbolic-semantic","slug":"language-independent-neuro-symbolic-semantic","title":"Language Independent Neuro-Symbolic Semantic Parsing for Form Understanding","date":"2023-05-08","arxiv_id":"2305.04460","repositories_listed":1,"syntology":null},{"url":"/paper/generative-pretrained-autoregressive","slug":"generative-pretrained-autoregressive","title":"Generative Pretrained Autoregressive Transformer Graph Neural Network applied to the Analysis and Discovery of Novel Proteins","date":"2023-05-07","arxiv_id":"2305.04934","repositories_listed":1,"syntology":null},{"url":"/paper/heterogeneous-directed-hypergraph-neural","slug":"heterogeneous-directed-hypergraph-neural","title":"Heterogeneous Directed Hypergraph Neural Network over abstract syntax tree (AST) for Code Classification","date":"2023-05-07","arxiv_id":"2305.04228","repositories_listed":1,"syntology":null},{"url":"/paper/lsgnn-towards-general-graph-neural-network-in","slug":"lsgnn-towards-general-graph-neural-network-in","title":"LSGNN: Towards General Graph Neural Network in Node Classification by Local Similarity","date":"2023-05-07","arxiv_id":"2305.04225","repositories_listed":1,"syntology":null},{"url":"/paper/conversational-semantic-parsing-using-dynamic","slug":"conversational-semantic-parsing-using-dynamic","title":"Conversational Semantic Parsing using Dynamic Context Graphs","date":"2023-05-04","arxiv_id":"2305.06164","repositories_listed":1,"syntology":null},{"url":"/paper/transforming-visual-scene-graphs-to-image","slug":"transforming-visual-scene-graphs-to-image","title":"Transforming Visual Scene Graphs to Image Captions","date":"2023-05-03","arxiv_id":"2305.02177","repositories_listed":1,"syntology":null},{"url":"/paper/learning-controllable-adaptive-simulation-for","slug":"learning-controllable-adaptive-simulation-for","title":"Learning Controllable Adaptive Simulation for Multi-resolution Physics","date":"2023-05-01","arxiv_id":"2305.01122","repositories_listed":1,"syntology":{"n":11,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/learning-controllable-adaptive-simulation-for#ran","syntology_url":"https://syntology.ai/paper/2305.01122","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.01122"}},"official":{"repos":["snap-stanford/lamp"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/nearly-optimal-steiner-trees-using-graph","slug":"nearly-optimal-steiner-trees-using-graph","title":"Nearly Optimal Steiner Trees using Graph Neural Network Assisted Monte Carlo Tree Search","date":"2023-04-30","arxiv_id":"2305.00535","repositories_listed":1,"syntology":null},{"url":"/paper/musical-voice-separation-as-link-prediction","slug":"musical-voice-separation-as-link-prediction","title":"Musical Voice Separation as Link Prediction: Modeling a Musical Perception Task as a Multi-Trajectory Tracking Problem","date":"2023-04-28","arxiv_id":"2304.14848","repositories_listed":1,"syntology":null},{"url":"/paper/x-rlflow-graph-reinforcement-learning-for","slug":"x-rlflow-graph-reinforcement-learning-for","title":"X-RLflow: Graph Reinforcement Learning for Neural Network Subgraphs Transformation","date":"2023-04-28","arxiv_id":"2304.14698","repositories_listed":1,"syntology":null},{"url":"/paper/impact-oriented-contextual-scholar-profiling","slug":"impact-oriented-contextual-scholar-profiling","title":"Impact-Oriented Contextual Scholar Profiling using Self-Citation Graphs","date":"2023-04-24","arxiv_id":"2304.12217","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"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 0 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","sample_list":"/paper/impact-oriented-contextual-scholar-profiling#ran","syntology_url":"https://syntology.ai/paper/2304.12217","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.12217"}},"official":{"repos":["visdata/geneticflow"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/paragraph2graph-a-gnn-based-framework-for","slug":"paragraph2graph-a-gnn-based-framework-for","title":"PARAGRAPH2GRAPH: A GNN-based framework for layout paragraph analysis","date":"2023-04-24","arxiv_id":"2304.11810","repositories_listed":1,"syntology":null},{"url":"/paper/detecting-spoilers-in-movie-reviews-with","slug":"detecting-spoilers-in-movie-reviews-with","title":"Detecting Spoilers in Movie Reviews with External Movie Knowledge and User Networks","date":"2023-04-22","arxiv_id":"2304.11411","repositories_listed":1,"syntology":{"n":7,"n_ran":3,"n_constructed":3,"n_ran_checked":3,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":7,"phrase":"3 ran (of which 3 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) · 4 unverified; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/detecting-spoilers-in-movie-reviews-with#ran","syntology_url":"https://syntology.ai/paper/2304.11411","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.11411"}},"official":{"repos":["arthur-heng/spoiler-detection"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/censoring-chemical-data-to-mitigate-dual-use","slug":"censoring-chemical-data-to-mitigate-dual-use","title":"Censoring chemical data to mitigate dual use risk","date":"2023-04-20","arxiv_id":"2304.10510","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-network-based-anomaly-detection-1","slug":"graph-neural-network-based-anomaly-detection-1","title":"Graph Neural Network-Based Anomaly Detection for River Network Systems","date":"2023-04-19","arxiv_id":"2304.09367","repositories_listed":1,"syntology":null},{"url":"/paper/normalizing-flow-based-neural-process-for-few","slug":"normalizing-flow-based-neural-process-for-few","title":"Normalizing Flow-based Neural Process for Few-Shot Knowledge Graph Completion","date":"2023-04-17","arxiv_id":"2304.08183","repositories_listed":1,"syntology":null},{"url":"/paper/h2cgl-modeling-dynamics-of-citation-network","slug":"h2cgl-modeling-dynamics-of-citation-network","title":"H2CGL: Modeling Dynamics of Citation Network for Impact Prediction","date":"2023-04-16","arxiv_id":"2305.01572","repositories_listed":1,"syntology":null},{"url":"/paper/m2gnn-metapath-and-multi-interest-aggregated","slug":"m2gnn-metapath-and-multi-interest-aggregated","title":"M2GNN: Metapath and Multi-interest Aggregated Graph Neural Network for Tag-based Cross-domain Recommendation","date":"2023-04-16","arxiv_id":"2304.07911","repositories_listed":1,"syntology":null},{"url":"/paper/hgwavenet-a-hyperbolic-graph-neural-network","slug":"hgwavenet-a-hyperbolic-graph-neural-network","title":"HGWaveNet: A Hyperbolic Graph Neural Network for Temporal Link Prediction","date":"2023-04-14","arxiv_id":"2304.07302","repositories_listed":1,"syntology":null},{"url":"/paper/rf-gnn-random-forest-boosted-graph-neural","slug":"rf-gnn-random-forest-boosted-graph-neural","title":"RF-GNN: Random Forest Boosted Graph Neural Network for Social Bot Detection","date":"2023-04-14","arxiv_id":"2304.08239","repositories_listed":1,"syntology":null},{"url":"/paper/dgnn-booster-a-generic-fpga-accelerator","slug":"dgnn-booster-a-generic-fpga-accelerator","title":"DGNN-Booster: A Generic FPGA Accelerator Framework For Dynamic Graph Neural Network Inference","date":"2023-04-13","arxiv_id":"2304.06831","repositories_listed":1,"syntology":null},{"url":"/paper/radargnn-transformation-invariant-graph","slug":"radargnn-transformation-invariant-graph","title":"RadarGNN: Transformation Invariant Graph Neural Network for Radar-based Perception","date":"2023-04-13","arxiv_id":"2304.06547","repositories_listed":1,"syntology":null},{"url":"/paper/differentiable-graph-structured-models-for","slug":"differentiable-graph-structured-models-for","title":"Differentiable graph-structured models for inverse design of lattice materials","date":"2023-04-11","arxiv_id":"2304.05422","repositories_listed":1,"syntology":null},{"url":"/paper/todynet-temporal-dynamic-graph-neural-network","slug":"todynet-temporal-dynamic-graph-neural-network","title":"TodyNet: Temporal Dynamic Graph Neural Network for Multivariate Time Series Classification","date":"2023-04-11","arxiv_id":"2304.05078","repositories_listed":1,"syntology":null},{"url":"/paper/topology-reasoning-for-driving-scenes","slug":"topology-reasoning-for-driving-scenes","title":"Graph-based Topology Reasoning for Driving Scenes","date":"2023-04-11","arxiv_id":"2304.05277","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 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","sample_list":"/paper/topology-reasoning-for-driving-scenes#ran","syntology_url":"https://syntology.ai/paper/2304.05277","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.05277"}},"official":{"repos":["opendrivelab/toponet"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/contrastive-cross-domain-sequential","slug":"contrastive-cross-domain-sequential","title":"Contrastive Cross-Domain Sequential Recommendation","date":"2023-04-08","arxiv_id":"2304.03891","repositories_listed":1,"syntology":null},{"url":"/paper/generating-a-graph-colouring-heuristic-with","slug":"generating-a-graph-colouring-heuristic-with","title":"Generating a Graph Colouring Heuristic with Deep Q-Learning and Graph Neural Networks","date":"2023-04-08","arxiv_id":"2304.04051","repositories_listed":1,"syntology":null},{"url":"/paper/sgdp-a-stream-graph-neural-network-based-data","slug":"sgdp-a-stream-graph-neural-network-based-data","title":"SGDP: A Stream-Graph Neural Network Based Data Prefetcher","date":"2023-04-07","arxiv_id":"2304.03864","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":2,"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/sgdp-a-stream-graph-neural-network-based-data#ran","syntology_url":"https://syntology.ai/paper/2304.03864","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.03864"}},"official":{"repos":["yyysjz1997/SGDP"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/checkerpose-progressive-dense-keypoint","slug":"checkerpose-progressive-dense-keypoint","title":"CheckerPose: Progressive Dense Keypoint Localization for Object Pose Estimation with Graph Neural Network","date":"2023-03-29","arxiv_id":"2303.16874","repositories_listed":1,"syntology":{"n":12,"n_ran":9,"n_constructed":3,"n_ran_checked":4,"n_instrument":5,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":12,"phrase":"9 ran (of which 3 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 5 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/checkerpose-progressive-dense-keypoint#ran","syntology_url":"https://syntology.ai/paper/2303.16874","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.16874"}},"official":{"repos":["ruyilian/checkerpose"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/gat-cobo-cost-sensitive-graph-neural-network","slug":"gat-cobo-cost-sensitive-graph-neural-network","title":"GAT-COBO: Cost-Sensitive Graph Neural Network for Telecom Fraud Detection","date":"2023-03-29","arxiv_id":"2303.17334","repositories_listed":1,"syntology":null},{"url":"/paper/gnnbuilder-an-automated-framework-for-generic","slug":"gnnbuilder-an-automated-framework-for-generic","title":"GNNBuilder: An Automated Framework for Generic Graph Neural Network Accelerator Generation, Simulation, and Optimization","date":"2023-03-29","arxiv_id":"2303.16459","repositories_listed":1,"syntology":null},{"url":"/paper/graf-graph-attention-aware-fusion-networks","slug":"graf-graph-attention-aware-fusion-networks","title":"GRAF: Graph Attention-aware Fusion Networks","date":"2023-03-29","arxiv_id":"2303.16781","repositories_listed":1,"syntology":null},{"url":"/paper/cost-sensitive-gnn-based-imbalanced-learning","slug":"cost-sensitive-gnn-based-imbalanced-learning","title":"Cost Sensitive GNN-based Imbalanced Learning for Mobile Social Network Fraud Detection","date":"2023-03-28","arxiv_id":"2303.17486","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/cost-sensitive-gnn-based-imbalanced-learning#ran","syntology_url":"https://syntology.ai/paper/2303.17486","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.17486"}},"official":{"repos":["xxhu94/csgnn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/uncovering-the-missing-pattern-unified","slug":"uncovering-the-missing-pattern-unified","title":"Uncovering the Missing Pattern: Unified Framework Towards Trajectory Imputation and Prediction","date":"2023-03-28","arxiv_id":"2303.16005","repositories_listed":1,"syntology":null},{"url":"/paper/learnable-graph-matching-a-practical-paradigm","slug":"learnable-graph-matching-a-practical-paradigm","title":"Learnable Graph Matching: A Practical Paradigm for Data Association","date":"2023-03-27","arxiv_id":"2303.15414","repositories_listed":1,"syntology":null},{"url":"/paper/gradient-scarcity-with-bilevel-optimization","slug":"gradient-scarcity-with-bilevel-optimization","title":"Gradient scarcity with Bilevel Optimization for Graph Learning","date":"2023-03-24","arxiv_id":"2303.13964","repositories_listed":1,"syntology":null},{"url":"/paper/positional-diffusion-ordering-unordered-sets","slug":"positional-diffusion-ordering-unordered-sets","title":"Positional Diffusion: Ordering Unordered Sets with Diffusion Probabilistic Models","date":"2023-03-20","arxiv_id":"2303.11120","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-learning-for-solving-the","slug":"unsupervised-learning-for-solving-the","title":"Unsupervised Learning for Solving the Travelling Salesman Problem","date":"2023-03-19","arxiv_id":"2303.10538","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":6,"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) · 1 unverified","sample_list":"/paper/unsupervised-learning-for-solving-the#ran","syntology_url":"https://syntology.ai/paper/2303.10538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.10538"}},"official":{"repos":["yimengmin/UTSP"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/action-knowledge-for-video-captioning-with","slug":"action-knowledge-for-video-captioning-with","title":"Action knowledge for video captioning with graph neural networks","date":"2023-03-16","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/glasu-a-communication-efficient-algorithm-for","slug":"glasu-a-communication-efficient-algorithm-for","title":"GLASU: A Communication-Efficient Algorithm for Federated Learning with Vertically Distributed Graph Data","date":"2023-03-16","arxiv_id":"2303.09531","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-and-topology-a-two-layer-spatially","slug":"knowledge-and-topology-a-two-layer-spatially","title":"Knowledge and topology: A two layer spatially dependent graph neural networks to identify urban functions with time-series street view image","date":"2023-03-16","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/robust-preference-guided-denoising-for-graph","slug":"robust-preference-guided-denoising-for-graph","title":"Robust Preference-Guided Denoising for Graph based Social Recommendation","date":"2023-03-15","arxiv_id":"2303.08346","repositories_listed":1,"syntology":null},{"url":"/paper/disentangled-graph-social-recommendation","slug":"disentangled-graph-social-recommendation","title":"Disentangled Graph Social Recommendation","date":"2023-03-14","arxiv_id":"2303.07810","repositories_listed":1,"syntology":null},{"url":"/paper/learning-reduced-order-models-for","slug":"learning-reduced-order-models-for","title":"Learning Reduced-Order Models for Cardiovascular Simulations with Graph Neural Networks","date":"2023-03-13","arxiv_id":"2303.07310","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-network-contextual-embedding-for","slug":"graph-neural-network-contextual-embedding-for","title":"Graph Neural Network contextual embedding for Deep Learning on Tabular Data","date":"2023-03-11","arxiv_id":"2303.06455","repositories_listed":1,"syntology":null},{"url":"/paper/a-hybrid-deep-learning-metaheuristic","slug":"a-hybrid-deep-learning-metaheuristic","title":"A hybrid deep-learning-metaheuristic framework for bi-level network design problems","date":"2023-03-10","arxiv_id":"2303.06024","repositories_listed":1,"syntology":null},{"url":"/paper/dr-label-improving-gnn-models-for-catalysis","slug":"dr-label-improving-gnn-models-for-catalysis","title":"DR-Label: Improving GNN Models for Catalysis Systems by Label Deconstruction and Reconstruction","date":"2023-03-06","arxiv_id":"2303.02875","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"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) · 0 unverified","sample_list":"/paper/dr-label-improving-gnn-models-for-catalysis#ran","syntology_url":"https://syntology.ai/paper/2303.02875","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.02875"}},"official":{"repos":["bowenwang77/DR-Label"],"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/hierarchical-graph-neural-networks-for","slug":"hierarchical-graph-neural-networks-for","title":"Hierarchical Graph Neural Networks for Particle Track Reconstruction","date":"2023-03-03","arxiv_id":"2303.01640","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-topic-model-with-commonsense","slug":"graph-neural-topic-model-with-commonsense","title":"Graph neural topic model with commonsense knowledge","date":"2023-03-02","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-hybrid-spatial-temporal-graph-neural","slug":"adaptive-hybrid-spatial-temporal-graph-neural","title":"Adaptive Hybrid Spatial-Temporal Graph Neural Network for Cellular Traffic Prediction","date":"2023-02-28","arxiv_id":"2303.00498","repositories_listed":1,"syntology":null},{"url":"/paper/chgnet-pretrained-universal-neural-network","slug":"chgnet-pretrained-universal-neural-network","title":"CHGNet: Pretrained universal neural network potential for charge-informed atomistic modeling","date":"2023-02-28","arxiv_id":"2302.14231","repositories_listed":1,"syntology":null},{"url":"/paper/invariant-representations-of-embedded","slug":"invariant-representations-of-embedded","title":"Invariant Representations of Embedded Simplicial Complexes","date":"2023-02-27","arxiv_id":"2302.13565","repositories_listed":1,"syntology":null},{"url":"/paper/gnndelete-a-general-strategy-for-unlearning","slug":"gnndelete-a-general-strategy-for-unlearning","title":"GNNDelete: A General Strategy for Unlearning in Graph Neural Networks","date":"2023-02-26","arxiv_id":"2302.13406","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"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: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/gnndelete-a-general-strategy-for-unlearning#ran","syntology_url":"https://syntology.ai/paper/2302.13406","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.13406"}},"official":{"repos":["mims-harvard/gnndelete"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/a-multimodal-graph-neural-network-framework","slug":"a-multimodal-graph-neural-network-framework","title":"A Multimodal Graph Neural Network Framework of Cancer Molecular Subtype Classification","date":"2023-02-24","arxiv_id":"2302.12838","repositories_listed":1,"syntology":null},{"url":"/paper/page-link-path-based-graph-neural-network","slug":"page-link-path-based-graph-neural-network","title":"PaGE-Link: Path-based Graph Neural Network Explanation for Heterogeneous Link Prediction","date":"2023-02-24","arxiv_id":"2302.12465","repositories_listed":1,"syntology":null},{"url":"/paper/supervised-hierarchical-clustering-using","slug":"supervised-hierarchical-clustering-using","title":"Supervised Hierarchical Clustering using Graph Neural Networks for Speaker Diarization","date":"2023-02-24","arxiv_id":"2302.12716","repositories_listed":1,"syntology":null},{"url":"/paper/mesograph-automatic-profiling-of-malignant","slug":"mesograph-automatic-profiling-of-malignant","title":"MesoGraph: Automatic Profiling of Malignant Mesothelioma Subtypes from Histological Images","date":"2023-02-23","arxiv_id":"2302.12653","repositories_listed":1,"syntology":null},{"url":"/paper/buaa-bigscity-spatial-temporal-graph-neural","slug":"buaa-bigscity-spatial-temporal-graph-neural","title":"BUAA_BIGSCity: Spatial-Temporal Graph Neural Network for Wind Power Forecasting in Baidu KDD CUP 2022","date":"2023-02-22","arxiv_id":"2302.11159","repositories_listed":1,"syntology":null},{"url":"/paper/dual-policy-learning-for-aggregation","slug":"dual-policy-learning-for-aggregation","title":"Dual Policy Learning for Aggregation Optimization in Graph Neural Network-based Recommender Systems","date":"2023-02-21","arxiv_id":"2302.10567","repositories_listed":1,"syntology":null},{"url":"/paper/lightgcl-simple-yet-effective-graph","slug":"lightgcl-simple-yet-effective-graph","title":"LightGCL: Simple Yet Effective Graph Contrastive Learning for Recommendation","date":"2023-02-16","arxiv_id":"2302.08191","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"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) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/lightgcl-simple-yet-effective-graph#ran","syntology_url":"https://syntology.ai/paper/2302.08191","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.08191"}},"official":{"repos":["hkuds/lightgcl"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/temporal-graph-neural-networks-for-irregular","slug":"temporal-graph-neural-networks-for-irregular","title":"Temporal Graph Neural Networks for Irregular Data","date":"2023-02-16","arxiv_id":"2302.08415","repositories_listed":1,"syntology":null},{"url":"/paper/cuts-neural-causal-discovery-from-irregular","slug":"cuts-neural-causal-discovery-from-irregular","title":"CUTS: Neural Causal Discovery from Irregular Time-Series Data","date":"2023-02-15","arxiv_id":"2302.07458","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":0,"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/cuts-neural-causal-discovery-from-irregular#ran","syntology_url":"https://syntology.ai/paper/2302.07458","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.07458"}},"official":{"repos":["jarrycyx/unn"],"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/espalomacharge-machine-learning-enabled-ultra","slug":"espalomacharge-machine-learning-enabled-ultra","title":"EspalomaCharge: Machine learning-enabled ultra-fast partial charge assignment","date":"2023-02-14","arxiv_id":"2302.06758","repositories_listed":1,"syntology":null},{"url":"/paper/message-passing-meets-graph-neural-networks-a","slug":"message-passing-meets-graph-neural-networks-a","title":"Message Passing Meets Graph Neural Networks: A New Paradigm for Massive MIMO Systems","date":"2023-02-14","arxiv_id":"2302.06896","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-network-inspired-kernels-for","slug":"graph-neural-network-inspired-kernels-for","title":"Graph Neural Network-Inspired Kernels for Gaussian Processes in Semi-Supervised Learning","date":"2023-02-12","arxiv_id":"2302.05828","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"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 0 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","sample_list":"/paper/graph-neural-network-inspired-kernels-for#ran","syntology_url":"https://syntology.ai/paper/2302.05828","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.05828"}},"official":{"repos":["niuzehao/gnn-gp"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/user-unsupervised-structural-entropy-based","slug":"user-unsupervised-structural-entropy-based","title":"USER: Unsupervised Structural Entropy-based Robust Graph Neural Network","date":"2023-02-12","arxiv_id":"2302.05889","repositories_listed":1,"syntology":null},{"url":"/paper/on-generalized-degree-fairness-in-graph","slug":"on-generalized-degree-fairness-in-graph","title":"On Generalized Degree Fairness in Graph Neural Networks","date":"2023-02-08","arxiv_id":"2302.03881","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/on-generalized-degree-fairness-in-graph#ran","syntology_url":"https://syntology.ai/paper/2302.03881","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.03881"}},"official":{"repos":["ntkien1904/DegFairGNN"],"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/an-entity-guided-text-summarization-framework","slug":"an-entity-guided-text-summarization-framework","title":"An entity-guided text summarization framework with relational heterogeneous graph neural network","date":"2023-02-07","arxiv_id":"2302.03205","repositories_listed":1,"syntology":null},{"url":"/paper/predicting-the-silent-majority-on-graphs","slug":"predicting-the-silent-majority-on-graphs","title":"Predicting the Silent Majority on Graphs: Knowledge Transferable Graph Neural Network","date":"2023-02-02","arxiv_id":"2302.00873","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/predicting-the-silent-majority-on-graphs#ran","syntology_url":"https://syntology.ai/paper/2302.00873","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.00873"}},"official":{"repos":["wendongbi/KT-GNN"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}}],"record_sha256":"9295feee92ef22b9ee32ae447a98f206ccde2dc58498a9018bdd24b5f5676c1b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}