{"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/3","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":3,"pages_in_order":16,"rows_per_page":100,"rows":[201,300],"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/2","next":"/task/graph-learning/papers/4","papers":[{"url":"/paper/anygraph-graph-foundation-model-in-the-wild","slug":"anygraph-graph-foundation-model-in-the-wild","title":"AnyGraph: Graph Foundation Model in the Wild","date":"2024-08-20","arxiv_id":"2408.10700","repositories_listed":1,"syntology":null},{"url":"/paper/e-cgl-an-efficient-continual-graph-learner","slug":"e-cgl-an-efficient-continual-graph-learner","title":"E-CGL: An Efficient Continual Graph Learner","date":"2024-08-18","arxiv_id":"2408.09350","repositories_listed":1,"syntology":null},{"url":"/paper/federated-graph-learning-with-structure-proxy","slug":"federated-graph-learning-with-structure-proxy","title":"Federated Graph Learning with Structure Proxy Alignment","date":"2024-08-18","arxiv_id":"2408.09393","repositories_listed":1,"syntology":null},{"url":"/paper/corradaptor-adaptive-local-context-learning","slug":"corradaptor-adaptive-local-context-learning","title":"CorrAdaptor: Adaptive Local Context Learning for Correspondence Pruning","date":"2024-08-15","arxiv_id":"2408.08134","repositories_listed":1,"syntology":null},{"url":"/paper/multi-task-heterogeneous-graph-learning-on","slug":"multi-task-heterogeneous-graph-learning-on","title":"Multi-task Heterogeneous Graph Learning on Electronic Health Records","date":"2024-08-14","arxiv_id":"2408.07569","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/multi-task-heterogeneous-graph-learning-on#ran","syntology_url":"https://syntology.ai/paper/2408.07569","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.07569"}},"official":{"repos":["hku-medai/mult-ehr"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/joint-graph-rewiring-and-feature-denoising","slug":"joint-graph-rewiring-and-feature-denoising","title":"Joint Graph Rewiring and Feature Denoising via Spectral Resonance","date":"2024-08-13","arxiv_id":"2408.07191","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":2,"n_instrument":5,"n_unverified":2,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_pointer_only":9,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 2 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/joint-graph-rewiring-and-feature-denoising#ran","syntology_url":"https://syntology.ai/paper/2408.07191","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.07191"}},"official":{"repos":["jlinki/JDR"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-generative-models-for-subgraph","slug":"deep-generative-models-for-subgraph","title":"Deep Generative Models for Subgraph Prediction","date":"2024-08-07","arxiv_id":"2408.04053","repositories_listed":1,"syntology":null},{"url":"/paper/2408-01697","slug":"2408-01697","title":"Invariant Graph Learning Meets Information Bottleneck for Out-of-Distribution Generalization","date":"2024-08-03","arxiv_id":"2408.01697","repositories_listed":1,"syntology":null},{"url":"/paper/you-can-t-ignore-either-unifying-structure","slug":"you-can-t-ignore-either-unifying-structure","title":"You Can't Ignore Either: Unifying Structure and Feature Denoising for Robust Graph Learning","date":"2024-08-01","arxiv_id":"2408.00700","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":2,"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/you-can-t-ignore-either-unifying-structure#ran","syntology_url":"https://syntology.ai/paper/2408.00700","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.00700"}},"official":{"repos":["youngtimmy/ugd"],"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/2408-00165","slug":"2408-00165","title":"Non-convolutional Graph Neural Networks","date":"2024-07-31","arxiv_id":"2408.00165","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/2408-00165#ran","syntology_url":"https://syntology.ai/paper/2408.00165","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.00165"}},"official":{"repos":["yuanqing-wang/rum"],"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/dygkt-dynamic-graph-learning-for-knowledge","slug":"dygkt-dynamic-graph-learning-for-knowledge","title":"DyGKT: Dynamic Graph Learning for Knowledge Tracing","date":"2024-07-30","arxiv_id":"2407.20824","repositories_listed":1,"syntology":null},{"url":"/paper/ftf-er-feature-topology-fusion-based","slug":"ftf-er-feature-topology-fusion-based","title":"FTF-ER: Feature-Topology Fusion-Based Experience Replay Method for Continual Graph Learning","date":"2024-07-28","arxiv_id":"2407.19429","repositories_listed":1,"syntology":null},{"url":"/paper/lifelong-graph-summarization-with-neural","slug":"lifelong-graph-summarization-with-neural","title":"Lifelong Graph Learning for Graph Summarization","date":"2024-07-25","arxiv_id":"2407.18042","repositories_listed":1,"syntology":null},{"url":"/paper/meta-gps-enhancing-graph-meta-learning-with","slug":"meta-gps-enhancing-graph-meta-learning-with","title":"Meta-GPS++: Enhancing Graph Meta-Learning with Contrastive Learning and Self-Training","date":"2024-07-20","arxiv_id":"2407.14732","repositories_listed":1,"syntology":null},{"url":"/paper/glaudio-listens-to-the-sound-of-the-graph","slug":"glaudio-listens-to-the-sound-of-the-graph","title":"GLAudio Listens to the Sound of the Graph","date":"2024-07-19","arxiv_id":"2407.14387","repositories_listed":1,"syntology":null},{"url":"/paper/temporal-receptive-field-in-dynamic-graph","slug":"temporal-receptive-field-in-dynamic-graph","title":"Temporal receptive field in dynamic graph learning: A comprehensive analysis","date":"2024-07-17","arxiv_id":"2407.12370","repositories_listed":1,"syntology":null},{"url":"/paper/continuity-preserving-online-centerline-graph","slug":"continuity-preserving-online-centerline-graph","title":"Continuity Preserving Online CenterLine Graph Learning","date":"2024-07-16","arxiv_id":"2407.11337","repositories_listed":1,"syntology":null},{"url":"/paper/joint-data-inpainting-and-graph-learning-via","slug":"joint-data-inpainting-and-graph-learning-via","title":"Joint Data Inpainting and Graph Learning via Unrolled Neural Networks","date":"2024-07-16","arxiv_id":"2407.11429","repositories_listed":1,"syntology":null},{"url":"/paper/geomix-towards-geometry-aware-data","slug":"geomix-towards-geometry-aware-data","title":"GeoMix: Towards Geometry-Aware Data Augmentation","date":"2024-07-15","arxiv_id":"2407.10681","repositories_listed":1,"syntology":null},{"url":"/paper/when-heterophily-meets-heterogeneity-new","slug":"when-heterophily-meets-heterogeneity-new","title":"When Heterophily Meets Heterogeneity: Challenges and a New Large-Scale Graph Benchmark","date":"2024-07-15","arxiv_id":"2407.10916","repositories_listed":1,"syntology":null},{"url":"/paper/learning-a-mini-batch-graph-transformer-via","slug":"learning-a-mini-batch-graph-transformer-via","title":"Learning a Mini-batch Graph Transformer via Two-stage Interaction Augmentation","date":"2024-07-13","arxiv_id":"2407.09904","repositories_listed":1,"syntology":null},{"url":"/paper/slidegcd-slide-based-graph-collaborative","slug":"slidegcd-slide-based-graph-collaborative","title":"SlideGCD: Slide-based Graph Collaborative Training with Knowledge Distillation for Whole Slide Image Classification","date":"2024-07-12","arxiv_id":"2407.08968","repositories_listed":1,"syntology":null},{"url":"/paper/meeg-and-at-dgnn-advancing-eeg-emotion","slug":"meeg-and-at-dgnn-advancing-eeg-emotion","title":"MEEG and AT-DGNN: Improving EEG Emotion Recognition with Music Introducing and Graph-based Learning","date":"2024-07-08","arxiv_id":"2407.05550","repositories_listed":1,"syntology":null},{"url":"/paper/consistency-and-discrepancy-based-contrastive","slug":"consistency-and-discrepancy-based-contrastive","title":"Consistency and Discrepancy-Based Contrastive Tripartite Graph Learning for Recommendations","date":"2024-07-06","arxiv_id":"2407.05126","repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-the-effectiveness-of-graph","slug":"rethinking-the-effectiveness-of-graph","title":"Rethinking the Effectiveness of Graph Classification Datasets in Benchmarks for Assessing GNNs","date":"2024-07-06","arxiv_id":"2407.04999","repositories_listed":1,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":9,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"phrase":"11 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; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/rethinking-the-effectiveness-of-graph#ran","syntology_url":"https://syntology.ai/paper/2407.04999","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.04999"}},"official":{"repos":["ICLab4DL/GNNBenchEffectiveness"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-peptide-multimodality-leveraged","slug":"multi-peptide-multimodality-leveraged","title":"Multi-Peptide: Multimodality Leveraged Language-Graph Learning of Peptide Properties","date":"2024-07-02","arxiv_id":"2407.03380","repositories_listed":1,"syntology":null},{"url":"/paper/federated-graph-semantic-and-structural","slug":"federated-graph-semantic-and-structural","title":"Federated Graph Semantic and Structural Learning","date":"2024-06-27","arxiv_id":"2406.18937","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/federated-graph-semantic-and-structural#ran","syntology_url":"https://syntology.ai/paper/2406.18937","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.18937"}},"official":{"repos":["guanchengwan/fgssl"],"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/fast-optimizer-benchmark","slug":"fast-optimizer-benchmark","title":"Fast Optimizer Benchmark","date":"2024-06-26","arxiv_id":"2406.18701","repositories_listed":1,"syntology":null},{"url":"/paper/kagnns-kolmogorov-arnold-networks-meet-graph","slug":"kagnns-kolmogorov-arnold-networks-meet-graph","title":"KAGNNs: Kolmogorov-Arnold Networks meet Graph Learning","date":"2024-06-26","arxiv_id":"2406.18380","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":8,"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/kagnns-kolmogorov-arnold-networks-meet-graph#ran","syntology_url":"https://syntology.ai/paper/2406.18380","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.18380"}},"official":{"repos":["RomanBresson/KAGNN"],"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/distance-recomputator-and-topology","slug":"distance-recomputator-and-topology","title":"Distance Recomputator and Topology Reconstructor for Graph Neural Networks","date":"2024-06-25","arxiv_id":"2406.17281","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"3 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/distance-recomputator-and-topology#ran","syntology_url":"https://syntology.ai/paper/2406.17281","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.17281"}},"official":{"repos":["NoakLiu/Distance-Recomputator-and-Topology-Reconstructor"],"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/graphsnapshot-graph-machine-learning","slug":"graphsnapshot-graph-machine-learning","title":"GraphSnapShot: Caching Local Structure for Fast Graph Learning","date":"2024-06-25","arxiv_id":"2406.17918","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graphsnapshot-graph-machine-learning#ran","syntology_url":"https://syntology.ai/paper/2406.17918","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.17918"}},"official":{"repos":["noakliu/graphsnapshot"],"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/next-level-message-passing-with-hierarchical","slug":"next-level-message-passing-with-hierarchical","title":"Next Level Message-Passing with Hierarchical Support Graphs","date":"2024-06-22","arxiv_id":"2406.15852","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":2,"n_no_contract":5,"n_pointer_only":6,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 2 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/next-level-message-passing-with-hierarchical#ran","syntology_url":"https://syntology.ai/paper/2406.15852","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.15852"}},"official":{"repos":["carlosinator/support-graphs"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/mm-gtunets-unified-multi-modal-graph-deep","slug":"mm-gtunets-unified-multi-modal-graph-deep","title":"MM-GTUNets: Unified Multi-Modal Graph Deep Learning for Brain Disorders Prediction","date":"2024-06-20","arxiv_id":"2406.14455","repositories_listed":1,"syntology":null},{"url":"/paper/dtgb-a-comprehensive-benchmark-for-dynamic","slug":"dtgb-a-comprehensive-benchmark-for-dynamic","title":"DTGB: A Comprehensive Benchmark for Dynamic Text-Attributed Graphs","date":"2024-06-17","arxiv_id":"2406.12072","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/dtgb-a-comprehensive-benchmark-for-dynamic#ran","syntology_url":"https://syntology.ai/paper/2406.12072","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.12072"}},"official":{"repos":["zjs123/DTGB"],"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/gaugllm-improving-graph-contrastive-learning","slug":"gaugllm-improving-graph-contrastive-learning","title":"GAugLLM: Improving Graph Contrastive Learning for Text-Attributed Graphs with Large Language Models","date":"2024-06-17","arxiv_id":"2406.11945","repositories_listed":1,"syntology":null},{"url":"/paper/hifgl-a-hierarchical-framework-for-cross-silo","slug":"hifgl-a-hierarchical-framework-for-cross-silo","title":"HiFGL: A Hierarchical Framework for Cross-silo Cross-device Federated Graph Learning","date":"2024-06-15","arxiv_id":"2406.10616","repositories_listed":1,"syntology":null},{"url":"/paper/igl-bench-establishing-the-comprehensive","slug":"igl-bench-establishing-the-comprehensive","title":"IGL-Bench: Establishing the Comprehensive Benchmark for Imbalanced Graph Learning","date":"2024-06-14","arxiv_id":"2406.09870","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/igl-bench-establishing-the-comprehensive#ran","syntology_url":"https://syntology.ai/paper/2406.09870","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.09870"}},"official":{"repos":["ringbdstack/igl-bench"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-neural-scaling-laws-for-foundation","slug":"towards-neural-scaling-laws-for-foundation","title":"Towards Neural Scaling Laws for Foundation Models on Temporal Graphs","date":"2024-06-14","arxiv_id":"2406.10426","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/towards-neural-scaling-laws-for-foundation#ran","syntology_url":"https://syntology.ai/paper/2406.10426","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.10426"}},"official":{"repos":["benjaminnNgo/ScalingTGNs"],"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/scalable-and-flexible-causal-discovery-with","slug":"scalable-and-flexible-causal-discovery-with","title":"Scalable and Flexible Causal Discovery with an Efficient Test for Adjacency","date":"2024-06-13","arxiv_id":"2406.09177","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/scalable-and-flexible-causal-discovery-with#ran","syntology_url":"https://syntology.ai/paper/2406.09177","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.09177"}},"official":{"repos":["alannawzadamin/dat-graph"],"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/heuristic-learning-with-graph-neural-networks","slug":"heuristic-learning-with-graph-neural-networks","title":"Heuristic Learning with Graph Neural Networks: A Unified Framework for Link Prediction","date":"2024-06-12","arxiv_id":"2406.07979","repositories_listed":1,"syntology":null},{"url":"/paper/informed-graph-learning-by-domain-knowledge","slug":"informed-graph-learning-by-domain-knowledge","title":"Informed Graph Learning By Domain Knowledge Injection and Smooth Graph Signal Representation","date":"2024-06-06","arxiv_id":"2406.03898","repositories_listed":1,"syntology":null},{"url":"/paper/combinatorial-optimization-with-automated","slug":"combinatorial-optimization-with-automated","title":"Combinatorial Optimization with Automated Graph Neural Networks","date":"2024-06-05","arxiv_id":"2406.02872","repositories_listed":1,"syntology":null},{"url":"/paper/s-2-gsl-incorporating-segment-to-syntactic","slug":"s-2-gsl-incorporating-segment-to-syntactic","title":"S$^2$GSL: Incorporating Segment to Syntactic Enhanced Graph Structure Learning for Aspect-based Sentiment Analysis","date":"2024-06-05","arxiv_id":"2406.02902","repositories_listed":1,"syntology":null},{"url":"/paper/agale-a-graph-aware-continual-learning","slug":"agale-a-graph-aware-continual-learning","title":"AGALE: A Graph-Aware Continual Learning Evaluation Framework","date":"2024-06-03","arxiv_id":"2406.01229","repositories_listed":1,"syntology":null},{"url":"/paper/state-space-models-on-temporal-graphs-a-first","slug":"state-space-models-on-temporal-graphs-a-first","title":"State Space Models on Temporal Graphs: A First-Principles Study","date":"2024-06-03","arxiv_id":"2406.00943","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":3,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 3 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/state-space-models-on-temporal-graphs-a-first#ran","syntology_url":"https://syntology.ai/paper/2406.00943","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.00943"}},"official":{"repos":["edisonleeeee/graphssm"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-on-large-graphs-using-intersecting","slug":"learning-on-large-graphs-using-intersecting","title":"Learning on Large Graphs using Intersecting Communities","date":"2024-05-31","arxiv_id":"2405.20724","repositories_listed":1,"syntology":null},{"url":"/paper/can-graph-learning-improve-task-planning","slug":"can-graph-learning-improve-task-planning","title":"Can Graph Learning Improve Planning in LLM-based Agents?","date":"2024-05-29","arxiv_id":"2405.19119","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/can-graph-learning-improve-task-planning#ran","syntology_url":"https://syntology.ai/paper/2405.19119","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.19119"}},"official":{"repos":["wxxshirley/gnn4taskplan"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/cross-context-backdoor-attacks-against-graph","slug":"cross-context-backdoor-attacks-against-graph","title":"Cross-Context Backdoor Attacks against Graph Prompt Learning","date":"2024-05-28","arxiv_id":"2405.17984","repositories_listed":1,"syntology":{"n":11,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":11,"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) · 5 unverified","sample_list":"/paper/cross-context-backdoor-attacks-against-graph#ran","syntology_url":"https://syntology.ai/paper/2405.17984","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.17984"}},"official":{"repos":["xtLyu/CrossBA"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/structure-aware-semantic-node-identifiers-for","slug":"structure-aware-semantic-node-identifiers-for","title":"Node Identifiers: Compact, Discrete Representations for Efficient Graph Learning","date":"2024-05-26","arxiv_id":"2405.16435","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":2,"n_no_contract":7,"n_pointer_only":3,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 2 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/structure-aware-semantic-node-identifiers-for#ran","syntology_url":"https://syntology.ai/paper/2405.16435","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16435"}},"official":{"repos":["LUOyk1999/NodeID"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/repeat-aware-neighbor-sampling-for-dynamic","slug":"repeat-aware-neighbor-sampling-for-dynamic","title":"Repeat-Aware Neighbor Sampling for Dynamic Graph Learning","date":"2024-05-24","arxiv_id":"2405.17473","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/repeat-aware-neighbor-sampling-for-dynamic#ran","syntology_url":"https://syntology.ai/paper/2405.17473","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.17473"}},"official":{"repos":["Hope-Rita/RepeatMixer"],"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/graph-sparsification-via-mixture-of-graphs","slug":"graph-sparsification-via-mixture-of-graphs","title":"Graph Sparsification via Mixture of Graphs","date":"2024-05-23","arxiv_id":"2405.14260","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/graph-sparsification-via-mixture-of-graphs#ran","syntology_url":"https://syntology.ai/paper/2405.14260","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.14260"}},"official":{"repos":["yanweiyue/mog"],"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/perception-inspired-graph-convolution-for","slug":"perception-inspired-graph-convolution-for","title":"Perception-Inspired Graph Convolution for Music Understanding Tasks","date":"2024-05-15","arxiv_id":"2405.09224","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/perception-inspired-graph-convolution-for#ran","syntology_url":"https://syntology.ai/paper/2405.09224","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.09224"}},"official":{"repos":["manoskary/musgconv"],"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/a-survey-of-large-language-models-for-graphs","slug":"a-survey-of-large-language-models-for-graphs","title":"A Survey of Large Language Models for Graphs","date":"2024-05-10","arxiv_id":"2405.08011","repositories_listed":1,"syntology":null},{"url":"/paper/disttack-graph-adversarial-attacks-toward","slug":"disttack-graph-adversarial-attacks-toward","title":"Disttack: Graph Adversarial Attacks Toward Distributed GNN Training","date":"2024-05-10","arxiv_id":"2405.06247","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-gnns-for-precise-seizure-detection","slug":"dynamic-gnns-for-precise-seizure-detection","title":"Dynamic GNNs for Precise Seizure Detection and Classification from EEG Data","date":"2024-05-08","arxiv_id":"2405.09568","repositories_listed":1,"syntology":null},{"url":"/paper/imbalanced-graph-classification-with-multi","slug":"imbalanced-graph-classification-with-multi","title":"Imbalanced Graph Classification with Multi-scale Oversampling Graph Neural Networks","date":"2024-05-08","arxiv_id":"2405.04903","repositories_listed":1,"syntology":null},{"url":"/paper/acceleration-algorithms-in-gnns-a-survey","slug":"acceleration-algorithms-in-gnns-a-survey","title":"Acceleration Algorithms in GNNs: A Survey","date":"2024-05-07","arxiv_id":"2405.04114","repositories_listed":1,"syntology":null},{"url":"/paper/semanticformer-holistic-and-semantic-traffic","slug":"semanticformer-holistic-and-semantic-traffic","title":"SemanticFormer: Holistic and Semantic Traffic Scene Representation for Trajectory Prediction using Knowledge Graphs","date":"2024-04-30","arxiv_id":"2404.19379","repositories_listed":1,"syntology":null},{"url":"/paper/fairgt-a-fairness-aware-graph-transformer","slug":"fairgt-a-fairness-aware-graph-transformer","title":"FairGT: A Fairness-aware Graph Transformer","date":"2024-04-26","arxiv_id":"2404.17169","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fairgt-a-fairness-aware-graph-transformer#ran","syntology_url":"https://syntology.ai/paper/2404.17169","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.17169"}},"official":{"repos":["yushuowiki/fairgt"],"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/are-graph-embeddings-the-panacea-an-empirical","slug":"are-graph-embeddings-the-panacea-an-empirical","title":"Are Graph Embeddings the Panacea? An Empirical Survey from the Data Fitness Perspective","date":"2024-04-25","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/ckgconv-general-graph-convolution-with","slug":"ckgconv-general-graph-convolution-with","title":"CKGConv: General Graph Convolution with Continuous Kernels","date":"2024-04-21","arxiv_id":"2404.13604","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":11,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/ckgconv-general-graph-convolution-with#ran","syntology_url":"https://syntology.ai/paper/2404.13604","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.13604"}},"official":{"repos":["networkslab/ckgconv"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/grasper-a-generalist-pursuer-for-pursuit","slug":"grasper-a-generalist-pursuer-for-pursuit","title":"Grasper: A Generalist Pursuer for Pursuit-Evasion Problems","date":"2024-04-19","arxiv_id":"2404.12626","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/grasper-a-generalist-pursuer-for-pursuit#ran","syntology_url":"https://syntology.ai/paper/2404.12626","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.12626"}},"official":{"repos":["ipadli/grasper"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/elevating-spectral-gnns-through-enhanced-band","slug":"elevating-spectral-gnns-through-enhanced-band","title":"Polynomial Selection in Spectral Graph Neural Networks: An Error-Sum of Function Slices Approach","date":"2024-04-15","arxiv_id":"2404.15354","repositories_listed":1,"syntology":null},{"url":"/paper/model-selection-with-model-zoo-via-graph","slug":"model-selection-with-model-zoo-via-graph","title":"Model Selection with Model Zoo via Graph Learning","date":"2024-04-05","arxiv_id":"2404.03988","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":5,"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) · 3 unverified","sample_list":"/paper/model-selection-with-model-zoo-via-graph#ran","syntology_url":"https://syntology.ai/paper/2404.03988","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.03988"}},"official":{"repos":["transfergraph/transfergraph"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/on-the-theoretical-expressive-power-and-the","slug":"on-the-theoretical-expressive-power-and-the","title":"On the Theoretical Expressive Power and the Design Space of Higher-Order Graph Transformers","date":"2024-04-04","arxiv_id":"2404.03380","repositories_listed":1,"syntology":{"n":13,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":5,"phrase":"11 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/on-the-theoretical-expressive-power-and-the#ran","syntology_url":"https://syntology.ai/paper/2404.03380","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.03380"}},"official":{"repos":["zhouc20/k-transformer"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/glemos-benchmark-for-instantaneous-graph-1","slug":"glemos-benchmark-for-instantaneous-graph-1","title":"GLEMOS: Benchmark for Instantaneous Graph Learning Model Selection","date":"2024-04-02","arxiv_id":"2404.01578","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/glemos-benchmark-for-instantaneous-graph-1#ran","syntology_url":"https://syntology.ai/paper/2404.01578","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.01578"}},"official":{"repos":["facebookresearch/glemos"],"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/inferring-latent-temporal-sparse-coordination","slug":"inferring-latent-temporal-sparse-coordination","title":"Inferring Latent Temporal Sparse Coordination Graph for Multi-Agent Reinforcement Learning","date":"2024-03-28","arxiv_id":"2403.19253","repositories_listed":1,"syntology":null},{"url":"/paper/mapl-model-agnostic-peer-to-peer-learning","slug":"mapl-model-agnostic-peer-to-peer-learning","title":"MAPL: Model Agnostic Peer-to-peer Learning","date":"2024-03-28","arxiv_id":"2403.19792","repositories_listed":1,"syntology":null},{"url":"/paper/tensor-based-graph-learning-with-consistency","slug":"tensor-based-graph-learning-with-consistency","title":"Tensor-based Graph Learning with Consistency and Specificity for Multi-view Clustering","date":"2024-03-27","arxiv_id":"2403.18393","repositories_listed":1,"syntology":null},{"url":"/paper/caselink-inductive-graph-learning-for-legal","slug":"caselink-inductive-graph-learning-for-legal","title":"CaseLink: Inductive Graph Learning for Legal Case Retrieval","date":"2024-03-26","arxiv_id":"2403.17780","repositories_listed":1,"syntology":null},{"url":"/paper/learn-from-heterophily-heterophilous","slug":"learn-from-heterophily-heterophilous","title":"Learn from Heterophily: Heterophilous Information-enhanced Graph Neural Network","date":"2024-03-26","arxiv_id":"2403.17351","repositories_listed":1,"syntology":null},{"url":"/paper/segment-anything-model-for-road-network-graph","slug":"segment-anything-model-for-road-network-graph","title":"Segment Anything Model for Road Network Graph Extraction","date":"2024-03-24","arxiv_id":"2403.16051","repositories_listed":1,"syntology":{"n":18,"n_ran":17,"n_constructed":0,"n_ran_checked":17,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":17,"n_pointer_only":0,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 0 honoured, 0 violated, 17 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/segment-anything-model-for-road-network-graph#ran","syntology_url":"https://syntology.ai/paper/2403.16051","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.16051"}},"official":{"repos":["htcr/sam_road"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":0,"n_ran_no_instrument_failure":17,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/vcr-graphormer-a-mini-batch-graph-transformer","slug":"vcr-graphormer-a-mini-batch-graph-transformer","title":"VCR-Graphormer: A Mini-batch Graph Transformer via Virtual Connections","date":"2024-03-24","arxiv_id":"2403.16030","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":3,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":6,"phrase":"5 ran (of which 3 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/vcr-graphormer-a-mini-batch-graph-transformer#ran","syntology_url":"https://syntology.ai/paper/2403.16030","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.16030"}},"official":{"repos":["dongqifu/vcr-graphormer"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/stg-mamba-spatial-temporal-graph-learning-via","slug":"stg-mamba-spatial-temporal-graph-learning-via","title":"STG-Mamba: Spatial-Temporal Graph Learning via Selective State Space Model","date":"2024-03-19","arxiv_id":"2403.12418","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":5,"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) · 3 unverified","sample_list":"/paper/stg-mamba-spatial-temporal-graph-learning-via#ran","syntology_url":"https://syntology.ai/paper/2403.12418","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.12418"}},"official":{"repos":["LincanLi98/STG-Mamba"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/forward-learning-of-graph-neural-networks","slug":"forward-learning-of-graph-neural-networks","title":"Forward Learning of Graph Neural Networks","date":"2024-03-16","arxiv_id":"2403.11004","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":5,"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) · 0 unverified","sample_list":"/paper/forward-learning-of-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2403.11004","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.11004"}},"official":{"repos":["facebookresearch/forwardgnn"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/addressing-shortcomings-in-fair-graph","slug":"addressing-shortcomings-in-fair-graph","title":"Addressing Shortcomings in Fair Graph Learning Datasets: Towards a New Benchmark","date":"2024-03-09","arxiv_id":"2403.06017","repositories_listed":1,"syntology":null},{"url":"/paper/bloomgml-graph-machine-learning-through-the","slug":"bloomgml-graph-machine-learning-through-the","title":"BloomGML: Graph Machine Learning through the Lens of Bilevel Optimization","date":"2024-03-07","arxiv_id":"2403.04763","repositories_listed":1,"syntology":null},{"url":"/paper/self-attention-empowered-graph-convolutional","slug":"self-attention-empowered-graph-convolutional","title":"Self-Attention Empowered Graph Convolutional Network for Structure Learning and Node Embedding","date":"2024-03-06","arxiv_id":"2403.03465","repositories_listed":1,"syntology":null},{"url":"/paper/dnnlasso-scalable-graph-learning-for-matrix","slug":"dnnlasso-scalable-graph-learning-for-matrix","title":"DNNLasso: Scalable Graph Learning for Matrix-Variate Data","date":"2024-03-05","arxiv_id":"2403.02608","repositories_listed":1,"syntology":null},{"url":"/paper/fedhcdr-federated-cross-domain-recommendation","slug":"fedhcdr-federated-cross-domain-recommendation","title":"FedHCDR: Federated Cross-Domain Recommendation with Hypergraph Signal Decoupling","date":"2024-03-05","arxiv_id":"2403.02630","repositories_listed":1,"syntology":null},{"url":"/paper/opengraph-towards-open-graph-foundation","slug":"opengraph-towards-open-graph-foundation","title":"OpenGraph: Towards Open Graph Foundation Models","date":"2024-03-02","arxiv_id":"2403.01121","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/opengraph-towards-open-graph-foundation#ran","syntology_url":"https://syntology.ai/paper/2403.01121","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.01121"}},"official":{"repos":["hkuds/opengraph"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/higpt-heterogeneous-graph-language-model","slug":"higpt-heterogeneous-graph-language-model","title":"HiGPT: Heterogeneous Graph Language Model","date":"2024-02-25","arxiv_id":"2402.16024","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":1,"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/higpt-heterogeneous-graph-language-model#ran","syntology_url":"https://syntology.ai/paper/2402.16024","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.16024"}},"official":{"repos":["hkuds/higpt"],"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","unlocated"]}}},{"url":"/paper/rao-blackwellising-bayesian-causal-inference","slug":"rao-blackwellising-bayesian-causal-inference","title":"Effective Bayesian Causal Inference via Structural Marginalisation and Autoregressive Orders","date":"2024-02-22","arxiv_id":"2402.14781","repositories_listed":1,"syntology":null},{"url":"/paper/diet-odin-a-novel-framework-for-opioid-misuse","slug":"diet-odin-a-novel-framework-for-opioid-misuse","title":"Diet-ODIN: A Novel Framework for Opioid Misuse Detection with Interpretable Dietary Patterns","date":"2024-02-21","arxiv_id":"2403.08820","repositories_listed":1,"syntology":null},{"url":"/paper/unigraph-learning-a-cross-domain-graph","slug":"unigraph-learning-a-cross-domain-graph","title":"UniGraph: Learning a Unified Cross-Domain Foundation Model for Text-Attributed Graphs","date":"2024-02-21","arxiv_id":"2402.13630","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":10,"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) · 3 unverified","sample_list":"/paper/unigraph-learning-a-cross-domain-graph#ran","syntology_url":"https://syntology.ai/paper/2402.13630","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.13630"}},"official":{"repos":["yf-he/UniGraph"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/continual-learning-on-graphs-challenges","slug":"continual-learning-on-graphs-challenges","title":"Continual Learning on Graphs: Challenges, Solutions, and Opportunities","date":"2024-02-18","arxiv_id":"2402.11565","repositories_listed":1,"syntology":null},{"url":"/paper/zerog-investigating-cross-dataset-zero-shot","slug":"zerog-investigating-cross-dataset-zero-shot","title":"ZeroG: Investigating Cross-dataset Zero-shot Transferability in Graphs","date":"2024-02-17","arxiv_id":"2402.11235","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/zerog-investigating-cross-dataset-zero-shot#ran","syntology_url":"https://syntology.ai/paper/2402.11235","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.11235"}},"official":{"repos":["nineabyss/zerog"],"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/graph-inference-acceleration-by-learning-mlps","slug":"graph-inference-acceleration-by-learning-mlps","title":"SimMLP: Training MLPs on Graphs without Supervision","date":"2024-02-14","arxiv_id":"2402.08918","repositories_listed":1,"syntology":null},{"url":"/paper/parallel-friendly-spatio-temporal-graph","slug":"parallel-friendly-spatio-temporal-graph","title":"Parallel-friendly Spatio-Temporal Graph Learning for Photovoltaic Degradation Analysis at Scale","date":"2024-02-13","arxiv_id":"2402.08470","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-structure-learning-for-sparse","slug":"scalable-structure-learning-for-sparse","title":"Scalable Structure Learning for Sparse Context-Specific Systems","date":"2024-02-12","arxiv_id":"2402.07762","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/scalable-structure-learning-for-sparse#ran","syntology_url":"https://syntology.ai/paper/2402.07762","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.07762"}},"official":{"repos":["felixleopoldo/cslearn"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/gsina-improving-subgraph-extraction-for-graph","slug":"gsina-improving-subgraph-extraction-for-graph","title":"GSINA: Improving Subgraph Extraction for Graph Invariant Learning via Graph Sinkhorn Attention","date":"2024-02-11","arxiv_id":"2402.07191","repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-node-wise-propagation-for-large","slug":"rethinking-node-wise-propagation-for-large","title":"Rethinking Node-wise Propagation for Large-scale Graph Learning","date":"2024-02-09","arxiv_id":"2402.06128","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/rethinking-node-wise-propagation-for-large#ran","syntology_url":"https://syntology.ai/paper/2402.06128","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.06128"}},"official":{"repos":["xkli-allen/atp"],"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/descriptive-kernel-convolution-network-with","slug":"descriptive-kernel-convolution-network-with","title":"Descriptive Kernel Convolution Network with Improved Random Walk Kernel","date":"2024-02-08","arxiv_id":"2402.06087","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":8,"phrase":"5 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; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/descriptive-kernel-convolution-network-with#ran","syntology_url":"https://syntology.ai/paper/2402.06087","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.06087"}},"official":{"repos":["mengchillee/rwk_plus"],"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/estimating-on-road-transportation-carbon","slug":"estimating-on-road-transportation-carbon","title":"Estimating On-road Transportation Carbon Emissions from Open Data of Road Network and Origin-destination Flow Data","date":"2024-02-07","arxiv_id":"2402.05153","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-completeness-of-invariant-geometric","slug":"on-the-completeness-of-invariant-geometric","title":"On the Completeness of Invariant Geometric Deep Learning Models","date":"2024-02-07","arxiv_id":"2402.04836","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":7,"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) · 0 unverified","sample_list":"/paper/on-the-completeness-of-invariant-geometric#ran","syntology_url":"https://syntology.ai/paper/2402.04836","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.04836"}},"official":{"repos":["GraphPKU/GeoNGNN"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/digital-twin-mobility-profiling-a-spatio","slug":"digital-twin-mobility-profiling-a-spatio","title":"Digital Twin Mobility Profiling: A Spatio-Temporal Graph Learning Approach","date":"2024-02-06","arxiv_id":"2402.03750","repositories_listed":1,"syntology":null},{"url":"/paper/latent-graph-diffusion-a-unified-framework","slug":"latent-graph-diffusion-a-unified-framework","title":"Unifying Generation and Prediction on Graphs with Latent Graph Diffusion","date":"2024-02-04","arxiv_id":"2402.02518","repositories_listed":1,"syntology":{"n":13,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":5,"n_honours":0,"n_violates":1,"n_no_contract":5,"n_pointer_only":4,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/latent-graph-diffusion-a-unified-framework#ran","syntology_url":"https://syntology.ai/paper/2402.02518","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.02518"}},"official":{"repos":["zhouc20/latentgraphdiffusion"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/a-cross-view-hierarchical-graph-learning","slug":"a-cross-view-hierarchical-graph-learning","title":"A Cross-View Hierarchical Graph Learning Hypernetwork for Skill Demand-Supply Joint Prediction","date":"2024-01-31","arxiv_id":"2401.17838","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":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) · 2 unverified","sample_list":"/paper/a-cross-view-hierarchical-graph-learning#ran","syntology_url":"https://syntology.ai/paper/2401.17838","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.17838"}},"official":{"repos":["vincent40416/Skill-Demand-Supply-Joint-Prediction"],"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/graph-contrastive-learning-with-cohesive","slug":"graph-contrastive-learning-with-cohesive","title":"Graph Contrastive Learning with Cohesive Subgraph Awareness","date":"2024-01-31","arxiv_id":"2401.17580","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/graph-contrastive-learning-with-cohesive#ran","syntology_url":"https://syntology.ai/paper/2401.17580","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.17580"}},"official":{"repos":["wuyucheng2002/ctaug"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-semantic-consistency-dirichlet-energy","slug":"towards-semantic-consistency-dirichlet-energy","title":"Towards Semantic Consistency: Dirichlet Energy Driven Robust Multi-Modal Entity Alignment","date":"2024-01-31","arxiv_id":"2401.17859","repositories_listed":1,"syntology":null}],"record_sha256":"404aef5069fd6e8af201c3089e27a6dcf169ee3f594308423c6ff76d922e5e75","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}