{"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/7","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":7,"pages_in_order":36,"rows_per_page":100,"rows":[601,700],"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/6","next":"/task/graph-neural-network/papers/8","papers":[{"url":"/paper/rayleigh-quotient-graph-neural-networks-for","slug":"rayleigh-quotient-graph-neural-networks-for","title":"Rayleigh Quotient Graph Neural Networks for Graph-level Anomaly Detection","date":"2023-10-04","arxiv_id":"2310.02861","repositories_listed":1,"syntology":{"n":6,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":6,"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) · 5 unverified","sample_list":"/paper/rayleigh-quotient-graph-neural-networks-for#ran","syntology_url":"https://syntology.ai/paper/2310.02861","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.02861"}},"official":{"repos":["xydong127/rqgnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/score-dynamics-scaling-molecular-dynamics","slug":"score-dynamics-scaling-molecular-dynamics","title":"Score dynamics: scaling molecular dynamics with picoseconds timestep via conditional diffusion model","date":"2023-10-02","arxiv_id":"2310.01678","repositories_listed":1,"syntology":{"n":15,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":15,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/score-dynamics-scaling-molecular-dynamics#ran","syntology_url":"https://syntology.ai/paper/2310.01678","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.01678"}},"official":{"repos":["llnl/graphite"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/the-map-equation-goes-neural","slug":"the-map-equation-goes-neural","title":"The Map Equation Goes Neural: Mapping Network Flows with Graph Neural Networks","date":"2023-10-02","arxiv_id":"2310.01144","repositories_listed":1,"syntology":null},{"url":"/paper/are-graph-neural-networks-optimal","slug":"are-graph-neural-networks-optimal","title":"Are Graph Neural Networks Optimal Approximation Algorithms?","date":"2023-10-01","arxiv_id":"2310.00526","repositories_listed":1,"syntology":{"n":13,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":13,"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) · 7 unverified","sample_list":"/paper/are-graph-neural-networks-optimal#ran","syntology_url":"https://syntology.ai/paper/2310.00526","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.00526"}},"official":{"repos":["penlu/bespoke-gnn4do"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/gnrk-graph-neural-runge-kutta-method-for","slug":"gnrk-graph-neural-runge-kutta-method-for","title":"GNRK: Graph Neural Runge-Kutta method for solving partial differential equations","date":"2023-10-01","arxiv_id":"2310.00618","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-adaptation-with-hypernetworks","slug":"hierarchical-adaptation-with-hypernetworks","title":"PACIA: Parameter-Efficient Adapter for Few-Shot Molecular Property Prediction","date":"2023-10-01","arxiv_id":"2310.00614","repositories_listed":1,"syntology":null},{"url":"/paper/learning-state-augmented-policies-for","slug":"learning-state-augmented-policies-for","title":"Learning State-Augmented Policies for Information Routing in Communication Networks","date":"2023-09-30","arxiv_id":"2310.00248","repositories_listed":1,"syntology":null},{"url":"/paper/admet-property-prediction-through","slug":"admet-property-prediction-through","title":"ADMET property prediction through combinations of molecular fingerprints","date":"2023-09-29","arxiv_id":"2310.00174","repositories_listed":1,"syntology":null},{"url":"/paper/controlling-continuous-relaxation-for","slug":"controlling-continuous-relaxation-for","title":"Controlling Continuous Relaxation for Combinatorial Optimization","date":"2023-09-29","arxiv_id":"2309.16965","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":6,"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) · 1 unverified","sample_list":"/paper/controlling-continuous-relaxation-for#ran","syntology_url":"https://syntology.ai/paper/2309.16965","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.16965"}},"official":{"repos":["Yuma-Ichikawa/CRA4CO"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/muse-gnn-learning-unified-gene-representation","slug":"muse-gnn-learning-unified-gene-representation","title":"MuSe-GNN: Learning Unified Gene Representation From Multimodal Biological Graph Data","date":"2023-09-29","arxiv_id":"2310.02275","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":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) · 1 unverified","sample_list":"/paper/muse-gnn-learning-unified-gene-representation#ran","syntology_url":"https://syntology.ai/paper/2310.02275","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.02275"}},"official":{"repos":["helloworldlty/muse-gnn"],"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/networked-inequality-preferential-attachment","slug":"networked-inequality-preferential-attachment","title":"Networked Inequality: Preferential Attachment Bias in Graph Neural Network Link Prediction","date":"2023-09-29","arxiv_id":"2309.17417","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/networked-inequality-preferential-attachment#ran","syntology_url":"https://syntology.ai/paper/2309.17417","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.17417"}},"official":{"repos":["arjunsubramonian/link_bias_amplification"],"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/on-the-equivalence-of-graph-convolution-and","slug":"on-the-equivalence-of-graph-convolution-and","title":"On the Equivalence of Graph Convolution and Mixup","date":"2023-09-29","arxiv_id":"2310.00183","repositories_listed":1,"syntology":null},{"url":"/paper/mhg-gnn-combination-of-molecular-hypergraph","slug":"mhg-gnn-combination-of-molecular-hypergraph","title":"MHG-GNN: Combination of Molecular Hypergraph Grammar with Graph Neural Network","date":"2023-09-28","arxiv_id":"2309.16374","repositories_listed":1,"syntology":null},{"url":"/paper/gnnhls-evaluating-graph-neural-network","slug":"gnnhls-evaluating-graph-neural-network","title":"GNNHLS: Evaluating Graph Neural Network Inference via High-Level Synthesis","date":"2023-09-27","arxiv_id":"2309.16022","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-prompting-with-large-language","slug":"graph-neural-prompting-with-large-language","title":"Graph Neural Prompting with Large Language Models","date":"2023-09-27","arxiv_id":"2309.15427","repositories_listed":1,"syntology":null},{"url":"/paper/hypertrack-neural-combinatorics-for-high","slug":"hypertrack-neural-combinatorics-for-high","title":"HyperTrack: Neural Combinatorics for High Energy Physics","date":"2023-09-25","arxiv_id":"2309.14113","repositories_listed":1,"syntology":null},{"url":"/paper/graph-enhanced-optimizers-for-structure-aware","slug":"graph-enhanced-optimizers-for-structure-aware","title":"Graph-enhanced Optimizers for Structure-aware Recommendation Embedding Evolution","date":"2023-09-24","arxiv_id":"2310.03032","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-enhanced-optimizers-for-structure-aware#ran","syntology_url":"https://syntology.ai/paper/2310.03032","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.03032"}},"official":{"repos":["mtandhj/sevo"],"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/improving-article-classification-with-edge","slug":"improving-article-classification-with-edge","title":"Article Classification with Graph Neural Networks and Multigraphs","date":"2023-09-20","arxiv_id":"2309.11341","repositories_listed":1,"syntology":null},{"url":"/paper/inkstream-real-time-gnn-inference-on","slug":"inkstream-real-time-gnn-inference-on","title":"InkStream: Real-time GNN Inference on Streaming Graphs via Incremental Update","date":"2023-09-20","arxiv_id":"2309.11071","repositories_listed":1,"syntology":null},{"url":"/paper/multi-stain-self-attention-graph-multiple","slug":"multi-stain-self-attention-graph-multiple","title":"MUSTANG: Multi-Stain Self-Attention Graph Multiple Instance Learning Pipeline for Histopathology Whole Slide Images","date":"2023-09-19","arxiv_id":"2309.10650","repositories_listed":1,"syntology":null},{"url":"/paper/graph-topological-property-recovery-with-heat","slug":"graph-topological-property-recovery-with-heat","title":"DYMAG: Rethinking Message Passing Using Dynamical-systems-based Waveforms","date":"2023-09-18","arxiv_id":"2309.09924","repositories_listed":1,"syntology":null},{"url":"/paper/higt-hierarchical-interaction-graph","slug":"higt-hierarchical-interaction-graph","title":"HIGT: Hierarchical Interaction Graph-Transformer for Whole Slide Image Analysis","date":"2023-09-14","arxiv_id":"2309.07400","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":6,"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) · 2 unverified","sample_list":"/paper/higt-hierarchical-interaction-graph#ran","syntology_url":"https://syntology.ai/paper/2309.07400","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.07400"}},"official":{"repos":["hku-medai/higt"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/uncertainty-aware-traffic-prediction-under","slug":"uncertainty-aware-traffic-prediction-under","title":"Uncertainty-aware Traffic Prediction under Missing Data","date":"2023-09-13","arxiv_id":"2309.06800","repositories_listed":1,"syntology":null},{"url":"/paper/2309-05953","slug":"2309-05953","title":"GLAD: Content-aware Dynamic Graphs For Log Anomaly Detection","date":"2023-09-12","arxiv_id":"2309.05953","repositories_listed":1,"syntology":null},{"url":"/paper/bregman-graph-neural-network","slug":"bregman-graph-neural-network","title":"Bregman Graph Neural Network","date":"2023-09-12","arxiv_id":"2309.06645","repositories_listed":1,"syntology":null},{"url":"/paper/pcn-a-deep-learning-approach-to-jet-tagging","slug":"pcn-a-deep-learning-approach-to-jet-tagging","title":"PCN: A Deep Learning Approach to Jet Tagging Utilizing Novel Graph Construction Methods and Chebyshev Graph Convolutions","date":"2023-09-12","arxiv_id":"2309.08630","repositories_listed":1,"syntology":null},{"url":"/paper/fully-connected-spatial-temporal-graph-for","slug":"fully-connected-spatial-temporal-graph-for","title":"Fully-Connected Spatial-Temporal Graph for Multivariate Time-Series Data","date":"2023-09-11","arxiv_id":"2309.05305","repositories_listed":1,"syntology":null},{"url":"/paper/learning-the-geodesic-embedding-with-graph","slug":"learning-the-geodesic-embedding-with-graph","title":"Learning the Geodesic Embedding with Graph Neural Networks","date":"2023-09-11","arxiv_id":"2309.05613","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-the-geodesic-embedding-with-graph#ran","syntology_url":"https://syntology.ai/paper/2309.05613","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.05613"}},"official":{"repos":["intelligentgeometry/gegnn"],"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"]}}},{"url":"/paper/spatiotemporal-graph-neural-networks-with","slug":"spatiotemporal-graph-neural-networks-with","title":"Uncertainty-Aware Probabilistic Graph Neural Networks for Road-Level Traffic Accident Prediction","date":"2023-09-10","arxiv_id":"2309.05072","repositories_listed":1,"syntology":null},{"url":"/paper/spectral-temporal-graph-neural-network-for-2","slug":"spectral-temporal-graph-neural-network-for-2","title":"Spectral Temporal Graph Neural Network for massive MIMO CSI Prediction","date":"2023-09-10","arxiv_id":"2312.02159","repositories_listed":1,"syntology":null},{"url":"/paper/deepcrystet-a-deep-learning-approach-using","slug":"deepcrystet-a-deep-learning-approach-using","title":"DeepCrysTet: A Deep Learning Approach Using Tetrahedral Mesh for Predicting Properties of Crystalline Materials","date":"2023-09-07","arxiv_id":"2310.06852","repositories_listed":1,"syntology":null},{"url":"/paper/extending-transductive-knowledge-graph","slug":"extending-transductive-knowledge-graph","title":"Extending Transductive Knowledge Graph Embedding Models for Inductive Logical Relational Inference","date":"2023-09-07","arxiv_id":"2309.03773","repositories_listed":1,"syntology":null},{"url":"/paper/effective-multi-graph-neural-networks-for","slug":"effective-multi-graph-neural-networks-for","title":"Effective Illicit Account Detection on Large Cryptocurrency MultiGraphs","date":"2023-09-04","arxiv_id":"2309.02460","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":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/effective-multi-graph-neural-networks-for#ran","syntology_url":"https://syntology.ai/paper/2309.02460","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.02460"}},"official":{"repos":["tommydzh/diam"],"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/reonto-a-neuro-symbolic-approach-for","slug":"reonto-a-neuro-symbolic-approach-for","title":"ReOnto: A Neuro-Symbolic Approach for Biomedical Relation Extraction","date":"2023-09-04","arxiv_id":"2309.01370","repositories_listed":1,"syntology":null},{"url":"/paper/sepal-spatial-gene-expression-prediction-from","slug":"sepal-spatial-gene-expression-prediction-from","title":"SEPAL: Spatial Gene Expression Prediction from Local Graphs","date":"2023-09-02","arxiv_id":"2309.01036","repositories_listed":1,"syntology":null},{"url":"/paper/a-locality-based-neural-solver-for-optical","slug":"a-locality-based-neural-solver-for-optical","title":"A Locality-based Neural Solver for Optical Motion Capture","date":"2023-09-01","arxiv_id":"2309.00428","repositories_listed":1,"syntology":null},{"url":"/paper/cktgnn-circuit-graph-neural-network-for","slug":"cktgnn-circuit-graph-neural-network-for","title":"CktGNN: Circuit Graph Neural Network for Electronic Design Automation","date":"2023-08-31","arxiv_id":"2308.16406","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/cktgnn-circuit-graph-neural-network-for#ran","syntology_url":"https://syntology.ai/paper/2308.16406","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.16406"}},"official":{"repos":["zehao-dong/CktGNN"],"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/domain-adaptive-message-passing-graph-neural","slug":"domain-adaptive-message-passing-graph-neural","title":"Domain-adaptive Message Passing Graph Neural Network","date":"2023-08-31","arxiv_id":"2308.16470","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":3,"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/domain-adaptive-message-passing-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2308.16470","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.16470"}},"official":{"repos":["shenxiaocam/dm_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"]}}},{"url":"/paper/pose-graph-attentional-graph-neural-network","slug":"pose-graph-attentional-graph-neural-network","title":"Pose-Graph Attentional Graph Neural Network for Lidar Place Recognition","date":"2023-08-31","arxiv_id":"2309.00168","repositories_listed":1,"syntology":null},{"url":"/paper/self-pruning-graph-neural-network-for","slug":"self-pruning-graph-neural-network-for","title":"Self-pruning Graph Neural Network for Predicting Inflammatory Disease Activity in Multiple Sclerosis from Brain MR Images","date":"2023-08-31","arxiv_id":"2308.16863","repositories_listed":1,"syntology":null},{"url":"/paper/low-bit-quantization-for-deep-graph-neural","slug":"low-bit-quantization-for-deep-graph-neural","title":"Low-bit Quantization for Deep Graph Neural Networks with Smoothness-aware Message Propagation","date":"2023-08-29","arxiv_id":"2308.14949","repositories_listed":1,"syntology":null},{"url":"/paper/hrgcn-heterogeneous-graph-level-anomaly","slug":"hrgcn-heterogeneous-graph-level-anomaly","title":"HRGCN: Heterogeneous Graph-level Anomaly Detection with Hierarchical Relation-augmented Graph Neural Networks","date":"2023-08-28","arxiv_id":"2308.14340","repositories_listed":1,"syntology":null},{"url":"/paper/building-explainable-graph-neural-network-by","slug":"building-explainable-graph-neural-network-by","title":"Building explainable graph neural network by sparse learning for the drug-protein binding prediction","date":"2023-08-27","arxiv_id":"2309.12906","repositories_listed":1,"syntology":null},{"url":"/paper/learning-bottleneck-transformer-for-event","slug":"learning-bottleneck-transformer-for-event","title":"Learning Bottleneck Transformer for Event Image-Voxel Feature Fusion based Classification","date":"2023-08-23","arxiv_id":"2308.11937","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":6,"phrase":"5 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-bottleneck-transformer-for-event#ran","syntology_url":"https://syntology.ai/paper/2308.11937","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.11937"}},"official":{"repos":["event-ahu/efv_event_classification"],"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/molgrapher-graph-based-visual-recognition-of","slug":"molgrapher-graph-based-visual-recognition-of","title":"MolGrapher: Graph-based Visual Recognition of Chemical Structures","date":"2023-08-23","arxiv_id":"2308.12234","repositories_listed":1,"syntology":null},{"url":"/paper/st-rap-a-spatio-temporal-framework-for-real","slug":"st-rap-a-spatio-temporal-framework-for-real","title":"ST-RAP: A Spatio-Temporal Framework for Real Estate Appraisal","date":"2023-08-21","arxiv_id":"2308.10609","repositories_listed":1,"syntology":null},{"url":"/paper/imputing-brain-measurements-across-data-sets","slug":"imputing-brain-measurements-across-data-sets","title":"Imputing Brain Measurements Across Data Sets via Graph Neural Networks","date":"2023-08-19","arxiv_id":"2308.09907","repositories_listed":1,"syntology":null},{"url":"/paper/boosting-few-shot-action-recognition-with","slug":"boosting-few-shot-action-recognition-with","title":"Boosting Few-shot Action Recognition with Graph-guided Hybrid Matching","date":"2023-08-18","arxiv_id":"2308.09346","repositories_listed":1,"syntology":null},{"url":"/paper/desco-towards-generalizable-and-scalable-deep","slug":"desco-towards-generalizable-and-scalable-deep","title":"DeSCo: Towards Generalizable and Scalable Deep Subgraph Counting","date":"2023-08-16","arxiv_id":"2308.08198","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"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) · 0 unverified","sample_list":"/paper/desco-towards-generalizable-and-scalable-deep#ran","syntology_url":"https://syntology.ai/paper/2308.08198","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.08198"}},"official":{"repos":["fuvty/DeSCo"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/s-mixup-structural-mixup-for-graph-neural","slug":"s-mixup-structural-mixup-for-graph-neural","title":"S-Mixup: Structural Mixup for Graph Neural Networks","date":"2023-08-16","arxiv_id":"2308.08097","repositories_listed":1,"syntology":null},{"url":"/paper/sr-hgn-semantic-and-relation-aware","slug":"sr-hgn-semantic-and-relation-aware","title":"SR-HGN: semantic- and relation-aware heterogeneous graph neural network","date":"2023-08-15","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/rlsac-reinforcement-learning-enhanced-sample","slug":"rlsac-reinforcement-learning-enhanced-sample","title":"RLSAC: Reinforcement Learning enhanced Sample Consensus for End-to-End Robust Estimation","date":"2023-08-10","arxiv_id":"2308.05318","repositories_listed":1,"syntology":null},{"url":"/paper/kairos-practical-intrusion-detection-and","slug":"kairos-practical-intrusion-detection-and","title":"Kairos: Practical Intrusion Detection and Investigation using Whole-system Provenance","date":"2023-08-09","arxiv_id":"2308.05034","repositories_listed":1,"syntology":{"n":12,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":12,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/kairos-practical-intrusion-detection-and#ran","syntology_url":"https://syntology.ai/paper/2308.05034","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.05034"}},"official":{"repos":["provenanceanalytics/kairos"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-a-graph-neural-network-with-cross","slug":"learning-a-graph-neural-network-with-cross","title":"Learning a Graph Neural Network with Cross Modality Interaction for Image Fusion","date":"2023-08-07","arxiv_id":"2308.03256","repositories_listed":1,"syntology":null},{"url":"/paper/sem-gat-explainable-semantic-pose-estimation","slug":"sem-gat-explainable-semantic-pose-estimation","title":"SEM-GAT: Explainable Semantic Pose Estimation using Learned Graph Attention","date":"2023-08-07","arxiv_id":"2308.03718","repositories_listed":1,"syntology":null},{"url":"/paper/a-graphical-approach-to-document-layout","slug":"a-graphical-approach-to-document-layout","title":"A Graphical Approach to Document Layout Analysis","date":"2023-08-03","arxiv_id":"2308.02051","repositories_listed":1,"syntology":null},{"url":"/paper/challenging-the-myth-of-graph-collaborative","slug":"challenging-the-myth-of-graph-collaborative","title":"Challenging the Myth of Graph Collaborative Filtering: a Reasoned and Reproducibility-driven Analysis","date":"2023-08-01","arxiv_id":"2308.00404","repositories_listed":1,"syntology":null},{"url":"/paper/multi-modal-graph-neural-network-for-early","slug":"multi-modal-graph-neural-network-for-early","title":"Multi-modal Graph Neural Network for Early Diagnosis of Alzheimer's Disease from sMRI and PET Scans","date":"2023-07-31","arxiv_id":"2307.16366","repositories_listed":1,"syntology":null},{"url":"/paper/robust-vertebra-identification-using","slug":"robust-vertebra-identification-using","title":"Robust vertebra identification using simultaneous node and edge predicting Graph Neural Networks","date":"2023-07-27","arxiv_id":"2308.02509","repositories_listed":1,"syntology":null},{"url":"/paper/timegnn-temporal-dynamic-graph-learning-for","slug":"timegnn-temporal-dynamic-graph-learning-for","title":"TimeGNN: Temporal Dynamic Graph Learning for Time Series Forecasting","date":"2023-07-27","arxiv_id":"2307.14680","repositories_listed":1,"syntology":null},{"url":"/paper/improving-reliable-navigation-under","slug":"improving-reliable-navigation-under","title":"Improving Reliable Navigation under Uncertainty via Predictions Informed by Non-Local Information","date":"2023-07-26","arxiv_id":"2307.14501","repositories_listed":1,"syntology":null},{"url":"/paper/finding-money-launderers-using-heterogeneous","slug":"finding-money-launderers-using-heterogeneous","title":"Finding Money Launderers Using Heterogeneous Graph Neural Networks","date":"2023-07-25","arxiv_id":"2307.13499","repositories_listed":1,"syntology":null},{"url":"/paper/synthetic-pre-training-for-neural-network","slug":"synthetic-pre-training-for-neural-network","title":"Synthetic pre-training for neural-network interatomic potentials","date":"2023-07-24","arxiv_id":"2307.15714","repositories_listed":1,"syntology":null},{"url":"/paper/echoglad-hierarchical-graph-neural-networks","slug":"echoglad-hierarchical-graph-neural-networks","title":"EchoGLAD: Hierarchical Graph Neural Networks for Left Ventricle Landmark Detection on Echocardiograms","date":"2023-07-23","arxiv_id":"2307.12229","repositories_listed":1,"syntology":null},{"url":"/paper/a-novel-unsupervised-graph-wavelet","slug":"a-novel-unsupervised-graph-wavelet","title":"A Novel Unsupervised Graph Wavelet Autoencoder for Mechanical System Fault Detection","date":"2023-07-20","arxiv_id":"2307.10676","repositories_listed":1,"syntology":null},{"url":"/paper/air-traffic-controller-workload-level","slug":"air-traffic-controller-workload-level","title":"Air Traffic Controller Workload Level Prediction using Conformalized Dynamical Graph Learning","date":"2023-07-20","arxiv_id":"2307.10559","repositories_listed":1,"syntology":null},{"url":"/paper/performance-issue-identification-in-cloud","slug":"performance-issue-identification-in-cloud","title":"Identifying Performance Issues in Cloud Service Systems Based on Relational-Temporal Features","date":"2023-07-20","arxiv_id":"2307.10869","repositories_listed":1,"syntology":null},{"url":"/paper/detecting-vulnerable-nodes-in-urban","slug":"detecting-vulnerable-nodes-in-urban","title":"Detecting Vulnerable Nodes in Urban Infrastructure Interdependent Network","date":"2023-07-19","arxiv_id":"2307.09866","repositories_listed":1,"syntology":null},{"url":"/paper/how-curvature-enhance-the-adaptation-power-of","slug":"how-curvature-enhance-the-adaptation-power-of","title":"How Curvature Enhance the Adaptation Power of Framelet GCNs","date":"2023-07-19","arxiv_id":"2307.09768","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/how-curvature-enhance-the-adaptation-power-of#ran","syntology_url":"https://syntology.ai/paper/2307.09768","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.09768"}},"official":{"repos":["dshi3553usyd/curvature_enhanced_graph_convolution"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/anticipating-technical-expertise-and","slug":"anticipating-technical-expertise-and","title":"Anticipating Technical Expertise and Capability Evolution in Research Communities using Dynamic Graph Transformers","date":"2023-07-18","arxiv_id":"2307.09665","repositories_listed":1,"syntology":null},{"url":"/paper/correlation-aware-spatial-temporal-graph","slug":"correlation-aware-spatial-temporal-graph","title":"Correlation-aware Spatial-Temporal Graph Learning for Multivariate Time-series Anomaly Detection","date":"2023-07-17","arxiv_id":"2307.08390","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/correlation-aware-spatial-temporal-graph#ran","syntology_url":"https://syntology.ai/paper/2307.08390","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.08390"}},"official":{"repos":["huankoh/cst-gl"],"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/latent-space-representations-of-neural","slug":"latent-space-representations-of-neural","title":"Latent Space Representations of Neural Algorithmic Reasoners","date":"2023-07-17","arxiv_id":"2307.08874","repositories_listed":1,"syntology":null},{"url":"/paper/polygnn-polyhedron-based-graph-neural-network","slug":"polygnn-polyhedron-based-graph-neural-network","title":"PolyGNN: Polyhedron-based Graph Neural Network for 3D Building Reconstruction from Point Clouds","date":"2023-07-17","arxiv_id":"2307.08636","repositories_listed":1,"syntology":null},{"url":"/paper/regexplainer-generating-explanations-for","slug":"regexplainer-generating-explanations-for","title":"RegExplainer: Generating Explanations for Graph Neural Networks in Regression Tasks","date":"2023-07-15","arxiv_id":"2307.07840","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":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/regexplainer-generating-explanations-for#ran","syntology_url":"https://syntology.ai/paper/2307.07840","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.07840"}},"official":{"repos":["jz48/regexplainer"],"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/maxcorrmgnn-a-multi-graph-neural-network","slug":"maxcorrmgnn-a-multi-graph-neural-network","title":"MaxCorrMGNN: A Multi-Graph Neural Network Framework for Generalized Multimodal Fusion of Medical Data for Outcome Prediction","date":"2023-07-13","arxiv_id":"2307.07093","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/maxcorrmgnn-a-multi-graph-neural-network#ran","syntology_url":"https://syntology.ai/paper/2307.07093","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.07093"}},"official":null}},{"url":"/paper/fis-one-floor-identification-system-with-one","slug":"fis-one-floor-identification-system-with-one","title":"FIS-ONE: Floor Identification System with One Label for Crowdsourced RF Signals","date":"2023-07-12","arxiv_id":"2307.05914","repositories_listed":1,"syntology":null},{"url":"/paper/intrinsically-motivated-graph-exploration","slug":"intrinsically-motivated-graph-exploration","title":"Intrinsically motivated graph exploration using network theories of human curiosity","date":"2023-07-11","arxiv_id":"2307.04962","repositories_listed":1,"syntology":null},{"url":"/paper/learning-from-heterogeneity-a-dynamic","slug":"learning-from-heterogeneity-a-dynamic","title":"Learning from Heterogeneity: A Dynamic Learning Framework for Hypergraphs","date":"2023-07-07","arxiv_id":"2307.03411","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-multimodal-approaches-for-alzheimer","slug":"exploring-multimodal-approaches-for-alzheimer","title":"Exploring Multimodal Approaches for Alzheimer's Disease Detection Using Patient Speech Transcript and Audio Data","date":"2023-07-05","arxiv_id":"2307.02514","repositories_listed":1,"syntology":null},{"url":"/paper/a-versatile-deep-learning-based-protein","slug":"a-versatile-deep-learning-based-protein","title":"PIGNet2: A Versatile Deep Learning-based Protein-Ligand Interaction Prediction Model for Binding Affinity Scoring and Virtual Screening","date":"2023-07-03","arxiv_id":"2307.01066","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-network-based-log-anomaly","slug":"graph-neural-network-based-log-anomaly","title":"Graph Neural Networks based Log Anomaly Detection and Explanation","date":"2023-07-02","arxiv_id":"2307.00527","repositories_listed":1,"syntology":null},{"url":"/paper/a-neural-separation-algorithm-for-the-rounded","slug":"a-neural-separation-algorithm-for-the-rounded","title":"A Neural Separation Algorithm for the Rounded Capacity Inequalities","date":"2023-06-29","arxiv_id":"2306.17283","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/a-neural-separation-algorithm-for-the-rounded#ran","syntology_url":"https://syntology.ai/paper/2306.17283","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.17283"}},"official":{"repos":["hyeonahkimm/neuralsep"],"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/learning-dynamic-graphs-from-all-contextual","slug":"learning-dynamic-graphs-from-all-contextual","title":"Learning Dynamic Graphs from All Contextual Information for Accurate Point-of-Interest Visit Forecasting","date":"2023-06-28","arxiv_id":"2306.15927","repositories_listed":1,"syntology":null},{"url":"/paper/torsion-graph-neural-networks","slug":"torsion-graph-neural-networks","title":"Torsion Graph Neural Networks","date":"2023-06-23","arxiv_id":"2306.13541","repositories_listed":1,"syntology":null},{"url":"/paper/dgc-gnn-descriptor-free-geometric-color-graph","slug":"dgc-gnn-descriptor-free-geometric-color-graph","title":"DGC-GNN: Leveraging Geometry and Color Cues for Visual Descriptor-Free 2D-3D Matching","date":"2023-06-21","arxiv_id":"2306.12547","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/dgc-gnn-descriptor-free-geometric-color-graph#ran","syntology_url":"https://syntology.ai/paper/2306.12547","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.12547"}},"official":{"repos":["aaltovision/dgc-gnn-release"],"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-heterophily-aware-graph-neural","slug":"spatial-heterophily-aware-graph-neural","title":"Spatial Heterophily Aware Graph Neural Networks","date":"2023-06-21","arxiv_id":"2306.12139","repositories_listed":1,"syntology":null},{"url":"/paper/learning-models-of-adversarial-agent-behavior","slug":"learning-models-of-adversarial-agent-behavior","title":"Learning Models of Adversarial Agent Behavior under Partial Observability","date":"2023-06-19","arxiv_id":"2306.11168","repositories_listed":1,"syntology":null},{"url":"/paper/nar-former-v2-rethinking-transformer-for-1","slug":"nar-former-v2-rethinking-transformer-for-1","title":"NAR-Former V2: Rethinking Transformer for Universal Neural Network Representation Learning","date":"2023-06-19","arxiv_id":"2306.10792","repositories_listed":1,"syntology":{"n":15,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/nar-former-v2-rethinking-transformer-for-1#ran","syntology_url":"https://syntology.ai/paper/2306.10792","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.10792"}},"official":{"repos":["yuny220/NAR-Former-V2"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/bkd-fedgnn-a-benchmark-for-classification","slug":"bkd-fedgnn-a-benchmark-for-classification","title":"Bkd-FedGNN: A Benchmark for Classification Backdoor Attacks on Federated Graph Neural Network","date":"2023-06-17","arxiv_id":"2306.10351","repositories_listed":1,"syntology":null},{"url":"/paper/from-hypergraph-energy-functions-to","slug":"from-hypergraph-energy-functions-to","title":"From Hypergraph Energy Functions to Hypergraph Neural Networks","date":"2023-06-16","arxiv_id":"2306.09623","repositories_listed":1,"syntology":{"n":12,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"7 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; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/from-hypergraph-energy-functions-to#ran","syntology_url":"https://syntology.ai/paper/2306.09623","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.09623"}},"official":{"repos":["yxzwang/phenomnn"],"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":["found_in_text","official"]}}},{"url":"/paper/uncertainty-quantification-via-spatial","slug":"uncertainty-quantification-via-spatial","title":"Uncertainty Quantification via Spatial-Temporal Tweedie Model for Zero-inflated and Long-tail Travel Demand Prediction","date":"2023-06-16","arxiv_id":"2306.09882","repositories_listed":1,"syntology":null},{"url":"/paper/multi-temporal-relationship-inference-in","slug":"multi-temporal-relationship-inference-in","title":"Multi-Temporal Relationship Inference in Urban Areas","date":"2023-06-15","arxiv_id":"2306.08921","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-resource-management-for-dynamic-mec","slug":"scalable-resource-management-for-dynamic-mec","title":"Scalable Resource Management for Dynamic MEC: An Unsupervised Link-Output Graph Neural Network Approach","date":"2023-06-15","arxiv_id":"2306.08938","repositories_listed":1,"syntology":null},{"url":"/paper/why-using-either-aggregated-features-or","slug":"why-using-either-aggregated-features-or","title":"A Simple and Scalable Graph Neural Network for Large Directed Graphs","date":"2023-06-14","arxiv_id":"2306.08274","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":2,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/why-using-either-aggregated-features-or#ran","syntology_url":"https://syntology.ai/paper/2306.08274","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.08274"}},"official":{"repos":["seijimaekawa/a2dug"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/von-mises-mixture-distributions-for-molecular","slug":"von-mises-mixture-distributions-for-molecular","title":"Von Mises Mixture Distributions for Molecular Conformation Generation","date":"2023-06-13","arxiv_id":"2306.07472","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":3,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"4 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/von-mises-mixture-distributions-for-molecular#ran","syntology_url":"https://syntology.ai/paper/2306.07472","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.07472"}},"official":{"repos":["thejonaslab/vonmises-icml-2023"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/livable-exploring-long-tailed-classification","slug":"livable-exploring-long-tailed-classification","title":"LIVABLE: Exploring Long-Tailed Classification of Software Vulnerability Types","date":"2023-06-12","arxiv_id":"2306.06935","repositories_listed":1,"syntology":null},{"url":"/paper/finding-hamiltonian-cycles-with-graph-neural","slug":"finding-hamiltonian-cycles-with-graph-neural","title":"Finding Hamiltonian cycles with graph neural networks","date":"2023-06-10","arxiv_id":"2306.06523","repositories_listed":1,"syntology":null},{"url":"/paper/a-dynamical-graph-prior-for-relational","slug":"a-dynamical-graph-prior-for-relational","title":"A Graph Dynamics Prior for Relational Inference","date":"2023-06-09","arxiv_id":"2306.06041","repositories_listed":1,"syntology":null},{"url":"/paper/comprehensive-evaluation-of-deep-and-graph","slug":"comprehensive-evaluation-of-deep-and-graph","title":"Comprehensive evaluation of deep and graph learning on drug-drug interactions prediction","date":"2023-06-08","arxiv_id":"2306.05257","repositories_listed":1,"syntology":null},{"url":"/paper/vig-unet-vision-graph-neural-networks-for","slug":"vig-unet-vision-graph-neural-networks-for","title":"ViG-UNet: Vision Graph Neural Networks for Medical Image Segmentation","date":"2023-06-08","arxiv_id":"2306.04905","repositories_listed":1,"syntology":null}],"record_sha256":"19799c61d9c028a505aa2378ae0c0446b73bd83c1d53c20fc3724dfa3e455050","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}