{"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-learning/papers/5","list_of":"/task/graph-learning","task":"Graph Learning","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":5,"pages_in_order":16,"rows_per_page":100,"rows":[401,500],"of":1570,"counts":{"archive_papers_tagged":1570,"with_a_code_link":686,"where_syntology_ran_a_sample":193,"not_listed_spam_title":0,"listed":1570,"listed_where_code_ran":193,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":162,"every_run_a_failure_of_syntologys_instrument":31,"listed_with_a_run_with_no_instrument_failure":162,"listed_every_run_a_failure_of_syntologys_instrument":31,"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-learning","prev":"/task/graph-learning/papers/4","next":"/task/graph-learning/papers/6","papers":[{"url":"/paper/graphcleaner-detecting-mislabelled-samples-in","slug":"graphcleaner-detecting-mislabelled-samples-in","title":"GraphCleaner: Detecting Mislabelled Samples in Popular Graph Learning Benchmarks","date":"2023-05-30","arxiv_id":"2306.00015","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graphcleaner-detecting-mislabelled-samples-in#ran","syntology_url":"https://syntology.ai/paper/2306.00015","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.00015"}},"official":{"repos":["lywww/graphcleaner"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-strong-graph-neural-networks-with","slug":"learning-strong-graph-neural-networks-with","title":"Learning Strong Graph Neural Networks with Weak Information","date":"2023-05-29","arxiv_id":"2305.18457","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-strong-graph-neural-networks-with#ran","syntology_url":"https://syntology.ai/paper/2305.18457","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.18457"}},"official":{"repos":["yixinliu233/d2pt"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/confidence-based-feature-imputation-for","slug":"confidence-based-feature-imputation-for","title":"Confidence-Based Feature Imputation for Graphs with Partially Known Features","date":"2023-05-26","arxiv_id":"2305.16618","repositories_listed":1,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":5,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/confidence-based-feature-imputation-for#ran","syntology_url":"https://syntology.ai/paper/2305.16618","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.16618"}},"official":{"repos":["daehoum1/pcfi"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-neural-convection-diffusion-with","slug":"graph-neural-convection-diffusion-with","title":"Graph Neural Convection-Diffusion with Heterophily","date":"2023-05-26","arxiv_id":"2305.16780","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":3,"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/graph-neural-convection-diffusion-with#ran","syntology_url":"https://syntology.ai/paper/2305.16780","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.16780"}},"official":{"repos":["zknus/graph-diffusion-cde"],"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/continual-learning-on-dynamic-graphs-via","slug":"continual-learning-on-dynamic-graphs-via","title":"Continual Learning on Dynamic Graphs via Parameter Isolation","date":"2023-05-23","arxiv_id":"2305.13825","repositories_listed":1,"syntology":null},{"url":"/paper/graph-propagation-transformer-for-graph","slug":"graph-propagation-transformer-for-graph","title":"Graph Propagation Transformer for Graph Representation Learning","date":"2023-05-19","arxiv_id":"2305.11424","repositories_listed":1,"syntology":{"n":8,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":8,"phrase":"4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/graph-propagation-transformer-for-graph#ran","syntology_url":"https://syntology.ai/paper/2305.11424","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.11424"}},"official":{"repos":["czczup/gptrans"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/fedhgn-a-federated-framework-for","slug":"fedhgn-a-federated-framework-for","title":"FedHGN: A Federated Framework for Heterogeneous Graph Neural Networks","date":"2023-05-16","arxiv_id":"2305.09729","repositories_listed":1,"syntology":null},{"url":"/paper/fisher-information-embedding-for-node-and","slug":"fisher-information-embedding-for-node-and","title":"Fisher Information Embedding for Node and Graph Learning","date":"2023-05-12","arxiv_id":"2305.07580","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fisher-information-embedding-for-node-and#ran","syntology_url":"https://syntology.ai/paper/2305.07580","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.07580"}},"official":{"repos":["BorgwardtLab/fisher_information_embedding"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/joint-graph-learning-and-model-fitting-in","slug":"joint-graph-learning-and-model-fitting-in","title":"Joint Graph Learning and Model Fitting in Laplacian Regularized Stratified Models","date":"2023-05-04","arxiv_id":"2305.02573","repositories_listed":1,"syntology":null},{"url":"/paper/tsgcnext-dynamic-static-multi-graph","slug":"tsgcnext-dynamic-static-multi-graph","title":"TSGCNeXt: Dynamic-Static Multi-Graph Convolution for Efficient Skeleton-Based Action Recognition with Long-term Learning Potential","date":"2023-04-23","arxiv_id":"2304.11631","repositories_listed":1,"syntology":null},{"url":"/paper/rs2g-data-driven-scene-graph-extraction-and","slug":"rs2g-data-driven-scene-graph-extraction-and","title":"RS2G: Data-Driven Scene-Graph Extraction and Embedding for Robust Autonomous Perception and Scenario Understanding","date":"2023-04-17","arxiv_id":"2304.08600","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/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/cafin-centrality-aware-fairness-inducing-in","slug":"cafin-centrality-aware-fairness-inducing-in","title":"CAFIN: Centrality Aware Fairness inducing IN-processing for Unsupervised Representation Learning on Graphs","date":"2023-04-10","arxiv_id":"2304.04391","repositories_listed":1,"syntology":null},{"url":"/paper/graph-toolformer-to-empower-llms-with-graph","slug":"graph-toolformer-to-empower-llms-with-graph","title":"Graph-ToolFormer: To Empower LLMs with Graph Reasoning Ability via Prompt Dataset Augmented by ChatGPT","date":"2023-04-10","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/graph-toolformer-to-empower-llms-with-graph-1","slug":"graph-toolformer-to-empower-llms-with-graph-1","title":"Graph-ToolFormer: To Empower LLMs with Graph Reasoning Ability via Prompt Augmented by ChatGPT","date":"2023-04-10","arxiv_id":"2304.11116","repositories_listed":1,"syntology":null},{"url":"/paper/selformer-molecular-representation-learning","slug":"selformer-molecular-representation-learning","title":"SELFormer: Molecular Representation Learning via SELFIES Language Models","date":"2023-04-10","arxiv_id":"2304.04662","repositories_listed":1,"syntology":null},{"url":"/paper/inductive-graph-unlearning","slug":"inductive-graph-unlearning","title":"Inductive Graph Unlearning","date":"2023-04-06","arxiv_id":"2304.03093","repositories_listed":1,"syntology":null},{"url":"/paper/topological-pooling-on-graphs","slug":"topological-pooling-on-graphs","title":"Topological Pooling on Graphs","date":"2023-03-25","arxiv_id":"2303.14543","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/easydgl-encode-train-and-interpret-for","slug":"easydgl-encode-train-and-interpret-for","title":"EasyDGL: Encode, Train and Interpret for Continuous-time Dynamic Graph Learning","date":"2023-03-22","arxiv_id":"2303.12341","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"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) · 1 unverified","sample_list":"/paper/easydgl-encode-train-and-interpret-for#ran","syntology_url":"https://syntology.ai/paper/2303.12341","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.12341"}},"official":{"repos":["cchao0116/EasyDGL"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/dg-trans-dual-level-graph-transformer-for","slug":"dg-trans-dual-level-graph-transformer-for","title":"DG-Trans: Dual-level Graph Transformer for Spatiotemporal Incident Impact Prediction on Traffic Networks","date":"2023-03-21","arxiv_id":"2303.12238","repositories_listed":1,"syntology":null},{"url":"/paper/dynamically-expandable-graph-convolution-for","slug":"dynamically-expandable-graph-convolution-for","title":"Dynamically Expandable Graph Convolution for Streaming Recommendation","date":"2023-03-21","arxiv_id":"2303.11700","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/dynamically-expandable-graph-convolution-for#ran","syntology_url":"https://syntology.ai/paper/2303.11700","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.11700"}},"official":{"repos":["bokwaiho/degc"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/efficiently-counting-substructures-by","slug":"efficiently-counting-substructures-by","title":"An Efficient Subgraph GNN with Provable Substructure Counting Power","date":"2023-03-19","arxiv_id":"2303.10576","repositories_listed":1,"syntology":null},{"url":"/paper/spatio-temporal-au-relational-graph","slug":"spatio-temporal-au-relational-graph","title":"Spatio-Temporal AU Relational Graph Representation Learning For Facial Action Units Detection","date":"2023-03-19","arxiv_id":"2303.10644","repositories_listed":1,"syntology":null},{"url":"/paper/siamese-graph-learning-for-semi-supervised","slug":"siamese-graph-learning-for-semi-supervised","title":"Siamese Graph Learning for Semi-supervised Age Estimation","date":"2023-03-13","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/exphormer-sparse-transformers-for-graphs","slug":"exphormer-sparse-transformers-for-graphs","title":"Exphormer: Sparse Transformers for Graphs","date":"2023-03-10","arxiv_id":"2303.06147","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":0,"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/exphormer-sparse-transformers-for-graphs#ran","syntology_url":"https://syntology.ai/paper/2303.06147","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.06147"}},"official":{"repos":["hamed1375/exphormer"],"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/heterogeneous-graph-learning-for-acoustic","slug":"heterogeneous-graph-learning-for-acoustic","title":"Heterogeneous Graph Learning for Acoustic Event Classification","date":"2023-03-05","arxiv_id":"2303.02665","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/fair-attribute-completion-on-graph-with","slug":"fair-attribute-completion-on-graph-with","title":"Fair Attribute Completion on Graph with Missing Attributes","date":"2023-02-25","arxiv_id":"2302.12977","repositories_listed":1,"syntology":null},{"url":"/paper/graph-construction-using-principal-axis-trees","slug":"graph-construction-using-principal-axis-trees","title":"Graph Construction using Principal Axis Trees for Simple Graph Convolution","date":"2023-02-22","arxiv_id":"2302.12000","repositories_listed":1,"syntology":null},{"url":"/paper/random-projection-forest-initialization-for","slug":"random-projection-forest-initialization-for","title":"Random Projection Forest Initialization for Graph Convolutional Networks","date":"2023-02-22","arxiv_id":"2302.12001","repositories_listed":1,"syntology":null},{"url":"/paper/distances-for-markov-chains-and-their","slug":"distances-for-markov-chains-and-their","title":"Distances for Markov Chains, and Their Differentiation","date":"2023-02-16","arxiv_id":"2302.08621","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-graph-laplacian-estimation-by-a","slug":"efficient-graph-laplacian-estimation-by-a","title":"Efficient Graph Laplacian Estimation by Proximal Newton","date":"2023-02-13","arxiv_id":"2302.06434","repositories_listed":1,"syntology":null},{"url":"/paper/outlier-robust-gromov-wasserstein-for-graph-1","slug":"outlier-robust-gromov-wasserstein-for-graph-1","title":"Outlier-Robust Gromov-Wasserstein for Graph Data","date":"2023-02-09","arxiv_id":"2302.04610","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 2 unverified","sample_list":"/paper/outlier-robust-gromov-wasserstein-for-graph-1#ran","syntology_url":"https://syntology.ai/paper/2302.04610","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.04610"}},"official":{"repos":["lmkong020/outlier-robust-gw"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/company-as-tribe-company-financial-risk","slug":"company-as-tribe-company-financial-risk","title":"Company-as-Tribe: Company Financial Risk Assessment on Tribe-Style Graph with Hierarchical Graph Neural Networks","date":"2023-01-31","arxiv_id":"2301.13492","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-dyadic-relations-with-homogeneous","slug":"enhancing-dyadic-relations-with-homogeneous","title":"Enhancing Dyadic Relations with Homogeneous Graphs for Multimodal Recommendation","date":"2023-01-28","arxiv_id":"2301.12097","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-connection-between-mpnn-and-graph","slug":"on-the-connection-between-mpnn-and-graph","title":"On the Connection Between MPNN and Graph Transformer","date":"2023-01-27","arxiv_id":"2301.11956","repositories_listed":1,"syntology":null},{"url":"/paper/causal-bandits-without-graph-learning","slug":"causal-bandits-without-graph-learning","title":"Causal Bandits without Graph Learning","date":"2023-01-26","arxiv_id":"2301.11401","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/causal-bandits-without-graph-learning#ran","syntology_url":"https://syntology.ai/paper/2301.11401","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.11401"}},"official":{"repos":["borealisai/raps"],"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/graph-contrastive-learning-for-skeleton-based","slug":"graph-contrastive-learning-for-skeleton-based","title":"Graph Contrastive Learning for Skeleton-based Action Recognition","date":"2023-01-26","arxiv_id":"2301.10900","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-can-recover-the-hidden","slug":"graph-neural-networks-can-recover-the-hidden","title":"Graph Neural Networks can Recover the Hidden Features Solely from the Graph Structure","date":"2023-01-26","arxiv_id":"2301.10956","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 3 unverified","sample_list":"/paper/graph-neural-networks-can-recover-the-hidden#ran","syntology_url":"https://syntology.ai/paper/2301.10956","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.10956"}},"official":{"repos":["joisino/gnnrecover"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/explainable-multilayer-graph-neural-network","slug":"explainable-multilayer-graph-neural-network","title":"Explainable Multilayer Graph Neural Network for Cancer Gene Prediction","date":"2023-01-20","arxiv_id":"2301.08831","repositories_listed":1,"syntology":null},{"url":"/paper/mg-tar-multi-view-graph-convolutional","slug":"mg-tar-multi-view-graph-convolutional","title":"MG-TAR: Multi-View Graph Convolutional Networks for Traffic Accident Risk Prediction","date":"2023-01-20","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/gipa-a-general-information-propagation","slug":"gipa-a-general-information-propagation","title":"GIPA: A General Information Propagation Algorithm for Graph Learning","date":"2023-01-19","arxiv_id":"2301.08209","repositories_listed":1,"syntology":null},{"url":"/paper/geometric-graph-learning-with-extended-atom","slug":"geometric-graph-learning-with-extended-atom","title":"Geometric Graph Learning with Extended Atom-Types Features for Protein-Ligand Binding Affinity Prediction","date":"2023-01-15","arxiv_id":"2301.06194","repositories_listed":1,"syntology":null},{"url":"/paper/a-comprehensive-survey-of-graph-level","slug":"a-comprehensive-survey-of-graph-level","title":"State of the Art and Potentialities of Graph-level Learning","date":"2023-01-14","arxiv_id":"2301.05860","repositories_listed":1,"syntology":null},{"url":"/paper/autoac-towards-automated-attribute-completion","slug":"autoac-towards-automated-attribute-completion","title":"AutoAC: Towards Automated Attribute Completion for Heterogeneous Graph Neural Network","date":"2023-01-08","arxiv_id":"2301.03049","repositories_listed":1,"syntology":null},{"url":"/paper/reliant-fair-knowledge-distillation-for-graph","slug":"reliant-fair-knowledge-distillation-for-graph","title":"RELIANT: Fair Knowledge Distillation for Graph Neural Networks","date":"2023-01-03","arxiv_id":"2301.01150","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/reliant-fair-knowledge-distillation-for-graph#ran","syntology_url":"https://syntology.ai/paper/2301.01150","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.01150"}},"official":{"repos":["yushundong/reliant"],"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/highly-confident-local-structure-based","slug":"highly-confident-local-structure-based","title":"Highly Confident Local Structure Based Consensus Graph Learning for Incomplete Multi-View Clustering","date":"2023-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/statistical-mechanics-of-generalization-in-1","slug":"statistical-mechanics-of-generalization-in-1","title":"Homophily modulates double descent generalization in graph convolution networks","date":"2022-12-26","arxiv_id":"2212.13069","repositories_listed":1,"syntology":null},{"url":"/paper/deepdfa-dataflow-analysis-guided-efficient","slug":"deepdfa-dataflow-analysis-guided-efficient","title":"Dataflow Analysis-Inspired Deep Learning for Efficient Vulnerability Detection","date":"2022-12-15","arxiv_id":"2212.08108","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":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deepdfa-dataflow-analysis-guided-efficient#ran","syntology_url":"https://syntology.ai/paper/2212.08108","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.08108"}},"official":{"repos":["ISU-PAAL/DeepDFA"],"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/graph-convolutional-networks-for-traffic-1","slug":"graph-convolutional-networks-for-traffic-1","title":"Graph Convolutional Networks for Traffic Forecasting with Missing Values","date":"2022-12-13","arxiv_id":"2212.06419","repositories_listed":1,"syntology":null},{"url":"/paper/megacrn-meta-graph-convolutional-recurrent","slug":"megacrn-meta-graph-convolutional-recurrent","title":"MegaCRN: Meta-Graph Convolutional Recurrent Network for Spatio-Temporal Modeling","date":"2022-12-12","arxiv_id":"2212.05989","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-weight-perturbation-improves-1","slug":"adversarial-weight-perturbation-improves-1","title":"Adversarial Weight Perturbation Improves Generalization in Graph Neural Networks","date":"2022-12-09","arxiv_id":"2212.04983","repositories_listed":1,"syntology":null},{"url":"/paper/graph-learning-indexer-a-contributor-friendly","slug":"graph-learning-indexer-a-contributor-friendly","title":"Graph Learning Indexer: A Contributor-Friendly and Metadata-Rich Platform for Graph Learning Benchmarks","date":"2022-12-08","arxiv_id":"2212.04537","repositories_listed":1,"syntology":null},{"url":"/paper/an-open-unified-deep-graph-learning-framework","slug":"an-open-unified-deep-graph-learning-framework","title":"An open unified deep graph learning framework for discovering drug leads","date":"2022-12-06","arxiv_id":"2301.03424","repositories_listed":1,"syntology":null},{"url":"/paper/joint-graph-learning-from-gaussian","slug":"joint-graph-learning-from-gaussian","title":"Joint graph learning from Gaussian observations in the presence of hidden nodes","date":"2022-12-04","arxiv_id":"2212.01816","repositories_listed":1,"syntology":null},{"url":"/paper/heterogeneous-graph-learning-for-multi-modal","slug":"heterogeneous-graph-learning-for-multi-modal","title":"Heterogeneous Graph Learning for Multi-modal Medical Data Analysis","date":"2022-11-28","arxiv_id":"2211.15158","repositories_listed":1,"syntology":null},{"url":"/paper/spatio-temporal-meta-graph-learning-for","slug":"spatio-temporal-meta-graph-learning-for","title":"Spatio-Temporal Meta-Graph Learning for Traffic Forecasting","date":"2022-11-27","arxiv_id":"2211.14701","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":1,"phrase":"0 ran · 2 unverified","sample_list":"/paper/spatio-temporal-meta-graph-learning-for#ran","syntology_url":"https://syntology.ai/paper/2211.14701","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.14701"}},"official":{"repos":["deepkashiwa20/megacrn"],"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/patchgt-transformer-over-non-trainable","slug":"patchgt-transformer-over-non-trainable","title":"PatchGT: Transformer over Non-trainable Clusters for Learning Graph Representations","date":"2022-11-26","arxiv_id":"2211.14425","repositories_listed":1,"syntology":null},{"url":"/paper/federated-learning-on-non-iid-graphs-via","slug":"federated-learning-on-non-iid-graphs-via","title":"Federated Learning on Non-IID Graphs via Structural Knowledge Sharing","date":"2022-11-23","arxiv_id":"2211.13009","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":4,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 4 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/federated-learning-on-non-iid-graphs-via#ran","syntology_url":"https://syntology.ai/paper/2211.13009","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.13009"}},"official":{"repos":["yuetan031/fedstar"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/from-node-interaction-to-hop-interaction-new","slug":"from-node-interaction-to-hop-interaction-new","title":"From Node Interaction to Hop Interaction: New Effective and Scalable Graph Learning Paradigm","date":"2022-11-21","arxiv_id":"2211.11761","repositories_listed":1,"syntology":null},{"url":"/paper/deepgar-deep-graph-learning-for-analogical","slug":"deepgar-deep-graph-learning-for-analogical","title":"DeepGAR: Deep Graph Learning for Analogical Reasoning","date":"2022-11-19","arxiv_id":"2211.10821","repositories_listed":1,"syntology":null},{"url":"/paper/a-new-graph-node-classification-benchmark","slug":"a-new-graph-node-classification-benchmark","title":"A New Graph Node Classification Benchmark: Learning Structure from Histology Cell Graphs","date":"2022-11-11","arxiv_id":"2211.06292","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/a-new-graph-node-classification-benchmark#ran","syntology_url":"https://syntology.ai/paper/2211.06292","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.06292"}},"official":{"repos":["nellaker-group/placenta"],"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/pygsl-a-graph-structure-learning-toolkit","slug":"pygsl-a-graph-structure-learning-toolkit","title":"pyGSL: A Graph Structure Learning Toolkit","date":"2022-11-07","arxiv_id":"2211.03583","repositories_listed":1,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/pygsl-a-graph-structure-learning-toolkit#ran","syntology_url":"https://syntology.ai/paper/2211.03583","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.03583"}},"official":{"repos":["maxwass/pygsl"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/heterogeneous-trajectory-forecasting-via-risk","slug":"heterogeneous-trajectory-forecasting-via-risk","title":"Heterogeneous Trajectory Forecasting via Risk and Scene Graph Learning","date":"2022-11-02","arxiv_id":"2211.00848","repositories_listed":1,"syntology":null},{"url":"/paper/time-aware-random-walk-diffusion-to-improve","slug":"time-aware-random-walk-diffusion-to-improve","title":"Time-aware Random Walk Diffusion to Improve Dynamic Graph Learning","date":"2022-11-02","arxiv_id":"2211.01214","repositories_listed":1,"syntology":null},{"url":"/paper/towards-relation-centered-pooling-and","slug":"towards-relation-centered-pooling-and","title":"Towards Relation-centered Pooling and Convolution for Heterogeneous Graph Learning Networks","date":"2022-10-31","arxiv_id":"2210.17142","repositories_listed":1,"syntology":null},{"url":"/paper/generalized-laplacian-regularized-framelet","slug":"generalized-laplacian-regularized-framelet","title":"Generalized Laplacian Regularized Framelet Graph Neural Networks","date":"2022-10-27","arxiv_id":"2210.15092","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-on-graph-counterfactual-explanations","slug":"a-survey-on-graph-counterfactual-explanations","title":"A Survey on Graph Counterfactual Explanations: Definitions, Methods, Evaluation, and Research Challenges","date":"2022-10-21","arxiv_id":"2210.12089","repositories_listed":1,"syntology":null},{"url":"/paper/graph-few-shot-learning-with-task-specific","slug":"graph-few-shot-learning-with-task-specific","title":"Graph Few-shot Learning with Task-specific Structures","date":"2022-10-21","arxiv_id":"2210.12130","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"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) · 0 unverified","sample_list":"/paper/graph-few-shot-learning-with-task-specific#ran","syntology_url":"https://syntology.ai/paper/2210.12130","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.12130"}},"official":{"repos":["songw-sw/glitter"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-graphical-factor-models-with","slug":"learning-graphical-factor-models-with","title":"Learning Graphical Factor Models with Riemannian Optimization","date":"2022-10-21","arxiv_id":"2210.11950","repositories_listed":1,"syntology":null},{"url":"/paper/a-practical-progressively-expressive-gnn","slug":"a-practical-progressively-expressive-gnn","title":"A Practical, Progressively-Expressive GNN","date":"2022-10-18","arxiv_id":"2210.09521","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":0,"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/a-practical-progressively-expressive-gnn#ran","syntology_url":"https://syntology.ai/paper/2210.09521","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.09521"}},"official":{"repos":["lingxiaoshawn/kcsetgnn"],"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/intrinsic-dimension-for-large-scale-geometric","slug":"intrinsic-dimension-for-large-scale-geometric","title":"Intrinsic Dimension for Large-Scale Geometric Learning","date":"2022-10-11","arxiv_id":"2210.05301","repositories_listed":1,"syntology":null},{"url":"/paper/association-graph-learning-for-multi-task","slug":"association-graph-learning-for-multi-task","title":"Association Graph Learning for Multi-Task Classification with Category Shifts","date":"2022-10-10","arxiv_id":"2210.04637","repositories_listed":1,"syntology":null},{"url":"/paper/towards-real-time-temporal-graph-learning","slug":"towards-real-time-temporal-graph-learning","title":"Towards Real-Time Temporal Graph Learning","date":"2022-10-08","arxiv_id":"2210.04114","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-mixup-based-graph-learning-for","slug":"enhancing-mixup-based-graph-learning-for","title":"On the Effectiveness of Hybrid Pooling in Mixup-Based Graph Learning for Language Processing","date":"2022-10-06","arxiv_id":"2210.03123","repositories_listed":1,"syntology":null},{"url":"/paper/geodesic-graph-neural-network-for-efficient","slug":"geodesic-graph-neural-network-for-efficient","title":"Geodesic Graph Neural Network for Efficient Graph Representation Learning","date":"2022-10-06","arxiv_id":"2210.02636","repositories_listed":1,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/geodesic-graph-neural-network-for-efficient#ran","syntology_url":"https://syntology.ai/paper/2210.02636","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.02636"}},"official":{"repos":["woodcutter1998/gdgnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/mechretro-is-a-chemical-mechanism-driven","slug":"mechretro-is-a-chemical-mechanism-driven","title":"MechRetro is a chemical-mechanism-driven graph learning framework for interpretable retrosynthesis prediction and pathway planning","date":"2022-10-06","arxiv_id":"2210.02630","repositories_listed":1,"syntology":null},{"url":"/paper/a-framework-for-large-scale-synthetic-graph","slug":"a-framework-for-large-scale-synthetic-graph","title":"A Framework for Large Scale Synthetic Graph Dataset Generation","date":"2022-10-04","arxiv_id":"2210.01944","repositories_listed":1,"syntology":null},{"url":"/paper/gradient-gating-for-deep-multi-rate-learning","slug":"gradient-gating-for-deep-multi-rate-learning","title":"Gradient Gating for Deep Multi-Rate Learning on Graphs","date":"2022-10-02","arxiv_id":"2210.00513","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 3 unverified","sample_list":"/paper/gradient-gating-for-deep-multi-rate-learning#ran","syntology_url":"https://syntology.ai/paper/2210.00513","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.00513"}},"official":{"repos":["tk-rusch/gradientgating"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/dyngl-sdp-dynamic-graph-learning-for-semantic","slug":"dyngl-sdp-dynamic-graph-learning-for-semantic","title":"DynGL-SDP: Dynamic Graph Learning for Semantic Dependency Parsing","date":"2022-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/gradual-weisfeiler-leman-slow-and-steady-wins","slug":"gradual-weisfeiler-leman-slow-and-steady-wins","title":"Gradual Weisfeiler-Leman: Slow and Steady Wins the Race","date":"2022-09-19","arxiv_id":"2209.09048","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-multi-view-clustering-via-unified","slug":"efficient-multi-view-clustering-via-unified","title":"Efficient Multi-view Clustering via Unified and Discrete Bipartite Graph Learning","date":"2022-09-09","arxiv_id":"2209.04187","repositories_listed":1,"syntology":null},{"url":"/paper/fedego-privacy-preserving-personalized","slug":"fedego-privacy-preserving-personalized","title":"FedEgo: Privacy-preserving Personalized Federated Graph Learning with Ego-graphs","date":"2022-08-29","arxiv_id":"2208.13685","repositories_listed":1,"syntology":null},{"url":"/paper/implicit-session-contexts-for-next-item","slug":"implicit-session-contexts-for-next-item","title":"Implicit Session Contexts for Next-Item Recommendations","date":"2022-08-18","arxiv_id":"2208.09076","repositories_listed":1,"syntology":null},{"url":"/paper/position-aware-structure-learning-for-graph","slug":"position-aware-structure-learning-for-graph","title":"Position-aware Structure Learning for Graph Topology-imbalance by Relieving Under-reaching and Over-squashing","date":"2022-08-17","arxiv_id":"2208.08302","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/position-aware-structure-learning-for-graph#ran","syntology_url":"https://syntology.ai/paper/2208.08302","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.08302"}},"official":{"repos":["ringbdstack/pastel"],"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/motif-based-graph-representation-learning","slug":"motif-based-graph-representation-learning","title":"Motif-based Graph Representation Learning with Application to Chemical Molecules","date":"2022-08-09","arxiv_id":"2208.04529","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":1,"phrase":"0 ran · 2 unverified","sample_list":"/paper/motif-based-graph-representation-learning#ran","syntology_url":"https://syntology.ai/paper/2208.04529","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.04529"}},"official":{"repos":["yifeiwang15/motifconv"],"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/semantic-enhanced-text-to-sql-parsing-via","slug":"semantic-enhanced-text-to-sql-parsing-via","title":"Semantic Enhanced Text-to-SQL Parsing via Iteratively Learning Schema Linking Graph","date":"2022-08-08","arxiv_id":"2208.03903","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/semantic-enhanced-text-to-sql-parsing-via#ran","syntology_url":"https://syntology.ai/paper/2208.03903","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.03903"}},"official":{"repos":["thu-bpm/isesl-sql"],"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/sgat-simplicial-graph-attention-network","slug":"sgat-simplicial-graph-attention-network","title":"SGAT: Simplicial Graph Attention Network","date":"2022-07-24","arxiv_id":"2207.11761","repositories_listed":1,"syntology":null},{"url":"/paper/scara-scalable-graph-neural-networks-with","slug":"scara-scalable-graph-neural-networks-with","title":"SCARA: Scalable Graph Neural Networks with Feature-Oriented Optimization","date":"2022-07-19","arxiv_id":"2207.09179","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-feature-selection-method-based","slug":"unsupervised-feature-selection-method-based","title":"Unsupervised feature selection method based on iterative similarity graph factorization and clustering by modularity","date":"2022-07-15","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/differentially-private-graph-learning-via","slug":"differentially-private-graph-learning-via","title":"Differentially Private Graph Learning via Sensitivity-Bounded Personalized PageRank","date":"2022-07-14","arxiv_id":"2207.06944","repositories_listed":1,"syntology":null},{"url":"/paper/wasserstein-multivariate-auto-regressive","slug":"wasserstein-multivariate-auto-regressive","title":"Wasserstein multivariate auto-regressive models for modeling distributional time series","date":"2022-07-12","arxiv_id":"2207.05442","repositories_listed":1,"syntology":null},{"url":"/paper/graph-based-molecular-representation-learning","slug":"graph-based-molecular-representation-learning","title":"Graph-based Molecular Representation Learning","date":"2022-07-08","arxiv_id":"2207.04869","repositories_listed":1,"syntology":null},{"url":"/paper/tf-gnn-graph-neural-networks-in-tensorflow","slug":"tf-gnn-graph-neural-networks-in-tensorflow","title":"TF-GNN: Graph Neural Networks in TensorFlow","date":"2022-07-07","arxiv_id":"2207.03522","repositories_listed":1,"syntology":null},{"url":"/paper/graph-trees-with-attention","slug":"graph-trees-with-attention","title":"TREE-G: Decision Trees Contesting Graph Neural Networks","date":"2022-07-06","arxiv_id":"2207.02760","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/graph-trees-with-attention#ran","syntology_url":"https://syntology.ai/paper/2207.02760","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.02760"}},"official":{"repos":["mayabechlerspeicher/tree-g"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/an-adaptive-graph-learning-method-for","slug":"an-adaptive-graph-learning-method-for","title":"An adaptive graph learning method for automated molecular interactions and properties predictions","date":"2022-06-23","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/autogml-fast-automatic-model-selection-for","slug":"autogml-fast-automatic-model-selection-for","title":"MetaGL: Evaluation-Free Selection of Graph Learning Models via Meta-Learning","date":"2022-06-18","arxiv_id":"2206.09280","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/autogml-fast-automatic-model-selection-for#ran","syntology_url":"https://syntology.ai/paper/2206.09280","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.09280"}},"official":{"repos":["namyongpark/metagl"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/decoupled-dynamic-spatial-temporal-graph","slug":"decoupled-dynamic-spatial-temporal-graph","title":"Decoupled Dynamic Spatial-Temporal Graph Neural Network for Traffic Forecasting","date":"2022-06-18","arxiv_id":"2206.09112","repositories_listed":1,"syntology":null}],"record_sha256":"df44165387a411d369d67e3cc8094ef587b5b3379c691e328a49a442a713bd96","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}