{"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/4","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":4,"pages_in_order":16,"rows_per_page":100,"rows":[301,400],"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/3","next":"/task/graph-learning/papers/5","papers":[{"url":"/paper/mapping-debiasing-graph-neural-networks-for","slug":"mapping-debiasing-graph-neural-networks-for","title":"MAPPING: Debiasing Graph Neural Networks for Fair Node Classification with Limited Sensitive Information Leakage","date":"2024-01-23","arxiv_id":"2401.12824","repositories_listed":1,"syntology":null},{"url":"/paper/fedgta-topology-aware-averaging-for-federated","slug":"fedgta-topology-aware-averaging-for-federated","title":"FedGTA: Topology-aware Averaging for Federated Graph Learning","date":"2024-01-22","arxiv_id":"2401.11755","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":6,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fedgta-topology-aware-averaging-for-federated#ran","syntology_url":"https://syntology.ai/paper/2401.11755","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.11755"}},"official":{"repos":["xkli-allen/fedgta"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/tensor-view-topological-graph-neural-network","slug":"tensor-view-topological-graph-neural-network","title":"Tensor-view Topological Graph Neural Network","date":"2024-01-22","arxiv_id":"2401.12007","repositories_listed":1,"syntology":null},{"url":"/paper/disentangled-condensation-for-large-scale","slug":"disentangled-condensation-for-large-scale","title":"Disentangled Condensation for Large-scale Graphs","date":"2024-01-18","arxiv_id":"2401.12231","repositories_listed":1,"syntology":null},{"url":"/paper/infinite-horizon-graph-filters-leveraging","slug":"infinite-horizon-graph-filters-leveraging","title":"Infinite-Horizon Graph Filters: Leveraging Power Series to Enhance Sparse Information Aggregation","date":"2024-01-18","arxiv_id":"2401.09943","repositories_listed":1,"syntology":null},{"url":"/paper/towards-principled-graph-transformers","slug":"towards-principled-graph-transformers","title":"Towards Principled Graph Transformers","date":"2024-01-18","arxiv_id":"2401.10119","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-principled-graph-transformers#ran","syntology_url":"https://syntology.ai/paper/2401.10119","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.10119"}},"official":{"repos":["luis-mueller/towards-principled-gts"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/beyond-weisfeiler-lehman-a-quantitative","slug":"beyond-weisfeiler-lehman-a-quantitative","title":"Beyond Weisfeiler-Lehman: A Quantitative Framework for GNN Expressiveness","date":"2024-01-16","arxiv_id":"2401.08514","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":3,"phrase":"0 ran · 3 unverified","sample_list":"/paper/beyond-weisfeiler-lehman-a-quantitative#ran","syntology_url":"https://syntology.ai/paper/2401.08514","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.08514"}},"official":{"repos":["subgraph23/homomorphism-expressivity"],"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/temporal-link-prediction-using-graph","slug":"temporal-link-prediction-using-graph","title":"Temporal Link Prediction Using Graph Embedding Dynamics","date":"2024-01-15","arxiv_id":"2401.07516","repositories_listed":1,"syntology":null},{"url":"/paper/wavelet-inspired-multiscale-graph","slug":"wavelet-inspired-multiscale-graph","title":"Wavelet-Inspired Multiscale Graph Convolutional Recurrent Network for Traffic Forecasting","date":"2024-01-11","arxiv_id":"2401.06040","repositories_listed":1,"syntology":null},{"url":"/paper/dgdnn-decoupled-graph-diffusion-neural","slug":"dgdnn-decoupled-graph-diffusion-neural","title":"DGDNN: Decoupled Graph Diffusion Neural Network for Stock Movement Prediction","date":"2024-01-03","arxiv_id":"2401.01846","repositories_listed":1,"syntology":null},{"url":"/paper/tumor-micro-environment-interactions-guided","slug":"tumor-micro-environment-interactions-guided","title":"Tumor Micro-environment Interactions Guided Graph Learning for Survival Analysis of Human Cancers from Whole-slide Pathological Images","date":"2024-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/graphgpt-graph-learning-with-generative-pre","slug":"graphgpt-graph-learning-with-generative-pre","title":"GraphGPT: Graph Learning with Generative Pre-trained Transformers","date":"2023-12-31","arxiv_id":"2401.00529","repositories_listed":1,"syntology":null},{"url":"/paper/graph-learning-in-4d-a-quaternion-valued","slug":"graph-learning-in-4d-a-quaternion-valued","title":"Graph Learning in 4D: a Quaternion-valued Laplacian to Enhance Spectral GCNs","date":"2023-12-28","arxiv_id":"2312.17361","repositories_listed":1,"syntology":null},{"url":"/paper/tspp-a-unified-benchmarking-tool-for-time","slug":"tspp-a-unified-benchmarking-tool-for-time","title":"TSPP: A Unified Benchmarking Tool for Time-series Forecasting","date":"2023-12-28","arxiv_id":"2312.17100","repositories_listed":1,"syntology":null},{"url":"/paper/lgmrec-local-and-global-graph-learning-for","slug":"lgmrec-local-and-global-graph-learning-for","title":"LGMRec: Local and Global Graph Learning for Multimodal Recommendation","date":"2023-12-27","arxiv_id":"2312.16400","repositories_listed":1,"syntology":null},{"url":"/paper/puma-efficient-continual-graph-learning-with","slug":"puma-efficient-continual-graph-learning-with","title":"PUMA: Efficient Continual Graph Learning for Node Classification with Graph Condensation","date":"2023-12-22","arxiv_id":"2312.14439","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":1,"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/puma-efficient-continual-graph-learning-with#ran","syntology_url":"https://syntology.ai/paper/2312.14439","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.14439"}},"official":{"repos":["superallen13/puma"],"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/fine-tuning-graph-neural-networks-by","slug":"fine-tuning-graph-neural-networks-by","title":"Fine-tuning Graph Neural Networks by Preserving Graph Generative Patterns","date":"2023-12-21","arxiv_id":"2312.13583","repositories_listed":1,"syntology":{"n":13,"n_ran":13,"n_constructed":0,"n_ran_checked":12,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":1,"n_no_contract":9,"n_pointer_only":13,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 2 honoured, 1 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fine-tuning-graph-neural-networks-by#ran","syntology_url":"https://syntology.ai/paper/2312.13583","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.13583"}},"official":{"repos":["zjunet/G-Tuning"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dynamic-frequency-domain-graph-convolutional","slug":"dynamic-frequency-domain-graph-convolutional","title":"Dynamic Frequency Domain Graph Convolutional Network for Traffic Forecasting","date":"2023-12-19","arxiv_id":"2312.11933","repositories_listed":1,"syntology":null},{"url":"/paper/graph-transformers-for-large-graphs","slug":"graph-transformers-for-large-graphs","title":"Graph Transformers for Large Graphs","date":"2023-12-18","arxiv_id":"2312.11109","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":5,"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/graph-transformers-for-large-graphs#ran","syntology_url":"https://syntology.ai/paper/2312.11109","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.11109"}},"official":{"repos":["snap-research/largegt"],"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/multi-level-graph-learning-for-audio-event","slug":"multi-level-graph-learning-for-audio-event","title":"Multi-level graph learning for audio event classification and human-perceived annoyance rating prediction","date":"2023-12-15","arxiv_id":"2312.09952","repositories_listed":1,"syntology":null},{"url":"/paper/robust-graph-neural-network-based-on-graph","slug":"robust-graph-neural-network-based-on-graph","title":"Robust Graph Neural Network based on Graph Denoising","date":"2023-12-11","arxiv_id":"2312.06557","repositories_listed":1,"syntology":null},{"url":"/paper/gnnflow-a-distributed-framework-for-1","slug":"gnnflow-a-distributed-framework-for-1","title":"GNNFlow: A Distributed Framework for Continuous Temporal GNN Learning on Dynamic Graphs","date":"2023-11-29","arxiv_id":"2311.17410","repositories_listed":1,"syntology":null},{"url":"/paper/cycle-invariant-positional-encoding-for-graph","slug":"cycle-invariant-positional-encoding-for-graph","title":"Cycle Invariant Positional Encoding for Graph Representation Learning","date":"2023-11-24","arxiv_id":"2311.14333","repositories_listed":1,"syntology":null},{"url":"/paper/environment-aware-dynamic-graph-learning-for-1","slug":"environment-aware-dynamic-graph-learning-for-1","title":"Environment-Aware Dynamic Graph Learning for Out-of-Distribution Generalization","date":"2023-11-18","arxiv_id":"2311.11114","repositories_listed":1,"syntology":{"n":37,"n_ran":28,"n_constructed":5,"n_ran_checked":25,"n_instrument":3,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":25,"n_pointer_only":25,"phrase":"28 ran (of which 5 constructed an object rather than computing a result; 25 with no instrument failure: 0 honoured, 0 violated, 25 with no contract checked; 3 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/environment-aware-dynamic-graph-learning-for-1#ran","syntology_url":"https://syntology.ai/paper/2311.11114","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.11114"}},"official":{"repos":["ringbdstack/eagle"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/correlation-distance-graph-learning-for","slug":"correlation-distance-graph-learning-for","title":"Correlation-Distance Graph Learning for Treatment Response Prediction from rs-fMRI","date":"2023-11-17","arxiv_id":"2311.10463","repositories_listed":1,"syntology":null},{"url":"/paper/effective-in-vehicle-intrusion-detection-via","slug":"effective-in-vehicle-intrusion-detection-via","title":"STATGRAPH: Effective In-vehicle Intrusion Detection via Multi-view Statistical Graph Learning","date":"2023-11-13","arxiv_id":"2311.07056","repositories_listed":1,"syntology":null},{"url":"/paper/verilog-to-pyg-a-framework-for-graph-learning","slug":"verilog-to-pyg-a-framework-for-graph-learning","title":"Verilog-to-PyG -- A Framework for Graph Learning and Augmentation on RTL Designs","date":"2023-11-09","arxiv_id":"2311.05722","repositories_listed":1,"syntology":null},{"url":"/paper/its-all-graph-to-me-foundational-topology","slug":"its-all-graph-to-me-foundational-topology","title":"Topology Only Pre-Training: Towards Generalised Multi-Domain Graph Models","date":"2023-11-07","arxiv_id":"2311.03976","repositories_listed":1,"syntology":null},{"url":"/paper/apgl4sr-a-generic-framework-with-adaptive-and","slug":"apgl4sr-a-generic-framework-with-adaptive-and","title":"APGL4SR: A Generic Framework with Adaptive and Personalized Global Collaborative Information in Sequential Recommendation","date":"2023-11-06","arxiv_id":"2311.02816","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/apgl4sr-a-generic-framework-with-adaptive-and#ran","syntology_url":"https://syntology.ai/paper/2311.02816","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.02816"}},"official":{"repos":["graph-team/apgl4sr"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/architecture-matters-uncovering-implicit-1","slug":"architecture-matters-uncovering-implicit-1","title":"Architecture Matters: Uncovering Implicit Mechanisms in Graph Contrastive Learning","date":"2023-11-05","arxiv_id":"2311.02687","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"6 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; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/architecture-matters-uncovering-implicit-1#ran","syntology_url":"https://syntology.ai/paper/2311.02687","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.02687"}},"official":{"repos":["pku-ml/architecturemattersgcl"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/elegant-certified-defense-on-the-fairness-of","slug":"elegant-certified-defense-on-the-fairness-of","title":"Certified Defense on the Fairness of Graph Neural Networks","date":"2023-11-05","arxiv_id":"2311.02757","repositories_listed":1,"syntology":null},{"url":"/paper/cooperative-network-learning-for-large-scale","slug":"cooperative-network-learning-for-large-scale","title":"Cooperative Network Learning for Large-Scale and Decentralized Graphs","date":"2023-11-03","arxiv_id":"2311.02117","repositories_listed":1,"syntology":null},{"url":"/paper/dytscl-dynamic-graph-representation-via-tempo","slug":"dytscl-dynamic-graph-representation-via-tempo","title":"DyTSCL: Dynamic graph representation via tempo-structural contrastive learning","date":"2023-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/constructing-sample-to-class-graph-for-few","slug":"constructing-sample-to-class-graph-for-few","title":"Constructing Sample-to-Class Graph for Few-Shot Class-Incremental Learning","date":"2023-10-31","arxiv_id":"2310.20268","repositories_listed":1,"syntology":null},{"url":"/paper/does-invariant-graph-learning-via-environment-1","slug":"does-invariant-graph-learning-via-environment-1","title":"Does Invariant Graph Learning via Environment Augmentation Learn Invariance?","date":"2023-10-29","arxiv_id":"2310.19035","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":3,"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; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/does-invariant-graph-learning-via-environment-1#ran","syntology_url":"https://syntology.ai/paper/2310.19035","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.19035"}},"official":null}},{"url":"/paper/deceptive-fairness-attacks-on-graphs-via-meta","slug":"deceptive-fairness-attacks-on-graphs-via-meta","title":"Deceptive Fairness Attacks on Graphs via Meta Learning","date":"2023-10-24","arxiv_id":"2310.15653","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"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) · 3 unverified","sample_list":"/paper/deceptive-fairness-attacks-on-graphs-via-meta#ran","syntology_url":"https://syntology.ai/paper/2310.15653","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.15653"}},"official":{"repos":["jiank2/fate"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/topology-aware-debiased-self-supervised-graph","slug":"topology-aware-debiased-self-supervised-graph","title":"Topology-aware Debiased Self-supervised Graph Learning for Recommendation","date":"2023-10-24","arxiv_id":"2310.15858","repositories_listed":1,"syntology":null},{"url":"/paper/using-causality-aware-graph-neural-networks","slug":"using-causality-aware-graph-neural-networks","title":"Using Time-Aware Graph Neural Networks to Predict Temporal Centralities in Dynamic Graphs","date":"2023-10-24","arxiv_id":"2310.15865","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/using-causality-aware-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2310.15865","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.15865"}},"official":{"repos":["pathpy/pathpyg"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-heterogeneous-graph-learning-via","slug":"efficient-heterogeneous-graph-learning-via","title":"Efficient Heterogeneous Graph Learning via Random Projection","date":"2023-10-23","arxiv_id":"2310.14481","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":8,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/efficient-heterogeneous-graph-learning-via#ran","syntology_url":"https://syntology.ai/paper/2310.14481","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.14481"}},"official":{"repos":["CrawlScript/RpHGNN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/multimodal-graph-learning-for-modeling","slug":"multimodal-graph-learning-for-modeling","title":"Multimodal Graph Learning for Modeling Emerging Pandemics with Big Data","date":"2023-10-23","arxiv_id":"2310.14549","repositories_listed":1,"syntology":null},{"url":"/paper/graphgpt-graph-instruction-tuning-for-large","slug":"graphgpt-graph-instruction-tuning-for-large","title":"GraphGPT: Graph Instruction Tuning for Large Language Models","date":"2023-10-19","arxiv_id":"2310.13023","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":3,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/graphgpt-graph-instruction-tuning-for-large#ran","syntology_url":"https://syntology.ai/paper/2310.13023","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.13023"}},"official":{"repos":["HKUDS/GraphGPT"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/open-world-lifelong-graph-learning","slug":"open-world-lifelong-graph-learning","title":"Open-World Lifelong Graph Learning","date":"2023-10-19","arxiv_id":"2310.12565","repositories_listed":1,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":15,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/open-world-lifelong-graph-learning#ran","syntology_url":"https://syntology.ai/paper/2310.12565","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.12565"}},"official":{"repos":["bobowner/open-world-lgl"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/equipping-federated-graph-neural-networks","slug":"equipping-federated-graph-neural-networks","title":"Equipping Federated Graph Neural Networks with Structure-aware Group Fairness","date":"2023-10-18","arxiv_id":"2310.12350","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-for-recommendation","slug":"graph-neural-networks-for-recommendation","title":"Graph Neural Networks for Recommendation: Reproducibility, Graph Topology, and Node Representation","date":"2023-10-17","arxiv_id":"2310.11270","repositories_listed":1,"syntology":null},{"url":"/paper/empower-text-attributed-graphs-learning-with","slug":"empower-text-attributed-graphs-learning-with","title":"Leveraging Large Language Models for Node Generation in Few-Shot Learning on Text-Attributed Graphs","date":"2023-10-15","arxiv_id":"2310.09872","repositories_listed":1,"syntology":{"n":4,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"0 ran · 4 unverified","sample_list":"/paper/empower-text-attributed-graphs-learning-with#ran","syntology_url":"https://syntology.ai/paper/2310.09872","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.09872"}},"official":{"repos":["jianxiangyu/llm4ng"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":[]}}},{"url":"/paper/infinite-width-graph-neural-networks-for-node","slug":"infinite-width-graph-neural-networks-for-node","title":"Infinite Width Graph Neural Networks for Node Regression/ Classification","date":"2023-10-12","arxiv_id":"2310.08176","repositories_listed":1,"syntology":null},{"url":"/paper/multimodal-graph-learning-for-generative","slug":"multimodal-graph-learning-for-generative","title":"Multimodal Graph Learning for Generative Tasks","date":"2023-10-11","arxiv_id":"2310.07478","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":9,"phrase":"6 ran (of which 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) · 3 unverified","sample_list":"/paper/multimodal-graph-learning-for-generative#ran","syntology_url":"https://syntology.ai/paper/2310.07478","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.07478"}},"official":{"repos":["minjiyoon/mmgl"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/graphllm-boosting-graph-reasoning-ability-of","slug":"graphllm-boosting-graph-reasoning-ability-of","title":"GraphLLM: Boosting Graph Reasoning Ability of Large Language Model","date":"2023-10-09","arxiv_id":"2310.05845","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":7,"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) · 0 unverified","sample_list":"/paper/graphllm-boosting-graph-reasoning-ability-of#ran","syntology_url":"https://syntology.ai/paper/2310.05845","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.05845"}},"official":{"repos":["mistyreed63849/graph-llm"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/tailoring-self-attention-for-graph-via-rooted-1","slug":"tailoring-self-attention-for-graph-via-rooted-1","title":"Tailoring Self-Attention for Graph via Rooted Subtrees","date":"2023-10-08","arxiv_id":"2310.05296","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":10,"phrase":"7 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; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/tailoring-self-attention-for-graph-via-rooted-1#ran","syntology_url":"https://syntology.ai/paper/2310.05296","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.05296"}},"official":{"repos":["lumia-group/subtree-attention"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/holonets-spectral-convolutions-do-extend-to","slug":"holonets-spectral-convolutions-do-extend-to","title":"HoloNets: Spectral Convolutions do extend to Directed Graphs","date":"2023-10-03","arxiv_id":"2310.02232","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/holonets-spectral-convolutions-do-extend-to#ran","syntology_url":"https://syntology.ai/paper/2310.02232","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.02232"}},"official":{"repos":["ChristianKoke/HoloNets"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-insights-into-noisy-pseudo-labeling-on-1","slug":"deep-insights-into-noisy-pseudo-labeling-on-1","title":"Deep Insights into Noisy Pseudo Labeling on Graph Data","date":"2023-10-02","arxiv_id":"2310.01634","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/deep-insights-into-noisy-pseudo-labeling-on-1#ran","syntology_url":"https://syntology.ai/paper/2310.01634","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.01634"}},"official":{"repos":["AcEbt/CPL"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-anatomical-labeling-of-pulmonary","slug":"efficient-anatomical-labeling-of-pulmonary","title":"Efficient Anatomical Labeling of Pulmonary Tree Structures via Deep Point-Graph Representation-based Implicit Fields","date":"2023-09-29","arxiv_id":"2309.17329","repositories_listed":1,"syntology":null},{"url":"/paper/one-for-all-towards-training-one-graph-model","slug":"one-for-all-towards-training-one-graph-model","title":"One for All: Towards Training One Graph Model for All Classification Tasks","date":"2023-09-29","arxiv_id":"2310.00149","repositories_listed":1,"syntology":{"n":18,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":5,"phrase":"9 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; 2 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/one-for-all-towards-training-one-graph-model#ran","syntology_url":"https://syntology.ai/paper/2310.00149","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.00149"}},"official":{"repos":["lechengkong/oneforall"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/touchup-g-improving-feature-representation","slug":"touchup-g-improving-feature-representation","title":"TouchUp-G: Improving Feature Representation through Graph-Centric Finetuning","date":"2023-09-25","arxiv_id":"2309.13885","repositories_listed":1,"syntology":null},{"url":"/paper/ggl-ppi-geometric-graph-learning-to-predict","slug":"ggl-ppi-geometric-graph-learning-to-predict","title":"GGL-PPI: Geometric Graph Learning to Predict Mutation-Induced Binding Free Energy Changes","date":"2023-09-23","arxiv_id":"2309.13484","repositories_listed":1,"syntology":null},{"url":"/paper/tmac-temporal-multi-modal-graph-learning-for","slug":"tmac-temporal-multi-modal-graph-learning-for","title":"TMac: Temporal Multi-Modal Graph Learning for Acoustic Event Classification","date":"2023-09-21","arxiv_id":"2309.11845","repositories_listed":1,"syntology":null},{"url":"/paper/a-physics-informed-and-attention-based-graph","slug":"a-physics-informed-and-attention-based-graph","title":"A physics-informed and attention-based graph learning approach for regional electric vehicle charging demand prediction","date":"2023-09-11","arxiv_id":"2309.05259","repositories_listed":1,"syntology":null},{"url":"/paper/unikg-a-benchmark-and-universal-embedding-for","slug":"unikg-a-benchmark-and-universal-embedding-for","title":"UniKG: A Benchmark and Universal Embedding for Large-Scale Knowledge Graphs","date":"2023-09-11","arxiv_id":"2309.05269","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/efficient-multi-view-graph-clustering-with","slug":"efficient-multi-view-graph-clustering-with","title":"Efficient Multi-View Graph Clustering with Local and Global Structure Preservation","date":"2023-08-31","arxiv_id":"2309.00024","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-incomplete-multi-view-clustering","slug":"scalable-incomplete-multi-view-clustering","title":"Scalable Incomplete Multi-View Clustering with Structure Alignment","date":"2023-08-31","arxiv_id":"2308.16541","repositories_listed":1,"syntology":null},{"url":"/paper/topological-augmentation-for-class-imbalanced","slug":"topological-augmentation-for-class-imbalanced","title":"Class-Imbalanced Graph Learning without Class Rebalancing","date":"2023-08-27","arxiv_id":"2308.14181","repositories_listed":1,"syntology":{"n":19,"n_ran":17,"n_constructed":0,"n_ran_checked":16,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":16,"n_pointer_only":0,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 0 violated, 16 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/topological-augmentation-for-class-imbalanced#ran","syntology_url":"https://syntology.ai/paper/2308.14181","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.14181"}},"official":{"repos":["zhiningliu1998/bat"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":0,"n_ran_no_instrument_failure":16,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/a-survey-of-imbalanced-learning-on-graphs","slug":"a-survey-of-imbalanced-learning-on-graphs","title":"A Survey of Imbalanced Learning on Graphs: Problems, Techniques, and Future Directions","date":"2023-08-26","arxiv_id":"2308.13821","repositories_listed":1,"syntology":null},{"url":"/paper/investigating-the-interplay-between-features","slug":"investigating-the-interplay-between-features","title":"Investigating the Interplay between Features and Structures in Graph Learning","date":"2023-08-18","arxiv_id":"2308.09570","repositories_listed":1,"syntology":{"n":17,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":17,"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) · 8 unverified","sample_list":"/paper/investigating-the-interplay-between-features#ran","syntology_url":"https://syntology.ai/paper/2308.09570","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.09570"}},"official":{"repos":["danielecastellana22/feature-structure-interplay-graph-learning"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/natural-language-is-all-a-graph-needs","slug":"natural-language-is-all-a-graph-needs","title":"Language is All a Graph Needs","date":"2023-08-14","arxiv_id":"2308.07134","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/natural-language-is-all-a-graph-needs#ran","syntology_url":"https://syntology.ai/paper/2308.07134","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.07134"}},"official":{"repos":["agiresearch/InstructGLM"],"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-on-graphs-with-out-of-distribution","slug":"learning-on-graphs-with-out-of-distribution","title":"Learning on Graphs with Out-of-Distribution Nodes","date":"2023-08-13","arxiv_id":"2308.06714","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":9,"phrase":"6 ran (of which 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) · 3 unverified","sample_list":"/paper/learning-on-graphs-with-out-of-distribution#ran","syntology_url":"https://syntology.ai/paper/2308.06714","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.06714"}},"official":{"repos":["songyyyy/kdd22-oodgat"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/xgbd-explanation-guided-graph-backdoor","slug":"xgbd-explanation-guided-graph-backdoor","title":"XGBD: Explanation-Guided Graph Backdoor Detection","date":"2023-08-08","arxiv_id":"2308.04406","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":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) · 1 unverified","sample_list":"/paper/xgbd-explanation-guided-graph-backdoor#ran","syntology_url":"https://syntology.ai/paper/2308.04406","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.04406"}},"official":{"repos":["guanzihan/gnn_backdoor_detection"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/implicit-graph-neural-diffusion-based-on","slug":"implicit-graph-neural-diffusion-based-on","title":"Implicit Graph Neural Diffusion Networks: Convergence, Generalization, and Over-Smoothing","date":"2023-08-07","arxiv_id":"2308.03306","repositories_listed":1,"syntology":{"n":12,"n_ran":12,"n_constructed":0,"n_ran_checked":11,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":10,"n_pointer_only":1,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 0 violated, 10 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/implicit-graph-neural-diffusion-based-on#ran","syntology_url":"https://syntology.ai/paper/2308.03306","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.03306"}},"official":{"repos":["guoji-fu/dignn"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/event-based-dynamic-graph-representation","slug":"event-based-dynamic-graph-representation","title":"Event-based Dynamic Graph Representation Learning for Patent Application Trend Prediction","date":"2023-08-04","arxiv_id":"2308.09780","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-multiplex-graph-learning-with","slug":"unsupervised-multiplex-graph-learning-with","title":"Unsupervised Multiplex Graph Learning with Complementary and Consistent Information","date":"2023-08-03","arxiv_id":"2308.01606","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":7,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/unsupervised-multiplex-graph-learning-with#ran","syntology_url":"https://syntology.ai/paper/2308.01606","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.01606"}},"official":{"repos":["larryuestc/cocomg"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/diffusal-coupling-active-learning-with-graph","slug":"diffusal-coupling-active-learning-with-graph","title":"DiffusAL: Coupling Active Learning with Graph Diffusion for Label-Efficient Node Classification","date":"2023-07-31","arxiv_id":"2308.00146","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/an-empirical-evaluation-of-temporal-graph","slug":"an-empirical-evaluation-of-temporal-graph","title":"An Empirical Evaluation of Temporal Graph Benchmark","date":"2023-07-24","arxiv_id":"2307.12510","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/an-empirical-evaluation-of-temporal-graph#ran","syntology_url":"https://syntology.ai/paper/2307.12510","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.12510"}},"official":{"repos":["yule-BUAA/DyGLib_TGB"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/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/novel-batch-active-learning-approach-and-its","slug":"novel-batch-active-learning-approach-and-its","title":"Novel Batch Active Learning Approach and Its Application to Synthetic Aperture Radar Datasets","date":"2023-07-19","arxiv_id":"2307.10495","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/examining-the-effects-of-degree-distribution","slug":"examining-the-effects-of-degree-distribution","title":"Examining the Effects of Degree Distribution and Homophily in Graph Learning Models","date":"2023-07-17","arxiv_id":"2307.08881","repositories_listed":1,"syntology":null},{"url":"/paper/inflect-dgnn-influencer-prediction-with","slug":"inflect-dgnn-influencer-prediction-with","title":"INFLECT-DGNN: Influencer Prediction with Dynamic Graph Neural Networks","date":"2023-07-16","arxiv_id":"2307.08131","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/generative-contrastive-graph-learning-for","slug":"generative-contrastive-graph-learning-for","title":"Generative Contrastive Graph Learning for Recommendation","date":"2023-07-11","arxiv_id":"2307.05100","repositories_listed":1,"syntology":null},{"url":"/paper/causal-neural-graph-collaborative-filtering","slug":"causal-neural-graph-collaborative-filtering","title":"Neural Causal Graph Collaborative Filtering","date":"2023-07-10","arxiv_id":"2307.04384","repositories_listed":1,"syntology":null},{"url":"/paper/improving-fairness-of-graph-neural-networks-a","slug":"improving-fairness-of-graph-neural-networks-a","title":"Towards Fair Graph Neural Networks via Graph Counterfactual","date":"2023-07-10","arxiv_id":"2307.04937","repositories_listed":1,"syntology":null},{"url":"/paper/improving-heterogeneous-graph-learning-with","slug":"improving-heterogeneous-graph-learning-with","title":"Improving Heterogeneous Graph Learning with Weighted Mixed-Curvature Product Manifold","date":"2023-07-10","arxiv_id":"2307.04514","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/improving-heterogeneous-graph-learning-with#ran","syntology_url":"https://syntology.ai/paper/2307.04514","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.04514"}},"official":{"repos":["sharecodesubmission/weighted_product_manifold"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-modal-graph-learning-over-umls","slug":"multi-modal-graph-learning-over-umls","title":"Multi-modal Graph Learning over UMLS Knowledge Graphs","date":"2023-07-10","arxiv_id":"2307.04461","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/multi-modal-graph-learning-over-umls#ran","syntology_url":"https://syntology.ai/paper/2307.04461","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.04461"}},"official":{"repos":["ratschlab/mmugl"],"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/multimodal-brain-age-estimation-using","slug":"multimodal-brain-age-estimation-using","title":"Multimodal brain age estimation using interpretable adaptive population-graph learning","date":"2023-07-10","arxiv_id":"2307.04639","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/knowledge-graph-self-supervised","slug":"knowledge-graph-self-supervised","title":"Knowledge Graph Self-Supervised Rationalization for Recommendation","date":"2023-07-06","arxiv_id":"2307.02759","repositories_listed":1,"syntology":{"n":8,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/knowledge-graph-self-supervised#ran","syntology_url":"https://syntology.ai/paper/2307.02759","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.02759"}},"official":{"repos":["hkuds/kgrec"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/re-think-and-re-design-graph-neural-networks","slug":"re-think-and-re-design-graph-neural-networks","title":"Re-Think and Re-Design Graph Neural Networks in Spaces of Continuous Graph Diffusion Functionals","date":"2023-07-01","arxiv_id":"2307.00222","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/re-think-and-re-design-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2307.00222","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.00222"}},"official":{"repos":["Dandy5721/GNN-PDE-COV"],"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/individual-and-structural-graph-information","slug":"individual-and-structural-graph-information","title":"Individual and Structural Graph Information Bottlenecks for Out-of-Distribution Generalization","date":"2023-06-28","arxiv_id":"2306.15902","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/individual-and-structural-graph-information#ran","syntology_url":"https://syntology.ai/paper/2306.15902","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.15902"}},"official":{"repos":["yangling0818/graphood"],"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/substructure-aware-graph-neural-networks","slug":"substructure-aware-graph-neural-networks","title":"Substructure Aware Graph Neural Networks","date":"2023-06-26","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/spatial-temporal-graph-learning-with","slug":"spatial-temporal-graph-learning-with","title":"Spatial-Temporal Graph Learning with Adversarial Contrastive Adaptation","date":"2023-06-19","arxiv_id":"2306.10683","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":2,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"4 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/spatial-temporal-graph-learning-with#ran","syntology_url":"https://syntology.ai/paper/2306.10683","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.10683"}},"official":{"repos":["hkuds/graphst"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"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/automated-3d-pre-training-for-molecular","slug":"automated-3d-pre-training-for-molecular","title":"Automated 3D Pre-Training for Molecular Property Prediction","date":"2023-06-13","arxiv_id":"2306.07812","repositories_listed":1,"syntology":{"n":13,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":3,"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) · 6 unverified","sample_list":"/paper/automated-3d-pre-training-for-molecular#ran","syntology_url":"https://syntology.ai/paper/2306.07812","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.07812"}},"official":{"repos":["lars-research/3d-pgt"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/time-aware-graph-structure-learning-via","slug":"time-aware-graph-structure-learning-via","title":"Time-aware Graph Structure Learning via Sequence Prediction on Temporal Graphs","date":"2023-06-13","arxiv_id":"2306.07699","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/permutaion-equivariant-graph-framelets-for","slug":"permutaion-equivariant-graph-framelets-for","title":"Permutation Equivariant Graph Framelets for Heterophilous Graph Learning","date":"2023-06-07","arxiv_id":"2306.04265","repositories_listed":1,"syntology":null},{"url":"/paper/structure-free-graph-condensation-from-large","slug":"structure-free-graph-condensation-from-large","title":"Structure-free Graph Condensation: From Large-scale Graphs to Condensed Graph-free Data","date":"2023-06-05","arxiv_id":"2306.02664","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/structure-free-graph-condensation-from-large#ran","syntology_url":"https://syntology.ai/paper/2306.02664","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.02664"}},"official":{"repos":["amanda-zheng/sfgc"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dshgt-dual-supervisors-heterogeneous-graph","slug":"dshgt-dual-supervisors-heterogeneous-graph","title":"DSHGT: Dual-Supervisors Heterogeneous Graph Transformer -- A pioneer study of using heterogeneous graph learning for detecting software vulnerabilities","date":"2023-06-02","arxiv_id":"2306.01376","repositories_listed":1,"syntology":null},{"url":"/paper/the-information-pathways-hypothesis","slug":"the-information-pathways-hypothesis","title":"The Information Pathways Hypothesis: Transformers are Dynamic Self-Ensembles","date":"2023-06-02","arxiv_id":"2306.01705","repositories_listed":1,"syntology":null}],"record_sha256":"9936100a2a93c4e7569865597d858165cddb2f32917f03d68ce321d015404b6f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}