{"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-mining","name":"Graph Mining","slug":"graph-mining","description_markdown":null,"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":174,"papers_with_code":86,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"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":0,"parent_tasks":0},"benchmarks":[],"datasets":[{"url":"/dataset/yelp","name":"Yelp","full_name":"","num_papers_in_archive":86},{"url":"/dataset/yelpchi","name":"Yelp-Fraud","full_name":"Multi-relational Graph Dataset for Yelp Spam Review Detection","num_papers_in_archive":13},{"url":"/dataset/amazon-fraud","name":"Amazon-Fraud","full_name":"Multi-relational Graph Dataset for Amazon Fraudulent Account Detection","num_papers_in_archive":8},{"url":"/dataset/netzschleuder","name":"Netzschleuder","full_name":"network catalogue, repository and centrifuge","num_papers_in_archive":5},{"url":"/dataset/imcpt-sparsegm-100","name":"IMCPT-SparseGM-100","full_name":"","num_papers_in_archive":1},{"url":"/dataset/nba-player-performance-prediction-dataset","name":"NBA player performance prediction dataset","full_name":"","num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[],"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":2,"rows_per_page":100,"shown":100,"of":174,"of_with_code":86,"tagged_in_all":174,"counts":{"archive_papers_tagged":174,"with_a_code_link":86,"where_syntology_ran_a_sample":16,"not_listed_spam_title":0,"listed":174,"listed_where_code_ran":16,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":11,"every_run_a_failure_of_syntologys_instrument":5,"listed_with_a_run_with_no_instrument_failure":11,"listed_every_run_a_failure_of_syntologys_instrument":5,"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/enhancing-graph-neural-network-based-fraud","slug":"enhancing-graph-neural-network-based-fraud","title":"Enhancing Graph Neural Network-based Fraud Detectors against Camouflaged Fraudsters","date":"2020-08-19","arxiv_id":"2008.08692","repositories_listed":6,"syntology":{"n":17,"n_ran":12,"n_constructed":0,"n_ran_checked":11,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":1,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/enhancing-graph-neural-network-based-fraud#ran","syntology_url":"https://syntology.ai/paper/2008.08692","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.08692"}},"official":{"repos":["YingtongDou/CARE-GNN","safe-graph/DGFraud"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/false-information-on-web-and-social-media-a","slug":"false-information-on-web-and-social-media-a","title":"False Information on Web and Social Media: A Survey","date":"2018-04-23","arxiv_id":"1804.08559","repositories_listed":3,"syntology":null},{"url":"/paper/all-the-world-s-a-hyper-graph-a-data-drama","slug":"all-the-world-s-a-hyper-graph-a-data-drama","title":"All the World's a (Hyper)Graph: A Data Drama","date":"2022-06-16","arxiv_id":"2206.08225","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/all-the-world-s-a-hyper-graph-a-data-drama#ran","syntology_url":"https://syntology.ai/paper/2206.08225","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.08225"}},"official":{"repos":["hyperbard/hyperbard","hyperbard/tutorials"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-survey-on-fairness-for-machine-learning-on","slug":"a-survey-on-fairness-for-machine-learning-on","title":"A Survey on Fairness for Machine Learning on Graphs","date":"2022-05-11","arxiv_id":"2205.05396","repositories_listed":2,"syntology":null},{"url":"/paper/fairness-in-graph-mining-a-survey","slug":"fairness-in-graph-mining-a-survey","title":"Fairness in Graph Mining: A Survey","date":"2022-04-21","arxiv_id":"2204.09888","repositories_listed":2,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":0,"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, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/fairness-in-graph-mining-a-survey#ran","syntology_url":"https://syntology.ai/paper/2204.09888","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.09888"}},"official":{"repos":["yushundong/graph-mining-fairness-data","yushundong/pygdebias"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/reinforcement-learning-on-graph-a-survey","slug":"reinforcement-learning-on-graph-a-survey","title":"Reinforcement learning on graphs: A survey","date":"2022-04-13","arxiv_id":"2204.06127","repositories_listed":2,"syntology":null},{"url":"/paper/twitch-gamers-a-dataset-for-evaluating","slug":"twitch-gamers-a-dataset-for-evaluating","title":"Twitch Gamers: a Dataset for Evaluating Proximity Preserving and Structural Role-based Node Embeddings","date":"2021-01-08","arxiv_id":"2101.03091","repositories_listed":2,"syntology":null},{"url":"/paper/an-api-oriented-open-source-python-framework-1","slug":"an-api-oriented-open-source-python-framework-1","title":"Karate Club: An API Oriented Open-source Python Framework for Unsupervised Learning on Graphs","date":"2020-03-10","arxiv_id":"2003.04819","repositories_listed":2,"syntology":null},{"url":"/paper/pitfalls-of-graph-neural-network-evaluation","slug":"pitfalls-of-graph-neural-network-evaluation","title":"Pitfalls of Graph Neural Network Evaluation","date":"2018-11-14","arxiv_id":"1811.05868","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/pitfalls-of-graph-neural-network-evaluation#ran","syntology_url":"https://syntology.ai/paper/1811.05868","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.05868"}},"official":null}},{"url":"/paper/exploring-the-semantic-content-of","slug":"exploring-the-semantic-content-of","title":"Exploring the Semantic Content of Unsupervised Graph Embeddings: An Empirical Study","date":"2018-06-19","arxiv_id":"1806.07464","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/exploring-the-semantic-content-of#ran","syntology_url":"https://syntology.ai/paper/1806.07464","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.07464"}},"official":{"repos":["sbonner0/unsupervised-graph-embedding","sbonner0/unsupervised-graph-embeddings"],"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/efficient-parallel-genetic-algorithm-for","slug":"efficient-parallel-genetic-algorithm-for","title":"Efficient Parallel Genetic Algorithm for Perturbed Substructure Optimization in Complex Network","date":"2024-12-30","arxiv_id":"2412.20980","repositories_listed":1,"syntology":null},{"url":"/paper/correlation-aware-graph-convolutional","slug":"correlation-aware-graph-convolutional","title":"Correlation-Aware Graph Convolutional Networks for Multi-Label Node Classification","date":"2024-11-26","arxiv_id":"2411.17350","repositories_listed":1,"syntology":null},{"url":"/paper/higher-order-gnns-meet-efficiency-sparse","slug":"higher-order-gnns-meet-efficiency-sparse","title":"Higher-Order GNNs Meet Efficiency: Sparse Sobolev Graph Neural Networks","date":"2024-11-07","arxiv_id":"2411.04570","repositories_listed":1,"syntology":null},{"url":"/paper/accurate-and-fast-estimation-of-temporal","slug":"accurate-and-fast-estimation-of-temporal","title":"Accurate and Fast Estimation of Temporal Motifs using Path Sampling","date":"2024-09-13","arxiv_id":"2409.08975","repositories_listed":1,"syntology":null},{"url":"/paper/refining-wikidata-taxonomy-using-large","slug":"refining-wikidata-taxonomy-using-large","title":"Refining Wikidata Taxonomy using Large Language Models","date":"2024-09-06","arxiv_id":"2409.04056","repositories_listed":1,"syntology":null},{"url":"/paper/a-versatile-framework-for-attributed-network","slug":"a-versatile-framework-for-attributed-network","title":"A Versatile Framework for Attributed Network Clustering via K-Nearest Neighbor Augmentation","date":"2024-08-10","arxiv_id":"2408.05459","repositories_listed":1,"syntology":null},{"url":"/paper/covering-a-graph-with-dense-subgraph-families","slug":"covering-a-graph-with-dense-subgraph-families","title":"Covering a Graph with Dense Subgraph Families, via Triangle-Rich Sets","date":"2024-07-23","arxiv_id":"2407.16850","repositories_listed":1,"syntology":null},{"url":"/paper/when-heterophily-meets-heterogeneity-new","slug":"when-heterophily-meets-heterogeneity-new","title":"When Heterophily Meets Heterogeneity: Challenges and a New Large-Scale Graph Benchmark","date":"2024-07-15","arxiv_id":"2407.10916","repositories_listed":1,"syntology":null},{"url":"/paper/is-your-large-language-model-knowledgeable-or","slug":"is-your-large-language-model-knowledgeable-or","title":"Is Your Large Language Model Knowledgeable or a Choices-Only Cheater?","date":"2024-07-02","arxiv_id":"2407.01992","repositories_listed":1,"syntology":null},{"url":"/paper/unveiling-global-interactive-patterns-across","slug":"unveiling-global-interactive-patterns-across","title":"Unveiling Global Interactive Patterns across Graphs: Towards Interpretable Graph Neural Networks","date":"2024-07-02","arxiv_id":"2407.01979","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"4 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/unveiling-global-interactive-patterns-across#ran","syntology_url":"https://syntology.ai/paper/2407.01979","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.01979"}},"official":{"repos":["Wangyuwen0627/GIP-Framework"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/revisiting-modularity-maximization-for-graph","slug":"revisiting-modularity-maximization-for-graph","title":"Revisiting Modularity Maximization for Graph Clustering: A Contrastive Learning Perspective","date":"2024-06-20","arxiv_id":"2406.14288","repositories_listed":1,"syntology":null},{"url":"/paper/toward-structure-fairness-in-dynamic-graph","slug":"toward-structure-fairness-in-dynamic-graph","title":"Toward Structure Fairness in Dynamic Graph Embedding: A Trend-aware Dual Debiasing Approach","date":"2024-06-19","arxiv_id":"2406.13201","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-the-message-passing-in","slug":"revisiting-the-message-passing-in","title":"Revisiting the Message Passing in Heterophilous Graph Neural Networks","date":"2024-05-28","arxiv_id":"2405.17768","repositories_listed":1,"syntology":null},{"url":"/paper/oag-bench-a-human-curated-benchmark-for","slug":"oag-bench-a-human-curated-benchmark-for","title":"OAG-Bench: A Human-Curated Benchmark for Academic Graph Mining","date":"2024-02-24","arxiv_id":"2402.15810","repositories_listed":1,"syntology":null},{"url":"/paper/graph-skeleton-1-nodes-are-sufficient-to","slug":"graph-skeleton-1-nodes-are-sufficient-to","title":"Graph-Skeleton: ~1% Nodes are Sufficient to Represent Billion-Scale Graph","date":"2024-02-14","arxiv_id":"2402.09565","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":1,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-skeleton-1-nodes-are-sufficient-to#ran","syntology_url":"https://syntology.ai/paper/2402.09565","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.09565"}},"official":{"repos":["zjunet/graphskeleton"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fine-tuning-graph-neural-networks-by","slug":"fine-tuning-graph-neural-networks-by","title":"Fine-tuning Graph Neural Networks by Preserving Graph Generative Patterns","date":"2023-12-21","arxiv_id":"2312.13583","repositories_listed":1,"syntology":{"n":13,"n_ran":13,"n_constructed":0,"n_ran_checked":10,"n_instrument":3,"n_unverified":0,"n_honours":3,"n_violates":2,"n_no_contract":5,"n_pointer_only":13,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 3 honoured, 2 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fine-tuning-graph-neural-networks-by#ran","syntology_url":"https://syntology.ai/paper/2312.13583","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.13583"}},"official":{"repos":["zjunet/G-Tuning"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dgcluster-a-neural-framework-for-attributed","slug":"dgcluster-a-neural-framework-for-attributed","title":"DGCLUSTER: A Neural Framework for Attributed Graph Clustering via Modularity Maximization","date":"2023-12-20","arxiv_id":"2312.12697","repositories_listed":1,"syntology":null},{"url":"/paper/survey-on-trustworthy-graph-neural-networks","slug":"survey-on-trustworthy-graph-neural-networks","title":"When Graph Neural Network Meets Causality: Opportunities, Methodologies and An Outlook","date":"2023-12-19","arxiv_id":"2312.12477","repositories_listed":1,"syntology":null},{"url":"/paper/user-modeling-in-the-era-of-large-language","slug":"user-modeling-in-the-era-of-large-language","title":"User Modeling in the Era of Large Language Models: Current Research and Future Directions","date":"2023-12-11","arxiv_id":"2312.11518","repositories_listed":1,"syntology":null},{"url":"/paper/fast-graph-condensation-with-structure-based","slug":"fast-graph-condensation-with-structure-based","title":"Fast Graph Condensation with Structure-based Neural Tangent Kernel","date":"2023-10-17","arxiv_id":"2310.11046","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":7,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fast-graph-condensation-with-structure-based#ran","syntology_url":"https://syntology.ai/paper/2310.11046","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.11046"}},"official":{"repos":["wanglin0126/gcsntk"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/independent-distribution-regularization-for","slug":"independent-distribution-regularization-for","title":"Independent Distribution Regularization for Private Graph Embedding","date":"2023-08-16","arxiv_id":"2308.08360","repositories_listed":1,"syntology":null},{"url":"/paper/contrastive-meta-learning-for-few-shot-node","slug":"contrastive-meta-learning-for-few-shot-node","title":"Contrastive Meta-Learning for Few-shot Node Classification","date":"2023-06-27","arxiv_id":"2306.15154","repositories_listed":1,"syntology":null},{"url":"/paper/a-fast-maximum-k-plex-algorithm-parameterized","slug":"a-fast-maximum-k-plex-algorithm-parameterized","title":"Fast Maximum $k$-Plex Algorithms Parameterized by Small Degeneracy Gaps","date":"2023-06-23","arxiv_id":"2306.13258","repositories_listed":1,"syntology":null},{"url":"/paper/gpt4graph-can-large-language-models","slug":"gpt4graph-can-large-language-models","title":"GPT4Graph: Can Large Language Models Understand Graph Structured Data ? An Empirical Evaluation and Benchmarking","date":"2023-05-24","arxiv_id":"2305.15066","repositories_listed":1,"syntology":null},{"url":"/paper/connecting-the-dots-what-graph-based-text","slug":"connecting-the-dots-what-graph-based-text","title":"Connecting the Dots: What Graph-Based Text Representations Work Best for Text Classification Using Graph Neural Networks?","date":"2023-05-23","arxiv_id":"2305.14578","repositories_listed":1,"syntology":null},{"url":"/paper/pgb-a-pubmed-graph-benchmark-for","slug":"pgb-a-pubmed-graph-benchmark-for","title":"PGB: A PubMed Graph Benchmark for Heterogeneous Network Representation Learning","date":"2023-05-04","arxiv_id":"2305.02691","repositories_listed":1,"syntology":null},{"url":"/paper/transition-propagation-graph-neural-networks","slug":"transition-propagation-graph-neural-networks","title":"Transition Propagation Graph Neural Networks for Temporal Networks","date":"2023-04-15","arxiv_id":"2304.07501","repositories_listed":1,"syntology":null},{"url":"/paper/gat-cobo-cost-sensitive-graph-neural-network","slug":"gat-cobo-cost-sensitive-graph-neural-network","title":"GAT-COBO: Cost-Sensitive Graph Neural Network for Telecom Fraud Detection","date":"2023-03-29","arxiv_id":"2303.17334","repositories_listed":1,"syntology":null},{"url":"/paper/ultraprop-principled-and-explainable","slug":"ultraprop-principled-and-explainable","title":"NetEffect: Discovery and Exploitation of Generalized Network Effects","date":"2022-12-31","arxiv_id":"2301.00270","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/ultraprop-principled-and-explainable#ran","syntology_url":"https://syntology.ai/paper/2301.00270","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.00270"}},"official":{"repos":["mengchillee/neteffect"],"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/graph-sequential-neural-ode-process-for-link","slug":"graph-sequential-neural-ode-process-for-link","title":"Graph Sequential Neural ODE Process for Link Prediction on Dynamic and Sparse Graphs","date":"2022-11-15","arxiv_id":"2211.08568","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"4 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-sequential-neural-ode-process-for-link#ran","syntology_url":"https://syntology.ai/paper/2211.08568","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.08568"}},"official":{"repos":["rmanluo/gsnop"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/overlapping-community-detection-using-dynamic","slug":"overlapping-community-detection-using-dynamic","title":"Overlapping Community Detection using Dynamic Dilated Aggregation in Deep Residual GCN","date":"2022-10-20","arxiv_id":"2210.11174","repositories_listed":1,"syntology":null},{"url":"/paper/code-recommendation-for-open-source-software","slug":"code-recommendation-for-open-source-software","title":"Code Recommendation for Open Source Software Developers","date":"2022-10-15","arxiv_id":"2210.08332","repositories_listed":1,"syntology":null},{"url":"/paper/slendergnn-accurate-robust-and-interpretable","slug":"slendergnn-accurate-robust-and-interpretable","title":"Less is More: SlimG for Accurate, Robust, and Interpretable Graph Mining","date":"2022-10-08","arxiv_id":"2210.04081","repositories_listed":1,"syntology":null},{"url":"/paper/fedego-privacy-preserving-personalized","slug":"fedego-privacy-preserving-personalized","title":"FedEgo: Privacy-preserving Personalized Federated Graph Learning with Ego-graphs","date":"2022-08-29","arxiv_id":"2208.13685","repositories_listed":1,"syntology":null},{"url":"/paper/mentorgnn-deriving-curriculum-for-pre","slug":"mentorgnn-deriving-curriculum-for-pre","title":"MentorGNN: Deriving Curriculum for Pre-Training GNNs","date":"2022-08-21","arxiv_id":"2208.09905","repositories_listed":1,"syntology":null},{"url":"/paper/from-time-series-to-networks-in-r-with-the","slug":"from-time-series-to-networks-in-r-with-the","title":"From Time Series to Networks in R with the ts2net Package","date":"2022-08-20","arxiv_id":"2208.09660","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-homophily-structure-aware-path","slug":"beyond-homophily-structure-aware-path","title":"Beyond Homophily: Structure-aware Path Aggregation Graph Neural Network","date":"2022-07-20","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/task-adaptive-few-shot-node-classification","slug":"task-adaptive-few-shot-node-classification","title":"Task-Adaptive Few-shot Node Classification","date":"2022-06-23","arxiv_id":"2206.11972","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/task-adaptive-few-shot-node-classification#ran","syntology_url":"https://syntology.ai/paper/2206.11972","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.11972"}},"official":{"repos":["songw-sw/tent"],"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","unlocated"]}}},{"url":"/paper/nagphormer-neighborhood-aggregation-graph","slug":"nagphormer-neighborhood-aggregation-graph","title":"NAGphormer: A Tokenized Graph Transformer for Node Classification in Large Graphs","date":"2022-06-10","arxiv_id":"2206.04910","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/nagphormer-neighborhood-aggregation-graph#ran","syntology_url":"https://syntology.ai/paper/2206.04910","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.04910"}},"official":{"repos":["jhl-hust/nagphormer"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/model-degradation-hinders-deep-graph-neural","slug":"model-degradation-hinders-deep-graph-neural","title":"Model Degradation Hinders Deep Graph Neural Networks","date":"2022-06-09","arxiv_id":"2206.04361","repositories_listed":1,"syntology":null},{"url":"/paper/relphormer-relational-graph-transformer-for","slug":"relphormer-relational-graph-transformer-for","title":"Relphormer: Relational Graph Transformer for Knowledge Graph Representations","date":"2022-05-22","arxiv_id":"2205.10852","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":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/relphormer-relational-graph-transformer-for#ran","syntology_url":"https://syntology.ai/paper/2205.10852","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10852"}},"official":{"repos":["zjunlp/relphormer"],"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/tigerlily-finding-drug-interactions-in-silico","slug":"tigerlily-finding-drug-interactions-in-silico","title":"TigerLily: Finding drug interactions in silico with the Graph","date":"2022-04-18","arxiv_id":"2204.08206","repositories_listed":1,"syntology":null},{"url":"/paper/graph-auto-encoder-via-neighborhood-1","slug":"graph-auto-encoder-via-neighborhood-1","title":"Graph Auto-Encoder Via Neighborhood Wasserstein Reconstruction","date":"2022-02-18","arxiv_id":"2202.09025","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/graph-auto-encoder-via-neighborhood-1#ran","syntology_url":"https://syntology.ai/paper/2202.09025","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.09025"}},"official":{"repos":["mtang724/nwr-gae"],"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/domain-adversarial-spatial-temporal-network-a","slug":"domain-adversarial-spatial-temporal-network-a","title":"Domain Adversarial Spatial-Temporal Network: A Transferable Framework for Short-term Traffic Forecasting across Cities","date":"2022-02-08","arxiv_id":"2202.03630","repositories_listed":1,"syntology":null},{"url":"/paper/fast-attributed-graph-embedding-via-density","slug":"fast-attributed-graph-embedding-via-density","title":"Fast Attributed Graph Embedding via Density of States","date":"2021-10-11","arxiv_id":"2110.05228","repositories_listed":1,"syntology":null},{"url":"/paper/blindness-to-modality-helps-entailment-graph","slug":"blindness-to-modality-helps-entailment-graph","title":"Blindness to Modality Helps Entailment Graph Mining","date":"2021-09-21","arxiv_id":"2109.10227","repositories_listed":1,"syntology":null},{"url":"/paper/incorporating-temporal-information-in","slug":"incorporating-temporal-information-in","title":"Incorporating Temporal Information in Entailment Graph Mining","date":"2021-09-20","arxiv_id":"2109.09412","repositories_listed":1,"syntology":null},{"url":"/paper/detecting-communities-from-heterogeneous","slug":"detecting-communities-from-heterogeneous","title":"Detecting Communities from Heterogeneous Graphs: A Context Path-based Graph Neural Network Model","date":"2021-09-05","arxiv_id":"2109.02058","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-deep-graph-neural-networks","slug":"evaluating-deep-graph-neural-networks","title":"Evaluating Deep Graph Neural Networks","date":"2021-08-02","arxiv_id":"2108.00955","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-on-role-oriented-network-embedding","slug":"a-survey-on-role-oriented-network-embedding","title":"A Survey on Role-Oriented Network Embedding","date":"2021-07-18","arxiv_id":"2107.08379","repositories_listed":1,"syntology":null},{"url":"/paper/zero-shot-scene-graph-relation-prediction","slug":"zero-shot-scene-graph-relation-prediction","title":"Zero-Shot Scene Graph Relation Prediction through Commonsense Knowledge Integration","date":"2021-07-11","arxiv_id":"2107.05080","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/zero-shot-scene-graph-relation-prediction#ran","syntology_url":"https://syntology.ai/paper/2107.05080","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.05080"}},"official":{"repos":["Wayfear/Coacher"],"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/federated-graph-classification-over-non-iid","slug":"federated-graph-classification-over-non-iid","title":"Federated Graph Classification over Non-IID Graphs","date":"2021-06-25","arxiv_id":"2106.13423","repositories_listed":1,"syntology":null},{"url":"/paper/subgraph-federated-learning-with-missing","slug":"subgraph-federated-learning-with-missing","title":"Subgraph Federated Learning with Missing Neighbor Generation","date":"2021-06-25","arxiv_id":"2106.13430","repositories_listed":1,"syntology":null},{"url":"/paper/binarizedattack-structural-poisoning-attacks","slug":"binarizedattack-structural-poisoning-attacks","title":"BinarizedAttack: Structural Poisoning Attacks to Graph-based Anomaly Detection","date":"2021-06-18","arxiv_id":"2106.09989","repositories_listed":1,"syntology":null},{"url":"/paper/sirius-a-mutual-information-tool-for","slug":"sirius-a-mutual-information-tool-for","title":"Sirius: Visualization of Mixed Features as a Mutual Information Network Graph","date":"2021-06-09","arxiv_id":"2106.05260","repositories_listed":1,"syntology":null},{"url":"/paper/the-generalized-mean-densest-subgraph-problem","slug":"the-generalized-mean-densest-subgraph-problem","title":"The Generalized Mean Densest Subgraph Problem","date":"2021-06-02","arxiv_id":"2106.00909","repositories_listed":1,"syntology":null},{"url":"/paper/a-robust-and-generalized-framework-for","slug":"a-robust-and-generalized-framework-for","title":"A Robust and Generalized Framework for Adversarial Graph Embedding","date":"2021-05-22","arxiv_id":"2105.10651","repositories_listed":1,"syntology":null},{"url":"/paper/identity-inference-on-blockchain-using-graph","slug":"identity-inference-on-blockchain-using-graph","title":"Identity Inference on Blockchain using Graph Neural Network","date":"2021-04-14","arxiv_id":"2104.06559","repositories_listed":1,"syntology":null},{"url":"/paper/theoretically-improving-graph-neural-networks","slug":"theoretically-improving-graph-neural-networks","title":"Theoretically Improving Graph Neural Networks via Anonymous Walk Graph Kernels","date":"2021-04-07","arxiv_id":"2104.02995","repositories_listed":1,"syntology":null},{"url":"/paper/accelerating-covid-19-research-with-graph","slug":"accelerating-covid-19-research-with-graph","title":"Accelerating COVID-19 research with graph mining and transformer-based learning","date":"2021-02-10","arxiv_id":"2102.07631","repositories_listed":1,"syntology":null},{"url":"/paper/autonomous-graph-mining-algorithm-search-with","slug":"autonomous-graph-mining-algorithm-search-with","title":"Autonomous Graph Mining Algorithm Search with Best Speed/Accuracy Trade-off","date":"2020-11-26","arxiv_id":"2011.14925","repositories_listed":1,"syntology":null},{"url":"/paper/a-simple-and-general-graph-neural-network","slug":"a-simple-and-general-graph-neural-network","title":"Permutation-equivariant and Proximity-aware Graph Neural Networks with Stochastic Message Passing","date":"2020-09-05","arxiv_id":"2009.02562","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-directed-graph-embedding","slug":"adversarial-directed-graph-embedding","title":"Adversarial Directed Graph Embedding","date":"2020-08-09","arxiv_id":"2008.03667","repositories_listed":1,"syntology":null},{"url":"/paper/interactive-text-graph-mining-with-a-prolog","slug":"interactive-text-graph-mining-with-a-prolog","title":"Interactive Text Graph Mining with a Prolog-based Dialog Engine","date":"2020-07-31","arxiv_id":"2008.00956","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-differentiable-multi-aspect","slug":"unsupervised-differentiable-multi-aspect","title":"Unsupervised Differentiable Multi-aspect Network Embedding","date":"2020-06-07","arxiv_id":"2006.04239","repositories_listed":1,"syntology":null},{"url":"/paper/persona2vec-a-flexible-multi-role","slug":"persona2vec-a-flexible-multi-role","title":"Persona2vec: A Flexible Multi-role Representations Learning Framework for Graphs","date":"2020-06-04","arxiv_id":"2006.04941","repositories_listed":1,"syntology":null},{"url":"/paper/learning-opinion-dynamics-from-social-traces","slug":"learning-opinion-dynamics-from-social-traces","title":"Learning Opinion Dynamics From Social Traces","date":"2020-06-02","arxiv_id":"2006.01673","repositories_listed":1,"syntology":null},{"url":"/paper/agatha-automatic-graph-mining-and-transformer","slug":"agatha-automatic-graph-mining-and-transformer","title":"AGATHA: Automatic Graph-mining And Transformer based Hypothesis generation Approach","date":"2020-02-13","arxiv_id":"2002.05635","repositories_listed":1,"syntology":null},{"url":"/paper/silcendice-mining-suspicious-multi-attribute","slug":"silcendice-mining-suspicious-multi-attribute","title":"SliceNDice: Mining Suspicious Multi-attribute Entity Groups with Multi-view Graphs","date":"2019-08-19","arxiv_id":"1908.07087","repositories_listed":1,"syntology":null},{"url":"/paper/a-multivariate-extreme-value-theory-approach","slug":"a-multivariate-extreme-value-theory-approach","title":"A Multivariate Extreme Value Theory Approach to Anomaly Clustering and Visualization","date":"2019-07-17","arxiv_id":"1907.07523","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-network-embedding-for-graph","slug":"unsupervised-network-embedding-for-graph","title":"Unsupervised Network Embedding for Graph Visualization, Clustering and Classification","date":"2019-02-25","arxiv_id":"1903.05980","repositories_listed":1,"syntology":null},{"url":"/paper/deep-network-embedding-for-graph","slug":"deep-network-embedding-for-graph","title":"Deep Network Embedding for Graph Representation Learning in Signed Networks","date":"2019-01-07","arxiv_id":"1901.01718","repositories_listed":1,"syntology":null},{"url":"/paper/mathematics-content-understanding-for","slug":"mathematics-content-understanding-for","title":"Mathematics Content Understanding for Cyberlearning via Formula Evolution Map","date":"2018-12-31","arxiv_id":"1812.11786","repositories_listed":1,"syntology":null},{"url":"/paper/attention-models-in-graphs-a-survey","slug":"attention-models-in-graphs-a-survey","title":"Attention Models in Graphs: A Survey","date":"2018-07-20","arxiv_id":"1807.07984","repositories_listed":1,"syntology":null},{"url":"/paper/wikipedia-graph-mining-dynamic-structure-of","slug":"wikipedia-graph-mining-dynamic-structure-of","title":"Wikipedia graph mining: dynamic structure of collective memory","date":"2017-10-01","arxiv_id":"1710.00398","repositories_listed":1,"syntology":null},{"url":"/paper/high-quality-scalable-and-parallel-community","slug":"high-quality-scalable-and-parallel-community","title":"High Quality, Scalable and Parallel Community Detectionfor Large Real Graphs","date":"2014-03-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":null,"slug":"differentially-private-densest-k-subgraph","title":"Differentially Private Densest-$k$-Subgraph","date":"2025-05-06","arxiv_id":"2505.03858","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-substructure-discovery-algorithm-for","title":"Scalable Substructure Discovery Algorithm For Homogeneous Multilayer Networks","date":"2025-04-27","arxiv_id":"2504.19328","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-unbiased-federated-graph-learning","title":"Towards Unbiased Federated Graph Learning: Label and Topology Perspectives","date":"2025-04-14","arxiv_id":"2504.09963","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-language-models-meet-graph-neural","title":"Large Language Models Meet Graph Neural Networks: A Perspective of Graph Mining","date":"2024-12-26","arxiv_id":"2412.19211","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-supply-chain-transparency-in","title":"Enhancing Supply Chain Transparency in Emerging Economies Using Online Contents and LLMs","date":"2024-12-22","arxiv_id":"2412.16922","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-scalable-and-deep-graph-neural","title":"Towards Scalable and Deep Graph Neural Networks via Noise Masking","date":"2024-12-19","arxiv_id":"2412.14602","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-driven-development-of-cycle-prediction","title":"Data-driven development of cycle prediction models for lithium metal batteries using multi modal mining","date":"2024-11-26","arxiv_id":"2411.17625","repositories_listed":0,"syntology":null},{"url":null,"slug":"web-scale-graph-mining-for-cyber-threat","title":"Web Scale Graph Mining for Cyber Threat Intelligence","date":"2024-11-09","arxiv_id":"2411.06239","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-graph-prompt-learning-a-survey-and","title":"Towards Graph Prompt Learning: A Survey and Beyond","date":"2024-08-26","arxiv_id":"2408.14520","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-mining-under-data-scarcity","title":"Graph Mining under Data scarcity","date":"2024-06-07","arxiv_id":"2406.04825","repositories_listed":0,"syntology":null},{"url":null,"slug":"anomaly-detection-in-dynamic-graphs-a","title":"Anomaly Detection in Dynamic Graphs: A Comprehensive Survey","date":"2024-05-31","arxiv_id":"2406.00134","repositories_listed":0,"syntology":null},{"url":"/paper/heterophilous-distribution-propagation-for","slug":"heterophilous-distribution-propagation-for","title":"Heterophilous Distribution Propagation for Graph Neural Networks","date":"2024-05-31","arxiv_id":"2405.20640","repositories_listed":0,"syntology":null},{"url":null,"slug":"chebmixer-efficient-graph-representation","title":"ChebMixer: Efficient Graph Representation Learning with MLP Mixer","date":"2024-03-25","arxiv_id":"2403.16358","repositories_listed":0,"syntology":null},{"url":null,"slug":"musegraph-graph-oriented-instruction-tuning","title":"MuseGraph: Graph-oriented Instruction Tuning of Large Language Models for Generic Graph Mining","date":"2024-03-02","arxiv_id":"2403.04780","repositories_listed":0,"syntology":null}],"syntology_records":16,"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":16,"papers_where_code_ran_first_page":"/task/graph-mining/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":2,"url":"/task/graph-mining/papers/2","json":"/task/graph-mining/papers/2.json","rows":74},{"order":"ran","page":1,"of":1,"url":"/task/graph-mining/papers/ran/1","json":"/task/graph-mining/papers/ran/1.json","rows":16}],"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":"7f33aac83e18036446de0ec8216e200909cd71512ae7520ed96ae3af59d0e00e","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}