{"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/triple-classification","name":"Triple Classification","slug":"triple-classification","description_markdown":"Triple classification aims to judge whether a given triple (h, r, t) is correct or not with respect to the knowledge graph.","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":45,"papers_with_code":23,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":4,"subtasks":1,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/triple-classification-on-yago39k","slug":"triple-classification-on-yago39k","dataset":"YAGO39K","dataset_url":"/dataset/yago","rows_in_archive":1,"metrics":["Accuracy","F1-Score","Precision","Recall"],"first_row_in_archive_order":{"model":"TransC (bern)","paper_title":"Differentiating Concepts and Instances for Knowledge Graph Embedding","paper_url":"/paper/differentiating-concepts-and-instances-for","paper_date":"2018-11-12","arxiv_id":"1811.04588","code_links":[{"title":"davidlvxin/TransC","url":"https://github.com/davidlvxin/TransC"}],"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/differentiating-concepts-and-instances-for#ran","syntology_url":"https://syntology.ai/paper/1811.04588","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.04588"}},"official":{"repos":["davidlvxin/TransC"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}}}],"datasets":[{"url":"/dataset/yago","name":"YAGO","full_name":"Yet Another Great Ontology","num_papers_in_archive":359},{"url":"/dataset/codex-medium","name":"CoDEx Medium","full_name":"","num_papers_in_archive":5},{"url":"/dataset/codex","name":"CoDEx Small","full_name":"","num_papers_in_archive":5},{"url":"/dataset/codex-large","name":"CoDEx Large","full_name":"","num_papers_in_archive":4}],"subtasks":[{"url":"/task/knowledge-graph-embeddings","name":"Knowledge Graph Embeddings"}],"parent_tasks":[{"url":"/task/knowledge-graph-completion","name":"Knowledge Graph Completion"}],"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":1,"rows_per_page":100,"shown":45,"of":45,"of_with_code":23,"tagged_in_all":45,"counts":{"archive_papers_tagged":45,"with_a_code_link":23,"where_syntology_ran_a_sample":4,"not_listed_spam_title":0,"listed":45,"listed_where_code_ran":4,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":3,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":3,"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/kg-bert-bert-for-knowledge-graph-completion","slug":"kg-bert-bert-for-knowledge-graph-completion","title":"KG-BERT: BERT for Knowledge Graph Completion","date":"2019-09-07","arxiv_id":"1909.03193","repositories_listed":3,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/kg-bert-bert-for-knowledge-graph-completion#ran","syntology_url":"https://syntology.ai/paper/1909.03193","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.03193"}},"official":{"repos":["yao8839836/kg-bert"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/codex-a-comprehensive-knowledge-graph","slug":"codex-a-comprehensive-knowledge-graph","title":"CoDEx: A Comprehensive Knowledge Graph Completion Benchmark","date":"2020-09-16","arxiv_id":"2009.07810","repositories_listed":2,"syntology":null},{"url":"/paper/reasoning-on-knowledge-graphs-with-debate","slug":"reasoning-on-knowledge-graphs-with-debate","title":"Reasoning on Knowledge Graphs with Debate Dynamics","date":"2020-01-02","arxiv_id":"2001.00461","repositories_listed":2,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/reasoning-on-knowledge-graphs-with-debate#ran","syntology_url":"https://syntology.ai/paper/2001.00461","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.00461"}},"official":{"repos":["m-hildebrandt/R2D2"],"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/knowledge-representation-learning-a","slug":"knowledge-representation-learning-a","title":"Knowledge Representation Learning: A Quantitative Review","date":"2018-12-28","arxiv_id":"1812.10901","repositories_listed":2,"syntology":null},{"url":"/paper/learning-entity-and-relation-embeddings-for","slug":"learning-entity-and-relation-embeddings-for","title":"Learning Entity and Relation Embeddings for Knowledge Graph Completion","date":"2015-01-25","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/progressive-knowledge-graph-completion","slug":"progressive-knowledge-graph-completion","title":"Progressive Knowledge Graph Completion","date":"2024-04-15","arxiv_id":"2404.09897","repositories_listed":1,"syntology":null},{"url":"/paper/embedding-ontologies-via-incoprorating","slug":"embedding-ontologies-via-incoprorating","title":"Embedding Ontologies via Incorporating Extensional and Intensional Knowledge","date":"2024-01-20","arxiv_id":"2402.01677","repositories_listed":1,"syntology":null},{"url":"/paper/a-study-on-knowledge-graph-embeddings-and","slug":"a-study-on-knowledge-graph-embeddings-and","title":"A Study on Knowledge Graph Embeddings and Graph Neural Networks for Web Of Things","date":"2023-10-23","arxiv_id":"2310.14866","repositories_listed":1,"syntology":null},{"url":"/paper/leveraging-pre-trained-language-models-for-2","slug":"leveraging-pre-trained-language-models-for-2","title":"Leveraging Pre-trained Language Models for Time Interval Prediction in Text-Enhanced Temporal Knowledge Graphs","date":"2023-09-28","arxiv_id":"2309.16357","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-large-language-models-for-knowledge","slug":"exploring-large-language-models-for-knowledge","title":"Exploring Large Language Models for Knowledge Graph Completion","date":"2023-08-26","arxiv_id":"2308.13916","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/exploring-large-language-models-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/2308.13916","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.13916"}},"official":{"repos":["yao8839836/kg-llm"],"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/iteratively-learning-representations-for","slug":"iteratively-learning-representations-for","title":"Iteratively Learning Representations for Unseen Entities with Inter-Rule Correlations","date":"2023-05-17","arxiv_id":"2305.10531","repositories_listed":1,"syntology":null},{"url":"/paper/structure-pretraining-and-prompt-tuning-for","slug":"structure-pretraining-and-prompt-tuning-for","title":"Structure Pretraining and Prompt Tuning for Knowledge Graph Transfer","date":"2023-03-03","arxiv_id":"2303.03922","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-refinement-based-on-triplet","slug":"knowledge-graph-refinement-based-on-triplet","title":"Knowledge Graph Refinement based on Triplet BERT-Networks","date":"2022-11-18","arxiv_id":"2211.10460","repositories_listed":1,"syntology":null},{"url":"/paper/repurposing-knowledge-graph-embeddings-for","slug":"repurposing-knowledge-graph-embeddings-for","title":"Repurposing Knowledge Graph Embeddings for Triple Representation via Weak Supervision","date":"2022-08-22","arxiv_id":"2208.10328","repositories_listed":1,"syntology":null},{"url":"/paper/greenkgc-a-lightweight-knowledge-graph","slug":"greenkgc-a-lightweight-knowledge-graph","title":"GreenKGC: A Lightweight Knowledge Graph Completion Method","date":"2022-08-19","arxiv_id":"2208.09137","repositories_listed":1,"syntology":null},{"url":"/paper/language-models-as-knowledge-embeddings","slug":"language-models-as-knowledge-embeddings","title":"Language Models as Knowledge Embeddings","date":"2022-06-25","arxiv_id":"2206.12617","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/language-models-as-knowledge-embeddings#ran","syntology_url":"https://syntology.ai/paper/2206.12617","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.12617"}},"official":{"repos":["neph0s/lmke"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/federated-knowledge-graphs-embedding","slug":"federated-knowledge-graphs-embedding","title":"Differentially Private Federated Knowledge Graphs Embedding","date":"2021-05-17","arxiv_id":"2105.07615","repositories_listed":1,"syntology":null},{"url":"/paper/transint-embedding-implication-rules-in-1","slug":"transint-embedding-implication-rules-in-1","title":"TransINT: Embedding Implication Rules in Knowledge Graphs with Isomorphic Intersections of Linear Subspaces","date":"2020-07-01","arxiv_id":"2007.00271","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-role-of-conceptualization-in","slug":"on-the-role-of-conceptualization-in","title":"On the Role of Conceptualization in Commonsense Knowledge Graph Construction","date":"2020-03-06","arxiv_id":"2003.03239","repositories_listed":1,"syntology":null},{"url":"/paper/relational-memory-based-knowledge-graph","slug":"relational-memory-based-knowledge-graph","title":"A Relational Memory-based Embedding Model for Triple Classification and Search Personalization","date":"2019-07-13","arxiv_id":"1907.06080","repositories_listed":1,"syntology":null},{"url":"/paper/differentiating-concepts-and-instances-for","slug":"differentiating-concepts-and-instances-for","title":"Differentiating Concepts and Instances for Knowledge Graph Embedding","date":"2018-11-12","arxiv_id":"1811.04588","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/differentiating-concepts-and-instances-for#ran","syntology_url":"https://syntology.ai/paper/1811.04588","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.04588"}},"official":{"repos":["davidlvxin/TransC"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/does-william-shakespeare-really-write-hamlet","slug":"does-william-shakespeare-really-write-hamlet","title":"Does William Shakespeare REALLY Write Hamlet? Knowledge Representation Learning with Confidence","date":"2017-05-09","arxiv_id":"1705.03202","repositories_listed":1,"syntology":null},{"url":"/paper/image-embodied-knowledge-representation","slug":"image-embodied-knowledge-representation","title":"Image-embodied Knowledge Representation Learning","date":"2016-09-22","arxiv_id":"1609.07028","repositories_listed":1,"syntology":null},{"url":null,"slug":"on-large-scale-evaluation-of-embedding-models","title":"On Large-scale Evaluation of Embedding Models for Knowledge Graph Completion","date":"2025-04-11","arxiv_id":"2504.08970","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-supervised-quantized-representation-for","title":"Self-supervised Quantized Representation for Seamlessly Integrating Knowledge Graphs with Large Language Models","date":"2025-01-30","arxiv_id":"2501.18119","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-relational-context-perception-for","title":"Efficient Relational Context Perception for Knowledge Graph Completion","date":"2024-12-31","arxiv_id":"2501.00397","repositories_listed":0,"syntology":null},{"url":null,"slug":"structural-damage-detection-via-hierarchical","title":"Structural damage detection via hierarchical damage information with volumetric assessment","date":"2024-07-29","arxiv_id":"2407.19694","repositories_listed":0,"syntology":null},{"url":null,"slug":"using-knowledge-graphs-for-performance","title":"Using Knowledge Graphs for Performance Prediction of Modular Optimization Algorithms","date":"2023-01-24","arxiv_id":"2301.09876","repositories_listed":0,"syntology":null},{"url":null,"slug":"onerel-joint-entity-and-relation-extraction","title":"OneRel:Joint Entity and Relation Extraction with One Module in One Step","date":"2022-03-10","arxiv_id":"2203.05412","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-knowledge-graph-representation","title":"Improving Knowledge Graph Representation Learning by Structure Contextual Pre-training","date":"2021-12-08","arxiv_id":"2112.04087","repositories_listed":0,"syntology":null},{"url":null,"slug":"triple-classification-for-scholarly-knowledge","title":"Triple Classification for Scholarly Knowledge Graph Completion","date":"2021-11-23","arxiv_id":"2111.11845","repositories_listed":0,"syntology":null},{"url":null,"slug":"travelbert-pre-training-language-model","title":"Pre-training Language Model Incorporating Domain-specific Heterogeneous Knowledge into A Unified Representation","date":"2021-09-02","arxiv_id":"2109.01048","repositories_listed":0,"syntology":null},{"url":null,"slug":"membership-inference-attacks-on-knowledge","title":"Membership Inference Attacks on Knowledge Graphs","date":"2021-04-16","arxiv_id":"2104.08273","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-structured-embeddings-of-knowledge","title":"Learning Structured Embeddings of Knowledge Graphs with Adversarial Learning Framework","date":"2020-04-15","arxiv_id":"2004.07265","repositories_listed":0,"syntology":null},{"url":null,"slug":"revisiting-evaluation-of-knowledge-base","title":"Revisiting Evaluation of Knowledge Base Completion Models","date":"2020-02-14","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"debate-dynamics-for-human-comprehensible-fact","title":"Debate Dynamics for Human-comprehensible Fact-checking on Knowledge Graphs","date":"2020-01-09","arxiv_id":"2001.03436","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-markov-logic-networks","title":"Neural Markov Logic Networks","date":"2019-05-31","arxiv_id":"1905.13462","repositories_listed":0,"syntology":null},{"url":null,"slug":"logic-rules-powered-knowledge-graph-embedding","title":"Logic Rules Powered Knowledge Graph Embedding","date":"2019-03-09","arxiv_id":"1903.03772","repositories_listed":0,"syntology":null},{"url":null,"slug":"dolores-deep-contextualized-knowledge-graph","title":"DOLORES: Deep Contextualized Knowledge Graph Embeddings","date":"2018-10-31","arxiv_id":"1811.00147","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-multimodal-translation-based-approach-for","title":"A Multimodal Translation-Based Approach for Knowledge Graph Representation Learning","date":"2018-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"accurate-text-enhanced-knowledge-graph","title":"Accurate Text-Enhanced Knowledge Graph Representation Learning","date":"2018-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-representation-via-joint-learning","title":"Knowledge Representation via Joint Learning of Sequential Text and Knowledge Graphs","date":"2016-09-22","arxiv_id":"1609.07075","repositories_listed":0,"syntology":null},{"url":null,"slug":"neighborhood-mixture-model-for-knowledge-base","title":"Neighborhood Mixture Model for Knowledge Base Completion","date":"2016-06-21","arxiv_id":"1606.06461","repositories_listed":0,"syntology":null},{"url":"/paper/probabilistic-reasoning-via-deep-learning","slug":"probabilistic-reasoning-via-deep-learning","title":"Probabilistic Reasoning via Deep Learning: Neural Association Models","date":"2016-03-24","arxiv_id":"1603.07704","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowlege-graph-embedding-by-flexible","title":"Knowlege Graph Embedding by Flexible Translation","date":"2015-05-20","arxiv_id":"1505.05253","repositories_listed":0,"syntology":null}],"syntology_records":5,"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":4,"papers_where_code_ran_first_page":"/task/triple-classification/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":"ran","page":1,"of":1,"url":"/task/triple-classification/papers/ran/1","json":"/task/triple-classification/papers/ran/1.json","rows":4}],"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":"aefee10be51772c720e54a1b002a119389b8fd5f7ba187bfbc0620dd52db8da9","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}