{"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/inductive-learning","name":"Inductive Learning","slug":"inductive-learning","description_markdown":null,"categories":[{"name":"Methodology","url":"/area/methodology"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":153,"papers_with_code":66,"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":0,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[],"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":153,"of_with_code":66,"tagged_in_all":153,"counts":{"archive_papers_tagged":153,"with_a_code_link":66,"where_syntology_ran_a_sample":17,"not_listed_spam_title":0,"listed":153,"listed_where_code_ran":17,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":16,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":16,"listed_every_run_a_failure_of_syntologys_instrument":1,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers 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/deep-graph-infomax","slug":"deep-graph-infomax","title":"Deep Graph Infomax","date":"2018-09-27","arxiv_id":"1809.10341","repositories_listed":11,"syntology":{"n":35,"n_ran":26,"n_constructed":11,"n_ran_checked":22,"n_instrument":4,"n_unverified":9,"n_honours":2,"n_violates":1,"n_no_contract":19,"n_pointer_only":10,"phrase":"26 ran (of which 11 constructed an object rather than computing a result; 22 with no instrument failure: 2 honoured, 1 violated, 19 with no contract checked; 4 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/deep-graph-infomax#ran","syntology_url":"https://syntology.ai/paper/1809.10341","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.10341"}},"official":{"repos":["PetarV-/DGI"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official","unlocated"]}}},{"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/190501669","slug":"190501669","title":"Representation Learning for Attributed Multiplex Heterogeneous Network","date":"2019-05-05","arxiv_id":"1905.01669","repositories_listed":4,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/190501669#ran","syntology_url":"https://syntology.ai/paper/1905.01669","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.01669"}},"official":{"repos":["cenyk1230/GATNE"],"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/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/chronosymbolic-learning-efficient-chc-solving","slug":"chronosymbolic-learning-efficient-chc-solving","title":"Chronosymbolic Learning: Efficient CHC Solving with Symbolic Reasoning and Inductive Learning","date":"2023-05-02","arxiv_id":"2305.01206","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/fold-rm-a-scalable-and-efficient-inductive","slug":"fold-rm-a-scalable-and-efficient-inductive","title":"FOLD-RM: A Scalable, Efficient, and Explainable Inductive Learning Algorithm for Multi-Category Classification of Mixed Data","date":"2022-02-14","arxiv_id":"2202.06913","repositories_listed":2,"syntology":null},{"url":"/paper/knowledge-preserving-incremental-social-event","slug":"knowledge-preserving-incremental-social-event","title":"Knowledge-Preserving Incremental Social Event Detection via Heterogeneous GNNs","date":"2021-01-21","arxiv_id":"2101.08747","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/knowledge-preserving-incremental-social-event#ran","syntology_url":"https://syntology.ai/paper/2101.08747","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.08747"}},"official":{"repos":["RingBDStack/KPGNN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/gtea-representation-learning-for-temporal","slug":"gtea-representation-learning-for-temporal","title":"GTEA: Inductive Representation Learning on Temporal Interaction Graphs via Temporal Edge Aggregation","date":"2020-09-11","arxiv_id":"2009.05266","repositories_listed":2,"syntology":null},{"url":"/paper/iterative-deep-graph-learning-for-graph-1","slug":"iterative-deep-graph-learning-for-graph-1","title":"Iterative Deep Graph Learning for Graph Neural Networks: Better and Robust Node Embeddings","date":"2020-06-21","arxiv_id":"2006.13009","repositories_listed":2,"syntology":{"n":14,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":6,"n_honours":1,"n_violates":1,"n_no_contract":5,"n_pointer_only":2,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 1 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/iterative-deep-graph-learning-for-graph-1#ran","syntology_url":"https://syntology.ai/paper/2006.13009","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.13009"}},"official":{"repos":["hugochan/IDGL"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/is-deep-learning-necessary-for-simple","slug":"is-deep-learning-necessary-for-simple","title":"Is deep learning necessary for simple classification tasks?","date":"2020-06-11","arxiv_id":"2006.06730","repositories_listed":2,"syntology":null},{"url":"/paper/deep-hyperedges-a-framework-for-transductive","slug":"deep-hyperedges-a-framework-for-transductive","title":"Deep Hyperedges: a Framework for Transductive and Inductive Learning on Hypergraphs","date":"2019-10-07","arxiv_id":"1910.02633","repositories_listed":2,"syntology":null},{"url":"/paper/neural-logic-machines-1","slug":"neural-logic-machines-1","title":"Neural Logic Machines","date":"2019-04-26","arxiv_id":"1904.11694","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neural-logic-machines-1#ran","syntology_url":"https://syntology.ai/paper/1904.11694","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.11694"}},"official":null}},{"url":"/paper/learning-role-based-graph-embeddings","slug":"learning-role-based-graph-embeddings","title":"Learning Role-based Graph Embeddings","date":"2018-02-07","arxiv_id":"1802.02896","repositories_listed":2,"syntology":null},{"url":"/paper/inductive-learning-of-robot-task-knowledge","slug":"inductive-learning-of-robot-task-knowledge","title":"Inductive Learning of Robot Task Knowledge from Raw Data and Online Expert Feedback","date":"2025-01-13","arxiv_id":"2501.07507","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-for-modelling-breast","slug":"graph-neural-networks-for-modelling-breast","title":"Graph Neural Networks for modelling breast biomechanical compression","date":"2024-11-10","arxiv_id":"2411.06596","repositories_listed":1,"syntology":null},{"url":"/paper/a-surprisingly-simple-approach-to-generalized","slug":"a-surprisingly-simple-approach-to-generalized","title":"A Surprisingly Simple Approach to Generalized Few-Shot Semantic Segmentation","date":"2024-09-26","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-graph-representation-learning","slug":"unsupervised-graph-representation-learning","title":"Unsupervised Graph Representation Learning with Inductive Shallow Node Embedding","date":"2024-07-12","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/solving-the-tree-containment-problem-using","slug":"solving-the-tree-containment-problem-using","title":"Solving the Tree Containment Problem Using Graph Neural Networks","date":"2024-04-15","arxiv_id":"2404.09812","repositories_listed":1,"syntology":null},{"url":"/paper/flowcyt-a-comparative-study-of-deep-learning","slug":"flowcyt-a-comparative-study-of-deep-learning","title":"FlowCyt: A Comparative Study of Deep Learning Approaches for Multi-Class Classification in Flow Cytometry Benchmarking","date":"2024-02-28","arxiv_id":"2403.00024","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":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/flowcyt-a-comparative-study-of-deep-learning#ran","syntology_url":"https://syntology.ai/paper/2403.00024","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.00024"}},"official":{"repos":["LorenzoBini4/FlowCyt-Classification-Benchmark"],"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/identifiable-cognitive-diagnosis-with-encoder","slug":"identifiable-cognitive-diagnosis-with-encoder","title":"Towards the Identifiability and Explainability for Personalized Learner Modeling: An Inductive Paradigm","date":"2023-09-01","arxiv_id":"2309.00300","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-solve-constraint-satisfaction","slug":"learning-to-solve-constraint-satisfaction","title":"Learning to Solve Constraint Satisfaction Problems with Recurrent Transformer","date":"2023-07-10","arxiv_id":"2307.04895","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":3,"n_ran_checked":3,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"6 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-to-solve-constraint-satisfaction#ran","syntology_url":"https://syntology.ai/paper/2307.04895","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.04895"}},"official":{"repos":["azreasoners/recurrent_transformer"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/ingram-inductive-knowledge-graph-embedding","slug":"ingram-inductive-knowledge-graph-embedding","title":"InGram: Inductive Knowledge Graph Embedding via Relation Graphs","date":"2023-05-31","arxiv_id":"2305.19987","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/ingram-inductive-knowledge-graph-embedding#ran","syntology_url":"https://syntology.ai/paper/2305.19987","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.19987"}},"official":{"repos":["bdi-lab/ingram"],"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/improving-few-shot-inductive-learning-on","slug":"improving-few-shot-inductive-learning-on","title":"Improving Few-Shot Inductive Learning on Temporal Knowledge Graphs using Confidence-Augmented Reinforcement Learning","date":"2023-04-02","arxiv_id":"2304.00613","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-fly-category-discovery","slug":"on-the-fly-category-discovery","title":"On-the-Fly Category Discovery","date":"2023-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-learn-better-for-video-object","slug":"learning-to-learn-better-for-video-object","title":"Learning to Learn Better for Video Object Segmentation","date":"2022-12-05","arxiv_id":"2212.02112","repositories_listed":1,"syntology":null},{"url":"/paper/distribution-free-prediction-sets-for-node","slug":"distribution-free-prediction-sets-for-node","title":"Distribution Free Prediction Sets for Node Classification","date":"2022-11-26","arxiv_id":"2211.14555","repositories_listed":1,"syntology":null},{"url":"/paper/what-do-large-language-models-learn-beyond","slug":"what-do-large-language-models-learn-beyond","title":"What do Large Language Models Learn beyond Language?","date":"2022-10-21","arxiv_id":"2210.12302","repositories_listed":1,"syntology":null},{"url":"/paper/facing-changes-continual-entity-alignment-for","slug":"facing-changes-continual-entity-alignment-for","title":"Facing Changes: Continual Entity Alignment for Growing Knowledge Graphs","date":"2022-07-23","arxiv_id":"2207.11436","repositories_listed":1,"syntology":null},{"url":"/paper/video-capsule-endoscopy-classification-using","slug":"video-capsule-endoscopy-classification-using","title":"Video Capsule Endoscopy Classification using Focal Modulation Guided Convolutional Neural Network","date":"2022-06-16","arxiv_id":"2206.08298","repositories_listed":1,"syntology":null},{"url":"/paper/developing-hierarchical-anticipations-via","slug":"developing-hierarchical-anticipations-via","title":"Developing hierarchical anticipations via neural network-based event segmentation","date":"2022-06-04","arxiv_id":"2206.02042","repositories_listed":1,"syntology":null},{"url":"/paper/multi-modal-graph-learning-for-disease-1","slug":"multi-modal-graph-learning-for-disease-1","title":"Multi-modal Graph Learning for Disease Prediction","date":"2022-03-11","arxiv_id":"2203.05880","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":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) · 0 unverified","sample_list":"/paper/multi-modal-graph-learning-for-disease-1#ran","syntology_url":"https://syntology.ai/paper/2203.05880","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.05880"}},"official":{"repos":["ssgood/mmgl"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/sparsity-aware-neural-user-behavior-modeling","slug":"sparsity-aware-neural-user-behavior-modeling","title":"Sparsity-aware neural user behavior modeling in online interaction platforms","date":"2022-02-28","arxiv_id":"2202.13491","repositories_listed":1,"syntology":null},{"url":"/paper/sparse-structure-learning-via-graph-neural","slug":"sparse-structure-learning-via-graph-neural","title":"Sparse Structure Learning via Graph Neural Networks for Inductive Document Classification","date":"2021-12-13","arxiv_id":"2112.06386","repositories_listed":1,"syntology":null},{"url":"/paper/hgate-heterogeneous-graph-attention-auto","slug":"hgate-heterogeneous-graph-attention-auto","title":"HGATE: Heterogeneous Graph Attention Auto-Encoders","date":"2021-11-28","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/fold-r-a-toolset-for-automated-inductive","slug":"fold-r-a-toolset-for-automated-inductive","title":"FOLD-R++: A Scalable Toolset for Automated Inductive Learning of Default Theories from Mixed Data","date":"2021-10-15","arxiv_id":"2110.07843","repositories_listed":1,"syntology":null},{"url":"/paper/towards-open-world-feature-extrapolation-an","slug":"towards-open-world-feature-extrapolation-an","title":"Towards Open-World Feature Extrapolation: An Inductive Graph Learning Approach","date":"2021-10-09","arxiv_id":"2110.04514","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":5,"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) · 1 unverified","sample_list":"/paper/towards-open-world-feature-extrapolation-an#ran","syntology_url":"https://syntology.ai/paper/2110.04514","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.04514"}},"official":{"repos":["qitianwu/FATE"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/how-neural-processes-improve-graph-link","slug":"how-neural-processes-improve-graph-link","title":"How Neural Processes Improve Graph Link Prediction","date":"2021-09-30","arxiv_id":"2109.14894","repositories_listed":1,"syntology":null},{"url":"/paper/transductive-learning-for-unsupervised-text","slug":"transductive-learning-for-unsupervised-text","title":"Transductive Learning for Unsupervised Text Style Transfer","date":"2021-09-16","arxiv_id":"2109.07812","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":2,"n_ran_checked":2,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"5 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/transductive-learning-for-unsupervised-text#ran","syntology_url":"https://syntology.ai/paper/2109.07812","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.07812"}},"official":{"repos":["xiaofei05/tsst"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/physgnn-a-physics-driven-graph-neural-network","slug":"physgnn-a-physics-driven-graph-neural-network","title":"PhysGNN: A Physics-Driven Graph Neural Network Based Model for Predicting Soft Tissue Deformation in Image-Guided Neurosurgery","date":"2021-09-09","arxiv_id":"2109.04352","repositories_listed":1,"syntology":null},{"url":"/paper/a-new-interpolation-approach-and","slug":"a-new-interpolation-approach-and","title":"A New Interpolation Approach and Corresponding Instance-Based Learning","date":"2021-08-26","arxiv_id":"2108.11530","repositories_listed":1,"syntology":null},{"url":"/paper/joint-inductive-and-transductive-learning-for","slug":"joint-inductive-and-transductive-learning-for","title":"Joint Inductive and Transductive Learning for Video Object Segmentation","date":"2021-08-08","arxiv_id":"2108.03679","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/joint-inductive-and-transductive-learning-for#ran","syntology_url":"https://syntology.ai/paper/2108.03679","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.03679"}},"official":{"repos":["maoyunyao/joint"],"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/rrules-an-improvement-of-the-rules-rule-based","slug":"rrules-an-improvement-of-the-rules-rule-based","title":"RRULES: An improvement of the RULES rule-based classifier","date":"2021-06-14","arxiv_id":"2106.07296","repositories_listed":1,"syntology":null},{"url":"/paper/cross-node-federated-graph-neural-network-for-1","slug":"cross-node-federated-graph-neural-network-for-1","title":"Cross-Node Federated Graph Neural Network for Spatio-Temporal Data Modeling","date":"2021-06-09","arxiv_id":"2106.05223","repositories_listed":1,"syntology":null},{"url":"/paper/adversarially-regularized-graph-attention","slug":"adversarially-regularized-graph-attention","title":"Adversarially Regularized Graph Attention Networks for Inductive Learning on Partially Labeled Graphs","date":"2021-06-07","arxiv_id":"2106.03393","repositories_listed":1,"syntology":null},{"url":"/paper/inductive-relation-prediction-by-bert","slug":"inductive-relation-prediction-by-bert","title":"Inductive Relation Prediction by BERT","date":"2021-03-12","arxiv_id":"2103.07102","repositories_listed":1,"syntology":null},{"url":"/paper/a-unifying-generative-model-for-graph","slug":"a-unifying-generative-model-for-graph","title":"A Unifying Generative Model for Graph Learning Algorithms: Label Propagation, Graph Convolutions, and Combinations","date":"2021-01-19","arxiv_id":"2101.07730","repositories_listed":1,"syntology":null},{"url":"/paper/inductive-learning-on-commonsense-knowledge","slug":"inductive-learning-on-commonsense-knowledge","title":"Inductive Learning on Commonsense Knowledge Graph Completion","date":"2020-09-19","arxiv_id":"2009.09263","repositories_listed":1,"syntology":null},{"url":"/paper/learning-robust-node-representation-on-graphs","slug":"learning-robust-node-representation-on-graphs","title":"Learning Node Representations against Perturbations","date":"2020-08-26","arxiv_id":"2008.11416","repositories_listed":1,"syntology":null},{"url":"/paper/funcgnn-a-graph-neural-network-approach-to","slug":"funcgnn-a-graph-neural-network-approach-to","title":"funcGNN: A Graph Neural Network Approach to Program Similarity","date":"2020-07-26","arxiv_id":"2007.13239","repositories_listed":1,"syntology":null},{"url":"/paper/transfer-deep-inductive-network-for-facial","slug":"transfer-deep-inductive-network-for-facial","title":"TRANSFER :- DEEP INDUCTIVE NETWORK FOR FACIAL EMOTION RECOGNITION","date":"2020-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/every-document-owns-its-structure-inductive","slug":"every-document-owns-its-structure-inductive","title":"Every Document Owns Its Structure: Inductive Text Classification via Graph Neural Networks","date":"2020-04-22","arxiv_id":"2004.13826","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/every-document-owns-its-structure-inductive#ran","syntology_url":"https://syntology.ai/paper/2004.13826","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.13826"}},"official":null}},{"url":"/paper/regression-via-implicit-models-and-optimal","slug":"regression-via-implicit-models-and-optimal","title":"Regression via Implicit Models and Optimal Transport Cost Minimization","date":"2020-03-03","arxiv_id":"2003.01296","repositories_listed":1,"syntology":null},{"url":"/paper/fully-differentiable-procedural-content","slug":"fully-differentiable-procedural-content","title":"Learning to Generate Levels From Nothing","date":"2020-02-12","arxiv_id":"2002.05259","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":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) · 0 unverified","sample_list":"/paper/fully-differentiable-procedural-content#ran","syntology_url":"https://syntology.ai/paper/2002.05259","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.05259"}},"official":{"repos":["pbontrager/GenerativePlayingNetworks"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-iterative-and-adaptive-learning-for","slug":"deep-iterative-and-adaptive-learning-for","title":"Deep Iterative and Adaptive Learning for Graph Neural Networks","date":"2019-12-17","arxiv_id":"1912.07832","repositories_listed":1,"syntology":null},{"url":"/paper/learn-to-explain-efficiently-via-neural-logic","slug":"learn-to-explain-efficiently-via-neural-logic","title":"Learn to Explain Efficiently via Neural Logic Inductive Learning","date":"2019-10-06","arxiv_id":"1910.02481","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learn-to-explain-efficiently-via-neural-logic#ran","syntology_url":"https://syntology.ai/paper/1910.02481","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.02481"}},"official":{"repos":["gblackout/NLIL"],"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/on-the-equivalence-between-node-embeddings-1","slug":"on-the-equivalence-between-node-embeddings-1","title":"On the Equivalence between Positional Node Embeddings and Structural Graph Representations","date":"2019-10-01","arxiv_id":"1910.00452","repositories_listed":1,"syntology":null},{"url":"/paper/densepoint-learning-densely-contextual","slug":"densepoint-learning-densely-contextual","title":"DensePoint: Learning Densely Contextual Representation for Efficient Point Cloud Processing","date":"2019-09-09","arxiv_id":"1909.03669","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/densepoint-learning-densely-contextual#ran","syntology_url":"https://syntology.ai/paper/1909.03669","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.03669"}},"official":{"repos":["Yochengliu/DensePoint"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/regression-with-conditional-gan","slug":"regression-with-conditional-gan","title":"Benchmarking Regression Methods: A comparison with CGAN","date":"2019-05-30","arxiv_id":"1905.12868","repositories_listed":1,"syntology":null},{"url":"/paper/graph-attention-auto-encoders","slug":"graph-attention-auto-encoders","title":"Graph Attention Auto-Encoders","date":"2019-05-26","arxiv_id":"1905.10715","repositories_listed":1,"syntology":null},{"url":"/paper/graphnas-graph-neural-architecture-search","slug":"graphnas-graph-neural-architecture-search","title":"GraphNAS: Graph Neural Architecture Search with Reinforcement Learning","date":"2019-04-22","arxiv_id":"1904.09981","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/graphnas-graph-neural-architecture-search#ran","syntology_url":"https://syntology.ai/paper/1904.09981","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.09981"}},"official":{"repos":["GraphNAS/GraphNAS-simple"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/differentiable-physics-informed-graph","slug":"differentiable-physics-informed-graph","title":"Differentiable Physics-informed Graph Networks","date":"2019-02-08","arxiv_id":"1902.02950","repositories_listed":1,"syntology":null},{"url":"/paper/on-evaluating-the-generalization-of-lstm","slug":"on-evaluating-the-generalization-of-lstm","title":"On Evaluating the Generalization of LSTM Models in Formal Languages","date":"2018-11-02","arxiv_id":"1811.01001","repositories_listed":1,"syntology":null},{"url":"/paper/large-scale-learnable-graph-convolutional","slug":"large-scale-learnable-graph-convolutional","title":"Large-Scale Learnable Graph Convolutional Networks","date":"2018-08-12","arxiv_id":"1808.03965","repositories_listed":1,"syntology":null},{"url":"/paper/deep-gaussian-embedding-of-graphs","slug":"deep-gaussian-embedding-of-graphs","title":"Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Ranking","date":"2017-07-12","arxiv_id":"1707.03815","repositories_listed":1,"syntology":null},{"url":"/paper/incremental-learning-of-event-definitions","slug":"incremental-learning-of-event-definitions","title":"Incremental Learning of Event Definitions with Inductive Logic Programming","date":"2014-02-24","arxiv_id":"1402.5988","repositories_listed":1,"syntology":null},{"url":null,"slug":"a-graph-in-graph-learning-framework-for-drug","title":"A Graph-in-Graph Learning Framework for Drug-Target Interaction Prediction","date":"2025-07-15","arxiv_id":"2507.11757","repositories_listed":0,"syntology":null},{"url":null,"slug":"mind-the-gap-deep-learning-doesn-t-learn","title":"Mind The Gap: Deep Learning Doesn't Learn Deeply","date":"2025-05-24","arxiv_id":"2505.18623","repositories_listed":0,"syntology":null},{"url":null,"slug":"dual-channel-heterophilic-message-passing-for","title":"Dual-channel Heterophilic Message Passing for Graph Fraud Detection","date":"2025-04-19","arxiv_id":"2504.14205","repositories_listed":0,"syntology":null},{"url":null,"slug":"standard-neural-computation-alone-is","title":"Standard Neural Computation Alone Is Insufficient for Logical Intelligence","date":"2025-02-04","arxiv_id":"2502.02135","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-inductive-learning-from-answer-sets","title":"Online inductive learning from answer sets for efficient reinforcement learning exploration","date":"2025-01-13","arxiv_id":"2501.07445","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-transfer-q-learning-for-offline-non","title":"Deep Transfer $Q$-Learning for Offline Non-Stationary Reinforcement Learning","date":"2025-01-08","arxiv_id":"2501.04870","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-training-for-graph-neural-1","title":"Adversarial Training for Graph Neural Networks via Graph Subspace Energy Optimization","date":"2024-12-25","arxiv_id":"2412.18886","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-fuzzy-rule-classifier-with-brain","title":"Improving Fuzzy Rule Classifier with Brain Storm Optimization and Rule Modification","date":"2024-10-02","arxiv_id":"2410.01413","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-order-evolving-graphs-for-enhanced","title":"High-Order Evolving Graphs for Enhanced Representation of Traffic Dynamics","date":"2024-09-17","arxiv_id":"2409.11206","repositories_listed":0,"syntology":null},{"url":null,"slug":"sub-graph-based-diffusion-model-for-link","title":"Sub-graph Based Diffusion Model for Link Prediction","date":"2024-09-13","arxiv_id":"2409.08487","repositories_listed":0,"syntology":null},{"url":null,"slug":"inductive-learning-of-logical-theories-with","title":"Inductive Learning of Logical Theories with LLMs: An Expressivity-Graded Analysis","date":"2024-08-15","arxiv_id":"2408.16779","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-and-frugal-text-graph-transformers-are","title":"Fast-and-Frugal Text-Graph Transformers are Effective Link Predictors","date":"2024-08-13","arxiv_id":"2408.06778","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-transductive-defense-a-two-stage","title":"Graph Transductive Defense: a Two-Stage Defense for Graph Membership Inference Attacks","date":"2024-06-12","arxiv_id":"2406.07917","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-graph-u-nets-for-mesh-agnostic","title":"Enhancing Graph U-Nets for Mesh-Agnostic Spatio-Temporal Flow Prediction","date":"2024-06-06","arxiv_id":"2406.03789","repositories_listed":0,"syntology":null},{"url":null,"slug":"unlock-the-power-of-algorithm-features-a","title":"Unlock the Power of Algorithm Features: A Generalization Analysis for Algorithm Selection","date":"2024-05-18","arxiv_id":"2405.11349","repositories_listed":0,"syntology":null},{"url":null,"slug":"flexible-forecasting-cellular-traffic-by","title":"FLEXIBLE: Forecasting Cellular Traffic by Leveraging Explicit Inductive Graph-Based Learning","date":"2024-05-14","arxiv_id":"2405.08843","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-of-dynamic-graph-neural-networks","title":"A survey of dynamic graph neural networks","date":"2024-04-28","arxiv_id":"2404.18211","repositories_listed":0,"syntology":null},{"url":null,"slug":"cnn2gnn-how-to-bridge-cnn-with-gnn","title":"CNN2GNN: How to Bridge CNN with GNN","date":"2024-04-23","arxiv_id":"2404.14822","repositories_listed":0,"syntology":null},{"url":null,"slug":"variational-graph-auto-encoder-based","title":"Variational Graph Auto-Encoder Based Inductive Learning Method for Semi-Supervised Classification","date":"2024-03-26","arxiv_id":"2403.17500","repositories_listed":0,"syntology":null},{"url":null,"slug":"can-llms-compute-with-reasons","title":"Can LLMs Compute with Reasons?","date":"2024-02-19","arxiv_id":"2402.12080","repositories_listed":0,"syntology":null},{"url":null,"slug":"two-stage-joint-transductive-and-inductive","title":"Two-stage Joint Transductive and Inductive learning for Nuclei Segmentation","date":"2023-11-15","arxiv_id":"2311.08774","repositories_listed":0,"syntology":null},{"url":null,"slug":"information-theoretic-generalization-bounds-6","title":"Information-Theoretic Generalization Bounds for Transductive Learning and its Applications","date":"2023-11-08","arxiv_id":"2311.04561","repositories_listed":0,"syntology":null},{"url":null,"slug":"transductive-learning-for-textual-few-shot","title":"Transductive Learning for Textual Few-Shot Classification in API-based Embedding Models","date":"2023-10-21","arxiv_id":"2310.13998","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-data-modelling-for-outcome-prediction","title":"Graph data modelling for outcome prediction in oropharyngeal cancer patients","date":"2023-10-04","arxiv_id":"2310.02931","repositories_listed":0,"syntology":null},{"url":null,"slug":"logicseg-parsing-visual-semantics-with-neural","title":"LOGICSEG: Parsing Visual Semantics with Neural Logic Learning and Reasoning","date":"2023-09-24","arxiv_id":"2309.13556","repositories_listed":0,"syntology":null},{"url":null,"slug":"inductive-learning-of-declarative-domain","title":"Inductive Learning of Declarative Domain-Specific Heuristics for ASP","date":"2023-08-30","arxiv_id":"2308.15863","repositories_listed":0,"syntology":null},{"url":null,"slug":"modeling-infant-object-perception-as-program","title":"Modeling infant object perception as program induction","date":"2023-08-28","arxiv_id":"2309.07099","repositories_listed":0,"syntology":null},{"url":null,"slug":"mathcal-g-2pxy-generative-open-set-node","title":"$\\mathcal{G}^2Pxy$: Generative Open-Set Node Classification on Graphs with Proxy Unknowns","date":"2023-08-10","arxiv_id":"2308.05463","repositories_listed":0,"syntology":null},{"url":"/paper/sequential-attention-source-identification","slug":"sequential-attention-source-identification","title":"Sequential Attention Source Identification Based on Feature Representation","date":"2023-06-28","arxiv_id":"2306.15886","repositories_listed":0,"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/sequential-attention-source-identification#ran","syntology_url":"https://syntology.ai/paper/2306.15886","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.15886"}},"official":null}},{"url":null,"slug":"object-topological-character-acquisition-by","title":"Object Topological Character Acquisition by Inductive Learning","date":"2023-06-19","arxiv_id":"2306.10664","repositories_listed":0,"syntology":null},{"url":null,"slug":"modeling-human-like-concept-learning-with","title":"Human-like Few-Shot Learning via Bayesian Reasoning over Natural Language","date":"2023-06-05","arxiv_id":"2306.02797","repositories_listed":0,"syntology":null},{"url":null,"slug":"inductive-detection-of-influence-operations","title":"Inductive detection of Influence Operations via Graph Learning","date":"2023-05-26","arxiv_id":"2305.16544","repositories_listed":0,"syntology":null},{"url":null,"slug":"message-intercommunication-for-inductive","title":"Message Intercommunication for Inductive Relation Reasoning","date":"2023-05-23","arxiv_id":"2305.14074","repositories_listed":0,"syntology":null},{"url":null,"slug":"inductive-graph-neural-networks-for-moving","title":"Inductive Graph Neural Networks for Moving Object Segmentation","date":"2023-05-16","arxiv_id":"2305.09585","repositories_listed":0,"syntology":null}],"syntology_records":20,"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":17,"papers_where_code_ran_first_page":"/task/inductive-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":2,"url":"/task/inductive-learning/papers/2","json":"/task/inductive-learning/papers/2.json","rows":53},{"order":"ran","page":1,"of":1,"url":"/task/inductive-learning/papers/ran/1","json":"/task/inductive-learning/papers/ran/1.json","rows":17}],"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":"ec01972ee7a3d0107a13985cbf4d3fe71947ad487e89faed5d72e1b9e3a096dd","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}