{"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/3","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":3,"pages_in_order":10,"rows_per_page":100,"rows":[201,300],"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/papers/2","next":"/task/graph-representation-learning/papers/4","papers":[{"url":"/paper/audio-event-relational-graph-representation","slug":"audio-event-relational-graph-representation","title":"Audio Event-Relational Graph Representation Learning for Acoustic Scene Classification","date":"2023-10-05","arxiv_id":"2310.03889","repositories_listed":1,"syntology":null},{"url":"/paper/certifiably-robust-graph-contrastive-learning-1","slug":"certifiably-robust-graph-contrastive-learning-1","title":"Certifiably Robust Graph Contrastive Learning","date":"2023-10-05","arxiv_id":"2310.03312","repositories_listed":1,"syntology":null},{"url":"/paper/dine-dimensional-interpretability-of-node","slug":"dine-dimensional-interpretability-of-node","title":"DINE: Dimensional Interpretability of Node Embeddings","date":"2023-10-02","arxiv_id":"2310.01162","repositories_listed":1,"syntology":null},{"url":"/paper/transformers-are-efficient-hierarchical","slug":"transformers-are-efficient-hierarchical","title":"Transformers are efficient hierarchical chemical graph learners","date":"2023-10-02","arxiv_id":"2310.01704","repositories_listed":1,"syntology":null},{"url":"/paper/learning-node-representation-via-motif","slug":"learning-node-representation-via-motif","title":"Learning node representation via Motif Coarsening","date":"2023-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/augment-to-interpret-unsupervised-and","slug":"augment-to-interpret-unsupervised-and","title":"Augment to Interpret: Unsupervised and Inherently Interpretable Graph Embeddings","date":"2023-09-28","arxiv_id":"2309.16564","repositories_listed":1,"syntology":null},{"url":"/paper/graph-contrastive-learning-meets-graph-meta","slug":"graph-contrastive-learning-meets-graph-meta","title":"Graph Contrastive Learning Meets Graph Meta Learning: A Unified Method for Few-shot Node Tasks","date":"2023-09-19","arxiv_id":"2309.10376","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-contrastive-learning-meets-graph-meta#ran","syntology_url":"https://syntology.ai/paper/2309.10376","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.10376"}},"official":{"repos":["haoliu-cola/cola"],"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/unikg-a-benchmark-and-universal-embedding-for","slug":"unikg-a-benchmark-and-universal-embedding-for","title":"UniKG: A Benchmark and Universal Embedding for Large-Scale Knowledge Graphs","date":"2023-09-11","arxiv_id":"2309.05269","repositories_listed":1,"syntology":null},{"url":"/paper/rdgsl-dynamic-graph-representation-learning","slug":"rdgsl-dynamic-graph-representation-learning","title":"RDGSL: Dynamic Graph Representation Learning with Structure Learning","date":"2023-09-05","arxiv_id":"2309.02025","repositories_listed":1,"syntology":null},{"url":"/paper/pure-message-passing-can-estimate-common","slug":"pure-message-passing-can-estimate-common","title":"Pure Message Passing Can Estimate Common Neighbor for Link Prediction","date":"2023-09-02","arxiv_id":"2309.00976","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":10,"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/pure-message-passing-can-estimate-common#ran","syntology_url":"https://syntology.ai/paper/2309.00976","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.00976"}},"official":{"repos":["Barcavin/efficient-node-labelling"],"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/concur-self-supervised-graph-representation","slug":"concur-self-supervised-graph-representation","title":"ConCur: Self-supervised graph representation based on contrastive learning with curriculum negative sampling","date":"2023-09-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/companion-animal-disease-diagnostics-based-on","slug":"companion-animal-disease-diagnostics-based-on","title":"Companion Animal Disease Diagnostics based on Literal-aware Medical Knowledge Graph Representation Learning","date":"2023-08-31","arxiv_id":"2309.03219","repositories_listed":1,"syntology":null},{"url":"/paper/a-hybrid-membership-latent-distance-model-for","slug":"a-hybrid-membership-latent-distance-model-for","title":"A Hybrid Membership Latent Distance Model for Unsigned and Signed Integer Weighted Networks","date":"2023-08-29","arxiv_id":"2308.15293","repositories_listed":1,"syntology":null},{"url":"/paper/can-transformer-and-gnn-help-each-other","slug":"can-transformer-and-gnn-help-each-other","title":"TransGNN: Harnessing the Collaborative Power of Transformers and Graph Neural Networks for Recommender Systems","date":"2023-08-28","arxiv_id":"2308.14355","repositories_listed":1,"syntology":null},{"url":"/paper/joint-prediction-of-audio-event-and-annoyance","slug":"joint-prediction-of-audio-event-and-annoyance","title":"Joint Prediction of Audio Event and Annoyance Rating in an Urban Soundscape by Hierarchical Graph Representation Learning","date":"2023-08-23","arxiv_id":"2308.11980","repositories_listed":1,"syntology":null},{"url":"/paper/biomedical-knowledge-graph-embeddings-with","slug":"biomedical-knowledge-graph-embeddings-with","title":"Biomedical Knowledge Graph Embeddings with Negative Statements","date":"2023-08-07","arxiv_id":"2308.03447","repositories_listed":1,"syntology":null},{"url":"/paper/event-based-dynamic-graph-representation","slug":"event-based-dynamic-graph-representation","title":"Event-based Dynamic Graph Representation Learning for Patent Application Trend Prediction","date":"2023-08-04","arxiv_id":"2308.09780","repositories_listed":1,"syntology":null},{"url":"/paper/gradient-based-spectral-embeddings-of-random","slug":"gradient-based-spectral-embeddings-of-random","title":"Gradient-Based Spectral Embeddings of Random Dot Product Graphs","date":"2023-07-25","arxiv_id":"2307.13818","repositories_listed":1,"syntology":null},{"url":"/paper/echoglad-hierarchical-graph-neural-networks","slug":"echoglad-hierarchical-graph-neural-networks","title":"EchoGLAD: Hierarchical Graph Neural Networks for Left Ventricle Landmark Detection on Echocardiograms","date":"2023-07-23","arxiv_id":"2307.12229","repositories_listed":1,"syntology":null},{"url":"/paper/expert-knowledge-aware-image-difference-graph","slug":"expert-knowledge-aware-image-difference-graph","title":"Expert Knowledge-Aware Image Difference Graph Representation Learning for Difference-Aware Medical Visual Question Answering","date":"2023-07-22","arxiv_id":"2307.11986","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/expert-knowledge-aware-image-difference-graph#ran","syntology_url":"https://syntology.ai/paper/2307.11986","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.11986"}},"official":{"repos":["holipori/mimic-diff-vqa"],"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/neural-architecture-retrieval","slug":"neural-architecture-retrieval","title":"Neural Architecture Retrieval","date":"2023-07-16","arxiv_id":"2307.07919","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/neural-architecture-retrieval#ran","syntology_url":"https://syntology.ai/paper/2307.07919","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.07919"}},"official":{"repos":["terrypei/nnretrieval"],"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/frameless-graph-knowledge-distillation","slug":"frameless-graph-knowledge-distillation","title":"Frameless Graph Knowledge Distillation","date":"2023-07-13","arxiv_id":"2307.06631","repositories_listed":1,"syntology":null},{"url":"/paper/causal-neural-graph-collaborative-filtering","slug":"causal-neural-graph-collaborative-filtering","title":"Neural Causal Graph Collaborative Filtering","date":"2023-07-10","arxiv_id":"2307.04384","repositories_listed":1,"syntology":null},{"url":"/paper/improving-heterogeneous-graph-learning-with","slug":"improving-heterogeneous-graph-learning-with","title":"Improving Heterogeneous Graph Learning with Weighted Mixed-Curvature Product Manifold","date":"2023-07-10","arxiv_id":"2307.04514","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/improving-heterogeneous-graph-learning-with#ran","syntology_url":"https://syntology.ai/paper/2307.04514","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.04514"}},"official":{"repos":["sharecodesubmission/weighted_product_manifold"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/histopathology-whole-slide-image-analysis-1","slug":"histopathology-whole-slide-image-analysis-1","title":"Histopathology Whole Slide Image Analysis with Heterogeneous Graph Representation Learning","date":"2023-07-09","arxiv_id":"2307.04189","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":6,"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) · 3 unverified","sample_list":"/paper/histopathology-whole-slide-image-analysis-1#ran","syntology_url":"https://syntology.ai/paper/2307.04189","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.04189"}},"official":{"repos":["hku-medai/wsi-hgnn"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/engage-explanation-guided-data-augmentation","slug":"engage-explanation-guided-data-augmentation","title":"ENGAGE: Explanation Guided Data Augmentation for Graph Representation Learning","date":"2023-07-03","arxiv_id":"2307.01053","repositories_listed":1,"syntology":null},{"url":"/paper/otter-knowledge-benchmarks-of-multimodal","slug":"otter-knowledge-benchmarks-of-multimodal","title":"Otter-Knowledge: benchmarks of multimodal knowledge graph representation learning from different sources for drug discovery","date":"2023-06-22","arxiv_id":"2306.12802","repositories_listed":1,"syntology":null},{"url":"/paper/accelerating-dynamic-network-embedding-with","slug":"accelerating-dynamic-network-embedding-with","title":"Accelerating Dynamic Network Embedding with Billions of Parameter Updates to Milliseconds","date":"2023-06-15","arxiv_id":"2306.08967","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/accelerating-dynamic-network-embedding-with#ran","syntology_url":"https://syntology.ai/paper/2306.08967","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.08967"}},"official":{"repos":["zjunet/damf"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/point-voxel-absorbing-graph-representation","slug":"point-voxel-absorbing-graph-representation","title":"Point-Voxel Absorbing Graph Representation Learning for Event Stream based Recognition","date":"2023-06-08","arxiv_id":"2306.05239","repositories_listed":1,"syntology":null},{"url":"/paper/commonsense-knowledge-graph-completion-via","slug":"commonsense-knowledge-graph-completion-via","title":"Commonsense Knowledge Graph Completion Via Contrastive Pretraining and Node Clustering","date":"2023-05-26","arxiv_id":"2305.17019","repositories_listed":1,"syntology":null},{"url":"/paper/union-subgraph-neural-networks","slug":"union-subgraph-neural-networks","title":"Union Subgraph Neural Networks","date":"2023-05-25","arxiv_id":"2305.15747","repositories_listed":1,"syntology":null},{"url":"/paper/graph-propagation-transformer-for-graph","slug":"graph-propagation-transformer-for-graph","title":"Graph Propagation Transformer for Graph Representation Learning","date":"2023-05-19","arxiv_id":"2305.11424","repositories_listed":1,"syntology":{"n":8,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":8,"phrase":"4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/graph-propagation-transformer-for-graph#ran","syntology_url":"https://syntology.ai/paper/2305.11424","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.11424"}},"official":{"repos":["czczup/gptrans"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-view-graph-representation-learning-for","slug":"multi-view-graph-representation-learning-for","title":"Multi-View Graph Representation Learning for Answering Hybrid Numerical Reasoning Question","date":"2023-05-05","arxiv_id":"2305.03458","repositories_listed":1,"syntology":null},{"url":"/paper/deep-graph-representation-learning-and","slug":"deep-graph-representation-learning-and","title":"Deep Graph Representation Learning and Optimization for Influence Maximization","date":"2023-05-01","arxiv_id":"2305.02200","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deep-graph-representation-learning-and#ran","syntology_url":"https://syntology.ai/paper/2305.02200","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.02200"}},"official":{"repos":["triplej0079/deepim"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/strengthening-structural-baselines-for-graph","slug":"strengthening-structural-baselines-for-graph","title":"Strengthening structural baselines for graph classification using Local Topological Profile","date":"2023-05-01","arxiv_id":"2305.00724","repositories_listed":1,"syntology":null},{"url":"/paper/neuralkg-ind-a-python-library-for-inductive","slug":"neuralkg-ind-a-python-library-for-inductive","title":"NeuralKG-ind: A Python Library for Inductive Knowledge Graph Representation Learning","date":"2023-04-28","arxiv_id":"2304.14678","repositories_listed":1,"syntology":null},{"url":"/paper/connector-0-5-a-unified-framework-for-graph","slug":"connector-0-5-a-unified-framework-for-graph","title":"Connector 0.5: A unified framework for graph representation learning","date":"2023-04-25","arxiv_id":"2304.13195","repositories_listed":1,"syntology":null},{"url":"/paper/what-do-gnns-actually-learn-towards","slug":"what-do-gnns-actually-learn-towards","title":"What Do GNNs Actually Learn? Towards Understanding their Representations","date":"2023-04-21","arxiv_id":"2304.10851","repositories_listed":1,"syntology":null},{"url":"/paper/stochastic-subgraph-neighborhood-pooling-for","slug":"stochastic-subgraph-neighborhood-pooling-for","title":"Stochastic Subgraph Neighborhood Pooling for Subgraph Classification","date":"2023-04-17","arxiv_id":"2304.08556","repositories_listed":1,"syntology":null},{"url":"/paper/multi-view-graph-representation-learning","slug":"multi-view-graph-representation-learning","title":"Multi-View Graph Representation Learning Beyond Homophily","date":"2023-04-15","arxiv_id":"2304.07509","repositories_listed":1,"syntology":null},{"url":"/paper/hyperbolic-geometric-graph-representation","slug":"hyperbolic-geometric-graph-representation","title":"Hyperbolic Geometric Graph Representation Learning for Hierarchy-imbalance Node Classification","date":"2023-04-11","arxiv_id":"2304.05059","repositories_listed":1,"syntology":null},{"url":"/paper/cafin-centrality-aware-fairness-inducing-in","slug":"cafin-centrality-aware-fairness-inducing-in","title":"CAFIN: Centrality Aware Fairness inducing IN-processing for Unsupervised Representation Learning on Graphs","date":"2023-04-10","arxiv_id":"2304.04391","repositories_listed":1,"syntology":null},{"url":"/paper/class-imbalanced-learning-on-graphs-a-survey","slug":"class-imbalanced-learning-on-graphs-a-survey","title":"Class-Imbalanced Learning on Graphs: A Survey","date":"2023-04-09","arxiv_id":"2304.04300","repositories_listed":1,"syntology":null},{"url":"/paper/topological-pooling-on-graphs","slug":"topological-pooling-on-graphs","title":"Topological Pooling on Graphs","date":"2023-03-25","arxiv_id":"2303.14543","repositories_listed":1,"syntology":null},{"url":"/paper/spatio-temporal-au-relational-graph","slug":"spatio-temporal-au-relational-graph","title":"Spatio-Temporal AU Relational Graph Representation Learning For Facial Action Units Detection","date":"2023-03-19","arxiv_id":"2303.10644","repositories_listed":1,"syntology":null},{"url":"/paper/surel-moving-from-walks-to-sets-for-scalable","slug":"surel-moving-from-walks-to-sets-for-scalable","title":"SUREL+: Moving from Walks to Sets for Scalable Subgraph-based Graph Representation Learning","date":"2023-03-06","arxiv_id":"2303.03379","repositories_listed":1,"syntology":null},{"url":"/paper/towards-improved-illicit-node-detection-with","slug":"towards-improved-illicit-node-detection-with","title":"Towards Improved Illicit Node Detection with Positive-Unlabelled Learning","date":"2023-03-04","arxiv_id":"2303.02462","repositories_listed":1,"syntology":null},{"url":"/paper/ftm-a-frame-level-timeline-modeling-method","slug":"ftm-a-frame-level-timeline-modeling-method","title":"FTM: A Frame-level Timeline Modeling Method for Temporal Graph Representation Learning","date":"2023-02-23","arxiv_id":"2302.11814","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":4,"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 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) · 0 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/ftm-a-frame-level-timeline-modeling-method#ran","syntology_url":"https://syntology.ai/paper/2302.11814","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.11814"}},"official":{"repos":["yeeeqichen/ftm"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-deep-probabilistic-spatiotemporal-framework","slug":"a-deep-probabilistic-spatiotemporal-framework","title":"A Deep Probabilistic Spatiotemporal Framework for Dynamic Graph Representation Learning with Application to Brain Disorder Identification","date":"2023-02-14","arxiv_id":"2302.07243","repositories_listed":1,"syntology":null},{"url":"/paper/lazygnn-large-scale-graph-neural-networks-via","slug":"lazygnn-large-scale-graph-neural-networks-via","title":"LazyGNN: Large-Scale Graph Neural Networks via Lazy Propagation","date":"2023-02-03","arxiv_id":"2302.01503","repositories_listed":1,"syntology":null},{"url":"/paper/simultaneous-linear-multi-view-attributed","slug":"simultaneous-linear-multi-view-attributed","title":"Simultaneous Linear Multi-view Attributed Graph Representation Learning and Clustering","date":"2023-02-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/unbiased-and-efficient-self-supervised","slug":"unbiased-and-efficient-self-supervised","title":"Unbiased and Efficient Self-Supervised Incremental Contrastive Learning","date":"2023-01-28","arxiv_id":"2301.12104","repositories_listed":1,"syntology":null},{"url":"/paper/characterizing-polarization-in-social","slug":"characterizing-polarization-in-social","title":"Characterizing Polarization in Social Networks using the Signed Relational Latent Distance Model","date":"2023-01-23","arxiv_id":"2301.09507","repositories_listed":1,"syntology":null},{"url":"/paper/logical-message-passing-networks-with-one-hop","slug":"logical-message-passing-networks-with-one-hop","title":"Logical Message Passing Networks with One-hop Inference on Atomic Formulas","date":"2023-01-21","arxiv_id":"2301.08859","repositories_listed":1,"syntology":null},{"url":"/paper/wl-align-weisfeiler-lehman-relabeling-for","slug":"wl-align-weisfeiler-lehman-relabeling-for","title":"WL-Align: Weisfeiler-Lehman Relabeling for Aligning Users across Networks via Regularized Representation Learning","date":"2022-12-29","arxiv_id":"2212.14182","repositories_listed":1,"syntology":null},{"url":"/paper/data-augmentation-on-graphs-a-survey","slug":"data-augmentation-on-graphs-a-survey","title":"Data Augmentation on Graphs: A Technical Survey","date":"2022-12-20","arxiv_id":"2212.09970","repositories_listed":1,"syntology":null},{"url":"/paper/graph-convolutional-neural-networks-with","slug":"graph-convolutional-neural-networks-with","title":"Graph Convolutional Neural Networks with Diverse Negative Samples via Decomposed Determinant Point Processes","date":"2022-12-05","arxiv_id":"2212.02055","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-smoothing-unsupervised-graph","slug":"beyond-smoothing-unsupervised-graph","title":"Beyond Smoothing: Unsupervised Graph Representation Learning with Edge Heterophily Discriminating","date":"2022-11-25","arxiv_id":"2211.14065","repositories_listed":1,"syntology":null},{"url":"/paper/rhco-a-relation-aware-heterogeneous-graph","slug":"rhco-a-relation-aware-heterogeneous-graph","title":"RHCO: A Relation-aware Heterogeneous Graph Neural Network with Contrastive Learning for Large-scale Graphs","date":"2022-11-20","arxiv_id":"2211.11752","repositories_listed":1,"syntology":null},{"url":"/paper/gratis-deep-learning-graph-representation","slug":"gratis-deep-learning-graph-representation","title":"GRATIS: Deep Learning Graph Representation with Task-specific Topology and Multi-dimensional Edge Features","date":"2022-11-19","arxiv_id":"2211.12482","repositories_listed":1,"syntology":null},{"url":"/paper/fairmile-a-multi-level-framework-for-fair-and","slug":"fairmile-a-multi-level-framework-for-fair-and","title":"FairMILE: Towards an Efficient Framework for Fair Graph Representation Learning","date":"2022-11-17","arxiv_id":"2211.09925","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fairmile-a-multi-level-framework-for-fair-and#ran","syntology_url":"https://syntology.ai/paper/2211.09925","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.09925"}},"official":{"repos":["heyuntian/fairmile"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/mgtcom-community-detection-in-multimodal","slug":"mgtcom-community-detection-in-multimodal","title":"MGTCOM: Community Detection in Multimodal Graphs","date":"2022-11-10","arxiv_id":"2211.06331","repositories_listed":1,"syntology":null},{"url":"/paper/implicit-graphon-neural-representation","slug":"implicit-graphon-neural-representation","title":"Implicit Graphon Neural Representation","date":"2022-11-07","arxiv_id":"2211.03329","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":7,"n_pointer_only":2,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 1 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/implicit-graphon-neural-representation#ran","syntology_url":"https://syntology.ai/paper/2211.03329","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.03329"}},"official":{"repos":["mishne-lab/ignr"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarial-causal-augmentation-for-graph","slug":"adversarial-causal-augmentation-for-graph","title":"Unleashing the Power of Graph Data Augmentation on Covariate Distribution Shift","date":"2022-11-05","arxiv_id":"2211.02843","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adversarial-causal-augmentation-for-graph#ran","syntology_url":"https://syntology.ai/paper/2211.02843","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.02843"}},"official":{"repos":["yongduosui/aia"],"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/geometry-complete-perceptron-networks-for-3d","slug":"geometry-complete-perceptron-networks-for-3d","title":"Geometry-Complete Perceptron Networks for 3D Molecular Graphs","date":"2022-11-04","arxiv_id":"2211.02504","repositories_listed":1,"syntology":null},{"url":"/paper/page-prototype-based-model-level-explanations","slug":"page-prototype-based-model-level-explanations","title":"PAGE: Prototype-Based Model-Level Explanations for Graph Neural Networks","date":"2022-10-31","arxiv_id":"2210.17159","repositories_listed":1,"syntology":null},{"url":"/paper/towards-relation-centered-pooling-and","slug":"towards-relation-centered-pooling-and","title":"Towards Relation-centered Pooling and Convolution for Heterogeneous Graph Learning Networks","date":"2022-10-31","arxiv_id":"2210.17142","repositories_listed":1,"syntology":null},{"url":"/paper/multi-dimensional-edge-based-audio-event","slug":"multi-dimensional-edge-based-audio-event","title":"Multi-dimensional Edge-based Audio Event Relational Graph Representation Learning for Acoustic Scene Classification","date":"2022-10-27","arxiv_id":"2210.15366","repositories_listed":1,"syntology":null},{"url":"/paper/transformers-over-directed-acyclic-graphs-1","slug":"transformers-over-directed-acyclic-graphs-1","title":"Transformers over Directed Acyclic Graphs","date":"2022-10-24","arxiv_id":"2210.13148","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":4,"n_pointer_only":3,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 2 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/transformers-over-directed-acyclic-graphs-1#ran","syntology_url":"https://syntology.ai/paper/2210.13148","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.13148"}},"official":null}},{"url":"/paper/graph-coloring-via-neural-networks-for","slug":"graph-coloring-via-neural-networks-for","title":"Graph Coloring via Neural Networks for Haplotype Assembly and Viral Quasispecies Reconstruction","date":"2022-10-21","arxiv_id":"2210.12158","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/graph-coloring-via-neural-networks-for#ran","syntology_url":"https://syntology.ai/paper/2210.12158","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.12158"}},"official":{"repos":["xuehansheng/neurhap"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/dyted-disentangling-temporal-invariance-and","slug":"dyted-disentangling-temporal-invariance-and","title":"DyTed: Disentangled Representation Learning for Discrete-time Dynamic Graph","date":"2022-10-19","arxiv_id":"2210.10592","repositories_listed":1,"syntology":null},{"url":"/paper/mdgcf-multi-dependency-graph-collaborative","slug":"mdgcf-multi-dependency-graph-collaborative","title":"MDGCF: Multi-Dependency Graph Collaborative Filtering with Neighborhood- and Homogeneous-level Dependencies","date":"2022-10-17","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/unifying-graph-contrastive-learning-with","slug":"unifying-graph-contrastive-learning-with","title":"Unifying Graph Contrastive Learning with Flexible Contextual Scopes","date":"2022-10-17","arxiv_id":"2210.08792","repositories_listed":1,"syntology":null},{"url":"/paper/towards-real-time-temporal-graph-learning","slug":"towards-real-time-temporal-graph-learning","title":"Towards Real-Time Temporal Graph Learning","date":"2022-10-08","arxiv_id":"2210.04114","repositories_listed":1,"syntology":null},{"url":"/paper/empowering-graph-representation-learning-with-1","slug":"empowering-graph-representation-learning-with-1","title":"Empowering Graph Representation Learning with Test-Time Graph Transformation","date":"2022-10-07","arxiv_id":"2210.03561","repositories_listed":1,"syntology":null},{"url":"/paper/expander-graph-propagation","slug":"expander-graph-propagation","title":"Expander Graph Propagation","date":"2022-10-06","arxiv_id":"2210.02997","repositories_listed":1,"syntology":null},{"url":"/paper/geodesic-graph-neural-network-for-efficient","slug":"geodesic-graph-neural-network-for-efficient","title":"Geodesic Graph Neural Network for Efficient Graph Representation Learning","date":"2022-10-06","arxiv_id":"2210.02636","repositories_listed":1,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/geodesic-graph-neural-network-for-efficient#ran","syntology_url":"https://syntology.ai/paper/2210.02636","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.02636"}},"official":{"repos":["woodcutter1998/gdgnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/unsupervised-multimodal-change-detection","slug":"unsupervised-multimodal-change-detection","title":"Unsupervised Multimodal Change Detection Based on Structural Relationship Graph Representation Learning","date":"2022-10-03","arxiv_id":"2210.00941","repositories_listed":1,"syntology":null},{"url":"/paper/dyngl-sdp-dynamic-graph-learning-for-semantic","slug":"dyngl-sdp-dynamic-graph-learning-for-semantic","title":"DynGL-SDP: Dynamic Graph Learning for Semantic Dependency Parsing","date":"2022-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/oqm9hk-a-large-scale-graph-dataset-for","slug":"oqm9hk-a-large-scale-graph-dataset-for","title":"OQM9HK: A Large-Scale Graph Dataset for Machine Learning in Materials Science","date":"2022-09-30","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/material-prediction-for-design-automation","slug":"material-prediction-for-design-automation","title":"Material Prediction for Design Automation Using Graph Representation Learning","date":"2022-09-26","arxiv_id":"2209.12793","repositories_listed":1,"syntology":null},{"url":"/paper/deep-steiner-learning-to-solve-the-euclidean","slug":"deep-steiner-learning-to-solve-the-euclidean","title":"Deep-Steiner: Learning to Solve the Euclidean Steiner Tree Problem","date":"2022-09-20","arxiv_id":"2209.09983","repositories_listed":1,"syntology":null},{"url":"/paper/cell-attention-networks","slug":"cell-attention-networks","title":"Cell Attention Networks","date":"2022-09-16","arxiv_id":"2209.08179","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/cell-attention-networks#ran","syntology_url":"https://syntology.ai/paper/2209.08179","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.08179"}},"official":{"repos":["lrnzgiusti/can"],"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/public-wisdom-matters-discourse-aware","slug":"public-wisdom-matters-discourse-aware","title":"Public Wisdom Matters! Discourse-Aware Hyperbolic Fourier Co-Attention for Social-Text Classification","date":"2022-09-15","arxiv_id":"2209.13017","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/public-wisdom-matters-discourse-aware#ran","syntology_url":"https://syntology.ai/paper/2209.13017","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.13017"}},"official":{"repos":["LCS2-IIITD/Hyphen"],"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/temporal-knowledge-graph-representation","slug":"temporal-knowledge-graph-representation","title":"Temporal knowledge graph representation learning with local and global evolutions","date":"2022-09-05","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/structure-preserving-graph-representation","slug":"structure-preserving-graph-representation","title":"Structure-Preserving Graph Representation Learning","date":"2022-09-02","arxiv_id":"2209.00793","repositories_listed":1,"syntology":null},{"url":"/paper/relational-self-supervised-learning-on-graphs","slug":"relational-self-supervised-learning-on-graphs","title":"Relational Self-Supervised Learning on Graphs","date":"2022-08-21","arxiv_id":"2208.10493","repositories_listed":1,"syntology":null},{"url":"/paper/modeling-two-way-selection-preference-for","slug":"modeling-two-way-selection-preference-for","title":"Modeling Two-Way Selection Preference for Person-Job Fit","date":"2022-08-18","arxiv_id":"2208.08612","repositories_listed":1,"syntology":null},{"url":"/paper/robust-causal-graph-representation-learning","slug":"robust-causal-graph-representation-learning","title":"Robust Causal Graph Representation Learning against Confounding Effects","date":"2022-08-18","arxiv_id":"2208.08584","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"0 ran · 3 unverified","sample_list":"/paper/robust-causal-graph-representation-learning#ran","syntology_url":"https://syntology.ai/paper/2208.08584","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.08584"}},"official":{"repos":["hang53/rcgrl"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/autism-spectrum-disorder-classification-based","slug":"autism-spectrum-disorder-classification-based","title":"Autism spectrum disorder classification based on interpersonal neural synchrony: Can classification be improved by dyadic neural biomarkers using unsupervised graph representation learning?","date":"2022-08-17","arxiv_id":"2208.08902","repositories_listed":1,"syntology":null},{"url":"/paper/ariel-adversarial-graph-contrastive-learning","slug":"ariel-adversarial-graph-contrastive-learning","title":"ARIEL: Adversarial Graph Contrastive Learning","date":"2022-08-15","arxiv_id":"2208.06956","repositories_listed":1,"syntology":null},{"url":"/paper/mm-gnn-mix-moment-graph-neural-network","slug":"mm-gnn-mix-moment-graph-neural-network","title":"MM-GNN: Mix-Moment Graph Neural Network towards Modeling Neighborhood Feature Distribution","date":"2022-08-15","arxiv_id":"2208.07012","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":5,"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) · 3 unverified","sample_list":"/paper/mm-gnn-mix-moment-graph-neural-network#ran","syntology_url":"https://syntology.ai/paper/2208.07012","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.07012"}},"official":{"repos":["wendongbi/MMGNN"],"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/scaling-up-dynamic-graph-representation","slug":"scaling-up-dynamic-graph-representation","title":"Scaling Up Dynamic Graph Representation Learning via Spiking Neural Networks","date":"2022-08-15","arxiv_id":"2208.10364","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/scaling-up-dynamic-graph-representation#ran","syntology_url":"https://syntology.ai/paper/2208.10364","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.10364"}},"official":{"repos":["edisonleeeee/spikenet"],"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/motif-based-graph-representation-learning","slug":"motif-based-graph-representation-learning","title":"Motif-based Graph Representation Learning with Application to Chemical Molecules","date":"2022-08-09","arxiv_id":"2208.04529","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 2 unverified","sample_list":"/paper/motif-based-graph-representation-learning#ran","syntology_url":"https://syntology.ai/paper/2208.04529","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.04529"}},"official":{"repos":["yifeiwang15/motifconv"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/towards-graph-representation-learning-based","slug":"towards-graph-representation-learning-based","title":"Towards Graph Representation Learning Based Surgical Workflow Anticipation","date":"2022-08-07","arxiv_id":"2208.03824","repositories_listed":1,"syntology":null},{"url":"/paper/generative-subgraph-contrast-for-self","slug":"generative-subgraph-contrast-for-self","title":"Generative Subgraph Contrast for Self-Supervised Graph Representation Learning","date":"2022-07-25","arxiv_id":"2207.11996","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"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 1 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; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/generative-subgraph-contrast-for-self#ran","syntology_url":"https://syntology.ai/paper/2207.11996","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.11996"}},"official":{"repos":["yh-han/gsc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/model-aware-contrastive-learning-towards","slug":"model-aware-contrastive-learning-towards","title":"Model-Aware Contrastive Learning: Towards Escaping the Dilemmas","date":"2022-07-16","arxiv_id":"2207.07874","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/model-aware-contrastive-learning-towards#ran","syntology_url":"https://syntology.ai/paper/2207.07874","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.07874"}},"official":{"repos":["chenhaoxing/MACL_ICML2023"],"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/a-proposal-of-multi-layer-perceptron-with","slug":"a-proposal-of-multi-layer-perceptron-with","title":"A Proposal of Multi-Layer Perceptron with Graph Gating Unit for Graph Representation Learning and its Application to Surrogate Model for FEM","date":"2022-07-11","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/features-based-adaptive-augmentation-for","slug":"features-based-adaptive-augmentation-for","title":"Features Based Adaptive Augmentation for Graph Contrastive Learning","date":"2022-07-05","arxiv_id":"2207.01792","repositories_listed":1,"syntology":null},{"url":"/paper/mm-gatbt-enriching-multimodal-representation","slug":"mm-gatbt-enriching-multimodal-representation","title":"MM-GATBT: Enriching Multimodal Representation Using Graph Attention Network","date":"2022-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null}],"record_sha256":"530255ff2e996fc50fcf105c64e6cb81d26a09c5575184005aa84fa43b9e0da8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}