{"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":"/dataset/reddit","name":"Reddit","full_name":null,"description_markdown":"The **Reddit** dataset is a graph dataset from Reddit posts made in the month of September, 2014. The node label in this case is the community, or “subreddit”, that a post belongs to. 50 large communities have been sampled to build a post-to-post graph, connecting posts if the same user comments on both. In total this dataset contains 232,965 posts with an average degree of 492. The first 20 days are used for training and the remaining days for testing (with 30% used for validation). For features, off-the-shelf 300-dimensional GloVe CommonCrawl word vectors are used.\r\n\r\nSource: [https://arxiv.org/pdf/1706.02216.pdf](https://arxiv.org/pdf/1706.02216.pdf)\r\nImage Source: [https://minimaxir.com/2016/05/reddit-graph/](https://minimaxir.com/2016/05/reddit-graph/)","description_withheld":null,"homepage":"http://snap.stanford.edu/graphsage/","introduced_date":"2017-01-01","introduced_date_note":null,"introduced_by":{"paper":"/paper/inductive-representation-learning-on-large","title":"Inductive Representation Learning on Large Graphs","first_author":"William L. Hamilton","url":null},"license":{"name":"Unknown","url":null},"modalities":[{"name":"Graphs","url":"/datasets/modality/graphs"}],"tasks":[{"name":"Classification","url":"/task/classification-1","datasets_with_task":"/datasets/task/classification-1"},{"name":"Question Answering","url":"/task/question-answering","datasets_with_task":"/datasets/task/question-answering"},{"name":"Text Classification","url":"/task/text-classification","datasets_with_task":"/datasets/task/text-classification"},{"name":"Node Classification","url":"/task/node-classification","datasets_with_task":"/datasets/task/node-classification"},{"name":"Text Summarization","url":"/task/text-summarization","datasets_with_task":"/datasets/task/text-summarization"},{"name":"Graph Classification","url":"/task/graph-classification","datasets_with_task":"/datasets/task/graph-classification"},{"name":"Abstractive Text Summarization","url":"/task/abstractive-text-summarization","datasets_with_task":"/datasets/task/abstractive-text-summarization"},{"name":"Conversational Response Selection","url":"/task/conversational-response-selection","datasets_with_task":"/datasets/task/conversational-response-selection"},{"name":"Dialogue Generation","url":"/task/dialogue-generation","datasets_with_task":"/datasets/task/dialogue-generation"},{"name":"Quantization","url":"/task/quantization","datasets_with_task":"/datasets/task/quantization"},{"name":"Sequence-to-sequence Language Modeling","url":"/task/sequence-to-sequence-language-modeling","datasets_with_task":"/datasets/task/sequence-to-sequence-language-modeling"},{"name":"Dynamic Link Prediction","url":"/task/dynamic-link-prediction","datasets_with_task":"/datasets/task/dynamic-link-prediction"},{"name":"Topic Models","url":"/task/topic-models","datasets_with_task":"/datasets/task/topic-models"},{"name":"Sarcasm Detection","url":"/task/sarcasm-detection","datasets_with_task":"/datasets/task/sarcasm-detection"},{"name":"Open-Domain Dialog","url":"/task/open-domain-dialog","datasets_with_task":"/datasets/task/open-domain-dialog"},{"name":"Graph Representation Learning","url":"/task/graph-representation-learning","datasets_with_task":"/datasets/task/graph-representation-learning"},{"name":"Generative Question Answering","url":"/task/generative-question-answering","datasets_with_task":"/datasets/task/generative-question-answering"},{"name":"Dialogue Evaluation","url":"/task/dialogue-evaluation","datasets_with_task":"/datasets/task/dialogue-evaluation"},{"name":"News Generation","url":"/task/news-generation","datasets_with_task":"/datasets/task/news-generation"},{"name":"News Recommendation","url":"/task/news-recommendation","datasets_with_task":"/datasets/task/news-recommendation"},{"name":"Topological Data Analysis","url":"/task/topological-data-analysis","datasets_with_task":"/datasets/task/topological-data-analysis"}],"languages":[{"name":"English","url":"/datasets/language/english"}],"variants":["The Reddit Ethereum Dataset","The Reddit COVID Dataset","The Reddit Climate Change Dataset","Ten Million Reddit Answers","squadshifts reddit","Six Months of GME on Reddit","Reddit TIFU","Reddit /r/WallStreetBets data for August of 2021","Reddit /r/NoNewNormal dataset","Reddit Norm Violations","Reddit (multi-ref)","REDDIT-MULTI-5k","REDDIT-MULTI-12K","Reddit Ideology Database","Reddit Engagement Dataset","Reddit C-SSRS","Reddit cryptocurrency data for August 2021","Reddit Corpus","Reddit Conversation Corpus","REDDIT-BINARY","REDDIT-B","REDDIT-5K","REDDIT-12K","Pushshift Reddit","PolyAI Reddit","One Year of Doge on Reddit","One Million Reddit Questions","One Million Reddit Jokes","One Million Reddit Confessions","Legal Advice Reddit","Five Years of AAPL on Reddit","FigLang 2020 Reddit Dataset","CodeSwitch-Reddit","lmqg/qg_squadshifts","Reddit"],"data_loaders":[{"repo":"https://github.com/rusty1s/pytorch_geometric","url":"https://pytorch-geometric.readthedocs.io/en/latest/modules/datasets.html","frameworks":["pytorch"]},{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/reddit","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/dmlc/dgl","url":"https://docs.dgl.ai/api/python/dgl.data.html#dgl.data.RedditDataset","frameworks":["pytorch","tf","mxnet"]},{"repo":"https://github.com/tensorflow/datasets","url":"https://www.tensorflow.org/datasets/catalog/reddit","frameworks":["tf","jax"]},{"repo":"https://github.com/danielegrattarola/spektral","url":"https://graphneural.network/datasets/#reddit","frameworks":["tf"]}],"num_papers_in_archive":699,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/node-classification-on-reddit","task":"Node Classification","dataset_variant":"Reddit","rows":16,"metrics":["Accuracy","Micro-F1"],"first_row_in_archive_order":{"model":"BNS-GCN","paper":"/paper/bns-gcn-efficient-full-graph-training-of","metrics":{"Accuracy":"97.17%"},"code_links":[{"title":"gatech-eic/bns-gcn","url":"https://github.com/gatech-eic/bns-gcn"},{"title":"RICE-EIC/BNS-GCN","url":"https://github.com/RICE-EIC/BNS-GCN"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/graph-classification-on-reddit-b","task":"Graph Classification","dataset_variant":"REDDIT-B","rows":12,"metrics":["Accuracy","Accuracy (10-fold)"],"first_row_in_archive_order":{"model":"CRaWl","paper":"/paper/graph-learning-with-1d-convolutions-on-random","metrics":{"Accuracy":"93.15"},"code_links":[{"title":"toenshoff/CRaWl","url":"https://github.com/toenshoff/CRaWl"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/conversational-response-selection-on-polyai","task":"Conversational Response Selection","dataset_variant":"PolyAI Reddit","rows":5,"metrics":["1-of-100 Accuracy"],"first_row_in_archive_order":{"model":"Multi-context ConveRT","paper":"/paper/convert-efficient-and-accurate-conversational","metrics":{"1-of-100 Accuracy":"71.8%"},"code_links":[{"title":"golsun/dialogrpt","url":"https://github.com/golsun/dialogrpt"},{"title":"davidalami/convert","url":"https://github.com/davidalami/convert"},{"title":"jordiclive/Convert-PolyAI-Torch","url":"https://github.com/jordiclive/Convert-PolyAI-Torch"},{"title":"koujm/convert-tf","url":"https://github.com/koujm/convert-tf"},{"title":"phamnam-mta/ConveRT-PolyAI-Vietnamese","url":"https://github.com/phamnam-mta/ConveRT-PolyAI-Vietnamese"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/graph-classification-on-reddit-multi-12k","task":"Graph Classification","dataset_variant":"REDDIT-MULTI-12K","rows":3,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GNN (DiffPool)","paper":"/paper/hierarchical-graph-representation-learning","metrics":{"Accuracy":"47.08"},"code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/diffpool"},{"title":"RexYing/diffpool","url":"https://github.com/RexYing/diffpool"},{"title":"RexYing/graph-pooling","url":"https://github.com/RexYing/graph-pooling"},{"title":"AaltoPML/Rethinking-pooling-in-GNNs","url":"https://github.com/AaltoPML/Rethinking-pooling-in-GNNs"},{"title":"gospodima/extended-simgnn","url":"https://github.com/gospodima/extended-simgnn"},{"title":"VoVAllen/diffpool","url":"https://github.com/VoVAllen/diffpool"},{"title":"Tioz90/GCN","url":"https://github.com/Tioz90/GCN"},{"title":"Tioz90/DiffPool","url":"https://github.com/Tioz90/DiffPool"},{"title":"basiralab/reproduciblefedgnn","url":"https://github.com/basiralab/reproduciblefedgnn"},{"title":"basiralab/RG-Select","url":"https://github.com/basiralab/RG-Select"},{"title":"chappers/graph-differential-pooling","url":"https://github.com/chappers/graph-differential-pooling"},{"title":"basiralab/Reproducible-Generative-Learning","url":"https://github.com/basiralab/Reproducible-Generative-Learning"},{"title":"PasqualeAuriemma/GCN-DIFFPOOL","url":"https://github.com/PasqualeAuriemma/GCN-DIFFPOOL"},{"title":"cedric_sanders/masterarbeit","url":"https://gitlab.com/cedric_sanders/masterarbeit"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/sarcasm-detection-on-figlang-2020-reddit","task":"Sarcasm Detection","dataset_variant":"FigLang 2020 Reddit Dataset","rows":2,"metrics":["F1"],"first_row_in_archive_order":{"model":"BERT+Aspect-based approaches","paper":"/paper/applying-transformers-and-aspect-based","metrics":{"F1":"0.737"},"code_links":[]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/dialogue-generation-on-reddit-multi-ref","task":"Dialogue Generation","dataset_variant":"Reddit (multi-ref)","rows":1,"metrics":["interest (human)","relevance (human)"],"first_row_in_archive_order":{"model":"SpaceFusion","paper":"/paper/jointly-optimizing-diversity-and-relevance-in","metrics":{"interest (human)":"2.53","relevance (human)":"2.72"},"code_links":[]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/dynamic-link-prediction-on-reddit","task":"Dynamic Link Prediction","dataset_variant":"Reddit","rows":1,"metrics":["AP"],"first_row_in_archive_order":{"model":"DyG2Vec","paper":"/paper/dyg2vec-representation-learning-for-dynamic","metrics":{"AP":"99.6"},"code_links":[{"title":"huawei-noah/noah-research","url":"https://github.com/huawei-noah/noah-research/tree/master/graph_atlas"},{"title":"huawei-noah/noah-research","url":"https://github.com/huawei-noah/noah-research"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/question-answering-on-squadshifts-reddit","task":"Question Answering","dataset_variant":"squadshifts reddit","rows":0,"metrics":["Exact Match","F1"],"first_row_in_archive_order":null,"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers":{"order":"date (newest first), then slug","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"shown":37,"of":37,"counts":{"papers_with_a_benchmark_row":37,"with_a_code_link":32,"where_syntology_ran_a_sample":15,"not_listed_spam_title":0,"listed":37,"listed_where_code_ran":15,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":14,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":14,"listed_every_run_a_failure_of_syntologys_instrument":1,"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 with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"paper":"/paper/graph-level-representation-learning-with","slug":"graph-level-representation-learning-with","title":"Graph-level Representation Learning with Joint-Embedding Predictive Architectures","date":"2023-09-27","arxiv_id":"2309.16014","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":11,"samples_ran":10,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":4,"samples_unverified":1,"pointer_only_for_licence":4,"official":{"repos":["geriskenderi/graph-jepa"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph-level-representation-learning-with#ran","syntology_url":"https://syntology.ai/paper/2309.16014","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.16014"}}}},{"paper":"/paper/communication-free-distributed-gnn-training","slug":"communication-free-distributed-gnn-training","title":"Communication-Free Distributed GNN Training with Vertex Cut","date":"2023-08-06","arxiv_id":"2308.03209","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/dyg2vec-representation-learning-for-dynamic","slug":"dyg2vec-representation-learning-for-dynamic","title":"DyG2Vec: Efficient Representation Learning for Dynamic Graphs","date":"2022-10-30","arxiv_id":"2210.16906","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/a-comprehensive-study-on-large-scale-graph","slug":"a-comprehensive-study-on-large-scale-graph","title":"A Comprehensive Study on Large-Scale Graph Training: Benchmarking and Rethinking","date":"2022-10-14","arxiv_id":"2210.07494","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":4,"samples_constructed":4,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["vita-group/large_scale_gcn_benchmarking"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-comprehensive-study-on-large-scale-graph#ran","syntology_url":"https://syntology.ai/paper/2210.07494","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.07494"}}}},{"paper":"/paper/bns-gcn-efficient-full-graph-training-of","slug":"bns-gcn-efficient-full-graph-training-of","title":"BNS-GCN: Efficient Full-Graph Training of Graph Convolutional Networks with Partition-Parallelism and Random Boundary Node Sampling","date":"2022-03-21","arxiv_id":"2203.10983","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/dimensionality-reduction-meets-message","slug":"dimensionality-reduction-meets-message","title":"Dimensionality Reduction Meets Message Passing for Graph Node Embeddings","date":"2022-02-01","arxiv_id":"2202.00408","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/decoupling-the-depth-and-scope-of-graph-1","slug":"decoupling-the-depth-and-scope-of-graph-1","title":"Decoupling the Depth and Scope of Graph Neural Networks","date":"2022-01-19","arxiv_id":"2201.07858","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":2,"official":{"repos":["facebookresearch/shaDow_GNN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/decoupling-the-depth-and-scope-of-graph-1#ran","syntology_url":"https://syntology.ai/paper/2201.07858","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.07858"}}}},{"paper":"/paper/vq-gnn-a-universal-framework-to-scale-up","slug":"vq-gnn-a-universal-framework-to-scale-up","title":"VQ-GNN: A Universal Framework to Scale up Graph Neural Networks using Vector Quantization","date":"2021-10-27","arxiv_id":"2110.14363","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/tackling-oversmoothing-of-gnns-with-1","slug":"tackling-oversmoothing-of-gnns-with-1","title":"Deeper-GXX: Deepening Arbitrary GNNs","date":"2021-10-26","arxiv_id":"2110.13798","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/graph-learning-with-1d-convolutions-on-random","slug":"graph-learning-with-1d-convolutions-on-random","title":"Walking Out of the Weisfeiler Leman Hierarchy: Graph Learning Beyond Message Passing","date":"2021-02-17","arxiv_id":"2102.08786","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/simple-spectral-graph-convolution","slug":"simple-spectral-graph-convolution","title":"Simple Spectral Graph Convolution","date":"2021-01-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/a-novel-higher-order-weisfeiler-lehman-graph","slug":"a-novel-higher-order-weisfeiler-lehman-graph","title":"A Novel Higher-order Weisfeiler-Lehman Graph Convolution","date":"2020-07-01","arxiv_id":"2007.00346","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/applying-transformers-and-aspect-based","slug":"applying-transformers-and-aspect-based","title":"Applying Transformers and Aspect-based Sentiment Analysis approaches on Sarcasm Detection","date":"2020-07-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/wasserstein-embedding-for-graph-learning","slug":"wasserstein-embedding-for-graph-learning","title":"Wasserstein Embedding for Graph Learning","date":"2020-06-16","arxiv_id":"2006.09430","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/deep-graph-contrastive-representation","slug":"deep-graph-contrastive-representation","title":"Deep Graph Contrastive Representation Learning","date":"2020-06-07","arxiv_id":"2006.04131","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["CRIPAC-DIG/GRACE"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deep-graph-contrastive-representation#ran","syntology_url":"https://syntology.ai/paper/2006.04131","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04131"}}}},{"paper":"/paper/sarcasm-detection-using-context-separators-in","slug":"sarcasm-detection-using-context-separators-in","title":"Sarcasm Detection using Context Separators in Online Discourse","date":"2020-06-01","arxiv_id":"2006.00850","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/sign-scalable-inception-graph-neural-networks","slug":"sign-scalable-inception-graph-neural-networks","title":"SIGN: Scalable Inception Graph Neural Networks","date":"2020-04-23","arxiv_id":"2004.11198","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["twitter-research/sign"],"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":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/sign-scalable-inception-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2004.11198","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.11198"}}}},{"paper":"/paper/a-fair-comparison-of-graph-neural-networks-1","slug":"a-fair-comparison-of-graph-neural-networks-1","title":"A Fair Comparison of Graph Neural Networks for Graph Classification","date":"2019-12-20","arxiv_id":"1912.09893","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/convert-efficient-and-accurate-conversational","slug":"convert-efficient-and-accurate-conversational","title":"ConveRT: Efficient and Accurate Conversational Representations from Transformers","date":"2019-11-09","arxiv_id":"1911.03688","rows_on_this_dataset":2,"code_links":5,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/convert-efficient-and-accurate-conversational#ran","syntology_url":"https://syntology.ai/paper/1911.03688","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.03688"}}}},{"paper":"/paper/hierarchical-representation-learning-in-graph","slug":"hierarchical-representation-learning-in-graph","title":"Hierarchical Representation Learning in Graph Neural Networks with Node Decimation Pooling","date":"2019-10-24","arxiv_id":"1910.11436","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["danielegrattarola/decimation-pooling"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hierarchical-representation-learning-in-graph#ran","syntology_url":"https://syntology.ai/paper/1910.11436","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.11436"}}}},{"paper":"/paper/the-truly-deep-graph-convolutional-networks","slug":"the-truly-deep-graph-convolutional-networks","title":"DropEdge: Towards Deep Graph Convolutional Networks on Node Classification","date":"2019-07-25","arxiv_id":"1907.10903","rows_on_this_dataset":1,"code_links":7,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["DropEdge/DropEdge"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/the-truly-deep-graph-convolutional-networks#ran","syntology_url":"https://syntology.ai/paper/1907.10903","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.10903"}}}},{"paper":"/paper/graphsaint-graph-sampling-based-inductive","slug":"graphsaint-graph-sampling-based-inductive","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","date":"2019-07-10","arxiv_id":"1907.04931","rows_on_this_dataset":1,"code_links":8,"syntology":null},{"paper":"/paper/improving-attention-mechanism-in-graph-neural","slug":"improving-attention-mechanism-in-graph-neural","title":"Improving Attention Mechanism in Graph Neural Networks via Cardinality Preservation","date":"2019-07-04","arxiv_id":"1907.02204","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["zetayue/CPA"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/improving-attention-mechanism-in-graph-neural#ran","syntology_url":"https://syntology.ai/paper/1907.02204","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.02204"}}}},{"paper":"/paper/190406472","slug":"190406472","title":"A Repository of Conversational Datasets","date":"2019-04-13","arxiv_id":"1904.06472","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["PolyAI-LDN/conversational-datasets"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/190406472#ran","syntology_url":"https://syntology.ai/paper/1904.06472","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.06472"}}}},{"paper":"/paper/rep-the-set-neural-networks-for-learning-set","slug":"rep-the-set-neural-networks-for-learning-set","title":"Rep the Set: Neural Networks for Learning Set Representations","date":"2019-04-03","arxiv_id":"1904.01962","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/towards-a-practical-k-dimensional-weisfeiler","slug":"towards-a-practical-k-dimensional-weisfeiler","title":"Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings","date":"2019-04-02","arxiv_id":"1904.01543","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["chrsmrrs/sparsewl"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/towards-a-practical-k-dimensional-weisfeiler#ran","syntology_url":"https://syntology.ai/paper/1904.01543","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.01543"}}}},{"paper":"/paper/unsupervised-inductive-whole-graph-embedding","slug":"unsupervised-inductive-whole-graph-embedding","title":"Unsupervised Inductive Graph-Level Representation Learning via Graph-Graph Proximity","date":"2019-04-01","arxiv_id":"1904.01098","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/fast-graph-representation-learning-with","slug":"fast-graph-representation-learning-with","title":"Fast Graph Representation Learning with PyTorch Geometric","date":"2019-03-06","arxiv_id":"1903.02428","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["rusty1s/pytorch_geometric"],"state":"official: harvested for another paper","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/fast-graph-representation-learning-with#ran","syntology_url":"https://syntology.ai/paper/1903.02428","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.02428"}}}},{"paper":"/paper/jointly-optimizing-diversity-and-relevance-in","slug":"jointly-optimizing-diversity-and-relevance-in","title":"Jointly Optimizing Diversity and Relevance in Neural Response Generation","date":"2019-02-28","arxiv_id":"1902.11205","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/how-powerful-are-graph-neural-networks","slug":"how-powerful-are-graph-neural-networks","title":"How Powerful are Graph Neural Networks?","date":"2018-10-01","arxiv_id":"1810.00826","rows_on_this_dataset":1,"code_links":19,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":6,"samples_constructed":2,"samples_ran_checked":6,"samples_ran_instrument_failed":0,"samples_unverified":4,"pointer_only_for_licence":5,"official":{"repos":["weihua916/powerful-gnns"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/how-powerful-are-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1810.00826","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.00826"}}}},{"paper":"/paper/adaptive-sampling-towards-fast-graph","slug":"adaptive-sampling-towards-fast-graph","title":"Adaptive Sampling Towards Fast Graph Representation Learning","date":"2018-09-14","arxiv_id":"1809.05343","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/hierarchical-graph-representation-learning","slug":"hierarchical-graph-representation-learning","title":"Hierarchical Graph Representation Learning with Differentiable Pooling","date":"2018-06-22","arxiv_id":"1806.08804","rows_on_this_dataset":1,"code_links":14,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":20,"samples_ran":10,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":1,"samples_unverified":10,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hierarchical-graph-representation-learning#ran","syntology_url":"https://syntology.ai/paper/1806.08804","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.08804"}}}},{"paper":"/paper/universal-sentence-encoder","slug":"universal-sentence-encoder","title":"Universal Sentence Encoder","date":"2018-03-29","arxiv_id":"1803.11175","rows_on_this_dataset":1,"code_links":24,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":22,"samples_ran":18,"samples_constructed":0,"samples_ran_checked":17,"samples_ran_instrument_failed":1,"samples_unverified":4,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/universal-sentence-encoder#ran","syntology_url":"https://syntology.ai/paper/1803.11175","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.11175"}}}},{"paper":"/paper/deep-contextualized-word-representations","slug":"deep-contextualized-word-representations","title":"Deep contextualized word representations","date":"2018-02-15","arxiv_id":"1802.05365","rows_on_this_dataset":1,"code_links":46,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":58,"samples_ran":30,"samples_constructed":12,"samples_ran_checked":24,"samples_ran_instrument_failed":6,"samples_unverified":28,"pointer_only_for_licence":25,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deep-contextualized-word-representations#ran","syntology_url":"https://syntology.ai/paper/1802.05365","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.05365"}}}},{"paper":"/paper/fastgcn-fast-learning-with-graph","slug":"fastgcn-fast-learning-with-graph","title":"FastGCN: Fast Learning with Graph Convolutional Networks via Importance Sampling","date":"2018-01-30","arxiv_id":"1801.10247","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":3,"official":{"repos":["matenure/FastGCN"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/fastgcn-fast-learning-with-graph#ran","syntology_url":"https://syntology.ai/paper/1801.10247","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1801.10247"}}}},{"paper":"/paper/inductive-representation-learning-on-large","slug":"inductive-representation-learning-on-large","title":"Inductive Representation Learning on Large Graphs","date":"2017-06-07","arxiv_id":"1706.02216","rows_on_this_dataset":1,"code_links":20,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":3,"samples_constructed":2,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":5,"official":{"repos":["williamleif/GraphSAGE"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/inductive-representation-learning-on-large#ran","syntology_url":"https://syntology.ai/paper/1706.02216","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.02216"}}}}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"paper":"/paper/graph-level-representation-learning-with","slug":"graph-level-representation-learning-with","title":"Graph-level Representation Learning with Joint-Embedding Predictive Architectures","date":"2023-09-27","arxiv_id":"2309.16014","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":11,"samples_ran":10,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":4,"samples_unverified":1,"pointer_only_for_licence":4,"official":{"repos":["geriskenderi/graph-jepa"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph-level-representation-learning-with#ran","syntology_url":"https://syntology.ai/paper/2309.16014","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.16014"}}}},{"paper":"/paper/communication-free-distributed-gnn-training","slug":"communication-free-distributed-gnn-training","title":"Communication-Free Distributed GNN Training with Vertex Cut","date":"2023-08-06","arxiv_id":"2308.03209","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/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","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/dyg2vec-representation-learning-for-dynamic","slug":"dyg2vec-representation-learning-for-dynamic","title":"DyG2Vec: Efficient Representation Learning for Dynamic Graphs","date":"2022-10-30","arxiv_id":"2210.16906","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/a-comprehensive-study-on-large-scale-graph","slug":"a-comprehensive-study-on-large-scale-graph","title":"A Comprehensive Study on Large-Scale Graph Training: Benchmarking and Rethinking","date":"2022-10-14","arxiv_id":"2210.07494","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":4,"samples_constructed":4,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["vita-group/large_scale_gcn_benchmarking"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-comprehensive-study-on-large-scale-graph#ran","syntology_url":"https://syntology.ai/paper/2210.07494","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.07494"}}}},{"paper":"/paper/bns-gcn-efficient-full-graph-training-of","slug":"bns-gcn-efficient-full-graph-training-of","title":"BNS-GCN: Efficient Full-Graph Training of Graph Convolutional Networks with Partition-Parallelism and Random Boundary Node Sampling","date":"2022-03-21","arxiv_id":"2203.10983","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/dimensionality-reduction-meets-message","slug":"dimensionality-reduction-meets-message","title":"Dimensionality Reduction Meets Message Passing for Graph Node Embeddings","date":"2022-02-01","arxiv_id":"2202.00408","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/decoupling-the-depth-and-scope-of-graph-1","slug":"decoupling-the-depth-and-scope-of-graph-1","title":"Decoupling the Depth and Scope of Graph Neural Networks","date":"2022-01-19","arxiv_id":"2201.07858","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":2,"official":{"repos":["facebookresearch/shaDow_GNN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/decoupling-the-depth-and-scope-of-graph-1#ran","syntology_url":"https://syntology.ai/paper/2201.07858","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.07858"}}}},{"paper":"/paper/vq-gnn-a-universal-framework-to-scale-up","slug":"vq-gnn-a-universal-framework-to-scale-up","title":"VQ-GNN: A Universal Framework to Scale up Graph Neural Networks using Vector Quantization","date":"2021-10-27","arxiv_id":"2110.14363","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/tackling-oversmoothing-of-gnns-with-1","slug":"tackling-oversmoothing-of-gnns-with-1","title":"Deeper-GXX: Deepening Arbitrary GNNs","date":"2021-10-26","arxiv_id":"2110.13798","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/graph-learning-with-1d-convolutions-on-random","slug":"graph-learning-with-1d-convolutions-on-random","title":"Walking Out of the Weisfeiler Leman Hierarchy: Graph Learning Beyond Message Passing","date":"2021-02-17","arxiv_id":"2102.08786","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/simple-spectral-graph-convolution","slug":"simple-spectral-graph-convolution","title":"Simple Spectral Graph Convolution","date":"2021-01-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/a-novel-higher-order-weisfeiler-lehman-graph","slug":"a-novel-higher-order-weisfeiler-lehman-graph","title":"A Novel Higher-order Weisfeiler-Lehman Graph Convolution","date":"2020-07-01","arxiv_id":"2007.00346","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/applying-transformers-and-aspect-based","slug":"applying-transformers-and-aspect-based","title":"Applying Transformers and Aspect-based Sentiment Analysis approaches on Sarcasm Detection","date":"2020-07-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/wasserstein-embedding-for-graph-learning","slug":"wasserstein-embedding-for-graph-learning","title":"Wasserstein Embedding for Graph Learning","date":"2020-06-16","arxiv_id":"2006.09430","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/deep-graph-contrastive-representation","slug":"deep-graph-contrastive-representation","title":"Deep Graph Contrastive Representation Learning","date":"2020-06-07","arxiv_id":"2006.04131","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["CRIPAC-DIG/GRACE"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deep-graph-contrastive-representation#ran","syntology_url":"https://syntology.ai/paper/2006.04131","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04131"}}}},{"paper":"/paper/sarcasm-detection-using-context-separators-in","slug":"sarcasm-detection-using-context-separators-in","title":"Sarcasm Detection using Context Separators in Online Discourse","date":"2020-06-01","arxiv_id":"2006.00850","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/sign-scalable-inception-graph-neural-networks","slug":"sign-scalable-inception-graph-neural-networks","title":"SIGN: Scalable Inception Graph Neural Networks","date":"2020-04-23","arxiv_id":"2004.11198","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["twitter-research/sign"],"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":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/sign-scalable-inception-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2004.11198","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.11198"}}}},{"paper":"/paper/a-fair-comparison-of-graph-neural-networks-1","slug":"a-fair-comparison-of-graph-neural-networks-1","title":"A Fair Comparison of Graph Neural Networks for Graph Classification","date":"2019-12-20","arxiv_id":"1912.09893","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/convert-efficient-and-accurate-conversational","slug":"convert-efficient-and-accurate-conversational","title":"ConveRT: Efficient and Accurate Conversational Representations from Transformers","date":"2019-11-09","arxiv_id":"1911.03688","rows_on_this_dataset":2,"code_links":5,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/convert-efficient-and-accurate-conversational#ran","syntology_url":"https://syntology.ai/paper/1911.03688","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.03688"}}}},{"paper":"/paper/hierarchical-representation-learning-in-graph","slug":"hierarchical-representation-learning-in-graph","title":"Hierarchical Representation Learning in Graph Neural Networks with Node Decimation Pooling","date":"2019-10-24","arxiv_id":"1910.11436","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["danielegrattarola/decimation-pooling"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hierarchical-representation-learning-in-graph#ran","syntology_url":"https://syntology.ai/paper/1910.11436","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.11436"}}}},{"paper":"/paper/the-truly-deep-graph-convolutional-networks","slug":"the-truly-deep-graph-convolutional-networks","title":"DropEdge: Towards Deep Graph Convolutional Networks on Node Classification","date":"2019-07-25","arxiv_id":"1907.10903","rows_on_this_dataset":1,"code_links":7,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["DropEdge/DropEdge"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/the-truly-deep-graph-convolutional-networks#ran","syntology_url":"https://syntology.ai/paper/1907.10903","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.10903"}}}},{"paper":"/paper/graphsaint-graph-sampling-based-inductive","slug":"graphsaint-graph-sampling-based-inductive","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","date":"2019-07-10","arxiv_id":"1907.04931","rows_on_this_dataset":1,"code_links":8,"syntology":null},{"paper":"/paper/improving-attention-mechanism-in-graph-neural","slug":"improving-attention-mechanism-in-graph-neural","title":"Improving Attention Mechanism in Graph Neural Networks via Cardinality Preservation","date":"2019-07-04","arxiv_id":"1907.02204","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["zetayue/CPA"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/improving-attention-mechanism-in-graph-neural#ran","syntology_url":"https://syntology.ai/paper/1907.02204","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.02204"}}}},{"paper":"/paper/190406472","slug":"190406472","title":"A Repository of Conversational Datasets","date":"2019-04-13","arxiv_id":"1904.06472","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["PolyAI-LDN/conversational-datasets"],"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/190406472#ran","syntology_url":"https://syntology.ai/paper/1904.06472","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.06472"}}}},{"paper":"/paper/rep-the-set-neural-networks-for-learning-set","slug":"rep-the-set-neural-networks-for-learning-set","title":"Rep the Set: Neural Networks for Learning Set Representations","date":"2019-04-03","arxiv_id":"1904.01962","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/towards-a-practical-k-dimensional-weisfeiler","slug":"towards-a-practical-k-dimensional-weisfeiler","title":"Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings","date":"2019-04-02","arxiv_id":"1904.01543","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["chrsmrrs/sparsewl"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/towards-a-practical-k-dimensional-weisfeiler#ran","syntology_url":"https://syntology.ai/paper/1904.01543","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.01543"}}}},{"paper":"/paper/unsupervised-inductive-whole-graph-embedding","slug":"unsupervised-inductive-whole-graph-embedding","title":"Unsupervised Inductive Graph-Level Representation Learning via Graph-Graph Proximity","date":"2019-04-01","arxiv_id":"1904.01098","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/fast-graph-representation-learning-with","slug":"fast-graph-representation-learning-with","title":"Fast Graph Representation Learning with PyTorch Geometric","date":"2019-03-06","arxiv_id":"1903.02428","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["rusty1s/pytorch_geometric"],"state":"official: harvested for another paper","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/fast-graph-representation-learning-with#ran","syntology_url":"https://syntology.ai/paper/1903.02428","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.02428"}}}},{"paper":"/paper/jointly-optimizing-diversity-and-relevance-in","slug":"jointly-optimizing-diversity-and-relevance-in","title":"Jointly Optimizing Diversity and Relevance in Neural Response Generation","date":"2019-02-28","arxiv_id":"1902.11205","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/how-powerful-are-graph-neural-networks","slug":"how-powerful-are-graph-neural-networks","title":"How Powerful are Graph Neural Networks?","date":"2018-10-01","arxiv_id":"1810.00826","rows_on_this_dataset":1,"code_links":19,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":6,"samples_constructed":2,"samples_ran_checked":6,"samples_ran_instrument_failed":0,"samples_unverified":4,"pointer_only_for_licence":5,"official":{"repos":["weihua916/powerful-gnns"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/how-powerful-are-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1810.00826","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.00826"}}}},{"paper":"/paper/adaptive-sampling-towards-fast-graph","slug":"adaptive-sampling-towards-fast-graph","title":"Adaptive Sampling Towards Fast Graph Representation Learning","date":"2018-09-14","arxiv_id":"1809.05343","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/hierarchical-graph-representation-learning","slug":"hierarchical-graph-representation-learning","title":"Hierarchical Graph Representation Learning with Differentiable Pooling","date":"2018-06-22","arxiv_id":"1806.08804","rows_on_this_dataset":1,"code_links":14,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":20,"samples_ran":10,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":1,"samples_unverified":10,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hierarchical-graph-representation-learning#ran","syntology_url":"https://syntology.ai/paper/1806.08804","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.08804"}}}},{"paper":"/paper/universal-sentence-encoder","slug":"universal-sentence-encoder","title":"Universal Sentence Encoder","date":"2018-03-29","arxiv_id":"1803.11175","rows_on_this_dataset":1,"code_links":24,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":22,"samples_ran":18,"samples_constructed":0,"samples_ran_checked":17,"samples_ran_instrument_failed":1,"samples_unverified":4,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/universal-sentence-encoder#ran","syntology_url":"https://syntology.ai/paper/1803.11175","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.11175"}}}},{"paper":"/paper/deep-contextualized-word-representations","slug":"deep-contextualized-word-representations","title":"Deep contextualized word representations","date":"2018-02-15","arxiv_id":"1802.05365","rows_on_this_dataset":1,"code_links":46,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":58,"samples_ran":30,"samples_constructed":12,"samples_ran_checked":24,"samples_ran_instrument_failed":6,"samples_unverified":28,"pointer_only_for_licence":25,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deep-contextualized-word-representations#ran","syntology_url":"https://syntology.ai/paper/1802.05365","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.05365"}}}},{"paper":"/paper/fastgcn-fast-learning-with-graph","slug":"fastgcn-fast-learning-with-graph","title":"FastGCN: Fast Learning with Graph Convolutional Networks via Importance Sampling","date":"2018-01-30","arxiv_id":"1801.10247","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":3,"official":{"repos":["matenure/FastGCN"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/fastgcn-fast-learning-with-graph#ran","syntology_url":"https://syntology.ai/paper/1801.10247","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1801.10247"}}}},{"paper":"/paper/inductive-representation-learning-on-large","slug":"inductive-representation-learning-on-large","title":"Inductive Representation Learning on Large Graphs","date":"2017-06-07","arxiv_id":"1706.02216","rows_on_this_dataset":1,"code_links":20,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":3,"samples_constructed":2,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":5,"official":{"repos":["williamleif/GraphSAGE"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/inductive-representation-learning-on-large#ran","syntology_url":"https://syntology.ai/paper/1706.02216","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.02216"}}}}],"papers_where_code_ran":15,"papers_where_code_ran_first_page":"/dataset/reddit/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this dataset or check it against this dataset's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/dataset/reddit/papers/ran/1","json":"/dataset/reddit/papers/ran/1.json","rows":15}],"row_route":"each paper's syntology object carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers","syntology_totals":{"read_at":"2026-10-05T00:36:11+00:00","papers_with_samples":18,"samples_harvested":167,"samples_ran":104,"samples_constructed":20,"samples_ran_checked":91,"samples_ran_instrument_failed":13,"samples_unverified":63,"pointer_only_for_licence":48,"papers_with_no_sample_that_ran":3,"papers_with_a_sample_that_ran":15,"papers_with_a_run_with_no_instrument_failure":14,"papers_where_every_run_was_an_instrument_failure":1,"note":"the per-paper counts of every listed paper (all pages), summed; not a rate"},"key_notes":{"samples_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'","samples_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)"},"since_archive_judged":{"papers":10,"papers_placed":0,"judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[{"leaderboard":"/sota/node-classification-on-reddit","since_archive":"/sota/node-classification-on-reddit#since-judged","papers_judged":5,"placed":0},{"leaderboard":"/sota/graph-classification-on-reddit-b","since_archive":"/sota/graph-classification-on-reddit-b#since-judged","papers_judged":2,"placed":0},{"leaderboard":"/sota/dynamic-link-prediction-on-reddit","since_archive":"/sota/dynamic-link-prediction-on-reddit#since-judged","papers_judged":3,"placed":0}]},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks.","record_sha256":"8404c47985571748836e3b5620d52fd2c735c252fd2d2c02ed625b54e7533bf3","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}