{"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/prediction","name":"Prediction","slug":"prediction","description_markdown":null,"categories":[{"name":"Time Series","url":"/area/time-series"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":8760,"papers_with_code":2835,"benchmarks":2,"benchmark_tables_in_archive":2,"benchmark_tables_shown":2,"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":3,"subtasks":0,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/prediction-on-qm9","slug":"prediction-on-qm9","dataset":"QM9","dataset_url":"/dataset/qm9","rows_in_archive":4,"metrics":["Edit Distance"],"first_row_in_archive_order":{"model":"ANY2GRAPH + FD","paper_title":"Any2Graph: Deep End-To-End Supervised Graph Prediction With An Optimal Transport Loss","paper_url":"/paper/end-to-end-supervised-prediction-of-arbitrary","paper_date":"2024-02-19","arxiv_id":"2402.12269","code_links":[{"title":"KrzakalaPaul/Any2Graph","url":"https://github.com/KrzakalaPaul/Any2Graph"}],"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":5,"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/end-to-end-supervised-prediction-of-arbitrary#ran","syntology_url":"https://syntology.ai/paper/2402.12269","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.12269"}},"official":{"repos":["KrzakalaPaul/Any2Graph"],"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"]}}}},{"leaderboard":"/sota/prediction-on-synthetic","slug":"prediction-on-synthetic","dataset":"Synthetic","dataset_url":null,"rows_in_archive":2,"metrics":["RMSE"],"first_row_in_archive_order":{"model":"CW-AT","paper_title":"CW-CNN & CW-AN: Convolutional Networks and Attention Networks for CW-Complexes","paper_url":"/paper/cw-cnn-cw-an-convolutional-networks-and","paper_date":"2024-08-29","arxiv_id":"2408.16686","code_links":[],"syntology":null}}],"datasets":[{"url":"/dataset/qm9","name":"QM9","full_name":"","num_papers_in_archive":76},{"url":"/dataset/sdwpf","name":"SDWPF","full_name":"A Dataset for Spatial Dynamic Wind Power Forecasting  Challenge at KDD Cup 2022","num_papers_in_archive":6},{"url":"/dataset/bone-cement-removal-with-audio-monitoring","name":"Bone Cement Removal with Audio-Monitoring","full_name":"Bone Cement Removal with Audio-Monitoring and Erosion Depth","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":88,"rows_per_page":100,"shown":100,"of":8760,"of_with_code":2835,"tagged_in_all":8760,"counts":{"archive_papers_tagged":8760,"with_a_code_link":2835,"where_syntology_ran_a_sample":607,"not_listed_spam_title":0,"listed":8760,"listed_where_code_ran":607,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":511,"every_run_a_failure_of_syntologys_instrument":96,"listed_with_a_run_with_no_instrument_failure":511,"listed_every_run_a_failure_of_syntologys_instrument":96,"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/why-should-i-trust-you-explaining-the","slug":"why-should-i-trust-you-explaining-the","title":"\"Why Should I Trust You?\": Explaining the Predictions of Any Classifier","date":"2016-02-16","arxiv_id":"1602.04938","repositories_listed":27,"syntology":{"n":19,"n_ran":13,"n_constructed":4,"n_ran_checked":13,"n_instrument":0,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"13 ran (of which 4 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/why-should-i-trust-you-explaining-the#ran","syntology_url":"https://syntology.ai/paper/1602.04938","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1602.04938"}},"official":{"repos":["marcotcr/lime-experiments"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/variational-graph-auto-encoders","slug":"variational-graph-auto-encoders","title":"Variational Graph Auto-Encoders","date":"2016-11-21","arxiv_id":"1611.07308","repositories_listed":22,"syntology":{"n":13,"n_ran":11,"n_constructed":0,"n_ran_checked":7,"n_instrument":4,"n_unverified":2,"n_honours":3,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 3 honoured, 0 violated, 4 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/variational-graph-auto-encoders#ran","syntology_url":"https://syntology.ai/paper/1611.07308","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.07308"}},"official":{"repos":["tkipf/gae"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/deep-interest-network-for-click-through-rate","slug":"deep-interest-network-for-click-through-rate","title":"Deep Interest Network for Click-Through Rate Prediction","date":"2017-06-21","arxiv_id":"1706.06978","repositories_listed":18,"syntology":null},{"url":"/paper/deeper-depth-prediction-with-fully","slug":"deeper-depth-prediction-with-fully","title":"Deeper Depth Prediction with Fully Convolutional Residual Networks","date":"2016-06-01","arxiv_id":"1606.00373","repositories_listed":18,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/deeper-depth-prediction-with-fully#ran","syntology_url":"https://syntology.ai/paper/1606.00373","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.00373"}},"official":{"repos":["iro-cp/FCRN-DepthPrediction"],"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":["listed","official"]}}},{"url":"/paper/vision-transformers-for-dense-prediction","slug":"vision-transformers-for-dense-prediction","title":"Vision Transformers for Dense Prediction","date":"2021-03-24","arxiv_id":"2103.13413","repositories_listed":15,"syntology":{"n":116,"n_ran":65,"n_constructed":19,"n_ran_checked":32,"n_instrument":33,"n_unverified":51,"n_honours":0,"n_violates":0,"n_no_contract":32,"n_pointer_only":15,"phrase":"65 ran (of which 19 constructed an object rather than computing a result; 32 with no instrument failure: 0 honoured, 0 violated, 32 with no contract checked; 33 where Syntology's instrument failed) · 51 unverified","sample_list":"/paper/vision-transformers-for-dense-prediction#ran","syntology_url":"https://syntology.ai/paper/2103.13413","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.13413"}},"official":null}},{"url":"/paper/deep-interest-evolution-network-for-click","slug":"deep-interest-evolution-network-for-click","title":"Deep Interest Evolution Network for Click-Through Rate Prediction","date":"2018-09-11","arxiv_id":"1809.03672","repositories_listed":15,"syntology":{"n":14,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/deep-interest-evolution-network-for-click#ran","syntology_url":"https://syntology.ai/paper/1809.03672","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.03672"}},"official":{"repos":["mouna99/dien"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/curiosity-driven-exploration-by-self","slug":"curiosity-driven-exploration-by-self","title":"Curiosity-driven Exploration by Self-supervised Prediction","date":"2017-05-15","arxiv_id":"1705.05363","repositories_listed":13,"syntology":{"n":32,"n_ran":16,"n_constructed":9,"n_ran_checked":13,"n_instrument":3,"n_unverified":16,"n_honours":1,"n_violates":1,"n_no_contract":11,"n_pointer_only":14,"phrase":"16 ran (of which 9 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 1 violated, 11 with no contract checked; 3 where Syntology's instrument failed) · 16 unverified","sample_list":"/paper/curiosity-driven-exploration-by-self#ran","syntology_url":"https://syntology.ai/paper/1705.05363","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.05363"}},"official":{"repos":["pathak22/noreward-rl"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":7,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/product-based-neural-networks-for-user","slug":"product-based-neural-networks-for-user","title":"Product-based Neural Networks for User Response Prediction","date":"2016-11-01","arxiv_id":"1611.00144","repositories_listed":11,"syntology":null},{"url":"/paper/inductive-relation-prediction-on-knowledge","slug":"inductive-relation-prediction-on-knowledge","title":"Inductive Relation Prediction by Subgraph Reasoning","date":"2019-11-16","arxiv_id":"1911.06962","repositories_listed":10,"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/inductive-relation-prediction-on-knowledge#ran","syntology_url":"https://syntology.ai/paper/1911.06962","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.06962"}},"official":{"repos":["kkteru/grail"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/190909638","slug":"190909638","title":"Accident Risk Prediction based on Heterogeneous Sparse Data: New Dataset and Insights","date":"2019-09-19","arxiv_id":"1909.09638","repositories_listed":10,"syntology":null},{"url":"/paper/t-gcn-a-temporal-graph-convolutionalnetwork","slug":"t-gcn-a-temporal-graph-convolutionalnetwork","title":"T-GCN: A Temporal Graph ConvolutionalNetwork for Traffic Prediction","date":"2018-11-12","arxiv_id":"1811.05320","repositories_listed":10,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/t-gcn-a-temporal-graph-convolutionalnetwork#ran","syntology_url":"https://syntology.ai/paper/1811.05320","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.05320"}},"official":{"repos":["lehaifeng/T-GCN"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/product-based-neural-networks-for-user-1","slug":"product-based-neural-networks-for-user-1","title":"Product-based Neural Networks for User Response Prediction over Multi-field Categorical Data","date":"2018-07-01","arxiv_id":"1807.00311","repositories_listed":10,"syntology":null},{"url":"/paper/evidential-deep-learning-to-quantify","slug":"evidential-deep-learning-to-quantify","title":"Evidential Deep Learning to Quantify Classification Uncertainty","date":"2018-06-05","arxiv_id":"1806.01768","repositories_listed":10,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"5 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/evidential-deep-learning-to-quantify#ran","syntology_url":"https://syntology.ai/paper/1806.01768","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.01768"}},"official":null}},{"url":"/paper/link-prediction-based-on-graph-neural","slug":"link-prediction-based-on-graph-neural","title":"Link Prediction Based on Graph Neural Networks","date":"2018-02-27","arxiv_id":"1802.09691","repositories_listed":10,"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":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/link-prediction-based-on-graph-neural#ran","syntology_url":"https://syntology.ai/paper/1802.09691","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.09691"}},"official":{"repos":["muhanzhang/SEAL"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/a-deep-reinforced-model-for-abstractive","slug":"a-deep-reinforced-model-for-abstractive","title":"A Deep Reinforced Model for Abstractive Summarization","date":"2017-05-11","arxiv_id":"1705.04304","repositories_listed":10,"syntology":null},{"url":"/paper/complex-embeddings-for-simple-link-prediction","slug":"complex-embeddings-for-simple-link-prediction","title":"Complex Embeddings for Simple Link Prediction","date":"2016-06-20","arxiv_id":"1606.06357","repositories_listed":9,"syntology":null},{"url":"/paper/multi-scale-context-aggregation-by-dilated","slug":"multi-scale-context-aggregation-by-dilated","title":"Multi-Scale Context Aggregation by Dilated Convolutions","date":"2015-11-23","arxiv_id":"1511.07122","repositories_listed":9,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/multi-scale-context-aggregation-by-dilated#ran","syntology_url":"https://syntology.ai/paper/1511.07122","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.07122"}},"official":{"repos":["fyu/dilation"],"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":["listed","official"]}}},{"url":"/paper/scheduled-sampling-for-sequence-prediction","slug":"scheduled-sampling-for-sequence-prediction","title":"Scheduled Sampling for Sequence Prediction with Recurrent Neural Networks","date":"2015-06-09","arxiv_id":"1506.03099","repositories_listed":9,"syntology":{"n":8,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/scheduled-sampling-for-sequence-prediction#ran","syntology_url":"https://syntology.ai/paper/1506.03099","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1506.03099"}},"official":null}},{"url":"/paper/cyclemlp-a-mlp-like-architecture-for-dense","slug":"cyclemlp-a-mlp-like-architecture-for-dense","title":"CycleMLP: A MLP-like Architecture for Dense Prediction","date":"2021-07-21","arxiv_id":"2107.10224","repositories_listed":8,"syntology":{"n":15,"n_ran":10,"n_constructed":6,"n_ran_checked":9,"n_instrument":1,"n_unverified":5,"n_honours":1,"n_violates":1,"n_no_contract":7,"n_pointer_only":2,"phrase":"10 ran (of which 6 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 1 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/cyclemlp-a-mlp-like-architecture-for-dense#ran","syntology_url":"https://syntology.ai/paper/2107.10224","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.10224"}},"official":{"repos":["ShoufaChen/CycleMLP"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/on-human-motion-prediction-using-recurrent","slug":"on-human-motion-prediction-using-recurrent","title":"On human motion prediction using recurrent neural networks","date":"2017-05-06","arxiv_id":"1705.02445","repositories_listed":8,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/on-human-motion-prediction-using-recurrent#ran","syntology_url":"https://syntology.ai/paper/1705.02445","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.02445"}},"official":{"repos":["una-dinosauria/human-motion-prediction"],"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":["listed","official"]}}},{"url":"/paper/utilizing-self-supervised-representations-for","slug":"utilizing-self-supervised-representations-for","title":"Utilizing Self-supervised Representations for MOS Prediction","date":"2021-04-07","arxiv_id":"2104.03017","repositories_listed":7,"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":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/utilizing-self-supervised-representations-for#ran","syntology_url":"https://syntology.ai/paper/2104.03017","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.03017"}},"official":{"repos":["s3prl/s3prl"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/dense-contrastive-learning-for-self","slug":"dense-contrastive-learning-for-self","title":"Dense Contrastive Learning for Self-Supervised Visual Pre-Training","date":"2020-11-18","arxiv_id":"2011.09157","repositories_listed":7,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/dense-contrastive-learning-for-self#ran","syntology_url":"https://syntology.ai/paper/2011.09157","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.09157"}},"official":null}},{"url":"/paper/flen-leveraging-field-for-scalable-ctr","slug":"flen-leveraging-field-for-scalable-ctr","title":"FLEN: Leveraging Field for Scalable CTR Prediction","date":"2019-11-12","arxiv_id":"1911.04690","repositories_listed":7,"syntology":null},{"url":"/paper/mesh-r-cnn","slug":"mesh-r-cnn","title":"Mesh R-CNN","date":"2019-06-06","arxiv_id":"1906.02739","repositories_listed":7,"syntology":null},{"url":"/paper/deep-session-interest-network-for-click","slug":"deep-session-interest-network-for-click","title":"Deep Session Interest Network for Click-Through Rate Prediction","date":"2019-05-16","arxiv_id":"1905.06482","repositories_listed":7,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/deep-session-interest-network-for-click#ran","syntology_url":"https://syntology.ai/paper/1905.06482","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.06482"}},"official":{"repos":["shenweichen/DSIN"],"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":["listed","official"]}}},{"url":"/paper/recurrent-neural-networks-for-multivariate","slug":"recurrent-neural-networks-for-multivariate","title":"Recurrent Neural Networks for Multivariate Time Series with Missing Values","date":"2016-06-06","arxiv_id":"1606.01865","repositories_listed":7,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"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) · 2 unverified","sample_list":"/paper/recurrent-neural-networks-for-multivariate#ran","syntology_url":"https://syntology.ai/paper/1606.01865","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.01865"}},"official":{"repos":["WenjieDu/PyPOTS"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/heterogeneous-networks-in-drug-target","slug":"heterogeneous-networks-in-drug-target","title":"Heterogeneous networks in drug-target interaction prediction","date":"2025-04-22","arxiv_id":"2504.16152","repositories_listed":6,"syntology":null},{"url":"/paper/efficientvit-enhanced-linear-attention-for","slug":"efficientvit-enhanced-linear-attention-for","title":"EfficientViT: Multi-Scale Linear Attention for High-Resolution Dense Prediction","date":"2022-05-29","arxiv_id":"2205.14756","repositories_listed":6,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/efficientvit-enhanced-linear-attention-for#ran","syntology_url":"https://syntology.ai/paper/2205.14756","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.14756"}},"official":{"repos":["mit-han-lab/efficientvit","rwightman/pytorch-image-models"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/masked-feature-prediction-for-self-supervised","slug":"masked-feature-prediction-for-self-supervised","title":"Masked Feature Prediction for Self-Supervised Visual Pre-Training","date":"2021-12-16","arxiv_id":"2112.09133","repositories_listed":6,"syntology":null},{"url":"/paper/fuxictr-an-open-benchmark-for-click-through","slug":"fuxictr-an-open-benchmark-for-click-through","title":"BARS-CTR: Open Benchmarking for Click-Through Rate Prediction","date":"2020-09-12","arxiv_id":"2009.05794","repositories_listed":6,"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":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fuxictr-an-open-benchmark-for-click-through#ran","syntology_url":"https://syntology.ai/paper/2009.05794","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.05794"}},"official":{"repos":["reczoo/BARS"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/fastpitch-parallel-text-to-speech-with-pitch","slug":"fastpitch-parallel-text-to-speech-with-pitch","title":"FastPitch: Parallel Text-to-speech with Pitch Prediction","date":"2020-06-11","arxiv_id":"2006.06873","repositories_listed":6,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":1,"n_honours":3,"n_violates":0,"n_no_contract":4,"n_pointer_only":3,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 3 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fastpitch-parallel-text-to-speech-with-pitch#ran","syntology_url":"https://syntology.ai/paper/2006.06873","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.06873"}},"official":{"repos":["NVIDIA/DeepLearningExamples"],"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":["listed","named_in_paper"]}}},{"url":"/paper/gman-a-graph-multi-attention-network-for","slug":"gman-a-graph-multi-attention-network-for","title":"GMAN: A Graph Multi-Attention Network for Traffic Prediction","date":"2019-11-11","arxiv_id":"1911.08415","repositories_listed":6,"syntology":{"n":10,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/gman-a-graph-multi-attention-network-for#ran","syntology_url":"https://syntology.ai/paper/1911.08415","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.08415"}},"official":{"repos":["zhengchuanpan/GMAN"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/federated-learning-for-mobile-keyboard","slug":"federated-learning-for-mobile-keyboard","title":"Federated Learning for Mobile Keyboard Prediction","date":"2018-11-08","arxiv_id":"1811.03604","repositories_listed":6,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/federated-learning-for-mobile-keyboard#ran","syntology_url":"https://syntology.ai/paper/1811.03604","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.03604"}},"official":null}},{"url":"/paper/sparse-to-dense-depth-prediction-from-sparse","slug":"sparse-to-dense-depth-prediction-from-sparse","title":"Sparse-to-Dense: Depth Prediction from Sparse Depth Samples and a Single Image","date":"2017-09-21","arxiv_id":"1709.07492","repositories_listed":6,"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/sparse-to-dense-depth-prediction-from-sparse#ran","syntology_url":"https://syntology.ai/paper/1709.07492","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1709.07492"}},"official":{"repos":["fangchangma/sparse-to-dense"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/deep-and-confident-prediction-for-time-series","slug":"deep-and-confident-prediction-for-time-series","title":"Deep and Confident Prediction for Time Series at Uber","date":"2017-09-06","arxiv_id":"1709.01907","repositories_listed":6,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 2 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deep-and-confident-prediction-for-time-series#ran","syntology_url":"https://syntology.ai/paper/1709.01907","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1709.01907"}},"official":null}},{"url":"/paper/highly-accurate-protein-structure-prediction","slug":"highly-accurate-protein-structure-prediction","title":"Highly accurate protein structure prediction with AlphaFold","date":"2021-07-15","arxiv_id":null,"repositories_listed":5,"syntology":null},{"url":"/paper/uncertainty-sets-for-image-classifiers-using","slug":"uncertainty-sets-for-image-classifiers-using","title":"Uncertainty Sets for Image Classifiers using Conformal Prediction","date":"2020-09-29","arxiv_id":"2009.14193","repositories_listed":5,"syntology":{"n":63,"n_ran":26,"n_constructed":1,"n_ran_checked":13,"n_instrument":13,"n_unverified":37,"n_honours":4,"n_violates":0,"n_no_contract":9,"n_pointer_only":19,"phrase":"26 ran (of which 1 constructed an object rather than computing a result; 13 with no instrument failure: 4 honoured, 0 violated, 9 with no contract checked; 13 where Syntology's instrument failed) · 37 unverified","sample_list":"/paper/uncertainty-sets-for-image-classifiers-using#ran","syntology_url":"https://syntology.ai/paper/2009.14193","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.14193"}},"official":{"repos":["aangelopoulos/conformal-classification","aangelopoulos/conformal_classification"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":15,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/probabilistic-anchor-assignment-with-iou","slug":"probabilistic-anchor-assignment-with-iou","title":"Probabilistic Anchor Assignment with IoU Prediction for Object Detection","date":"2020-07-16","arxiv_id":"2007.08103","repositories_listed":5,"syntology":null},{"url":"/paper/prophetnet-predicting-future-n-gram-for","slug":"prophetnet-predicting-future-n-gram-for","title":"ProphetNet: Predicting Future N-gram for Sequence-to-Sequence Pre-training","date":"2020-01-13","arxiv_id":"2001.04063","repositories_listed":5,"syntology":null},{"url":"/paper/learning-trajectory-dependencies-for-human","slug":"learning-trajectory-dependencies-for-human","title":"Learning Trajectory Dependencies for Human Motion Prediction","date":"2019-08-15","arxiv_id":"1908.05436","repositories_listed":5,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-trajectory-dependencies-for-human#ran","syntology_url":"https://syntology.ai/paper/1908.05436","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.05436"}},"official":{"repos":["wei-mao-2019/LearnTrajDep"],"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/conformalized-quantile-regression","slug":"conformalized-quantile-regression","title":"Conformalized Quantile Regression","date":"2019-05-08","arxiv_id":"1905.03222","repositories_listed":5,"syntology":null},{"url":"/paper/document-expansion-by-query-prediction","slug":"document-expansion-by-query-prediction","title":"Document Expansion by Query Prediction","date":"2019-04-17","arxiv_id":"1904.08375","repositories_listed":5,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/document-expansion-by-query-prediction#ran","syntology_url":"https://syntology.ai/paper/1904.08375","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.08375"}},"official":{"repos":["nyu-dl/dl4ir-doc2query"],"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/mmkg-multi-modal-knowledge-graphs","slug":"mmkg-multi-modal-knowledge-graphs","title":"MMKG: Multi-Modal Knowledge Graphs","date":"2019-03-13","arxiv_id":"1903.05485","repositories_listed":5,"syntology":null},{"url":"/paper/tucker-tensor-factorization-for-knowledge","slug":"tucker-tensor-factorization-for-knowledge","title":"TuckER: Tensor Factorization for Knowledge Graph Completion","date":"2019-01-28","arxiv_id":"1901.09590","repositories_listed":5,"syntology":null},{"url":"/paper/selectivenet-a-deep-neural-network-with-an","slug":"selectivenet-a-deep-neural-network-with-an","title":"SelectiveNet: A Deep Neural Network with an Integrated Reject Option","date":"2019-01-26","arxiv_id":"1901.09192","repositories_listed":5,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":3,"n_pointer_only":3,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 1 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/selectivenet-a-deep-neural-network-with-an#ran","syntology_url":"https://syntology.ai/paper/1901.09192","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.09192"}},"official":{"repos":["geifmany/SelectiveNet"],"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":["listed","official"]}}},{"url":"/paper/large-scale-study-of-curiosity-driven","slug":"large-scale-study-of-curiosity-driven","title":"Large-Scale Study of Curiosity-Driven Learning","date":"2018-08-13","arxiv_id":"1808.04355","repositories_listed":5,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/large-scale-study-of-curiosity-driven#ran","syntology_url":"https://syntology.ai/paper/1808.04355","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.04355"}},"official":{"repos":["openai/large-scale-curiosity"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/field-weighted-factorization-machines-for","slug":"field-weighted-factorization-machines-for","title":"Field-weighted Factorization Machines for Click-Through Rate Prediction in Display Advertising","date":"2018-06-09","arxiv_id":"1806.03514","repositories_listed":5,"syntology":null},{"url":"/paper/real-time-seamless-single-shot-6d-object-pose","slug":"real-time-seamless-single-shot-6d-object-pose","title":"Real-Time Seamless Single Shot 6D Object Pose Prediction","date":"2017-11-24","arxiv_id":"1711.08848","repositories_listed":5,"syntology":null},{"url":"/paper/online-real-time-multiple-spatiotemporal","slug":"online-real-time-multiple-spatiotemporal","title":"Online Real-time Multiple Spatiotemporal Action Localisation and Prediction","date":"2016-11-25","arxiv_id":"1611.08563","repositories_listed":5,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":1,"n_instrument":6,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":7,"phrase":"7 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; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/online-real-time-multiple-spatiotemporal#ran","syntology_url":"https://syntology.ai/paper/1611.08563","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.08563"}},"official":{"repos":["gurkirt/realtime-action-detection","gurkirt/corrected-UCF101-Annots"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/distribution-free-predictive-inference-for","slug":"distribution-free-predictive-inference-for","title":"Distribution-Free Predictive Inference For Regression","date":"2016-04-14","arxiv_id":"1604.04173","repositories_listed":5,"syntology":null},{"url":"/paper/deep-multi-scale-video-prediction-beyond-mean","slug":"deep-multi-scale-video-prediction-beyond-mean","title":"Deep multi-scale video prediction beyond mean square error","date":"2015-11-17","arxiv_id":"1511.05440","repositories_listed":5,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/deep-multi-scale-video-prediction-beyond-mean#ran","syntology_url":"https://syntology.ai/paper/1511.05440","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.05440"}},"official":null}},{"url":"/paper/openstarlab-open-approach-for-spatio-temporal","slug":"openstarlab-open-approach-for-spatio-temporal","title":"OpenSTARLab: Open Approach for Spatio-Temporal Agent Data Analysis in Soccer","date":"2025-02-05","arxiv_id":"2502.02785","repositories_listed":4,"syntology":null},{"url":"/paper/assumption-lean-and-data-adaptive-post","slug":"assumption-lean-and-data-adaptive-post","title":"Assumption-Lean and Data-Adaptive Post-Prediction Inference","date":"2023-11-23","arxiv_id":"2311.14220","repositories_listed":4,"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/assumption-lean-and-data-adaptive-post#ran","syntology_url":"https://syntology.ai/paper/2311.14220","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.14220"}},"official":{"repos":["qlu-lab/popinf","qlu-lab/pspa"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/expediting-large-scale-vision-transformer-for","slug":"expediting-large-scale-vision-transformer-for","title":"Expediting Large-Scale Vision Transformer for Dense Prediction without Fine-tuning","date":"2022-10-03","arxiv_id":"2210.01035","repositories_listed":4,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"7 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/expediting-large-scale-vision-transformer-for#ran","syntology_url":"https://syntology.ai/paper/2210.01035","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.01035"}},"official":{"repos":["Expedit-LargeScale-Vision-Transformer/Expedit-DINO","Expedit-LargeScale-Vision-Transformer/Expedit-DPT","Expedit-LargeScale-Vision-Transformer/Expedit-Segmenter"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/mpa-multipath-based-architecture-for-motion","slug":"mpa-multipath-based-architecture-for-motion","title":"MPA: MultiPath++ Based Architecture for Motion Prediction","date":"2022-06-20","arxiv_id":"2206.10041","repositories_listed":4,"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/mpa-multipath-based-architecture-for-motion#ran","syntology_url":"https://syntology.ai/paper/2206.10041","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.10041"}},"official":{"repos":["stepankonev/waymo-motion-prediction-chalenge-2022-multipath-plus-plus"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/rita-a-study-on-scaling-up-generative-protein","slug":"rita-a-study-on-scaling-up-generative-protein","title":"RITA: a Study on Scaling Up Generative Protein Sequence Models","date":"2022-05-11","arxiv_id":"2205.05789","repositories_listed":4,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"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: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/rita-a-study-on-scaling-up-generative-protein#ran","syntology_url":"https://syntology.ai/paper/2205.05789","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.05789"}},"official":{"repos":["lightonai/rita"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-gentle-introduction-to-conformal-prediction","slug":"a-gentle-introduction-to-conformal-prediction","title":"A Gentle Introduction to Conformal Prediction and Distribution-Free Uncertainty Quantification","date":"2021-07-15","arxiv_id":"2107.07511","repositories_listed":4,"syntology":{"n":12,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"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) · 6 unverified","sample_list":"/paper/a-gentle-introduction-to-conformal-prediction#ran","syntology_url":"https://syntology.ai/paper/2107.07511","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.07511"}},"official":{"repos":["aangelopoulos/conformal-prediction"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/sgcn-sparse-graph-convolution-network-for","slug":"sgcn-sparse-graph-convolution-network-for","title":"SGCN:Sparse Graph Convolution Network for Pedestrian Trajectory Prediction","date":"2021-04-04","arxiv_id":"2104.01528","repositories_listed":4,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"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) · 2 unverified","sample_list":"/paper/sgcn-sparse-graph-convolution-network-for#ran","syntology_url":"https://syntology.ai/paper/2104.01528","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.01528"}},"official":{"repos":["shuaishiliu/SGCN"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/learning-accurate-dense-correspondences-and","slug":"learning-accurate-dense-correspondences-and","title":"Learning Accurate Dense Correspondences and When to Trust Them","date":"2021-01-05","arxiv_id":"2101.01710","repositories_listed":4,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"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/learning-accurate-dense-correspondences-and#ran","syntology_url":"https://syntology.ai/paper/2101.01710","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.01710"}},"official":{"repos":["PruneTruong/PDCNet","PruneTruong/DenseMatching"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/joint-analysis-and-prediction-of-human","slug":"joint-analysis-and-prediction-of-human","title":"From Recognition to Prediction: Analysis of Human Action and Trajectory Prediction in Video","date":"2020-11-20","arxiv_id":"2011.10670","repositories_listed":4,"syntology":null},{"url":"/paper/saint-integrating-temporal-features-for-ednet","slug":"saint-integrating-temporal-features-for-ednet","title":"SAINT+: Integrating Temporal Features for EdNet Correctness Prediction","date":"2020-10-19","arxiv_id":"2010.12042","repositories_listed":4,"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/saint-integrating-temporal-features-for-ednet#ran","syntology_url":"https://syntology.ai/paper/2010.12042","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.12042"}},"official":null}},{"url":"/paper/field-embedded-factorization-machines-for","slug":"field-embedded-factorization-machines-for","title":"Field-Embedded Factorization Machines for Click-through rate prediction","date":"2020-09-13","arxiv_id":"2009.09931","repositories_listed":4,"syntology":null},{"url":"/paper/tnt-target-driven-trajectory-prediction","slug":"tnt-target-driven-trajectory-prediction","title":"TNT: Target-driveN Trajectory Prediction","date":"2020-08-19","arxiv_id":"2008.08294","repositories_listed":4,"syntology":null},{"url":"/paper/it-is-not-the-journey-but-the-destination","slug":"it-is-not-the-journey-but-the-destination","title":"It Is Not the Journey but the Destination: Endpoint Conditioned Trajectory Prediction","date":"2020-04-04","arxiv_id":"2004.02025","repositories_listed":4,"syntology":null},{"url":"/paper/the-alzheimer-s-disease-prediction-of","slug":"the-alzheimer-s-disease-prediction-of","title":"The Alzheimer's Disease Prediction Of Longitudinal Evolution (TADPOLE) Challenge: Results after 1 Year Follow-up","date":"2020-02-09","arxiv_id":"2002.03419","repositories_listed":4,"syntology":null},{"url":"/paper/dp-lstm-differential-privacy-inspired-lstm","slug":"dp-lstm-differential-privacy-inspired-lstm","title":"DP-LSTM: Differential Privacy-inspired LSTM for Stock Prediction Using Financial News","date":"2019-12-20","arxiv_id":"1912.10806","repositories_listed":4,"syntology":null},{"url":"/paper/incrementally-improving-graph-wavenet","slug":"incrementally-improving-graph-wavenet","title":"Incrementally Improving Graph WaveNet Performance on Traffic Prediction","date":"2019-12-11","arxiv_id":"1912.07390","repositories_listed":4,"syntology":null},{"url":"/paper/a-cnn-rnn-framework-for-crop-yield-prediction","slug":"a-cnn-rnn-framework-for-crop-yield-prediction","title":"A CNN-RNN Framework for Crop Yield Prediction","date":"2019-11-20","arxiv_id":"1911.09045","repositories_listed":4,"syntology":null},{"url":"/paper/adversarial-examples-for-models-of-code","slug":"adversarial-examples-for-models-of-code","title":"Adversarial Examples for Models of Code","date":"2019-10-15","arxiv_id":"1910.07517","repositories_listed":4,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":5,"n_instrument":5,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":4,"phrase":"10 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; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adversarial-examples-for-models-of-code#ran","syntology_url":"https://syntology.ai/paper/1910.07517","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.07517"}},"official":{"repos":["tech-srl/adversarial-examples"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/ngboost-natural-gradient-boosting-for","slug":"ngboost-natural-gradient-boosting-for","title":"NGBoost: Natural Gradient Boosting for Probabilistic Prediction","date":"2019-10-08","arxiv_id":"1910.03225","repositories_listed":4,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/ngboost-natural-gradient-boosting-for#ran","syntology_url":"https://syntology.ai/paper/1910.03225","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.03225"}},"official":{"repos":["stanfordmlgroup/ngboost"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/sme-net-sparse-motion-estimation-for","slug":"sme-net-sparse-motion-estimation-for","title":"SME-Net: Sparse Motion Estimation for Parametric Video Prediction Through Reinforcement Learning","date":"2019-10-01","arxiv_id":null,"repositories_listed":4,"syntology":null},{"url":"/paper/knowledge-graph-embedding-for","slug":"knowledge-graph-embedding-for","title":"Knowledge Graph Embedding for Ecotoxicological Effect Prediction","date":"2019-07-02","arxiv_id":"1907.01328","repositories_listed":4,"syntology":null},{"url":"/paper/efficient-algorithms-for-set-valued","slug":"efficient-algorithms-for-set-valued","title":"Efficient Set-Valued Prediction in Multi-Class Classification","date":"2019-06-19","arxiv_id":"1906.08129","repositories_listed":4,"syntology":null},{"url":"/paper/graph-embedding-on-biomedical-networks","slug":"graph-embedding-on-biomedical-networks","title":"Graph Embedding on Biomedical Networks: Methods, Applications, and Evaluations","date":"2019-06-12","arxiv_id":"1906.05017","repositories_listed":4,"syntology":{"n":11,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/graph-embedding-on-biomedical-networks#ran","syntology_url":"https://syntology.ai/paper/1906.05017","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.05017"}},"official":{"repos":["xiangyue9607/BioNEV"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/fair-regression-quantitative-definitions-and","slug":"fair-regression-quantitative-definitions-and","title":"Fair Regression: Quantitative Definitions and Reduction-based Algorithms","date":"2019-05-30","arxiv_id":"1905.12843","repositories_listed":4,"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/fair-regression-quantitative-definitions-and#ran","syntology_url":"https://syntology.ai/paper/1905.12843","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.12843"}},"official":null}},{"url":"/paper/190412579","slug":"190412579","title":"Operation-aware Neural Networks for User Response Prediction","date":"2019-04-02","arxiv_id":"1904.12579","repositories_listed":4,"syntology":null},{"url":"/paper/are-learned-molecular-representations-ready","slug":"are-learned-molecular-representations-ready","title":"Analyzing Learned Molecular Representations for Property Prediction","date":"2019-04-02","arxiv_id":"1904.01561","repositories_listed":4,"syntology":{"n":15,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":3,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/are-learned-molecular-representations-ready#ran","syntology_url":"https://syntology.ai/paper/1904.01561","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.01561"}},"official":{"repos":["swansonk14/chemprop"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/contextual-encoder-decoder-network-for-visual","slug":"contextual-encoder-decoder-network-for-visual","title":"Contextual Encoder-Decoder Network for Visual Saliency Prediction","date":"2019-02-18","arxiv_id":"1902.06634","repositories_listed":4,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/contextual-encoder-decoder-network-for-visual#ran","syntology_url":"https://syntology.ai/paper/1902.06634","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.06634"}},"official":{"repos":["alexanderkroner/saliency"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["listed"]}}},{"url":"/paper/consistent-rank-logits-for-ordinal-regression","slug":"consistent-rank-logits-for-ordinal-regression","title":"Rank consistent ordinal regression for neural networks with application to age estimation","date":"2019-01-20","arxiv_id":"1901.07884","repositories_listed":4,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/consistent-rank-logits-for-ordinal-regression#ran","syntology_url":"https://syntology.ai/paper/1901.07884","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.07884"}},"official":{"repos":["Raschka-research-group/coral-cnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/stochastic-adversarial-video-prediction","slug":"stochastic-adversarial-video-prediction","title":"Stochastic Adversarial Video Prediction","date":"2018-04-04","arxiv_id":"1804.01523","repositories_listed":4,"syntology":{"n":16,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":6,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":3,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/stochastic-adversarial-video-prediction#ran","syntology_url":"https://syntology.ai/paper/1804.01523","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.01523"}},"official":{"repos":["alexlee-gk/video_prediction"],"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":["listed","official"]}}},{"url":"/paper/deepdta-deep-drug-target-binding-affinity","slug":"deepdta-deep-drug-target-binding-affinity","title":"DeepDTA: Deep Drug-Target Binding Affinity Prediction","date":"2018-01-30","arxiv_id":"1801.10193","repositories_listed":4,"syntology":null},{"url":"/paper/salgan-visual-saliency-prediction-with","slug":"salgan-visual-saliency-prediction-with","title":"SalGAN: Visual Saliency Prediction with Generative Adversarial Networks","date":"2017-01-04","arxiv_id":"1701.01081","repositories_listed":4,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"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) · 0 unverified","sample_list":"/paper/salgan-visual-saliency-prediction-with#ran","syntology_url":"https://syntology.ai/paper/1701.01081","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1701.01081"}},"official":{"repos":["imatge-upc/salgan"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/higher-order-factorization-machines","slug":"higher-order-factorization-machines","title":"Higher-Order Factorization Machines","date":"2016-07-25","arxiv_id":"1607.07195","repositories_listed":4,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/higher-order-factorization-machines#ran","syntology_url":"https://syntology.ai/paper/1607.07195","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1607.07195"}},"official":null}},{"url":"/paper/a-convolutional-click-prediction-model-1","slug":"a-convolutional-click-prediction-model-1","title":"A Convolutional Click Prediction Model","date":"2015-01-01","arxiv_id":null,"repositories_listed":4,"syntology":null},{"url":"/paper/rsar-restricted-state-angle-resolver-and","slug":"rsar-restricted-state-angle-resolver-and","title":"RSAR: Restricted State Angle Resolver and Rotated SAR Benchmark","date":"2025-01-08","arxiv_id":"2501.04440","repositories_listed":3,"syntology":null},{"url":"/paper/diffusion-forcing-next-token-prediction-meets","slug":"diffusion-forcing-next-token-prediction-meets","title":"Diffusion Forcing: Next-token Prediction Meets Full-Sequence Diffusion","date":"2024-07-01","arxiv_id":"2407.01392","repositories_listed":3,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":2,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 2 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/diffusion-forcing-next-token-prediction-meets#ran","syntology_url":"https://syntology.ai/paper/2407.01392","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.01392"}},"official":{"repos":["buoyancy99/diffusion-forcing"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/large-language-model-validity-via-enhanced","slug":"large-language-model-validity-via-enhanced","title":"Large language model validity via enhanced conformal prediction methods","date":"2024-06-14","arxiv_id":"2406.09714","repositories_listed":3,"syntology":{"n":32,"n_ran":23,"n_constructed":0,"n_ran_checked":18,"n_instrument":5,"n_unverified":9,"n_honours":3,"n_violates":2,"n_no_contract":13,"n_pointer_only":12,"phrase":"23 ran (of which 0 constructed an object rather than computing a result; 18 with no instrument failure: 3 honoured, 2 violated, 13 with no contract checked; 5 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/large-language-model-validity-via-enhanced#ran","syntology_url":"https://syntology.ai/paper/2406.09714","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.09714"}},"official":{"repos":["jjcherian/conformal-safety"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["found_in_text","listed","official"]}}},{"url":"/paper/generalized-predictive-model-for-autonomous","slug":"generalized-predictive-model-for-autonomous","title":"GenAD: Generalized Predictive Model for Autonomous Driving","date":"2024-03-14","arxiv_id":"2403.09630","repositories_listed":3,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/generalized-predictive-model-for-autonomous#ran","syntology_url":"https://syntology.ai/paper/2403.09630","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.09630"}},"official":{"repos":["opendrivelab/driveagi"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/triplet-interaction-improves-graph","slug":"triplet-interaction-improves-graph","title":"Triplet Interaction Improves Graph Transformers: Accurate Molecular Graph Learning with Triplet Graph Transformers","date":"2024-02-07","arxiv_id":"2402.04538","repositories_listed":3,"syntology":{"n":13,"n_ran":10,"n_constructed":1,"n_ran_checked":2,"n_instrument":8,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"10 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 8 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/triplet-interaction-improves-graph#ran","syntology_url":"https://syntology.ai/paper/2402.04538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.04538"}},"official":{"repos":["shamim-hussain/tgt"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/spatial-temporal-large-language-model-for","slug":"spatial-temporal-large-language-model-for","title":"Spatial-Temporal Large Language Model for Traffic Prediction","date":"2024-01-18","arxiv_id":"2401.10134","repositories_listed":3,"syntology":null},{"url":"/paper/fully-sparse-3d-panoptic-occupancy-prediction","slug":"fully-sparse-3d-panoptic-occupancy-prediction","title":"Fully Sparse 3D Occupancy Prediction","date":"2023-12-28","arxiv_id":"2312.17118","repositories_listed":3,"syntology":{"n":24,"n_ran":16,"n_constructed":0,"n_ran_checked":10,"n_instrument":6,"n_unverified":8,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 6 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/fully-sparse-3d-panoptic-occupancy-prediction#ran","syntology_url":"https://syntology.ai/paper/2312.17118","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.17118"}},"official":{"repos":["mcg-nju/sparseocc"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/conformal-prediction-for-deep-classifier-via","slug":"conformal-prediction-for-deep-classifier-via","title":"Conformal Prediction for Deep Classifier via Label Ranking","date":"2023-10-10","arxiv_id":"2310.06430","repositories_listed":3,"syntology":{"n":15,"n_ran":10,"n_constructed":1,"n_ran_checked":9,"n_instrument":1,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":15,"phrase":"10 ran (of which 1 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/conformal-prediction-for-deep-classifier-via#ran","syntology_url":"https://syntology.ai/paper/2310.06430","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.06430"}},"official":{"repos":["ml-stat-Sustech/conformal_prediction_via_label_ranking"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/road-barlow-twins-redundancy-reduction-for","slug":"road-barlow-twins-redundancy-reduction-for","title":"RedMotion: Motion Prediction via Redundancy Reduction","date":"2023-06-19","arxiv_id":"2306.10840","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/road-barlow-twins-redundancy-reduction-for#ran","syntology_url":"https://syntology.ai/paper/2306.10840","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.10840"}},"official":{"repos":["kit-mrt/red-motion","kit-mrt/road-barlow-twins","kit-mrt/future-motion"],"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/link-prediction-without-graph-neural-networks","slug":"link-prediction-without-graph-neural-networks","title":"Link Prediction without Graph Neural Networks","date":"2023-05-23","arxiv_id":"2305.13656","repositories_listed":3,"syntology":null},{"url":"/paper/video-prediction-models-as-rewards-for","slug":"video-prediction-models-as-rewards-for","title":"Video Prediction Models as Rewards for Reinforcement Learning","date":"2023-05-23","arxiv_id":"2305.14343","repositories_listed":3,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":8,"n_instrument":4,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 2 honoured, 0 violated, 6 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/video-prediction-models-as-rewards-for#ran","syntology_url":"https://syntology.ai/paper/2305.14343","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.14343"}},"official":null}},{"url":"/paper/fedgh-heterogeneous-federated-learning-with","slug":"fedgh-heterogeneous-federated-learning-with","title":"FedGH: Heterogeneous Federated Learning with Generalized Global Header","date":"2023-03-23","arxiv_id":"2303.13137","repositories_listed":3,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/fedgh-heterogeneous-federated-learning-with#ran","syntology_url":"https://syntology.ai/paper/2303.13137","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.13137"}},"official":{"repos":["lipingyi/fedgh"],"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/simplifying-subgraph-representation-learning","slug":"simplifying-subgraph-representation-learning","title":"Simplifying Subgraph Representation Learning for Scalable Link Prediction","date":"2023-01-29","arxiv_id":"2301.12562","repositories_listed":3,"syntology":null},{"url":"/paper/prediction-powered-inference","slug":"prediction-powered-inference","title":"Prediction-Powered Inference","date":"2023-01-23","arxiv_id":"2301.09633","repositories_listed":3,"syntology":{"n":16,"n_ran":12,"n_constructed":0,"n_ran_checked":7,"n_instrument":5,"n_unverified":4,"n_honours":5,"n_violates":2,"n_no_contract":0,"n_pointer_only":3,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 5 honoured, 2 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/prediction-powered-inference#ran","syntology_url":"https://syntology.ai/paper/2301.09633","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.09633"}},"official":{"repos":["aangelopoulos/ppi_py","aangelopoulos/prediction-powered-inference"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/context-aware-multi-head-self-attentional","slug":"context-aware-multi-head-self-attentional","title":"Context-aware multi-head self-attentional neural network model for next location prediction","date":"2022-12-04","arxiv_id":"2212.01953","repositories_listed":3,"syntology":{"n":7,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/context-aware-multi-head-self-attentional#ran","syntology_url":"https://syntology.ai/paper/2212.01953","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.01953"}},"official":{"repos":["mie-lab/location-prediction"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/motion-transformer-with-global-intention","slug":"motion-transformer-with-global-intention","title":"Motion Transformer with Global Intention Localization and Local Movement Refinement","date":"2022-09-27","arxiv_id":"2209.13508","repositories_listed":3,"syntology":{"n":15,"n_ran":6,"n_constructed":1,"n_ran_checked":4,"n_instrument":2,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"6 ran (of which 1 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/motion-transformer-with-global-intention#ran","syntology_url":"https://syntology.ai/paper/2209.13508","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.13508"}},"official":{"repos":["sshaoshuai/mtr"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":6,"ran_from_kinds":["listed","official"]}}}],"syntology_records":62,"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":6,"papers_placed":0,"judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[{"leaderboard":"/sota/prediction-on-synthetic","since_archive":"/sota/prediction-on-synthetic#since-judged","papers_judged":6,"placed":0}]},"papers_where_code_ran":607,"papers_where_code_ran_first_page":"/task/prediction/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":88,"url":"/task/prediction/papers/2","json":"/task/prediction/papers/2.json","rows":100},{"order":"archive","page":3,"of":88,"url":"/task/prediction/papers/3","json":"/task/prediction/papers/3.json","rows":100},{"order":"archive","page":4,"of":88,"url":"/task/prediction/papers/4","json":"/task/prediction/papers/4.json","rows":100},{"order":"archive","page":5,"of":88,"url":"/task/prediction/papers/5","json":"/task/prediction/papers/5.json","rows":100},{"order":"archive","page":6,"of":88,"url":"/task/prediction/papers/6","json":"/task/prediction/papers/6.json","rows":100},{"order":"archive","page":7,"of":88,"url":"/task/prediction/papers/7","json":"/task/prediction/papers/7.json","rows":100},{"order":"archive","page":8,"of":88,"url":"/task/prediction/papers/8","json":"/task/prediction/papers/8.json","rows":100},{"order":"archive","page":9,"of":88,"url":"/task/prediction/papers/9","json":"/task/prediction/papers/9.json","rows":100},{"order":"archive","page":10,"of":88,"url":"/task/prediction/papers/10","json":"/task/prediction/papers/10.json","rows":100},{"order":"archive","page":11,"of":88,"url":"/task/prediction/papers/11","json":"/task/prediction/papers/11.json","rows":100},{"order":"archive","page":12,"of":88,"url":"/task/prediction/papers/12","json":"/task/prediction/papers/12.json","rows":100},{"order":"archive","page":13,"of":88,"url":"/task/prediction/papers/13","json":"/task/prediction/papers/13.json","rows":100},{"order":"archive","page":14,"of":88,"url":"/task/prediction/papers/14","json":"/task/prediction/papers/14.json","rows":100},{"order":"archive","page":15,"of":88,"url":"/task/prediction/papers/15","json":"/task/prediction/papers/15.json","rows":100},{"order":"archive","page":16,"of":88,"url":"/task/prediction/papers/16","json":"/task/prediction/papers/16.json","rows":100},{"order":"archive","page":17,"of":88,"url":"/task/prediction/papers/17","json":"/task/prediction/papers/17.json","rows":100},{"order":"archive","page":18,"of":88,"url":"/task/prediction/papers/18","json":"/task/prediction/papers/18.json","rows":100},{"order":"archive","page":19,"of":88,"url":"/task/prediction/papers/19","json":"/task/prediction/papers/19.json","rows":100},{"order":"archive","page":20,"of":88,"url":"/task/prediction/papers/20","json":"/task/prediction/papers/20.json","rows":100},{"order":"archive","page":21,"of":88,"url":"/task/prediction/papers/21","json":"/task/prediction/papers/21.json","rows":100},{"order":"archive","page":22,"of":88,"url":"/task/prediction/papers/22","json":"/task/prediction/papers/22.json","rows":100},{"order":"archive","page":23,"of":88,"url":"/task/prediction/papers/23","json":"/task/prediction/papers/23.json","rows":100},{"order":"archive","page":24,"of":88,"url":"/task/prediction/papers/24","json":"/task/prediction/papers/24.json","rows":100},{"order":"archive","page":25,"of":88,"url":"/task/prediction/papers/25","json":"/task/prediction/papers/25.json","rows":100},{"order":"archive","page":26,"of":88,"url":"/task/prediction/papers/26","json":"/task/prediction/papers/26.json","rows":100},{"order":"archive","page":27,"of":88,"url":"/task/prediction/papers/27","json":"/task/prediction/papers/27.json","rows":100},{"order":"archive","page":28,"of":88,"url":"/task/prediction/papers/28","json":"/task/prediction/papers/28.json","rows":100},{"order":"archive","page":29,"of":88,"url":"/task/prediction/papers/29","json":"/task/prediction/papers/29.json","rows":100},{"order":"archive","page":30,"of":88,"url":"/task/prediction/papers/30","json":"/task/prediction/papers/30.json","rows":100},{"order":"archive","page":31,"of":88,"url":"/task/prediction/papers/31","json":"/task/prediction/papers/31.json","rows":100},{"order":"archive","page":32,"of":88,"url":"/task/prediction/papers/32","json":"/task/prediction/papers/32.json","rows":100},{"order":"archive","page":33,"of":88,"url":"/task/prediction/papers/33","json":"/task/prediction/papers/33.json","rows":100},{"order":"archive","page":34,"of":88,"url":"/task/prediction/papers/34","json":"/task/prediction/papers/34.json","rows":100},{"order":"archive","page":35,"of":88,"url":"/task/prediction/papers/35","json":"/task/prediction/papers/35.json","rows":100},{"order":"archive","page":36,"of":88,"url":"/task/prediction/papers/36","json":"/task/prediction/papers/36.json","rows":100},{"order":"archive","page":37,"of":88,"url":"/task/prediction/papers/37","json":"/task/prediction/papers/37.json","rows":100},{"order":"archive","page":38,"of":88,"url":"/task/prediction/papers/38","json":"/task/prediction/papers/38.json","rows":100},{"order":"archive","page":39,"of":88,"url":"/task/prediction/papers/39","json":"/task/prediction/papers/39.json","rows":100},{"order":"archive","page":40,"of":88,"url":"/task/prediction/papers/40","json":"/task/prediction/papers/40.json","rows":100},{"order":"archive","page":41,"of":88,"url":"/task/prediction/papers/41","json":"/task/prediction/papers/41.json","rows":100},{"order":"archive","page":42,"of":88,"url":"/task/prediction/papers/42","json":"/task/prediction/papers/42.json","rows":100},{"order":"archive","page":43,"of":88,"url":"/task/prediction/papers/43","json":"/task/prediction/papers/43.json","rows":100},{"order":"archive","page":44,"of":88,"url":"/task/prediction/papers/44","json":"/task/prediction/papers/44.json","rows":100},{"order":"archive","page":45,"of":88,"url":"/task/prediction/papers/45","json":"/task/prediction/papers/45.json","rows":100},{"order":"archive","page":46,"of":88,"url":"/task/prediction/papers/46","json":"/task/prediction/papers/46.json","rows":100},{"order":"archive","page":47,"of":88,"url":"/task/prediction/papers/47","json":"/task/prediction/papers/47.json","rows":100},{"order":"archive","page":48,"of":88,"url":"/task/prediction/papers/48","json":"/task/prediction/papers/48.json","rows":100},{"order":"archive","page":49,"of":88,"url":"/task/prediction/papers/49","json":"/task/prediction/papers/49.json","rows":100},{"order":"archive","page":50,"of":88,"url":"/task/prediction/papers/50","json":"/task/prediction/papers/50.json","rows":100},{"order":"archive","page":51,"of":88,"url":"/task/prediction/papers/51","json":"/task/prediction/papers/51.json","rows":100},{"order":"archive","page":52,"of":88,"url":"/task/prediction/papers/52","json":"/task/prediction/papers/52.json","rows":100},{"order":"archive","page":53,"of":88,"url":"/task/prediction/papers/53","json":"/task/prediction/papers/53.json","rows":100},{"order":"archive","page":54,"of":88,"url":"/task/prediction/papers/54","json":"/task/prediction/papers/54.json","rows":100},{"order":"archive","page":55,"of":88,"url":"/task/prediction/papers/55","json":"/task/prediction/papers/55.json","rows":100},{"order":"archive","page":56,"of":88,"url":"/task/prediction/papers/56","json":"/task/prediction/papers/56.json","rows":100},{"order":"archive","page":57,"of":88,"url":"/task/prediction/papers/57","json":"/task/prediction/papers/57.json","rows":100},{"order":"archive","page":58,"of":88,"url":"/task/prediction/papers/58","json":"/task/prediction/papers/58.json","rows":100},{"order":"archive","page":59,"of":88,"url":"/task/prediction/papers/59","json":"/task/prediction/papers/59.json","rows":100},{"order":"archive","page":60,"of":88,"url":"/task/prediction/papers/60","json":"/task/prediction/papers/60.json","rows":100},{"order":"archive","page":61,"of":88,"url":"/task/prediction/papers/61","json":"/task/prediction/papers/61.json","rows":100},{"order":"archive","page":62,"of":88,"url":"/task/prediction/papers/62","json":"/task/prediction/papers/62.json","rows":100},{"order":"archive","page":63,"of":88,"url":"/task/prediction/papers/63","json":"/task/prediction/papers/63.json","rows":100},{"order":"archive","page":64,"of":88,"url":"/task/prediction/papers/64","json":"/task/prediction/papers/64.json","rows":100},{"order":"archive","page":65,"of":88,"url":"/task/prediction/papers/65","json":"/task/prediction/papers/65.json","rows":100},{"order":"archive","page":66,"of":88,"url":"/task/prediction/papers/66","json":"/task/prediction/papers/66.json","rows":100},{"order":"archive","page":67,"of":88,"url":"/task/prediction/papers/67","json":"/task/prediction/papers/67.json","rows":100},{"order":"archive","page":68,"of":88,"url":"/task/prediction/papers/68","json":"/task/prediction/papers/68.json","rows":100},{"order":"archive","page":69,"of":88,"url":"/task/prediction/papers/69","json":"/task/prediction/papers/69.json","rows":100},{"order":"archive","page":70,"of":88,"url":"/task/prediction/papers/70","json":"/task/prediction/papers/70.json","rows":100},{"order":"archive","page":71,"of":88,"url":"/task/prediction/papers/71","json":"/task/prediction/papers/71.json","rows":100},{"order":"archive","page":72,"of":88,"url":"/task/prediction/papers/72","json":"/task/prediction/papers/72.json","rows":100},{"order":"archive","page":73,"of":88,"url":"/task/prediction/papers/73","json":"/task/prediction/papers/73.json","rows":100},{"order":"archive","page":74,"of":88,"url":"/task/prediction/papers/74","json":"/task/prediction/papers/74.json","rows":100},{"order":"archive","page":75,"of":88,"url":"/task/prediction/papers/75","json":"/task/prediction/papers/75.json","rows":100},{"order":"archive","page":76,"of":88,"url":"/task/prediction/papers/76","json":"/task/prediction/papers/76.json","rows":100},{"order":"archive","page":77,"of":88,"url":"/task/prediction/papers/77","json":"/task/prediction/papers/77.json","rows":100},{"order":"archive","page":78,"of":88,"url":"/task/prediction/papers/78","json":"/task/prediction/papers/78.json","rows":100},{"order":"archive","page":79,"of":88,"url":"/task/prediction/papers/79","json":"/task/prediction/papers/79.json","rows":100},{"order":"archive","page":80,"of":88,"url":"/task/prediction/papers/80","json":"/task/prediction/papers/80.json","rows":100},{"order":"archive","page":81,"of":88,"url":"/task/prediction/papers/81","json":"/task/prediction/papers/81.json","rows":100},{"order":"archive","page":82,"of":88,"url":"/task/prediction/papers/82","json":"/task/prediction/papers/82.json","rows":100},{"order":"archive","page":83,"of":88,"url":"/task/prediction/papers/83","json":"/task/prediction/papers/83.json","rows":100},{"order":"archive","page":84,"of":88,"url":"/task/prediction/papers/84","json":"/task/prediction/papers/84.json","rows":100},{"order":"archive","page":85,"of":88,"url":"/task/prediction/papers/85","json":"/task/prediction/papers/85.json","rows":100},{"order":"archive","page":86,"of":88,"url":"/task/prediction/papers/86","json":"/task/prediction/papers/86.json","rows":100},{"order":"archive","page":87,"of":88,"url":"/task/prediction/papers/87","json":"/task/prediction/papers/87.json","rows":100},{"order":"archive","page":88,"of":88,"url":"/task/prediction/papers/88","json":"/task/prediction/papers/88.json","rows":60},{"order":"ran","page":1,"of":7,"url":"/task/prediction/papers/ran/1","json":"/task/prediction/papers/ran/1.json","rows":100},{"order":"ran","page":2,"of":7,"url":"/task/prediction/papers/ran/2","json":"/task/prediction/papers/ran/2.json","rows":100},{"order":"ran","page":3,"of":7,"url":"/task/prediction/papers/ran/3","json":"/task/prediction/papers/ran/3.json","rows":100},{"order":"ran","page":4,"of":7,"url":"/task/prediction/papers/ran/4","json":"/task/prediction/papers/ran/4.json","rows":100},{"order":"ran","page":5,"of":7,"url":"/task/prediction/papers/ran/5","json":"/task/prediction/papers/ran/5.json","rows":100},{"order":"ran","page":6,"of":7,"url":"/task/prediction/papers/ran/6","json":"/task/prediction/papers/ran/6.json","rows":100},{"order":"ran","page":7,"of":7,"url":"/task/prediction/papers/ran/7","json":"/task/prediction/papers/ran/7.json","rows":7}],"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":"83599e438d7c089dd9c42b18d3fd0b75518120a61e2063ac36440373e4a20596","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}