{"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-representation-learning/papers/2","list_of":"/task/graph-representation-learning","task":"Graph Representation 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":2,"pages_in_order":10,"rows_per_page":100,"rows":[101,200],"of":982,"counts":{"archive_papers_tagged":982,"with_a_code_link":479,"where_syntology_ran_a_sample":129,"not_listed_spam_title":0,"listed":982,"listed_where_code_ran":129,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":115,"every_run_a_failure_of_syntologys_instrument":14,"listed_with_a_run_with_no_instrument_failure":115,"listed_every_run_a_failure_of_syntologys_instrument":14,"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-representation-learning","prev":"/task/graph-representation-learning","next":"/task/graph-representation-learning/papers/3","papers":[{"url":"/paper/line-graph-vietoris-rips-persistence-diagram","slug":"line-graph-vietoris-rips-persistence-diagram","title":"Line Graph Vietoris-Rips Persistence Diagram for Topological Graph Representation Learning","date":"2024-12-23","arxiv_id":"2412.17468","repositories_listed":1,"syntology":null},{"url":"/paper/a-deep-probabilistic-framework-for-continuous","slug":"a-deep-probabilistic-framework-for-continuous","title":"A Deep Probabilistic Framework for Continuous Time Dynamic Graph Generation","date":"2024-12-20","arxiv_id":"2412.15582","repositories_listed":1,"syntology":null},{"url":"/paper/gnn-transformer-cooperative-architecture-for","slug":"gnn-transformer-cooperative-architecture-for","title":"GNN-Transformer Cooperative Architecture for Trustworthy Graph Contrastive Learning","date":"2024-12-18","arxiv_id":"2412.16218","repositories_listed":1,"syntology":null},{"url":"/paper/multi-class-and-multi-task-strategies-for","slug":"multi-class-and-multi-task-strategies-for","title":"Multi-Class and Multi-Task Strategies for Neural Directed Link Prediction","date":"2024-12-14","arxiv_id":"2412.10895","repositories_listed":1,"syntology":null},{"url":"/paper/ringformer-a-ring-enhanced-graph-transformer","slug":"ringformer-a-ring-enhanced-graph-transformer","title":"RingFormer: A Ring-Enhanced Graph Transformer for Organic Solar Cell Property Prediction","date":"2024-12-12","arxiv_id":"2412.09030","repositories_listed":1,"syntology":null},{"url":"/paper/mixture-of-experts-meets-decoupled-message","slug":"mixture-of-experts-meets-decoupled-message","title":"Mixture of Experts Meets Decoupled Message Passing: Towards General and Adaptive Node Classification","date":"2024-12-11","arxiv_id":"2412.08193","repositories_listed":1,"syntology":null},{"url":"/paper/repository-level-graph-representation","slug":"repository-level-graph-representation","title":"Repository-Level Graph Representation Learning for Enhanced Security Patch Detection","date":"2024-12-11","arxiv_id":"2412.08068","repositories_listed":1,"syntology":null},{"url":"/paper/why-does-dropping-edges-usually-outperform","slug":"why-does-dropping-edges-usually-outperform","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","date":"2024-12-11","arxiv_id":"2412.08128","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":6,"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) · 0 unverified","sample_list":"/paper/why-does-dropping-edges-usually-outperform#ran","syntology_url":"https://syntology.ai/paper/2412.08128","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.08128"}},"official":{"repos":["hyzhang98/epagcl"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/from-chebnet-to-chebgibbsnet-1","slug":"from-chebnet-to-chebgibbsnet-1","title":"From ChebNet to ChebGibbsNet","date":"2024-12-02","arxiv_id":"2412.01789","repositories_listed":1,"syntology":null},{"url":"/paper/grokformer-graph-fourier-kolmogorov-arnold","slug":"grokformer-graph-fourier-kolmogorov-arnold","title":"GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers","date":"2024-11-26","arxiv_id":"2411.17296","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":3,"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 3 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/grokformer-graph-fourier-kolmogorov-arnold#ran","syntology_url":"https://syntology.ai/paper/2411.17296","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.17296"}},"official":{"repos":["GGA23/GrokFormer"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/tangnn-a-concise-scalable-and-effective-graph","slug":"tangnn-a-concise-scalable-and-effective-graph","title":"TANGNN: a Concise, Scalable and Effective Graph Neural Networks with Top-m Attention Mechanism for Graph Representation Learning","date":"2024-11-23","arxiv_id":"2411.15458","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-conditional-distribution","slug":"self-supervised-conditional-distribution","title":"Conditional Distribution Learning on Graphs","date":"2024-11-20","arxiv_id":"2411.15206","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":6,"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) · 0 unverified","sample_list":"/paper/self-supervised-conditional-distribution#ran","syntology_url":"https://syntology.ai/paper/2411.15206","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.15206"}},"official":{"repos":["chenjie20/SSCDL"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/an-efficient-memory-module-for-graph-few-shot","slug":"an-efficient-memory-module-for-graph-few-shot","title":"An Efficient Memory Module for Graph Few-Shot Class-Incremental Learning","date":"2024-11-11","arxiv_id":"2411.06659","repositories_listed":1,"syntology":null},{"url":"/paper/variational-graph-contrastive-learning","slug":"variational-graph-contrastive-learning","title":"Variational Graph Contrastive Learning","date":"2024-11-11","arxiv_id":"2411.07150","repositories_listed":1,"syntology":null},{"url":"/paper/centrality-graph-shift-operators-for-graph","slug":"centrality-graph-shift-operators-for-graph","title":"Centrality Graph Shift Operators for Graph Neural Networks","date":"2024-11-07","arxiv_id":"2411.04655","repositories_listed":1,"syntology":null},{"url":"/paper/non-euclidean-mixture-model-for-social","slug":"non-euclidean-mixture-model-for-social","title":"Non-Euclidean Mixture Model for Social Network Embedding","date":"2024-11-07","arxiv_id":"2411.04876","repositories_listed":1,"syntology":null},{"url":"/paper/query-efficient-adversarial-attack-against","slug":"query-efficient-adversarial-attack-against","title":"Query-Efficient Adversarial Attack Against Vertical Federated Graph Learning","date":"2024-11-05","arxiv_id":"2411.02809","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-consistency-in-graph","slug":"exploring-consistency-in-graph","title":"Exploring Consistency in Graph Representations:from Graph Kernels to Graph Neural Networks","date":"2024-10-31","arxiv_id":"2410.23748","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/exploring-consistency-in-graph#ran","syntology_url":"https://syntology.ai/paper/2410.23748","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.23748"}},"official":{"repos":["graphminddartmouth/graph-consistency"],"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/theoretical-insights-into-line-graph","slug":"theoretical-insights-into-line-graph","title":"Theoretical Insights into Line Graph Transformation on Graph Learning","date":"2024-10-21","arxiv_id":"2410.16138","repositories_listed":1,"syntology":null},{"url":"/paper/explanation-preserving-augmentation-for-semi","slug":"explanation-preserving-augmentation-for-semi","title":"Explanation-Preserving Augmentation for Semi-Supervised Graph Representation Learning","date":"2024-10-16","arxiv_id":"2410.12657","repositories_listed":1,"syntology":null},{"url":"/paper/quest-querying-functional-and-structural","slug":"quest-querying-functional-and-structural","title":"Querying functional and structural niches on spatial transcriptomics data","date":"2024-10-14","arxiv_id":"2410.10652","repositories_listed":1,"syntology":null},{"url":"/paper/diffusing-to-the-top-boost-graph-neural","slug":"diffusing-to-the-top-boost-graph-neural","title":"Diffusing to the Top: Boost Graph Neural Networks with Minimal Hyperparameter Tuning","date":"2024-10-08","arxiv_id":"2410.05697","repositories_listed":1,"syntology":null},{"url":"/paper/proxi-challenging-the-gnns-for-link","slug":"proxi-challenging-the-gnns-for-link","title":"PROXI: Challenging the GNNs for Link Prediction","date":"2024-10-02","arxiv_id":"2410.01802","repositories_listed":1,"syntology":null},{"url":"/paper/whole-graph-representation-learning-for-the","slug":"whole-graph-representation-learning-for-the","title":"Whole-Graph Representation Learning For the Classification of Signed Networks","date":"2024-09-30","arxiv_id":"2409.20073","repositories_listed":1,"syntology":null},{"url":"/paper/neuropath-a-neural-pathway-transformer-for","slug":"neuropath-a-neural-pathway-transformer-for","title":"NeuroPath: A Neural Pathway Transformer for Joining the Dots of Human Connectomes","date":"2024-09-26","arxiv_id":"2409.17510","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/neuropath-a-neural-pathway-transformer-for#ran","syntology_url":"https://syntology.ai/paper/2409.17510","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.17510"}},"official":{"repos":["Chrisa142857/neuro_detour"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/molecular-graph-representation-learning-via","slug":"molecular-graph-representation-learning-via","title":"Molecular Graph Representation Learning via Structural Similarity Information","date":"2024-09-13","arxiv_id":"2409.08580","repositories_listed":1,"syntology":null},{"url":"/paper/disentangling-amplifying-and-debiasing","slug":"disentangling-amplifying-and-debiasing","title":"Disentangling, Amplifying, and Debiasing: Learning Disentangled Representations for Fair Graph Neural Networks","date":"2024-08-23","arxiv_id":"2408.12875","repositories_listed":1,"syntology":null},{"url":"/paper/molecular-graph-representation-learning","slug":"molecular-graph-representation-learning","title":"Molecular Graph Representation Learning Integrating Large Language Models with Domain-specific Small Models","date":"2024-08-19","arxiv_id":"2408.10124","repositories_listed":1,"syntology":null},{"url":"/paper/2408-03195","slug":"2408-03195","title":"RELIEF: Reinforcement Learning Empowered Graph Feature Prompt Tuning","date":"2024-08-06","arxiv_id":"2408.03195","repositories_listed":1,"syntology":{"n":15,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":15,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/2408-03195#ran","syntology_url":"https://syntology.ai/paper/2408.03195","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.03195"}},"official":{"repos":["JasonZhujp/RELIEF"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/2408-00490","slug":"2408-00490","title":"Graph Representation Learning via Causal Diffusion for Out-of-Distribution Recommendation","date":"2024-08-01","arxiv_id":"2408.00490","repositories_listed":1,"syntology":null},{"url":"/paper/noise-resilient-unsupervised-graph","slug":"noise-resilient-unsupervised-graph","title":"Noise-Resilient Unsupervised Graph Representation Learning via Multi-Hop Feature Quality Estimation","date":"2024-07-29","arxiv_id":"2407.19944","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-graph-compressed-convolutions","slug":"scalable-graph-compressed-convolutions","title":"Scalable Graph Compressed Convolutions","date":"2024-07-26","arxiv_id":"2407.18480","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-the-role-of-node-diversity-in","slug":"exploring-the-role-of-node-diversity-in","title":"Exploring the Role of Node Diversity in Directed Graph Representation Learning","date":"2024-07-25","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/polyformer-scalable-node-wise-filters-via","slug":"polyformer-scalable-node-wise-filters-via","title":"PolyFormer: Scalable Node-wise Filters via Polynomial Graph Transformer","date":"2024-07-19","arxiv_id":"2407.14459","repositories_listed":1,"syntology":{"n":14,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":14,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/polyformer-scalable-node-wise-filters-via#ran","syntology_url":"https://syntology.ai/paper/2407.14459","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.14459"}},"official":{"repos":["air029/polyformer"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/unsupervised-graph-representation-learning","slug":"unsupervised-graph-representation-learning","title":"Unsupervised Graph Representation Learning with Inductive Shallow Node Embedding","date":"2024-07-12","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/olga-one-class-graph-autoencoder","slug":"olga-one-class-graph-autoencoder","title":"OLGA: One-cLass Graph Autoencoder","date":"2024-06-13","arxiv_id":"2406.09131","repositories_listed":1,"syntology":null},{"url":"/paper/learning-long-range-dependencies-on-graphs","slug":"learning-long-range-dependencies-on-graphs","title":"Learning Long Range Dependencies on Graphs via Random Walks","date":"2024-06-05","arxiv_id":"2406.03386","repositories_listed":1,"syntology":{"n":13,"n_ran":13,"n_constructed":0,"n_ran_checked":10,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-long-range-dependencies-on-graphs#ran","syntology_url":"https://syntology.ai/paper/2406.03386","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03386"}},"official":{"repos":["borgwardtlab/neuralwalker"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/predicting-genetic-mutation-from-whole-slide","slug":"predicting-genetic-mutation-from-whole-slide","title":"Predicting Genetic Mutation from Whole Slide Images via Biomedical-Linguistic Knowledge Enhanced Multi-label Classification","date":"2024-06-05","arxiv_id":"2406.02990","repositories_listed":1,"syntology":null},{"url":"/paper/gefl-extended-filtration-learning-for-graph","slug":"gefl-extended-filtration-learning-for-graph","title":"GEFL: Extended Filtration Learning for Graph Classification","date":"2024-06-04","arxiv_id":"2406.02732","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-fairness-in-unsupervised-graph","slug":"enhancing-fairness-in-unsupervised-graph","title":"Enhancing Fairness in Unsupervised Graph Anomaly Detection through Disentanglement","date":"2024-06-03","arxiv_id":"2406.00987","repositories_listed":1,"syntology":null},{"url":"/paper/know-your-neighborhood-general-and-zero-shot","slug":"know-your-neighborhood-general-and-zero-shot","title":"Know Your Neighborhood: General and Zero-Shot Capable Binary Function Search Powered by Call Graphlets","date":"2024-06-02","arxiv_id":"2406.02606","repositories_listed":1,"syntology":null},{"url":"/paper/graph-external-attention-enhanced-transformer","slug":"graph-external-attention-enhanced-transformer","title":"Graph External Attention Enhanced Transformer","date":"2024-05-31","arxiv_id":"2405.21061","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":2,"n_no_contract":6,"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, 2 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/graph-external-attention-enhanced-transformer#ran","syntology_url":"https://syntology.ai/paper/2405.21061","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.21061"}},"official":{"repos":["icm1018/geaet"],"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/a-structure-aware-framework-for-learning","slug":"a-structure-aware-framework-for-learning","title":"A Structure-Aware Framework for Learning Device Placements on Computation Graphs","date":"2024-05-23","arxiv_id":"2405.14185","repositories_listed":1,"syntology":null},{"url":"/paper/gcondenser-benchmarking-graph-condensation","slug":"gcondenser-benchmarking-graph-condensation","title":"GCondenser: Benchmarking Graph Condensation","date":"2024-05-23","arxiv_id":"2405.14246","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/gcondenser-benchmarking-graph-condensation#ran","syntology_url":"https://syntology.ai/paper/2405.14246","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.14246"}},"official":{"repos":["superallen13/GCondenser"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/harnessing-collective-structure-knowledge-in","slug":"harnessing-collective-structure-knowledge-in","title":"Harnessing Collective Structure Knowledge in Data Augmentation for Graph Neural Networks","date":"2024-05-17","arxiv_id":"2405.10633","repositories_listed":1,"syntology":null},{"url":"/paper/fair-graph-representation-learning-via","slug":"fair-graph-representation-learning-via","title":"Fair Graph Representation Learning via Sensitive Attribute Disentanglement","date":"2024-05-11","arxiv_id":"2405.07011","repositories_listed":1,"syntology":null},{"url":"/paper/pac-bayesian-generalization-bounds-for-2","slug":"pac-bayesian-generalization-bounds-for-2","title":"PAC-Bayesian Generalization Bounds for Knowledge Graph Representation Learning","date":"2024-05-10","arxiv_id":"2405.06418","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":2,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"phrase":"3 ran (of which 2 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) · 1 unverified","sample_list":"/paper/pac-bayesian-generalization-bounds-for-2#ran","syntology_url":"https://syntology.ai/paper/2405.06418","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.06418"}},"official":{"repos":["bdi-lab/reed"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"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/temporal-graph-odes-for-irregularly-sampled","slug":"temporal-graph-odes-for-irregularly-sampled","title":"Temporal Graph ODEs for Irregularly-Sampled Time Series","date":"2024-04-30","arxiv_id":"2404.19508","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/temporal-graph-odes-for-irregularly-sampled#ran","syntology_url":"https://syntology.ai/paper/2404.19508","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.19508"}},"official":{"repos":["gravins/tg-ode"],"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/bounding-the-expected-robustness-of-graph","slug":"bounding-the-expected-robustness-of-graph","title":"Bounding the Expected Robustness of Graph Neural Networks Subject to Node Feature Attacks","date":"2024-04-27","arxiv_id":"2404.17947","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/bounding-the-expected-robustness-of-graph#ran","syntology_url":"https://syntology.ai/paper/2404.17947","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.17947"}},"official":{"repos":["sennadir/gcorn"],"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/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/multi-view-graph-structural-representation","slug":"multi-view-graph-structural-representation","title":"An Efficient Loop and Clique Coarsening Algorithm for Graph Classification","date":"2024-04-18","arxiv_id":"2404.11869","repositories_listed":1,"syntology":null},{"url":"/paper/videosage-video-summarization-with-graph","slug":"videosage-video-summarization-with-graph","title":"VideoSAGE: Video Summarization with Graph Representation Learning","date":"2024-04-14","arxiv_id":"2404.10539","repositories_listed":1,"syntology":null},{"url":"/paper/mpxgat-an-attention-based-deep-learning-model","slug":"mpxgat-an-attention-based-deep-learning-model","title":"MPXGAT: An Attention based Deep Learning Model for Multiplex Graphs Embedding","date":"2024-03-28","arxiv_id":"2403.19246","repositories_listed":1,"syntology":null},{"url":"/paper/investigating-similarities-across","slug":"investigating-similarities-across","title":"Investigating Similarities Across Decentralized Financial (DeFi) Services","date":"2024-03-23","arxiv_id":"2404.00034","repositories_listed":1,"syntology":null},{"url":"/paper/gtc-gnn-transformer-co-contrastive-learning","slug":"gtc-gnn-transformer-co-contrastive-learning","title":"GTC: GNN-Transformer Co-contrastive Learning for Self-supervised Heterogeneous Graph Representation","date":"2024-03-22","arxiv_id":"2403.15520","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":2,"n_honours":3,"n_violates":0,"n_no_contract":1,"n_pointer_only":8,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 3 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/gtc-gnn-transformer-co-contrastive-learning#ran","syntology_url":"https://syntology.ai/paper/2403.15520","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.15520"}},"official":{"repos":["phd-lanyu/gtc"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/spatial-temporal-graph-representation","slug":"spatial-temporal-graph-representation","title":"Spatial-Temporal Graph Representation Learning for Tactical Networks Future State Prediction","date":"2024-03-20","arxiv_id":"2403.13872","repositories_listed":1,"syntology":null},{"url":"/paper/complete-and-efficient-graph-transformers-for","slug":"complete-and-efficient-graph-transformers-for","title":"Complete and Efficient Graph Transformers for Crystal Material Property Prediction","date":"2024-03-18","arxiv_id":"2403.11857","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-graph-representation-with-knowledge","slug":"dynamic-graph-representation-with-knowledge","title":"Dynamic Graph Representation with Knowledge-aware Attention for Histopathology Whole Slide Image Analysis","date":"2024-03-12","arxiv_id":"2403.07719","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/dynamic-graph-representation-with-knowledge#ran","syntology_url":"https://syntology.ai/paper/2403.07719","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.07719"}},"official":{"repos":["wonderlandxd/wikg"],"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/hegae-ac-heterogeneous-graph-auto-encoder-for","slug":"hegae-ac-heterogeneous-graph-auto-encoder-for","title":"HeGAE-AC: heterogeneous graph auto-encoder for attribute completion","date":"2024-03-05","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/multi-hop-attention-based-graph-pooling-a","slug":"multi-hop-attention-based-graph-pooling-a","title":"Multi-hop Attention-based Graph Pooling: A Personalized PageRank Perspective","date":"2024-03-04","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/decoupling-weighing-and-selecting-for","slug":"decoupling-weighing-and-selecting-for","title":"Decoupling Weighing and Selecting for Integrating Multiple Graph Pre-training Tasks","date":"2024-03-03","arxiv_id":"2403.01400","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":7,"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) · 2 unverified","sample_list":"/paper/decoupling-weighing-and-selecting-for#ran","syntology_url":"https://syntology.ai/paper/2403.01400","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.01400"}},"official":{"repos":["tianyufan0504/was"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/hierarchical-multi-relational-graph","slug":"hierarchical-multi-relational-graph","title":"Hierarchical Multi-Relational Graph Representation Learning for Large-Scale Prediction of Drug-Drug Interactions","date":"2024-02-28","arxiv_id":"2402.18127","repositories_listed":1,"syntology":null},{"url":"/paper/representation-learning-in-multiplex-graphs","slug":"representation-learning-in-multiplex-graphs","title":"Representation learning in multiplex graphs: Where and how to fuse information?","date":"2024-02-27","arxiv_id":"2402.17906","repositories_listed":1,"syntology":null},{"url":"/paper/graph-mamba-towards-learning-on-graphs-with","slug":"graph-mamba-towards-learning-on-graphs-with","title":"Graph Mamba: Towards Learning on Graphs with State Space Models","date":"2024-02-13","arxiv_id":"2402.08678","repositories_listed":1,"syntology":null},{"url":"/paper/taser-temporal-adaptive-sampling-for-fast-and","slug":"taser-temporal-adaptive-sampling-for-fast-and","title":"TASER: Temporal Adaptive Sampling for Fast and Accurate Dynamic Graph Representation Learning","date":"2024-02-08","arxiv_id":"2402.05396","repositories_listed":1,"syntology":null},{"url":"/paper/two-trades-is-not-baffled-condense-graph-via","slug":"two-trades-is-not-baffled-condense-graph-via","title":"Two Trades is not Baffled: Condensing Graph via Crafting Rational Gradient Matching","date":"2024-02-07","arxiv_id":"2402.04924","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/two-trades-is-not-baffled-condense-graph-via#ran","syntology_url":"https://syntology.ai/paper/2402.04924","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.04924"}},"official":{"repos":["nus-hpc-ai-lab/ctrl"],"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/a-graph-is-worth-k-words-euclideanizing-graph","slug":"a-graph-is-worth-k-words-euclideanizing-graph","title":"A Graph is Worth $K$ Words: Euclideanizing Graph using Pure Transformer","date":"2024-02-04","arxiv_id":"2402.02464","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-graph-is-worth-k-words-euclideanizing-graph#ran","syntology_url":"https://syntology.ai/paper/2402.02464","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.02464"}},"official":{"repos":["A4Bio/GraphsGPT"],"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/no-need-to-look-back-an-efficient-and","slug":"no-need-to-look-back-an-efficient-and","title":"Scalable and Efficient Temporal Graph Representation Learning via Forward Recent Sampling","date":"2024-02-03","arxiv_id":"2402.01964","repositories_listed":1,"syntology":null},{"url":"/paper/few-shot-learning-on-graphs-from-meta","slug":"few-shot-learning-on-graphs-from-meta","title":"A Survey of Few-Shot Learning on Graphs: from Meta-Learning to Pre-Training and Prompt Learning","date":"2024-02-02","arxiv_id":"2402.01440","repositories_listed":1,"syntology":null},{"url":"/paper/l2g2g-a-scalable-local-to-global-network","slug":"l2g2g-a-scalable-local-to-global-network","title":"L2G2G: a Scalable Local-to-Global Network Embedding with Graph Autoencoders","date":"2024-02-02","arxiv_id":"2402.01614","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/l2g2g-a-scalable-local-to-global-network#ran","syntology_url":"https://syntology.ai/paper/2402.01614","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.01614"}},"official":{"repos":["tonyauyeung/local2gae2global"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-domain-adaptation-challenges-progress","slug":"graph-domain-adaptation-challenges-progress","title":"Graph Domain Adaptation: Challenges, Progress and Prospects","date":"2024-02-01","arxiv_id":"2402.00904","repositories_listed":1,"syntology":null},{"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/gradient-flow-of-energy-a-general-and","slug":"gradient-flow-of-energy-a-general-and","title":"Gradient Flow of Energy: A General and Efficient Approach for Entity Alignment Decoding","date":"2024-01-23","arxiv_id":"2401.12798","repositories_listed":1,"syntology":null},{"url":"/paper/graph-representation-learning-for-contention","slug":"graph-representation-learning-for-contention","title":"Graph Representation Learning for Contention and Interference Management in Wireless Networks","date":"2024-01-15","arxiv_id":"2402.00879","repositories_listed":1,"syntology":null},{"url":"/paper/motif-aware-riemannian-graph-neural-network","slug":"motif-aware-riemannian-graph-neural-network","title":"Motif-aware Riemannian Graph Neural Network with Generative-Contrastive Learning","date":"2024-01-02","arxiv_id":"2401.01232","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/motif-aware-riemannian-graph-neural-network#ran","syntology_url":"https://syntology.ai/paper/2401.01232","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.01232"}},"official":{"repos":["riemanngraph/motifrgc"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/diffkg-knowledge-graph-diffusion-model-for","slug":"diffkg-knowledge-graph-diffusion-model-for","title":"DiffKG: Knowledge Graph Diffusion Model for Recommendation","date":"2023-12-28","arxiv_id":"2312.16890","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/diffkg-knowledge-graph-diffusion-model-for#ran","syntology_url":"https://syntology.ai/paper/2312.16890","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.16890"}},"official":{"repos":["hkuds/diffkg"],"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/pc-conv-unifying-homophily-and-heterophily","slug":"pc-conv-unifying-homophily-and-heterophily","title":"PC-Conv: Unifying Homophily and Heterophily with Two-fold Filtering","date":"2023-12-22","arxiv_id":"2312.14438","repositories_listed":1,"syntology":{"n":14,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":14,"phrase":"10 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; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/pc-conv-unifying-homophily-and-heterophily#ran","syntology_url":"https://syntology.ai/paper/2312.14438","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.14438"}},"official":{"repos":["uestclbh/pc-conv"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":4,"ran_from_kinds":["official"]}}},{"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/hierarchical-topology-isomorphism-expertise","slug":"hierarchical-topology-isomorphism-expertise","title":"Hierarchical Topology Isomorphism Expertise Embedded Graph Contrastive Learning","date":"2023-12-21","arxiv_id":"2312.14222","repositories_listed":1,"syntology":null},{"url":"/paper/social-recommendation-through-heterogeneous","slug":"social-recommendation-through-heterogeneous","title":"Social Recommendation through Heterogeneous Graph Modeling of the Long-term and Short-term Preference Defined by Dynamic Time Spans","date":"2023-12-21","arxiv_id":"2312.14306","repositories_listed":1,"syntology":null},{"url":"/paper/graph-invariant-learning-with-subgraph-co","slug":"graph-invariant-learning-with-subgraph-co","title":"Graph Invariant Learning with Subgraph Co-mixup for Out-Of-Distribution Generalization","date":"2023-12-18","arxiv_id":"2312.10988","repositories_listed":1,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":9,"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) · 4 unverified","sample_list":"/paper/graph-invariant-learning-with-subgraph-co#ran","syntology_url":"https://syntology.ai/paper/2312.10988","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.10988"}},"official":{"repos":["bupt-gamma/igm"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/lightgcn-evaluated-and-enhanced","slug":"lightgcn-evaluated-and-enhanced","title":"LightGCN: Evaluated and Enhanced","date":"2023-12-17","arxiv_id":"2312.16183","repositories_listed":1,"syntology":null},{"url":"/paper/relational-deep-learning-graph-representation","slug":"relational-deep-learning-graph-representation","title":"Relational Deep Learning: Graph Representation Learning on Relational Databases","date":"2023-12-07","arxiv_id":"2312.04615","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-initialization-of-graph-neural","slug":"on-the-initialization-of-graph-neural","title":"On the Initialization of Graph Neural Networks","date":"2023-12-05","arxiv_id":"2312.02622","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-the-initialization-of-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2312.02622","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.02622"}},"official":{"repos":["lspongebobjh/virgo_icml2023"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/normed-spaces-for-graph-embedding","slug":"normed-spaces-for-graph-embedding","title":"Normed Spaces for Graph Embedding","date":"2023-12-03","arxiv_id":"2312.01502","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/normed-spaces-for-graph-embedding#ran","syntology_url":"https://syntology.ai/paper/2312.01502","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.01502"}},"official":{"repos":["andyweizhao/graphs-normed-spaces"],"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/recurrent-distance-encoding-neural-networks","slug":"recurrent-distance-encoding-neural-networks","title":"Recurrent Distance Filtering for Graph Representation Learning","date":"2023-12-03","arxiv_id":"2312.01538","repositories_listed":1,"syntology":{"n":21,"n_ran":12,"n_constructed":2,"n_ran_checked":9,"n_instrument":3,"n_unverified":9,"n_honours":0,"n_violates":1,"n_no_contract":8,"n_pointer_only":21,"phrase":"12 ran (of which 2 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 1 violated, 8 with no contract checked; 3 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/recurrent-distance-encoding-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2312.01538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.01538"}},"official":{"repos":["skeletondyh/gred"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":2,"n_ran_no_instrument_failure":9,"n_unverified":9,"ran_from_kinds":["official"]}}},{"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/multigprompt-for-multi-task-pre-training-and","slug":"multigprompt-for-multi-task-pre-training-and","title":"MultiGPrompt for Multi-Task Pre-Training and Prompting on Graphs","date":"2023-11-28","arxiv_id":"2312.03731","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"phrase":"4 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multigprompt-for-multi-task-pre-training-and#ran","syntology_url":"https://syntology.ai/paper/2312.03731","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.03731"}},"official":{"repos":["nashchou/multigprompt"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"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/hgclip-exploring-vision-language-models-with-1","slug":"hgclip-exploring-vision-language-models-with-1","title":"HGCLIP: Exploring Vision-Language Models with Graph Representations for Hierarchical Understanding","date":"2023-11-23","arxiv_id":"2311.14064","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/hgclip-exploring-vision-language-models-with-1#ran","syntology_url":"https://syntology.ai/paper/2311.14064","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.14064"}},"official":{"repos":["richard-peng-xia/HGCLIP"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/cross-view-graph-consistency-learning-for","slug":"cross-view-graph-consistency-learning-for","title":"Cross-View Graph Consistency Learning for Invariant Graph Representations","date":"2023-11-20","arxiv_id":"2311.11821","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/calibrate-and-boost-logical-expressiveness-of","slug":"calibrate-and-boost-logical-expressiveness-of","title":"Calibrate and Boost Logical Expressiveness of GNN Over Multi-Relational and Temporal Graphs","date":"2023-11-03","arxiv_id":"2311.01647","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/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/unimap-universal-smiles-graph-representation","slug":"unimap-universal-smiles-graph-representation","title":"UniMAP: Universal SMILES-Graph Representation Learning","date":"2023-10-22","arxiv_id":"2310.14216","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-the-performance-of-automated-grade","slug":"enhancing-the-performance-of-automated-grade","title":"Enhancing the Performance of Automated Grade Prediction in MOOC using Graph Representation Learning","date":"2023-10-18","arxiv_id":"2310.12281","repositories_listed":1,"syntology":null},{"url":"/paper/prompt-tuning-for-multi-view-graph","slug":"prompt-tuning-for-multi-view-graph","title":"Self-Pro: A Self-Prompt and Tuning Framework for Graph Neural Networks","date":"2023-10-16","arxiv_id":"2310.10362","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":7,"phrase":"6 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/prompt-tuning-for-multi-view-graph#ran","syntology_url":"https://syntology.ai/paper/2310.10362","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.10362"}},"official":{"repos":["gongchenghua/self-pro"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/magic-detecting-advanced-persistent-threats","slug":"magic-detecting-advanced-persistent-threats","title":"MAGIC: Detecting Advanced Persistent Threats via Masked Graph Representation Learning","date":"2023-10-15","arxiv_id":"2310.09831","repositories_listed":1,"syntology":null}],"record_sha256":"d02442c08b9b7b7c402ae5197b0268e1223c52606eb6b7a10bb0760211ba11e1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}