{"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","name":"Graph Representation Learning","slug":"graph-representation-learning","description_markdown":"The goal of **Graph Representation Learning** is to construct a set of features (‘embeddings’) representing the structure of the graph and the data thereon. We can distinguish among Node-wise embeddings, representing each node of the graph, Edge-wise embeddings, representing each edge in the graph, and Graph-wise embeddings representing the graph as a whole.\r\n\r\n\r\n<span class=\"description-source\">Source: [SIGN: Scalable Inception Graph Neural Networks ](https://arxiv.org/abs/2004.11198)</span>","categories":[{"name":"Graphs","url":"/area/graphs"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":982,"papers_with_code":479,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":6,"subtasks":1,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/graph-representation-learning-on-coma","slug":"graph-representation-learning-on-coma","dataset":"COMA","dataset_url":"/dataset/coma","rows_in_archive":1,"metrics":["Error (mm)"],"first_row_in_archive_order":{"model":"Pi-net-linear","paper_title":"$Π-$nets: Deep Polynomial Neural Networks","paper_url":"/paper/-nets-deep-polynomial-neural-networks","paper_date":"2020-03-08","arxiv_id":"2003.03828","code_links":[{"title":"grigorisg9gr/polynomial_nets","url":"https://github.com/grigorisg9gr/polynomial_nets"},{"title":"kzkadc/poly-nets","url":"https://github.com/kzkadc/poly-nets"}],"syntology":null}}],"datasets":[{"url":"/dataset/reddit","name":"Reddit","full_name":"","num_papers_in_archive":699},{"url":"/dataset/imdb-binary","name":"IMDB-BINARY","full_name":"","num_papers_in_archive":326},{"url":"/dataset/reddit-binary","name":"REDDIT-BINARY","full_name":"","num_papers_in_archive":150},{"url":"/dataset/coma","name":"COMA","full_name":"COMA","num_papers_in_archive":81},{"url":"/dataset/wikigraphs","name":"WikiGraphs","full_name":"","num_papers_in_archive":4},{"url":"/dataset/myket-android-application-install","name":"Myket Android Application Install","full_name":"","num_papers_in_archive":1}],"subtasks":[{"url":"/task/knowledge-graph-embedding","name":"Knowledge Graph Embedding"}],"parent_tasks":[{"url":"/task/representation-learning","name":"Representation Learning"}],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":10,"rows_per_page":100,"shown":100,"of":982,"of_with_code":479,"tagged_in_all":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"},"items":[{"url":"/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","repositories_listed":19,"syntology":{"n":10,"n_ran":6,"n_constructed":2,"n_ran_checked":6,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":5,"phrase":"6 ran (of which 2 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","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"}},"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"]}}},{"url":"/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","repositories_listed":14,"syntology":{"n":20,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":10,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 10 unverified","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"}},"official":null}},{"url":"/paper/evolvegcn-evolving-graph-convolutional","slug":"evolvegcn-evolving-graph-convolutional","title":"EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs","date":"2019-02-26","arxiv_id":"1902.10191","repositories_listed":10,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/evolvegcn-evolving-graph-convolutional#ran","syntology_url":"https://syntology.ai/paper/1902.10191","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.10191"}},"official":{"repos":["IBM/AMLSim","IBM/EvolveGCN"],"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":["listed","official"]}}},{"url":"/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","repositories_listed":8,"syntology":null},{"url":"/paper/qa-gnn-reasoning-with-language-models-and","slug":"qa-gnn-reasoning-with-language-models-and","title":"QA-GNN: Reasoning with Language Models and Knowledge Graphs for Question Answering","date":"2021-04-13","arxiv_id":"2104.06378","repositories_listed":6,"syntology":{"n":25,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":17,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":5,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 17 unverified","sample_list":"/paper/qa-gnn-reasoning-with-language-models-and#ran","syntology_url":"https://syntology.ai/paper/2104.06378","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.06378"}},"official":{"repos":["michiyasunaga/qagnn","worksheets.codalab.org/worksheets/0xf215deb05edf44a2ac353c711f52a25f"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":13,"ran_from_kinds":["official"]}}},{"url":"/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","repositories_listed":6,"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":0,"phrase":"0 ran · 2 unverified","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"}},"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":[]}}},{"url":"/paper/effect-of-choosing-loss-function-when-using-t","slug":"effect-of-choosing-loss-function-when-using-t","title":"Effect of Choosing Loss Function when Using T-batching for Representation Learning on Dynamic Networks","date":"2023-08-13","arxiv_id":"2308.06862","repositories_listed":5,"syntology":null},{"url":"/paper/do-transformers-really-perform-bad-for-graph","slug":"do-transformers-really-perform-bad-for-graph","title":"Do Transformers Really Perform Bad for Graph Representation?","date":"2021-06-09","arxiv_id":"2106.05234","repositories_listed":5,"syntology":null},{"url":"/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","repositories_listed":5,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","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"}},"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"]}}},{"url":"/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","repositories_listed":5,"syntology":null},{"url":"/paper/graphgan-graph-representation-learning-with","slug":"graphgan-graph-representation-learning-with","title":"GraphGAN: Graph Representation Learning with Generative Adversarial Nets","date":"2017-11-22","arxiv_id":"1711.08267","repositories_listed":5,"syntology":null},{"url":"/paper/recipe-for-a-general-powerful-scalable-graph","slug":"recipe-for-a-general-powerful-scalable-graph","title":"Recipe for a General, Powerful, Scalable Graph Transformer","date":"2022-05-25","arxiv_id":"2205.12454","repositories_listed":4,"syntology":{"n":21,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":18,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 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; 2 where Syntology's instrument failed) · 18 unverified","sample_list":"/paper/recipe-for-a-general-powerful-scalable-graph#ran","syntology_url":"https://syntology.ai/paper/2205.12454","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.12454"}},"official":{"repos":["rampasek/GraphGPS"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/bootstrapped-representation-learning-on","slug":"bootstrapped-representation-learning-on","title":"Large-Scale Representation Learning on Graphs via Bootstrapping","date":"2021-02-12","arxiv_id":"2102.06514","repositories_listed":4,"syntology":{"n":8,"n_ran":5,"n_constructed":4,"n_ran_checked":4,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":7,"phrase":"5 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; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/bootstrapped-representation-learning-on#ran","syntology_url":"https://syntology.ai/paper/2102.06514","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.06514"}},"official":{"repos":["nerdslab/bgrl"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/gcc-graph-contrastive-coding-for-graph-neural","slug":"gcc-graph-contrastive-coding-for-graph-neural","title":"GCC: Graph Contrastive Coding for Graph Neural Network Pre-Training","date":"2020-06-17","arxiv_id":"2006.09963","repositories_listed":4,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/gcc-graph-contrastive-coding-for-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2006.09963","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.09963"}},"official":{"repos":["THUDM/GCC"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/understanding-negative-sampling-in-graph","slug":"understanding-negative-sampling-in-graph","title":"Understanding Negative Sampling in Graph Representation Learning","date":"2020-05-20","arxiv_id":"2005.09863","repositories_listed":4,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/understanding-negative-sampling-in-graph#ran","syntology_url":"https://syntology.ai/paper/2005.09863","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.09863"}},"official":{"repos":["zyang-16/MCNS"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/transitivity-preserving-graph-representation","slug":"transitivity-preserving-graph-representation","title":"Transitivity-Preserving Graph Representation Learning for Bridging Local Connectivity and Role-based Similarity","date":"2023-08-18","arxiv_id":"2308.09517","repositories_listed":3,"syntology":{"n":26,"n_ran":19,"n_constructed":0,"n_ran_checked":13,"n_instrument":6,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":0,"phrase":"19 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 6 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/transitivity-preserving-graph-representation#ran","syntology_url":"https://syntology.ai/paper/2308.09517","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.09517"}},"official":{"repos":["nslab-cuk/unified-graph-transformer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/explanations-as-features-llm-based-features","slug":"explanations-as-features-llm-based-features","title":"Harnessing Explanations: LLM-to-LM Interpreter for Enhanced Text-Attributed Graph Representation Learning","date":"2023-05-31","arxiv_id":"2305.19523","repositories_listed":3,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/explanations-as-features-llm-based-features#ran","syntology_url":"https://syntology.ai/paper/2305.19523","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.19523"}},"official":{"repos":["XiaoxinHe/TAPE","xiaoxinhe/tape_arxiv_2023"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/tractable-probabilistic-graph-representation","slug":"tractable-probabilistic-graph-representation","title":"Tractable Probabilistic Graph Representation Learning with Graph-Induced Sum-Product Networks","date":"2023-05-17","arxiv_id":"2305.10544","repositories_listed":3,"syntology":null},{"url":"/paper/a-critical-look-at-the-evaluation-of-gnns","slug":"a-critical-look-at-the-evaluation-of-gnns","title":"A critical look at the evaluation of GNNs under heterophily: Are we really making progress?","date":"2023-02-22","arxiv_id":"2302.11640","repositories_listed":3,"syntology":null},{"url":"/paper/simplifying-subgraph-representation-learning","slug":"simplifying-subgraph-representation-learning","title":"Simplifying Subgraph Representation Learning for Scalable Link Prediction","date":"2023-01-29","arxiv_id":"2301.12562","repositories_listed":3,"syntology":null},{"url":"/paper/a-generalization-of-vit-mlp-mixer-to-graphs","slug":"a-generalization-of-vit-mlp-mixer-to-graphs","title":"A Generalization of ViT/MLP-Mixer to Graphs","date":"2022-12-27","arxiv_id":"2212.13350","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"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 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) · 1 unverified","sample_list":"/paper/a-generalization-of-vit-mlp-mixer-to-graphs#ran","syntology_url":"https://syntology.ai/paper/2212.13350","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.13350"}},"official":{"repos":["XiaoxinHe/Graph-ViT-MLPMixer"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/algorithm-and-system-co-design-for-efficient","slug":"algorithm-and-system-co-design-for-efficient","title":"Algorithm and System Co-design for Efficient Subgraph-based Graph Representation Learning","date":"2022-02-28","arxiv_id":"2202.13538","repositories_listed":3,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/algorithm-and-system-co-design-for-efficient#ran","syntology_url":"https://syntology.ai/paper/2202.13538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.13538"}},"official":{"repos":["graph-com/surel"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-survey-of-pretraining-on-graphs-taxonomy","slug":"a-survey-of-pretraining-on-graphs-taxonomy","title":"A Survey of Pretraining on Graphs: Taxonomy, Methods, and Applications","date":"2022-02-16","arxiv_id":"2202.07893","repositories_listed":3,"syntology":null},{"url":"/paper/structure-aware-transformer-for-graph","slug":"structure-aware-transformer-for-graph","title":"Structure-Aware Transformer for Graph Representation Learning","date":"2022-02-07","arxiv_id":"2202.03036","repositories_listed":3,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":1,"n_honours":3,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 3 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/structure-aware-transformer-for-graph#ran","syntology_url":"https://syntology.ai/paper/2202.03036","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.03036"}},"official":{"repos":["borgwardtlab/sat"],"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"]}}},{"url":"/paper/e-graphsage-a-graph-neural-network-based","slug":"e-graphsage-a-graph-neural-network-based","title":"E-GraphSAGE: A Graph Neural Network based Intrusion Detection System for IoT","date":"2021-03-30","arxiv_id":"2103.16329","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/e-graphsage-a-graph-neural-network-based#ran","syntology_url":"https://syntology.ai/paper/2103.16329","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.16329"}},"official":{"repos":["waimorris/E-GraphSAGE"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/towards-a-unified-framework-for-fair-and","slug":"towards-a-unified-framework-for-fair-and","title":"Towards a Unified Framework for Fair and Stable Graph Representation Learning","date":"2021-02-25","arxiv_id":"2102.13186","repositories_listed":3,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/towards-a-unified-framework-for-fair-and#ran","syntology_url":"https://syntology.ai/paper/2102.13186","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.13186"}},"official":{"repos":["chirag126/nifty"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/sub-graph-contrast-for-scalable-self","slug":"sub-graph-contrast-for-scalable-self","title":"Sub-graph Contrast for Scalable Self-Supervised Graph Representation Learning","date":"2020-09-22","arxiv_id":"2009.10273","repositories_listed":3,"syntology":null},{"url":"/paper/towards-deeper-graph-neural-networks","slug":"towards-deeper-graph-neural-networks","title":"Towards Deeper Graph Neural Networks","date":"2020-07-18","arxiv_id":"2007.09296","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-deeper-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2007.09296","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.09296"}},"official":{"repos":["divelab/DeeperGNN"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/deep-graph-contrastive-representation","slug":"deep-graph-contrastive-representation","title":"Deep Graph Contrastive Representation Learning","date":"2020-06-07","arxiv_id":"2006.04131","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deep-graph-contrastive-representation#ran","syntology_url":"https://syntology.ai/paper/2006.04131","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04131"}},"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"]}}},{"url":"/paper/a-gentle-introduction-to-deep-learning-for","slug":"a-gentle-introduction-to-deep-learning-for","title":"A Gentle Introduction to Deep Learning for Graphs","date":"2019-12-29","arxiv_id":"1912.12693","repositories_listed":3,"syntology":null},{"url":"/paper/hyperbolic-neural-networks","slug":"hyperbolic-neural-networks","title":"Hyperbolic Neural Networks","date":"2018-05-23","arxiv_id":"1805.09112","repositories_listed":3,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":3,"n_no_contract":0,"n_pointer_only":3,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 3 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/hyperbolic-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1805.09112","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.09112"}},"official":{"repos":["dalab/hyperbolic_nn"],"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"]}}},{"url":"/paper/diss-l-ect-dissecting-graph-data-with-local","slug":"diss-l-ect-dissecting-graph-data-with-local","title":"Diss-l-ECT: Dissecting Graph Data with Local Euler Characteristic Transforms","date":"2024-10-03","arxiv_id":"2410.02622","repositories_listed":2,"syntology":{"n":10,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":9,"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) · 9 unverified","sample_list":"/paper/diss-l-ect-dissecting-graph-data-with-local#ran","syntology_url":"https://syntology.ai/paper/2410.02622","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.02622"}},"official":{"repos":["aidos-lab/Diss-l-ECT"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/when-heterophily-meets-heterogeneous-graphs","slug":"when-heterophily-meets-heterogeneous-graphs","title":"When Heterophily Meets Heterogeneous Graphs: Latent Graphs Guided Unsupervised Representation Learning","date":"2024-09-01","arxiv_id":"2409.00687","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/when-heterophily-meets-heterogeneous-graphs#ran","syntology_url":"https://syntology.ai/paper/2409.00687","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.00687"}},"official":{"repos":["zxlearningdeep/latgrl"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-based-link-anomaly-detection-in","slug":"learning-based-link-anomaly-detection-in","title":"Learning-Based Link Anomaly Detection in Continuous-Time Dynamic Graphs","date":"2024-05-28","arxiv_id":"2405.18050","repositories_listed":2,"syntology":null},{"url":"/paper/unleashing-the-potential-of-fractional","slug":"unleashing-the-potential-of-fractional","title":"Unleashing the Potential of Fractional Calculus in Graph Neural Networks with FROND","date":"2024-04-26","arxiv_id":"2404.17099","repositories_listed":2,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":10,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/unleashing-the-potential-of-fractional#ran","syntology_url":"https://syntology.ai/paper/2404.17099","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.17099"}},"official":{"repos":["zknus/iclr2024-frond","zknus/torchfde"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/product-manifold-representations-for-learning","slug":"product-manifold-representations-for-learning","title":"Product Manifold Representations for Learning on Biological Pathways","date":"2024-01-27","arxiv_id":"2401.15478","repositories_listed":2,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":6,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/product-manifold-representations-for-learning#ran","syntology_url":"https://syntology.ai/paper/2401.15478","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.15478"}},"official":{"repos":["mcneela/mixed-curvature-gcn","mcneela/mixed-curvature-pathways"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/generalized-graph-prompt-toward-a-unification","slug":"generalized-graph-prompt-toward-a-unification","title":"Generalized Graph Prompt: Toward a Unification of Pre-Training and Downstream Tasks on Graphs","date":"2023-11-26","arxiv_id":"2311.15317","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"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) · 1 unverified","sample_list":"/paper/generalized-graph-prompt-toward-a-unification#ran","syntology_url":"https://syntology.ai/paper/2311.15317","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.15317"}},"official":{"repos":["gmcmt/graph_prompt_extension"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/does-graph-distillation-see-like-vision","slug":"does-graph-distillation-see-like-vision","title":"Does Graph Distillation See Like Vision Dataset Counterpart?","date":"2023-10-13","arxiv_id":"2310.09192","repositories_listed":2,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":1,"n_honours":3,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 3 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/does-graph-distillation-see-like-vision#ran","syntology_url":"https://syntology.ai/paper/2310.09192","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.09192"}},"official":{"repos":["ringbdstack/sgdd","suchun-sv/sgdd"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/simteg-a-frustratingly-simple-approach","slug":"simteg-a-frustratingly-simple-approach","title":"SimTeG: A Frustratingly Simple Approach Improves Textual Graph Learning","date":"2023-08-03","arxiv_id":"2308.02565","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/simteg-a-frustratingly-simple-approach#ran","syntology_url":"https://syntology.ai/paper/2308.02565","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.02565"}},"official":{"repos":["vermouthdky/simteg"],"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/towards-better-graph-representation-learning","slug":"towards-better-graph-representation-learning","title":"Towards Better Graph Representation Learning with Parameterized Decomposition & Filtering","date":"2023-05-10","arxiv_id":"2305.06102","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/towards-better-graph-representation-learning#ran","syntology_url":"https://syntology.ai/paper/2305.06102","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.06102"}},"official":{"repos":["qslim/pdf"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-view-tensor-graph-neural-networks","slug":"multi-view-tensor-graph-neural-networks","title":"Multi-view Tensor Graph Neural Networks Through Reinforced Aggregation","date":"2023-04-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/efficient-and-feasible-robotic-assembly","slug":"efficient-and-feasible-robotic-assembly","title":"Efficient and Feasible Robotic Assembly Sequence Planning via Graph Representation Learning","date":"2023-03-17","arxiv_id":"2303.10135","repositories_listed":2,"syntology":null},{"url":"/paper/learnable-topological-features-for","slug":"learnable-topological-features-for","title":"Learnable Topological Features for Phylogenetic Inference via Graph Neural Networks","date":"2023-02-17","arxiv_id":"2302.08840","repositories_listed":2,"syntology":{"n":11,"n_ran":9,"n_constructed":6,"n_ran_checked":9,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":5,"phrase":"9 ran (of which 6 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/learnable-topological-features-for#ran","syntology_url":"https://syntology.ai/paper/2302.08840","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.08840"}},"official":{"repos":["zcrabbit/vbpi-gnn"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/graphprompt-unifying-pre-training-and","slug":"graphprompt-unifying-pre-training-and","title":"GraphPrompt: Unifying Pre-Training and Downstream Tasks for Graph Neural Networks","date":"2023-02-16","arxiv_id":"2302.08043","repositories_listed":2,"syntology":null},{"url":"/paper/is-distance-matrix-enough-for-geometric-deep-1","slug":"is-distance-matrix-enough-for-geometric-deep-1","title":"Is Distance Matrix Enough for Geometric Deep Learning?","date":"2023-02-11","arxiv_id":"2302.05743","repositories_listed":2,"syntology":null},{"url":"/paper/increase-inductive-graph-representation","slug":"increase-inductive-graph-representation","title":"INCREASE: Inductive Graph Representation Learning for Spatio-Temporal Kriging","date":"2023-02-06","arxiv_id":"2302.02738","repositories_listed":2,"syntology":{"n":13,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/increase-inductive-graph-representation#ran","syntology_url":"https://syntology.ai/paper/2302.02738","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.02738"}},"official":{"repos":["zhengchuanpan/increase"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/promptkg-a-prompt-learning-framework-for","slug":"promptkg-a-prompt-learning-framework-for","title":"LambdaKG: A Library for Pre-trained Language Model-Based Knowledge Graph Embeddings","date":"2022-10-01","arxiv_id":"2210.00305","repositories_listed":2,"syntology":null},{"url":"/paper/periodic-graph-transformers-for-crystal","slug":"periodic-graph-transformers-for-crystal","title":"Periodic Graph Transformers for Crystal Material Property Prediction","date":"2022-09-23","arxiv_id":"2209.11807","repositories_listed":2,"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":2,"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/periodic-graph-transformers-for-crystal#ran","syntology_url":"https://syntology.ai/paper/2209.11807","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.11807"}},"official":{"repos":["YKQ98/Matformer"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/roland-graph-learning-framework-for-dynamic","slug":"roland-graph-learning-framework-for-dynamic","title":"ROLAND: Graph Learning Framework for Dynamic Graphs","date":"2022-08-15","arxiv_id":"2208.07239","repositories_listed":2,"syntology":null},{"url":"/paper/nafs-a-simple-yet-tough-to-beat-baseline-for-1","slug":"nafs-a-simple-yet-tough-to-beat-baseline-for-1","title":"NAFS: A Simple yet Tough-to-beat Baseline for Graph Representation Learning","date":"2022-06-17","arxiv_id":"2206.08583","repositories_listed":2,"syntology":null},{"url":"/paper/dropmessage-unifying-random-dropping-for","slug":"dropmessage-unifying-random-dropping-for","title":"DropMessage: Unifying Random Dropping for Graph Neural Networks","date":"2022-04-21","arxiv_id":"2204.10037","repositories_listed":2,"syntology":null},{"url":"/paper/sign-and-basis-invariant-networks-for","slug":"sign-and-basis-invariant-networks-for","title":"Sign and Basis Invariant Networks for Spectral Graph Representation Learning","date":"2022-02-25","arxiv_id":"2202.13013","repositories_listed":2,"syntology":null},{"url":"/paper/on-recoverability-of-graph-neural-network","slug":"on-recoverability-of-graph-neural-network","title":"Graph Representation Learning via Aggregation Enhancement","date":"2022-01-30","arxiv_id":"2201.12843","repositories_listed":2,"syntology":null},{"url":"/paper/neural-approximation-of-extended-persistent","slug":"neural-approximation-of-extended-persistent","title":"Neural Approximation of Graph Topological Features","date":"2022-01-28","arxiv_id":"2201.12032","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/neural-approximation-of-extended-persistent#ran","syntology_url":"https://syntology.ai/paper/2201.12032","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.12032"}},"official":{"repos":["pkuyzy/TLC-GNN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/grape-fast-and-scalable-graph-processing-and","slug":"grape-fast-and-scalable-graph-processing-and","title":"GRAPE for Fast and Scalable Graph Processing and random walk-based Embedding","date":"2021-10-12","arxiv_id":"2110.06196","repositories_listed":2,"syntology":null},{"url":"/paper/local2global-scaling-global-representation","slug":"local2global-scaling-global-representation","title":"Local2Global: Scaling global representation learning on graphs via local training","date":"2021-07-26","arxiv_id":"2107.12224","repositories_listed":2,"syntology":null},{"url":"/paper/edge-representation-learning-with-hypergraphs","slug":"edge-representation-learning-with-hypergraphs","title":"Edge Representation Learning with Hypergraphs","date":"2021-06-30","arxiv_id":"2106.15845","repositories_listed":2,"syntology":null},{"url":"/paper/graphonomy-universal-image-parsing-via-graph","slug":"graphonomy-universal-image-parsing-via-graph","title":"Graphonomy: Universal Image Parsing via Graph Reasoning and Transfer","date":"2021-01-26","arxiv_id":"2101.10620","repositories_listed":2,"syntology":null},{"url":"/paper/generating-a-doppelganger-graph-resembling","slug":"generating-a-doppelganger-graph-resembling","title":"Generating a Doppelganger Graph: Resembling but Distinct","date":"2021-01-23","arxiv_id":"2101.09593","repositories_listed":2,"syntology":null},{"url":"/paper/xerte-explainable-reasoning-on-temporal","slug":"xerte-explainable-reasoning-on-temporal","title":"xERTE: Explainable Reasoning on Temporal Knowledge Graphs for Forecasting Future Links","date":"2020-12-31","arxiv_id":"2012.15537","repositories_listed":2,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":7,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/xerte-explainable-reasoning-on-temporal#ran","syntology_url":"https://syntology.ai/paper/2012.15537","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.15537"}},"official":{"repos":["TemporalKGTeam/xERTE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/a-large-scale-database-for-graph","slug":"a-large-scale-database-for-graph","title":"A Large-Scale Database for Graph Representation Learning","date":"2020-11-16","arxiv_id":"2011.07682","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-large-scale-database-for-graph#ran","syntology_url":"https://syntology.ai/paper/2011.07682","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.07682"}},"official":{"repos":["safreita1/malnet-graph"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-neural-networks-in-recommender-systems","slug":"graph-neural-networks-in-recommender-systems","title":"Graph Neural Networks in Recommender Systems: A Survey","date":"2020-11-04","arxiv_id":"2011.02260","repositories_listed":2,"syntology":null},{"url":"/paper/graph-infoclust-leveraging-cluster-level-node","slug":"graph-infoclust-leveraging-cluster-level-node","title":"Graph InfoClust: Leveraging cluster-level node information for unsupervised graph representation learning","date":"2020-09-15","arxiv_id":"2009.06946","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/graph-infoclust-leveraging-cluster-level-node#ran","syntology_url":"https://syntology.ai/paper/2009.06946","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.06946"}},"official":null}},{"url":"/paper/vernal-a-tool-for-mining-fuzzy-network-motifs","slug":"vernal-a-tool-for-mining-fuzzy-network-motifs","title":"VeRNAl: Mining RNA Structures for Fuzzy Base Pairing Network Motifs","date":"2020-09-01","arxiv_id":"2009.00664","repositories_listed":2,"syntology":null},{"url":"/paper/distance-encoding-design-provably-more","slug":"distance-encoding-design-provably-more","title":"Distance Encoding: Design Provably More Powerful Neural Networks for Graph Representation Learning","date":"2020-08-31","arxiv_id":"2009.00142","repositories_listed":2,"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":1,"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/distance-encoding-design-provably-more#ran","syntology_url":"https://syntology.ai/paper/2009.00142","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.00142"}},"official":{"repos":["snap-stanford/distance-encoding"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/-nets-deep-polynomial-neural-networks","slug":"-nets-deep-polynomial-neural-networks","title":"$Π-$nets: Deep Polynomial Neural Networks","date":"2020-03-08","arxiv_id":"2003.03828","repositories_listed":2,"syntology":null},{"url":"/paper/magnet-multi-label-text-classification-using","slug":"magnet-multi-label-text-classification-using","title":"MAGNET: Multi-Label Text Classification using Attention-based Graph Neural Network","date":"2020-02-24","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/get-rid-of-suspended-animation-problem-deep","slug":"get-rid-of-suspended-animation-problem-deep","title":"Get Rid of Suspended Animation Problem: Deep Diffusive Neural Network on Graph Semi-Supervised Classification","date":"2020-01-22","arxiv_id":"2001.07922","repositories_listed":2,"syntology":null},{"url":"/paper/learning-semantic-specific-graph","slug":"learning-semantic-specific-graph","title":"Learning Semantic-Specific Graph Representation for Multi-Label Image Recognition","date":"2019-08-20","arxiv_id":"1908.07325","repositories_listed":2,"syntology":null},{"url":"/paper/isonn-isomorphic-neural-network-for-graph","slug":"isonn-isomorphic-neural-network-for-graph","title":"IsoNN: Isomorphic Neural Network for Graph Representation Learning and Classification","date":"2019-07-22","arxiv_id":"1907.09495","repositories_listed":2,"syntology":null},{"url":"/paper/dynamic-graph-representation-learning-via","slug":"dynamic-graph-representation-learning-via","title":"Dynamic Graph Representation Learning via Self-Attention Networks","date":"2018-12-22","arxiv_id":"1812.09430","repositories_listed":2,"syntology":null},{"url":"/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","repositories_listed":2,"syntology":null},{"url":"/paper/open-domain-question-answering-using-early","slug":"open-domain-question-answering-using-early","title":"Open Domain Question Answering Using Early Fusion of Knowledge Bases and Text","date":"2018-09-04","arxiv_id":"1809.00782","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/open-domain-question-answering-using-early#ran","syntology_url":"https://syntology.ai/paper/1809.00782","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.00782"}},"official":{"repos":["OceanskySun/GraftNet"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/learning-to-make-predictions-on-graphs-with","slug":"learning-to-make-predictions-on-graphs-with","title":"Learning to Make Predictions on Graphs with Autoencoders","date":"2018-02-23","arxiv_id":"1802.08352","repositories_listed":2,"syntology":null},{"url":"/paper/positional-encoding-meets-persistent-homology","slug":"positional-encoding-meets-persistent-homology","title":"Positional Encoding meets Persistent Homology on Graphs","date":"2025-06-06","arxiv_id":"2506.05814","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/positional-encoding-meets-persistent-homology#ran","syntology_url":"https://syntology.ai/paper/2506.05814","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.05814"}},"official":{"repos":["aalto-quml/pipe"],"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/subgraph-gaussian-embedding-contrast-for-self","slug":"subgraph-gaussian-embedding-contrast-for-self","title":"Subgraph Gaussian Embedding Contrast for Self-Supervised Graph Representation Learning","date":"2025-05-29","arxiv_id":"2505.23529","repositories_listed":1,"syntology":null},{"url":"/paper/lobstur-a-local-bootstrap-framework-for","slug":"lobstur-a-local-bootstrap-framework-for","title":"LOBSTUR: A Local Bootstrap Framework for Tuning Unsupervised Representations in Graph Neural Networks","date":"2025-05-20","arxiv_id":"2505.14867","repositories_listed":1,"syntology":null},{"url":"/paper/radiogenomic-bipartite-graph-representation","slug":"radiogenomic-bipartite-graph-representation","title":"Radiogenomic Bipartite Graph Representation Learning for Alzheimer's Disease Detection","date":"2025-05-14","arxiv_id":"2505.09848","repositories_listed":1,"syntology":null},{"url":"/paper/pytdc-a-multimodal-machine-learning-training","slug":"pytdc-a-multimodal-machine-learning-training","title":"PyTDC: A multimodal machine learning training, evaluation, and inference platform for biomedical foundation models","date":"2025-05-08","arxiv_id":"2505.05577","repositories_listed":1,"syntology":null},{"url":"/paper/abg-nas-adaptive-bayesian-genetic-neural","slug":"abg-nas-adaptive-bayesian-genetic-neural","title":"ABG-NAS: Adaptive Bayesian Genetic Neural Architecture Search for Graph Representation Learning","date":"2025-04-30","arxiv_id":"2504.21254","repositories_listed":1,"syntology":null},{"url":"/paper/mitigating-degree-bias-in-graph","slug":"mitigating-degree-bias-in-graph","title":"Mitigating Degree Bias in Graph Representation Learning with Learnable Structural Augmentation and Structural Self-Attention","date":"2025-04-21","arxiv_id":"2504.15075","repositories_listed":1,"syntology":null},{"url":"/paper/gt-svq-a-linear-time-graph-transformer-for","slug":"gt-svq-a-linear-time-graph-transformer-for","title":"GT-SVQ: A Linear-Time Graph Transformer for Node Classification Using Spiking Vector Quantization","date":"2025-04-16","arxiv_id":"2504.11840","repositories_listed":1,"syntology":null},{"url":"/paper/local-distance-preserving-node-embeddings-and","slug":"local-distance-preserving-node-embeddings-and","title":"Local Distance-Preserving Node Embeddings and Their Performance on Random Graphs","date":"2025-04-11","arxiv_id":"2504.08216","repositories_listed":1,"syntology":null},{"url":"/paper/robo-taxi-fleet-coordination-at-scale-via","slug":"robo-taxi-fleet-coordination-at-scale-via","title":"Robo-taxi Fleet Coordination at Scale via Reinforcement Learning","date":"2025-04-08","arxiv_id":"2504.06125","repositories_listed":1,"syntology":null},{"url":"/paper/lorentzian-graph-isomorphic-network","slug":"lorentzian-graph-isomorphic-network","title":"LGIN: Defining an Approximately Powerful Hyperbolic GNN","date":"2025-03-31","arxiv_id":"2504.00142","repositories_listed":1,"syntology":null},{"url":"/paper/msngo-multi-species-protein-function","slug":"msngo-multi-species-protein-function","title":"MSNGO: multi-species protein function annotation based on 3D protein structure and network propagation","date":"2025-03-29","arxiv_id":"2503.23014","repositories_listed":1,"syntology":null},{"url":"/paper/augward-augmentation-aware-representation","slug":"augward-augmentation-aware-representation","title":"AugWard: Augmentation-Aware Representation Learning for Accurate Graph Classification","date":"2025-03-27","arxiv_id":"2503.21105","repositories_listed":1,"syntology":null},{"url":"/paper/towards-quantifying-long-range-interactions","slug":"towards-quantifying-long-range-interactions","title":"Towards Quantifying Long-Range Interactions in Graph Machine Learning: a Large Graph Dataset and a Measurement","date":"2025-03-12","arxiv_id":"2503.09008","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-quantifying-long-range-interactions#ran","syntology_url":"https://syntology.ai/paper/2503.09008","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.09008"}},"official":{"repos":["leonresearch/city-networks"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/democratizing-large-language-model-based","slug":"democratizing-large-language-model-based","title":"Democratizing Large Language Model-Based Graph Data Augmentation via Latent Knowledge Graphs","date":"2025-02-19","arxiv_id":"2502.13555","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-graph-contrastive-pretraining","slug":"self-supervised-graph-contrastive-pretraining","title":"DICE: Device-level Integrated Circuits Encoder with Graph Contrastive Pretraining","date":"2025-02-13","arxiv_id":"2502.08949","repositories_listed":1,"syntology":null},{"url":"/paper/graph-contrastive-learning-for-connectome","slug":"graph-contrastive-learning-for-connectome","title":"Graph Contrastive Learning for Connectome Classification","date":"2025-02-07","arxiv_id":"2502.05109","repositories_listed":1,"syntology":null},{"url":"/paper/learning-efficient-positional-encodings-with","slug":"learning-efficient-positional-encodings-with","title":"Learning Efficient Positional Encodings with Graph Neural Networks","date":"2025-02-03","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/leveraging-joint-predictive-embedding-and","slug":"leveraging-joint-predictive-embedding-and","title":"Leveraging Joint Predictive Embedding and Bayesian Inference in Graph Self Supervised Learning","date":"2025-02-02","arxiv_id":"2502.01684","repositories_listed":1,"syntology":null},{"url":"/paper/community-aware-temporal-walks-parameter-free","slug":"community-aware-temporal-walks-parameter-free","title":"Community-Aware Temporal Walks: Parameter-Free Representation Learning on Continuous-Time Dynamic Graphs","date":"2025-01-21","arxiv_id":"2501.11880","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-graph-representation-learning-with-1","slug":"enhancing-graph-representation-learning-with-1","title":"Enhancing Graph Representation Learning with Localized Topological Features","date":"2025-01-15","arxiv_id":"2501.09178","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/enhancing-graph-representation-learning-with-1#ran","syntology_url":"https://syntology.ai/paper/2501.09178","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.09178"}},"official":{"repos":["pkuyzy/TLC-GNN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/benchmarking-graph-representations-and-graph","slug":"benchmarking-graph-representations-and-graph","title":"Benchmarking Graph Representations and Graph Neural Networks for Multivariate Time Series Classification","date":"2025-01-14","arxiv_id":"2501.08305","repositories_listed":1,"syntology":null},{"url":"/paper/curegraph-contrastive-multi-modal-graph","slug":"curegraph-contrastive-multi-modal-graph","title":"CureGraph: Contrastive Multi-Modal Graph Representation Learning for Urban Living Circle Health Profiling and Prediction","date":"2025-01-13","arxiv_id":"2501.07157","repositories_listed":1,"syntology":null},{"url":"/paper/data-driven-self-supervised-graph","slug":"data-driven-self-supervised-graph","title":"Data-Driven Self-Supervised Graph Representation Learning","date":"2024-12-24","arxiv_id":"2412.18316","repositories_listed":1,"syntology":null},{"url":"/paper/noisehgnn-synthesized-similarity-graph-based","slug":"noisehgnn-synthesized-similarity-graph-based","title":"NoiseHGNN: Synthesized Similarity Graph-Based Neural Network For Noised Heterogeneous Graph Representation Learning","date":"2024-12-24","arxiv_id":"2412.18267","repositories_listed":1,"syntology":null},{"url":"/paper/lase-learned-adjacency-spectral-embeddings","slug":"lase-learned-adjacency-spectral-embeddings","title":"LASE: Learned Adjacency Spectral Embeddings","date":"2024-12-23","arxiv_id":"2412.17734","repositories_listed":1,"syntology":null}],"syntology_records":40,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"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":[]},"papers_where_code_ran":129,"papers_where_code_ran_first_page":"/task/graph-representation-learning/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":10,"url":"/task/graph-representation-learning/papers/2","json":"/task/graph-representation-learning/papers/2.json","rows":100},{"order":"archive","page":3,"of":10,"url":"/task/graph-representation-learning/papers/3","json":"/task/graph-representation-learning/papers/3.json","rows":100},{"order":"archive","page":4,"of":10,"url":"/task/graph-representation-learning/papers/4","json":"/task/graph-representation-learning/papers/4.json","rows":100},{"order":"archive","page":5,"of":10,"url":"/task/graph-representation-learning/papers/5","json":"/task/graph-representation-learning/papers/5.json","rows":100},{"order":"archive","page":6,"of":10,"url":"/task/graph-representation-learning/papers/6","json":"/task/graph-representation-learning/papers/6.json","rows":100},{"order":"archive","page":7,"of":10,"url":"/task/graph-representation-learning/papers/7","json":"/task/graph-representation-learning/papers/7.json","rows":100},{"order":"archive","page":8,"of":10,"url":"/task/graph-representation-learning/papers/8","json":"/task/graph-representation-learning/papers/8.json","rows":100},{"order":"archive","page":9,"of":10,"url":"/task/graph-representation-learning/papers/9","json":"/task/graph-representation-learning/papers/9.json","rows":100},{"order":"archive","page":10,"of":10,"url":"/task/graph-representation-learning/papers/10","json":"/task/graph-representation-learning/papers/10.json","rows":82},{"order":"ran","page":1,"of":2,"url":"/task/graph-representation-learning/papers/ran/1","json":"/task/graph-representation-learning/papers/ran/1.json","rows":100},{"order":"ran","page":2,"of":2,"url":"/task/graph-representation-learning/papers/ran/2","json":"/task/graph-representation-learning/papers/ran/2.json","rows":29}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper 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"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"8b07a5894d90a403daefb56d9267314270d9442cde7fe8ebc283a11e2d480c04","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}