{"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/papers/ran/4","list_of":"/task/prediction","task":"Prediction","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","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.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":4,"pages_in_order":7,"rows_per_page":100,"rows":[301,400],"of":607,"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":519,"every_run_a_failure_of_syntologys_instrument":88,"listed_with_a_run_with_no_instrument_failure":519,"listed_every_run_a_failure_of_syntologys_instrument":88,"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"},"first_page":"/task/prediction/papers/ran/1","prev":"/task/prediction/papers/ran/3","next":"/task/prediction/papers/ran/5","papers":[{"url":"/paper/improving-interpretability-of-deep-sequential","slug":"improving-interpretability-of-deep-sequential","title":"Improving Interpretability of Deep Sequential Knowledge Tracing Models with Question-centric Cognitive Representations","date":"2023-02-14","arxiv_id":"2302.06885","repositories_listed":2,"syntology":{"n":11,"n_ran":8,"n_constructed":5,"n_ran_checked":6,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"8 ran (of which 5 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/improving-interpretability-of-deep-sequential#ran","syntology_url":"https://syntology.ai/paper/2302.06885","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.06885"}},"official":null}},{"url":"/paper/one-shot-federated-conformal-prediction","slug":"one-shot-federated-conformal-prediction","title":"One-Shot Federated Conformal Prediction","date":"2023-02-13","arxiv_id":"2302.06322","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/one-shot-federated-conformal-prediction#ran","syntology_url":"https://syntology.ai/paper/2302.06322","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.06322"}},"official":{"repos":["pierrehmbt/fedcp-qq"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-representations-of-bi-level","slug":"learning-representations-of-bi-level","title":"Learning Representations of Bi-level Knowledge Graphs for Reasoning beyond Link Prediction","date":"2023-02-06","arxiv_id":"2302.02601","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"2 ran (of which 2 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; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/learning-representations-of-bi-level#ran","syntology_url":"https://syntology.ai/paper/2302.02601","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.02601"}},"official":{"repos":["bdi-lab/bive"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/how-many-and-which-training-points-would-need","slug":"how-many-and-which-training-points-would-need","title":"How Many and Which Training Points Would Need to be Removed to Flip this Prediction?","date":"2023-02-04","arxiv_id":"2302.02169","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"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) · 2 unverified","sample_list":"/paper/how-many-and-which-training-points-would-need#ran","syntology_url":"https://syntology.ai/paper/2302.02169","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.02169"}},"official":{"repos":["ecielyang/smallest_set"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/optimizing-feature-set-for-click-through-rate","slug":"optimizing-feature-set-for-click-through-rate","title":"Optimizing Feature Set for Click-Through Rate Prediction","date":"2023-01-26","arxiv_id":"2301.10909","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/optimizing-feature-set-for-click-through-rate#ran","syntology_url":"https://syntology.ai/paper/2301.10909","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.10909"}},"official":{"repos":["fuyuanlyu/optfs"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/unsupervised-protein-ligand-binding-energy","slug":"unsupervised-protein-ligand-binding-energy","title":"Unsupervised Protein-Ligand Binding Energy Prediction via Neural Euler's Rotation Equation","date":"2023-01-25","arxiv_id":"2301.10814","repositories_listed":1,"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":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) · 2 unverified","sample_list":"/paper/unsupervised-protein-ligand-binding-energy#ran","syntology_url":"https://syntology.ai/paper/2301.10814","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.10814"}},"official":{"repos":["wengong-jin/dsmbind"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"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/pdformer-propagation-delay-aware-dynamic-long","slug":"pdformer-propagation-delay-aware-dynamic-long","title":"PDFormer: Propagation Delay-Aware Dynamic Long-Range Transformer for Traffic Flow Prediction","date":"2023-01-19","arxiv_id":"2301.07945","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":6,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 6 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) · 2 unverified; every one of the 6 samples that ran constructed an object rather than computing a result","sample_list":"/paper/pdformer-propagation-delay-aware-dynamic-long#ran","syntology_url":"https://syntology.ai/paper/2301.07945","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.07945"}},"official":{"repos":["BUAABIGSCity/PDFormer"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":6,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/causal-conditional-hidden-markov-model-for","slug":"causal-conditional-hidden-markov-model-for","title":"Causal conditional hidden Markov model for multimodal traffic prediction","date":"2023-01-19","arxiv_id":"2301.08249","repositories_listed":1,"syntology":{"n":13,"n_ran":11,"n_constructed":8,"n_ran_checked":9,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"11 ran (of which 8 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/causal-conditional-hidden-markov-model-for#ran","syntology_url":"https://syntology.ai/paper/2301.08249","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.08249"}},"official":{"repos":["eternityzy/cchmm"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":8,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/excelformer-a-neural-network-surpassing-gbdts","slug":"excelformer-a-neural-network-surpassing-gbdts","title":"ExcelFormer: A neural network surpassing GBDTs on tabular data","date":"2023-01-07","arxiv_id":"2301.02819","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/excelformer-a-neural-network-surpassing-gbdts#ran","syntology_url":"https://syntology.ai/paper/2301.02819","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.02819"}},"official":{"repos":["whatashot/excelformer"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/super-resolution-probabilistic-rain","slug":"super-resolution-probabilistic-rain","title":"Super-resolution Probabilistic Rain Prediction from Satellite Data Using 3D U-Nets and EarthFormers","date":"2022-12-06","arxiv_id":"2212.02998","repositories_listed":1,"syntology":{"n":20,"n_ran":18,"n_constructed":0,"n_ran_checked":15,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":0,"phrase":"18 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/super-resolution-probabilistic-rain#ran","syntology_url":"https://syntology.ai/paper/2212.02998","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.02998"}},"official":{"repos":["bugsuse/weather4cast-2022-stage2"],"state":"official (archive's flag): 18 ran","n_ran":18,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/copula-conformal-prediction-for-multi-step","slug":"copula-conformal-prediction-for-multi-step","title":"Copula Conformal Prediction for Multi-step Time Series Forecasting","date":"2022-12-06","arxiv_id":"2212.03281","repositories_listed":1,"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/copula-conformal-prediction-for-multi-step#ran","syntology_url":"https://syntology.ai/paper/2212.03281","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.03281"}},"official":{"repos":["rose-stl-lab/copulacpts"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/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/rfold-towards-simple-yet-effective-rna","slug":"rfold-towards-simple-yet-effective-rna","title":"Deciphering RNA Secondary Structure Prediction: A Probabilistic K-Rook Matching Perspective","date":"2022-12-02","arxiv_id":"2212.14041","repositories_listed":1,"syntology":{"n":16,"n_ran":11,"n_constructed":0,"n_ran_checked":7,"n_instrument":4,"n_unverified":5,"n_honours":1,"n_violates":1,"n_no_contract":5,"n_pointer_only":16,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 1 violated, 5 with no contract checked; 4 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/rfold-towards-simple-yet-effective-rna#ran","syntology_url":"https://syntology.ai/paper/2212.14041","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.14041"}},"official":{"repos":["a4bio/rfold"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/boosted-dynamic-neural-networks","slug":"boosted-dynamic-neural-networks","title":"Boosted Dynamic Neural Networks","date":"2022-11-30","arxiv_id":"2211.16726","repositories_listed":1,"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/boosted-dynamic-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2211.16726","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.16726"}},"official":{"repos":["SHI-Labs/Boosted-Dynamic-Networks"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/link-prediction-with-non-contrastive-learning","slug":"link-prediction-with-non-contrastive-learning","title":"Link Prediction with Non-Contrastive Learning","date":"2022-11-25","arxiv_id":"2211.14394","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":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/link-prediction-with-non-contrastive-learning#ran","syntology_url":"https://syntology.ai/paper/2211.14394","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.14394"}},"official":{"repos":["snap-research/non-contrastive-link-prediction"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/caspr-customer-activity-sequence-based","slug":"caspr-customer-activity-sequence-based","title":"CASPR: Customer Activity Sequence-based Prediction and Representation","date":"2022-11-16","arxiv_id":"2211.09174","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/caspr-customer-activity-sequence-based#ran","syntology_url":"https://syntology.ai/paper/2211.09174","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.09174"}},"official":{"repos":["microsoft/caspr"],"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/graph-sequential-neural-ode-process-for-link","slug":"graph-sequential-neural-ode-process-for-link","title":"Graph Sequential Neural ODE Process for Link Prediction on Dynamic and Sparse Graphs","date":"2022-11-15","arxiv_id":"2211.08568","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-sequential-neural-ode-process-for-link#ran","syntology_url":"https://syntology.ai/paper/2211.08568","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.08568"}},"official":{"repos":["rmanluo/gsnop"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/algorithms-with-prediction-portfolios","slug":"algorithms-with-prediction-portfolios","title":"Algorithms with Prediction Portfolios","date":"2022-10-22","arxiv_id":"2210.12438","repositories_listed":1,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/algorithms-with-prediction-portfolios#ran","syntology_url":"https://syntology.ai/paper/2210.12438","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.12438"}},"official":{"repos":["tlavastida/predictionportfolios"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/bayesian-optimization-with-conformal-coverage","slug":"bayesian-optimization-with-conformal-coverage","title":"Bayesian Optimization with Conformal Prediction Sets","date":"2022-10-22","arxiv_id":"2210.12496","repositories_listed":1,"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/bayesian-optimization-with-conformal-coverage#ran","syntology_url":"https://syntology.ai/paper/2210.12496","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.12496"}},"official":{"repos":["samuelstanton/conformal-bayesopt"],"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/attention-attention-everywhere-monocular","slug":"attention-attention-everywhere-monocular","title":"Attention Attention Everywhere: Monocular Depth Prediction with Skip Attention","date":"2022-10-17","arxiv_id":"2210.09071","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":11,"phrase":"7 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; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/attention-attention-everywhere-monocular#ran","syntology_url":"https://syntology.ai/paper/2210.09071","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.09071"}},"official":{"repos":["ashutosh1807/pixelformer"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/parameter-free-dynamic-graph-embedding-for","slug":"parameter-free-dynamic-graph-embedding-for","title":"Parameter-free Dynamic Graph Embedding for Link Prediction","date":"2022-10-15","arxiv_id":"2210.08189","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":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/parameter-free-dynamic-graph-embedding-for#ran","syntology_url":"https://syntology.ai/paper/2210.08189","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.08189"}},"official":{"repos":["fudancisl/freegem"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/gulp-a-prediction-based-metric-between","slug":"gulp-a-prediction-based-metric-between","title":"GULP: a prediction-based metric between representations","date":"2022-10-12","arxiv_id":"2210.06545","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":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/gulp-a-prediction-based-metric-between#ran","syntology_url":"https://syntology.ai/paper/2210.06545","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.06545"}},"official":{"repos":["sgstepaniants/gulp"],"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/selection-by-prediction-with-conformal-p","slug":"selection-by-prediction-with-conformal-p","title":"Selection by Prediction with Conformal p-values","date":"2022-10-04","arxiv_id":"2210.01408","repositories_listed":2,"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/selection-by-prediction-with-conformal-p#ran","syntology_url":"https://syntology.ai/paper/2210.01408","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.01408"}},"official":{"repos":["ying531/selcf_paper"],"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/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/graph-neural-networks-for-link-prediction","slug":"graph-neural-networks-for-link-prediction","title":"Graph Neural Networks for Link Prediction with Subgraph Sketching","date":"2022-09-30","arxiv_id":"2209.15486","repositories_listed":1,"syntology":{"n":19,"n_ran":15,"n_constructed":0,"n_ran_checked":15,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":1,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/graph-neural-networks-for-link-prediction#ran","syntology_url":"https://syntology.ai/paper/2209.15486","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.15486"}},"official":{"repos":["melifluos/subgraph-sketching"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":4,"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"]}}},{"url":"/paper/periodic-graph-transformers-for-crystal","slug":"periodic-graph-transformers-for-crystal","title":"Periodic Graph Transformers for Crystal Material Property Prediction","date":"2022-09-23","arxiv_id":"2209.11807","repositories_listed":2,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 2 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/periodic-graph-transformers-for-crystal#ran","syntology_url":"https://syntology.ai/paper/2209.11807","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.11807"}},"official":{"repos":["YKQ98/Matformer"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/expanding-the-deployment-envelope-of-behavior","slug":"expanding-the-deployment-envelope-of-behavior","title":"Expanding the Deployment Envelope of Behavior Prediction via Adaptive Meta-Learning","date":"2022-09-23","arxiv_id":"2209.11820","repositories_listed":2,"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/expanding-the-deployment-envelope-of-behavior#ran","syntology_url":"https://syntology.ai/paper/2209.11820","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.11820"}},"official":{"repos":["nvlabs/adaptive-prediction","nvr-avg/adaptive-prediction"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-comprehensive-benchmark-for-covid-19","slug":"a-comprehensive-benchmark-for-covid-19","title":"A Comprehensive Benchmark for COVID-19 Predictive Modeling Using Electronic Health Records in Intensive Care","date":"2022-09-16","arxiv_id":"2209.07805","repositories_listed":3,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":3,"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) · 1 unverified","sample_list":"/paper/a-comprehensive-benchmark-for-covid-19#ran","syntology_url":"https://syntology.ai/paper/2209.07805","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.07805"}},"official":{"repos":["yhzhu99/covid-ehr-benchmarks","yhzhu99/pyehr","yhzhu99/pyehr-playground"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/transpolymer-a-transformer-based-language","slug":"transpolymer-a-transformer-based-language","title":"TransPolymer: a Transformer-based language model for polymer property predictions","date":"2022-09-03","arxiv_id":"2209.01307","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/transpolymer-a-transformer-based-language#ran","syntology_url":"https://syntology.ai/paper/2209.01307","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.01307"}},"official":{"repos":["ChangwenXu98/TransPolymer"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/temporal-label-smoothing-for-early-prediction","slug":"temporal-label-smoothing-for-early-prediction","title":"Temporal Label Smoothing for Early Event Prediction","date":"2022-08-29","arxiv_id":"2208.13764","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":3,"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) · 2 unverified","sample_list":"/paper/temporal-label-smoothing-for-early-prediction#ran","syntology_url":"https://syntology.ai/paper/2208.13764","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.13764"}},"official":{"repos":["ratschlab/tls"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/disenhcn-disentangled-hypergraph","slug":"disenhcn-disentangled-hypergraph","title":"DisenHCN: Disentangled Hypergraph Convolutional Networks for Spatiotemporal Activity Prediction","date":"2022-08-14","arxiv_id":"2208.06794","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/disenhcn-disentangled-hypergraph#ran","syntology_url":"https://syntology.ai/paper/2208.06794","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.06794"}},"official":{"repos":["yf-li15/DisenHCN"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/semantic-segmentation-assisted-instance","slug":"semantic-segmentation-assisted-instance","title":"Semantic Segmentation-Assisted Instance Feature Fusion for Multi-Level 3D Part Instance Segmentation","date":"2022-08-09","arxiv_id":"2208.04766","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/semantic-segmentation-assisted-instance#ran","syntology_url":"https://syntology.ai/paper/2208.04766","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.04766"}},"official":{"repos":["isunchy/3d_instance_segmentation"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/conformal-risk-control","slug":"conformal-risk-control","title":"Conformal Risk Control","date":"2022-08-04","arxiv_id":"2208.02814","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/conformal-risk-control#ran","syntology_url":"https://syntology.ai/paper/2208.02814","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.02814"}},"official":{"repos":["aangelopoulos/conformal-risk"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/vip3d-end-to-end-visual-trajectory-prediction","slug":"vip3d-end-to-end-visual-trajectory-prediction","title":"ViP3D: End-to-end Visual Trajectory Prediction via 3D Agent Queries","date":"2022-08-02","arxiv_id":"2208.01582","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":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) · 2 unverified","sample_list":"/paper/vip3d-end-to-end-visual-trajectory-prediction#ran","syntology_url":"https://syntology.ai/paper/2208.01582","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.01582"}},"official":{"repos":["Tsinghua-MARS-Lab/ViP3D"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/time-series-prediction-under-distribution","slug":"time-series-prediction-under-distribution","title":"Time Series Prediction under Distribution Shift using Differentiable Forgetting","date":"2022-07-23","arxiv_id":"2207.11486","repositories_listed":1,"syntology":{"n":11,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":10,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":11,"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) · 10 unverified","sample_list":"/paper/time-series-prediction-under-distribution#ran","syntology_url":"https://syntology.ai/paper/2207.11486","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.11486"}},"official":{"repos":["jase-clarkson/pods_2022_icml_ts"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":10,"ran_from_kinds":["official"]}}},{"url":"/paper/d2-tpred-discontinuous-dependency-for","slug":"d2-tpred-discontinuous-dependency-for","title":"D2-TPred: Discontinuous Dependency for Trajectory Prediction under Traffic Lights","date":"2022-07-21","arxiv_id":"2207.10398","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/d2-tpred-discontinuous-dependency-for#ran","syntology_url":"https://syntology.ai/paper/2207.10398","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.10398"}},"official":{"repos":["vtp-tl/d2-tpred"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/human-trajectory-prediction-via-neural-social","slug":"human-trajectory-prediction-via-neural-social","title":"Human Trajectory Prediction via Neural Social Physics","date":"2022-07-21","arxiv_id":"2207.10435","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":6,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/human-trajectory-prediction-via-neural-social#ran","syntology_url":"https://syntology.ai/paper/2207.10435","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.10435"}},"official":{"repos":["realcrane/human-trajectory-prediction-via-neural-social-physics"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-pedestrian-group-representations-for","slug":"learning-pedestrian-group-representations-for","title":"Learning Pedestrian Group Representations for Multi-modal Trajectory Prediction","date":"2022-07-20","arxiv_id":"2207.09953","repositories_listed":3,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/learning-pedestrian-group-representations-for#ran","syntology_url":"https://syntology.ai/paper/2207.09953","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.09953"}},"official":{"repos":["inhwanbae/gpgraph"],"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":["official"]}}},{"url":"/paper/towards-better-evaluation-for-dynamic-link","slug":"towards-better-evaluation-for-dynamic-link","title":"Towards Better Evaluation for Dynamic Link Prediction","date":"2022-07-20","arxiv_id":"2207.10128","repositories_listed":1,"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/towards-better-evaluation-for-dynamic-link#ran","syntology_url":"https://syntology.ai/paper/2207.10128","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.10128"}},"official":{"repos":["fpour/dgb"],"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/bootstrapped-masked-autoencoders-for-vision","slug":"bootstrapped-masked-autoencoders-for-vision","title":"Bootstrapped Masked Autoencoders for Vision BERT Pretraining","date":"2022-07-14","arxiv_id":"2207.07116","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":6,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":7,"phrase":"6 ran (of which 6 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 6 samples that ran constructed an object rather than computing a result","sample_list":"/paper/bootstrapped-masked-autoencoders-for-vision#ran","syntology_url":"https://syntology.ai/paper/2207.07116","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.07116"}},"official":{"repos":["lightdxy/bootmae"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":6,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/bipoco-bi-directional-trajectory-prediction","slug":"bipoco-bi-directional-trajectory-prediction","title":"BiPOCO: Bi-Directional Trajectory Prediction with Pose Constraints for Pedestrian Anomaly Detection","date":"2022-07-05","arxiv_id":"2207.02281","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bipoco-bi-directional-trajectory-prediction#ran","syntology_url":"https://syntology.ai/paper/2207.02281","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.02281"}},"official":{"repos":["akanuasiegbu/bipoco"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/e2efold-3d-end-to-end-deep-learning-method","slug":"e2efold-3d-end-to-end-deep-learning-method","title":"Accurate RNA 3D structure prediction using a language model-based deep learning approach","date":"2022-07-04","arxiv_id":"2207.01586","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/e2efold-3d-end-to-end-deep-learning-method#ran","syntology_url":"https://syntology.ai/paper/2207.01586","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.01586"}},"official":{"repos":["ml4bio/rhofold","ml4bio/rna-fm"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/backward-baselines-is-your-model-predicting","slug":"backward-baselines-is-your-model-predicting","title":"Is your model predicting the past?","date":"2022-06-23","arxiv_id":"2206.11673","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/backward-baselines-is-your-model-predicting#ran","syntology_url":"https://syntology.ai/paper/2206.11673","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.11673"}},"official":{"repos":["socialfoundations/backward_baselines"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/performance-prediction-under-dataset-shift","slug":"performance-prediction-under-dataset-shift","title":"Performance Prediction Under Dataset Shift","date":"2022-06-21","arxiv_id":"2206.10697","repositories_listed":1,"syntology":{"n":16,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":0,"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) · 2 unverified","sample_list":"/paper/performance-prediction-under-dataset-shift#ran","syntology_url":"https://syntology.ai/paper/2206.10697","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.10697"}},"official":{"repos":["dataiku-research/performance_prediction_under_shift"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/smt-dta-improving-drug-target-affinity","slug":"smt-dta-improving-drug-target-affinity","title":"SSM-DTA: Breaking the Barriers of Data Scarcity in Drug-Target Affinity Prediction","date":"2022-06-20","arxiv_id":"2206.09818","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/smt-dta-improving-drug-target-affinity#ran","syntology_url":"https://syntology.ai/paper/2206.09818","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.09818"}},"official":{"repos":["qizhipei/smt-dta","qizhipei/ssm-dta"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/diffusion-models-for-video-prediction-and","slug":"diffusion-models-for-video-prediction-and","title":"Diffusion Models for Video Prediction and Infilling","date":"2022-06-15","arxiv_id":"2206.07696","repositories_listed":1,"syntology":{"n":19,"n_ran":12,"n_constructed":0,"n_ran_checked":8,"n_instrument":4,"n_unverified":7,"n_honours":4,"n_violates":0,"n_no_contract":4,"n_pointer_only":11,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 4 honoured, 0 violated, 4 with no contract checked; 4 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/diffusion-models-for-video-prediction-and#ran","syntology_url":"https://syntology.ai/paper/2206.07696","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.07696"}},"official":{"repos":["Tobi-r9/RaMViD"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/conformal-prediction-set-for-time-series","slug":"conformal-prediction-set-for-time-series","title":"Conformal prediction set for time-series","date":"2022-06-15","arxiv_id":"2206.07851","repositories_listed":2,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"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) · 1 unverified","sample_list":"/paper/conformal-prediction-set-for-time-series#ran","syntology_url":"https://syntology.ai/paper/2206.07851","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.07851"}},"official":{"repos":["hamrel-cxu/ensemble-regularized-adaptive-prediction-set-eraps"],"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/exploring-evolution-based-free-protein","slug":"exploring-evolution-based-free-protein","title":"Exploring evolution-aware & -free protein language models as protein function predictors","date":"2022-06-14","arxiv_id":"2206.06583","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":6,"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, 1 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/exploring-evolution-based-free-protein#ran","syntology_url":"https://syntology.ai/paper/2206.06583","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.06583"}},"official":{"repos":["elttaes/revisiting-plms"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-based-spatial-transformer-with-memory-1","slug":"graph-based-spatial-transformer-with-memory-1","title":"Graph-based Spatial Transformer with Memory Replay for Multi-future Pedestrian Trajectory Prediction","date":"2022-06-12","arxiv_id":"2206.05712","repositories_listed":1,"syntology":{"n":10,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":10,"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) · 6 unverified","sample_list":"/paper/graph-based-spatial-transformer-with-memory-1#ran","syntology_url":"https://syntology.ai/paper/2206.05712","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.05712"}},"official":{"repos":["jacobieee/st-mr"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/proactive-self-attentive-temporal-point","slug":"proactive-self-attentive-temporal-point","title":"ProActive: Self-Attentive Temporal Point Process Flows for Activity Sequences","date":"2022-06-10","arxiv_id":"2206.05291","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/proactive-self-attentive-temporal-point#ran","syntology_url":"https://syntology.ai/paper/2206.05291","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.05291"}},"official":{"repos":["data-iitd/proactive"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/simvp-simpler-yet-better-video-prediction-1","slug":"simvp-simpler-yet-better-video-prediction-1","title":"SimVP: Simpler yet Better Video Prediction","date":"2022-06-09","arxiv_id":"2206.05099","repositories_listed":3,"syntology":{"n":9,"n_ran":6,"n_constructed":5,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":9,"phrase":"6 ran (of which 5 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/simvp-simpler-yet-better-video-prediction-1#ran","syntology_url":"https://syntology.ai/paper/2206.05099","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.05099"}},"official":{"repos":["gaozhangyang/simvp-simpler-yet-better-video-prediction"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":5,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/practical-adversarial-multivalid-conformal","slug":"practical-adversarial-multivalid-conformal","title":"Practical Adversarial Multivalid Conformal Prediction","date":"2022-06-02","arxiv_id":"2206.01067","repositories_listed":1,"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":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/practical-adversarial-multivalid-conformal#ran","syntology_url":"https://syntology.ai/paper/2206.01067","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.01067"}},"official":{"repos":["progbelarus/multivalidprediction"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/simulation-based-inference-with-waldo","slug":"simulation-based-inference-with-waldo","title":"Simulator-Based Inference with Waldo: Confidence Regions by Leveraging Prediction Algorithms and Posterior Estimators for Inverse Problems","date":"2022-05-31","arxiv_id":"2205.15680","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/simulation-based-inference-with-waldo#ran","syntology_url":"https://syntology.ai/paper/2205.15680","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.15680"}},"official":{"repos":["lee-group-cmu/lf2i"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/pre-training-via-denoising-for-molecular","slug":"pre-training-via-denoising-for-molecular","title":"Pre-training via Denoising for Molecular Property Prediction","date":"2022-05-31","arxiv_id":"2206.00133","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":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) · 2 unverified","sample_list":"/paper/pre-training-via-denoising-for-molecular#ran","syntology_url":"https://syntology.ai/paper/2206.00133","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.00133"}},"official":{"repos":["shehzaidi/pre-training-via-denoising"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/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/conformal-prediction-intervals-with-temporal","slug":"conformal-prediction-intervals-with-temporal","title":"Conformal Prediction Intervals with Temporal Dependence","date":"2022-05-25","arxiv_id":"2205.12940","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/conformal-prediction-intervals-with-temporal#ran","syntology_url":"https://syntology.ai/paper/2205.12940","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.12940"}},"official":{"repos":["zlin7/cptd"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/deepstruct-pretraining-of-language-models-for-1","slug":"deepstruct-pretraining-of-language-models-for-1","title":"DeepStruct: Pretraining of Language Models for Structure Prediction","date":"2022-05-21","arxiv_id":"2205.10475","repositories_listed":1,"syntology":{"n":13,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":9,"n_pointer_only":3,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 1 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/deepstruct-pretraining-of-language-models-for-1#ran","syntology_url":"https://syntology.ai/paper/2205.10475","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10475"}},"official":{"repos":["cgraywang/deepstruct"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/masked-conditional-video-diffusion-for","slug":"masked-conditional-video-diffusion-for","title":"MCVD: Masked Conditional Video Diffusion for Prediction, Generation, and Interpolation","date":"2022-05-19","arxiv_id":"2205.09853","repositories_listed":2,"syntology":{"n":16,"n_ran":7,"n_constructed":1,"n_ran_checked":4,"n_instrument":3,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"7 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; 3 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/masked-conditional-video-diffusion-for#ran","syntology_url":"https://syntology.ai/paper/2205.09853","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.09853"}},"official":{"repos":["voletiv/mcvd-pytorch"],"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":["listed","official"]}}},{"url":"/paper/r5-rule-discovery-with-reinforced-and-1","slug":"r5-rule-discovery-with-reinforced-and-1","title":"R5: Rule Discovery with Reinforced and Recurrent Relational Reasoning","date":"2022-05-13","arxiv_id":"2205.06454","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/r5-rule-discovery-with-reinforced-and-1#ran","syntology_url":"https://syntology.ai/paper/2205.06454","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.06454"}},"official":{"repos":["sluxsr/r5_graph_reasoning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/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/multivariate-prediction-intervals-for-random","slug":"multivariate-prediction-intervals-for-random","title":"Multivariate Prediction Intervals for Random Forests","date":"2022-05-04","arxiv_id":"2205.02260","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":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/multivariate-prediction-intervals-for-random#ran","syntology_url":"https://syntology.ai/paper/2205.02260","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.02260"}},"official":{"repos":["CitrineInformatics/lolo","citrineinformatics/multivariate-prediction-intervals"],"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/from-noisy-prediction-to-true-label-noisy","slug":"from-noisy-prediction-to-true-label-noisy","title":"From Noisy Prediction to True Label: Noisy Prediction Calibration via Generative Model","date":"2022-05-02","arxiv_id":"2205.00690","repositories_listed":2,"syntology":{"n":13,"n_ran":6,"n_constructed":2,"n_ran_checked":5,"n_instrument":1,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":6,"phrase":"6 ran (of which 2 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/from-noisy-prediction-to-true-label-noisy#ran","syntology_url":"https://syntology.ai/paper/2205.00690","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.00690"}},"official":{"repos":["BaeHeeSun/NPC"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/lm-debugger-an-interactive-tool-for","slug":"lm-debugger-an-interactive-tool-for","title":"LM-Debugger: An Interactive Tool for Inspection and Intervention in Transformer-Based Language Models","date":"2022-04-26","arxiv_id":"2204.12130","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/lm-debugger-an-interactive-tool-for#ran","syntology_url":"https://syntology.ai/paper/2204.12130","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.12130"}},"official":{"repos":["mega002/lm-debugger"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/where-and-what-driver-attention-based-object","slug":"where-and-what-driver-attention-based-object","title":"Where and What: Driver Attention-based Object Detection","date":"2022-04-26","arxiv_id":"2204.12150","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/where-and-what-driver-attention-based-object#ran","syntology_url":"https://syntology.ai/paper/2204.12150","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.12150"}},"official":{"repos":["yaorong0921/driver-gaze-yolov5"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/goal-driven-self-attentive-recurrent-networks","slug":"goal-driven-self-attentive-recurrent-networks","title":"Goal-driven Self-Attentive Recurrent Networks for Trajectory Prediction","date":"2022-04-25","arxiv_id":"2204.11561","repositories_listed":1,"syntology":{"n":17,"n_ran":16,"n_constructed":0,"n_ran_checked":16,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":16,"n_pointer_only":0,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 0 violated, 16 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/goal-driven-self-attentive-recurrent-networks#ran","syntology_url":"https://syntology.ai/paper/2204.11561","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.11561"}},"official":{"repos":["luigifilippochiara/Goal-SAR"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":16,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/groupnet-multiscale-hypergraph-neural","slug":"groupnet-multiscale-hypergraph-neural","title":"GroupNet: Multiscale Hypergraph Neural Networks for Trajectory Prediction with Relational Reasoning","date":"2022-04-19","arxiv_id":"2204.08770","repositories_listed":1,"syntology":{"n":19,"n_ran":12,"n_constructed":6,"n_ran_checked":7,"n_instrument":5,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"12 ran (of which 6 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 5 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/groupnet-multiscale-hypergraph-neural#ran","syntology_url":"https://syntology.ai/paper/2204.08770","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.08770"}},"official":{"repos":["mediabrain-sjtu/groupnet"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":6,"n_ran_no_instrument_failure":7,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-structured-prediction-for-inductive-1","slug":"neural-structured-prediction-for-inductive-1","title":"Neural Structured Prediction for Inductive Node Classification","date":"2022-04-15","arxiv_id":"2204.07524","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neural-structured-prediction-for-inductive-1#ran","syntology_url":"https://syntology.ai/paper/2204.07524","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.07524"}},"official":{"repos":["deepgraphlearning/spn"],"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/modelling-evolutionary-and-stationary-user","slug":"modelling-evolutionary-and-stationary-user","title":"Continuous-Time User Preference Modelling for Temporal Sets Prediction","date":"2022-04-12","arxiv_id":"2204.05490","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/modelling-evolutionary-and-stationary-user#ran","syntology_url":"https://syntology.ai/paper/2204.05490","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.05490"}},"official":{"repos":["yule-BUAA/CTTSP"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/progressively-generating-better-initial","slug":"progressively-generating-better-initial","title":"Progressively Generating Better Initial Guesses Towards Next Stages for High-Quality Human Motion Prediction","date":"2022-03-30","arxiv_id":"2203.16051","repositories_listed":1,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":6,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/progressively-generating-better-initial#ran","syntology_url":"https://syntology.ai/paper/2203.16051","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.16051"}},"official":{"repos":["705062791/pgbig"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/disentangling-object-motion-and-occlusion-for","slug":"disentangling-object-motion-and-occlusion-for","title":"Disentangling Object Motion and Occlusion for Unsupervised Multi-frame Monocular Depth","date":"2022-03-29","arxiv_id":"2203.15174","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/disentangling-object-motion-and-occlusion-for#ran","syntology_url":"https://syntology.ai/paper/2203.15174","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.15174"}},"official":{"repos":["AutoAILab/DynamicDepth"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/augmenting-knowledge-graphs-for-better-link","slug":"augmenting-knowledge-graphs-for-better-link","title":"Augmenting Knowledge Graphs for Better Link Prediction","date":"2022-03-26","arxiv_id":"2203.13965","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/augmenting-knowledge-graphs-for-better-link#ran","syntology_url":"https://syntology.ai/paper/2203.13965","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.13965"}},"official":{"repos":["otamio/kga"],"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/non-probability-sampling-network-for","slug":"non-probability-sampling-network-for","title":"Non-Probability Sampling Network for Stochastic Human Trajectory Prediction","date":"2022-03-25","arxiv_id":"2203.13471","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/non-probability-sampling-network-for#ran","syntology_url":"https://syntology.ai/paper/2203.13471","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.13471"}},"official":{"repos":["inhwanbae/npsn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/root-aligned-smiles-for-molecular","slug":"root-aligned-smiles-for-molecular","title":"Root-aligned SMILES: A Tight Representation for Chemical Reaction Prediction","date":"2022-03-22","arxiv_id":"2203.11444","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":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/root-aligned-smiles-for-molecular#ran","syntology_url":"https://syntology.ai/paper/2203.11444","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.11444"}},"official":{"repos":["otori-bird/retrosynthesis"],"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/hop-history-and-order-aware-pre-training-for","slug":"hop-history-and-order-aware-pre-training-for","title":"HOP: History-and-Order Aware Pre-training for Vision-and-Language Navigation","date":"2022-03-22","arxiv_id":"2203.11591","repositories_listed":1,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/hop-history-and-order-aware-pre-training-for#ran","syntology_url":"https://syntology.ai/paper/2203.11591","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.11591"}},"official":{"repos":["yanyuanqiao/hop-vln"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/sequence-to-sequence-knowledge-graph-1","slug":"sequence-to-sequence-knowledge-graph-1","title":"Sequence-to-Sequence Knowledge Graph Completion and Question Answering","date":"2022-03-19","arxiv_id":"2203.10321","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/sequence-to-sequence-knowledge-graph-1#ran","syntology_url":"https://syntology.ai/paper/2203.10321","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.10321"}},"official":{"repos":["apoorvumang/kgt5"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/motionaug-augmentation-with-physical","slug":"motionaug-augmentation-with-physical","title":"MotionAug: Augmentation with Physical Correction for Human Motion Prediction","date":"2022-03-17","arxiv_id":"2203.09116","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/motionaug-augmentation-with-physical#ran","syntology_url":"https://syntology.ai/paper/2203.09116","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.09116"}},"official":{"repos":["meaten/motionaug"],"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/socialvae-human-trajectory-prediction-using","slug":"socialvae-human-trajectory-prediction-using","title":"SocialVAE: Human Trajectory Prediction using Timewise Latents","date":"2022-03-15","arxiv_id":"2203.08207","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/socialvae-human-trajectory-prediction-using#ran","syntology_url":"https://syntology.ai/paper/2203.08207","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.08207"}},"official":{"repos":["xupei0610/socialvae"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-modal-graph-learning-for-disease-1","slug":"multi-modal-graph-learning-for-disease-1","title":"Multi-modal Graph Learning for Disease Prediction","date":"2022-03-11","arxiv_id":"2203.05880","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multi-modal-graph-learning-for-disease-1#ran","syntology_url":"https://syntology.ai/paper/2203.05880","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.05880"}},"official":{"repos":["ssgood/mmgl"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/protein-structure-representation-learning-by","slug":"protein-structure-representation-learning-by","title":"Protein Representation Learning by Geometric Structure Pretraining","date":"2022-03-11","arxiv_id":"2203.06125","repositories_listed":2,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/protein-structure-representation-learning-by#ran","syntology_url":"https://syntology.ai/paper/2203.06125","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.06125"}},"official":{"repos":["deepgraphlearning/gearnet"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/equivariant-and-stable-positional-encoding-1","slug":"equivariant-and-stable-positional-encoding-1","title":"Equivariant and Stable Positional Encoding for More Powerful Graph Neural Networks","date":"2022-03-01","arxiv_id":"2203.00199","repositories_listed":1,"syntology":{"n":17,"n_ran":15,"n_constructed":0,"n_ran_checked":13,"n_instrument":2,"n_unverified":2,"n_honours":2,"n_violates":1,"n_no_contract":10,"n_pointer_only":2,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 2 honoured, 1 violated, 10 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/equivariant-and-stable-positional-encoding-1#ran","syntology_url":"https://syntology.ai/paper/2203.00199","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.00199"}},"official":{"repos":["graph-com/peg"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/algorithm-and-system-co-design-for-efficient","slug":"algorithm-and-system-co-design-for-efficient","title":"Algorithm and System Co-design for Efficient Subgraph-based Graph Representation Learning","date":"2022-02-28","arxiv_id":"2202.13538","repositories_listed":3,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/algorithm-and-system-co-design-for-efficient#ran","syntology_url":"https://syntology.ai/paper/2202.13538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.13538"}},"official":{"repos":["graph-com/surel"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/m2i-from-factored-marginal-trajectory","slug":"m2i-from-factored-marginal-trajectory","title":"M2I: From Factored Marginal Trajectory Prediction to Interactive Prediction","date":"2022-02-24","arxiv_id":"2202.11884","repositories_listed":1,"syntology":{"n":6,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/m2i-from-factored-marginal-trajectory#ran","syntology_url":"https://syntology.ai/paper/2202.11884","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.11884"}},"official":null}},{"url":"/paper/efficient-and-differentiable-conformal-1","slug":"efficient-and-differentiable-conformal-1","title":"Efficient and Differentiable Conformal Prediction with General Function Classes","date":"2022-02-22","arxiv_id":"2202.11091","repositories_listed":1,"syntology":{"n":9,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":6,"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) · 6 unverified","sample_list":"/paper/efficient-and-differentiable-conformal-1#ran","syntology_url":"https://syntology.ai/paper/2202.11091","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.11091"}},"official":{"repos":["allenbai01/cp-gen"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/probabilistic-embeddings-revisited","slug":"probabilistic-embeddings-revisited","title":"Probabilistic Embeddings Revisited","date":"2022-02-14","arxiv_id":"2202.06768","repositories_listed":1,"syntology":{"n":18,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":10,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/probabilistic-embeddings-revisited#ran","syntology_url":"https://syntology.ai/paper/2202.06768","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.06768"}},"official":{"repos":["tinkoff-ai/probabilistic-embeddings"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":10,"ran_from_kinds":["official"]}}},{"url":"/paper/conformal-prediction-for-the-design-problem","slug":"conformal-prediction-for-the-design-problem","title":"Conformal Prediction Under Feedback Covariate Shift for Biomolecular Design","date":"2022-02-08","arxiv_id":"2202.03613","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/conformal-prediction-for-the-design-problem#ran","syntology_url":"https://syntology.ai/paper/2202.03613","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.03613"}},"official":{"repos":["clarafy/conformal-for-design"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/improving-vae-based-molecular-representations","slug":"improving-vae-based-molecular-representations","title":"Improving VAE based molecular representations for compound property prediction","date":"2022-01-13","arxiv_id":"2201.04929","repositories_listed":2,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/improving-vae-based-molecular-representations#ran","syntology_url":"https://syntology.ai/paper/2201.04929","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.04929"}},"official":{"repos":["znavoyan/vae-embeddings","znavoyan/vaedatasets"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/on-adversarial-robustness-of-trajectory","slug":"on-adversarial-robustness-of-trajectory","title":"On Adversarial Robustness of Trajectory Prediction for Autonomous Vehicles","date":"2022-01-13","arxiv_id":"2201.05057","repositories_listed":1,"syntology":{"n":13,"n_ran":13,"n_constructed":2,"n_ran_checked":5,"n_instrument":8,"n_unverified":0,"n_honours":2,"n_violates":1,"n_no_contract":2,"n_pointer_only":13,"phrase":"13 ran (of which 2 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 1 violated, 2 with no contract checked; 8 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-adversarial-robustness-of-trajectory#ran","syntology_url":"https://syntology.ai/paper/2201.05057","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.05057"}},"official":null}},{"url":"/paper/investigating-pose-representations-and-motion","slug":"investigating-pose-representations-and-motion","title":"Investigating Pose Representations and Motion Contexts Modeling for 3D Motion Prediction","date":"2021-12-30","arxiv_id":"2112.15012","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/investigating-pose-representations-and-motion#ran","syntology_url":"https://syntology.ai/paper/2112.15012","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.15012"}},"official":{"repos":["BII-wushuang/Lie-Group-Motion-Prediction"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/pairwise-learning-for-neural-link-prediction","slug":"pairwise-learning-for-neural-link-prediction","title":"Pairwise Learning for Neural Link Prediction","date":"2021-12-06","arxiv_id":"2112.02936","repositories_listed":2,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 2 unverified","sample_list":"/paper/pairwise-learning-for-neural-link-prediction#ran","syntology_url":"https://syntology.ai/paper/2112.02936","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.02936"}},"official":{"repos":["zhitao-wang/plnlp"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/gaussian-mixture-variational-autoencoder-with","slug":"gaussian-mixture-variational-autoencoder-with","title":"Gaussian Mixture Variational Autoencoder with Contrastive Learning for Multi-Label Classification","date":"2021-12-02","arxiv_id":"2112.00976","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/gaussian-mixture-variational-autoencoder-with#ran","syntology_url":"https://syntology.ai/paper/2112.00976","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.00976"}},"official":{"repos":["junwenbai/c-gmvae"],"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/editing-a-classifier-by-rewriting-its-1","slug":"editing-a-classifier-by-rewriting-its-1","title":"Editing a classifier by rewriting its prediction rules","date":"2021-12-02","arxiv_id":"2112.01008","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/editing-a-classifier-by-rewriting-its-1#ran","syntology_url":"https://syntology.ai/paper/2112.01008","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.01008"}},"official":{"repos":["madrylab/editingclassifiers"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-multiple-dense-prediction-tasks-from","slug":"learning-multiple-dense-prediction-tasks-from","title":"Learning Multiple Dense Prediction Tasks from Partially Annotated Data","date":"2021-11-29","arxiv_id":"2111.14893","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":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/learning-multiple-dense-prediction-tasks-from#ran","syntology_url":"https://syntology.ai/paper/2111.14893","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.14893"}},"official":{"repos":["vico-uoe/mtpsl"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/multiset-equivariant-set-prediction-with-1","slug":"multiset-equivariant-set-prediction-with-1","title":"Multiset-Equivariant Set Prediction with Approximate Implicit Differentiation","date":"2021-11-23","arxiv_id":"2111.12193","repositories_listed":1,"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":5,"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/multiset-equivariant-set-prediction-with-1#ran","syntology_url":"https://syntology.ai/paper/2111.12193","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.12193"}},"official":{"repos":["davzha/multiset-equivariance"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/air-2-for-interaction-prediction","slug":"air-2-for-interaction-prediction","title":"$AIR^2$ for Interaction Prediction","date":"2021-11-16","arxiv_id":"2111.08184","repositories_listed":1,"syntology":{"n":13,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":8,"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) · 8 unverified","sample_list":"/paper/air-2-for-interaction-prediction#ran","syntology_url":"https://syntology.ai/paper/2111.08184","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.08184"}},"official":{"repos":["david9dragon9/air"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/poisoning-knowledge-graph-embeddings-via-1","slug":"poisoning-knowledge-graph-embeddings-via-1","title":"Poisoning Knowledge Graph Embeddings via Relation Inference Patterns","date":"2021-11-11","arxiv_id":"2111.06345","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/poisoning-knowledge-graph-embeddings-via-1#ran","syntology_url":"https://syntology.ai/paper/2111.06345","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.06345"}},"official":{"repos":["perubhardwaj/inferenceattack"],"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":["found_in_text"]}}},{"url":"/paper/deep-learning-based-non-intrusive-multi","slug":"deep-learning-based-non-intrusive-multi","title":"Deep Learning-based Non-Intrusive Multi-Objective Speech Assessment Model with Cross-Domain Features","date":"2021-11-03","arxiv_id":"2111.02363","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deep-learning-based-non-intrusive-multi#ran","syntology_url":"https://syntology.ai/paper/2111.02363","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.02363"}},"official":{"repos":["dhimasryan/MOSA-Net-Cross-Domain"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/parameter-prediction-for-unseen-deep","slug":"parameter-prediction-for-unseen-deep","title":"Parameter Prediction for Unseen Deep Architectures","date":"2021-10-25","arxiv_id":"2110.13100","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":1,"n_ran_checked":1,"n_instrument":5,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"6 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/parameter-prediction-for-unseen-deep#ran","syntology_url":"https://syntology.ai/paper/2110.13100","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.13100"}},"official":{"repos":["facebookresearch/ppuda"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["community","found_in_text"]}}},{"url":"/paper/hrformer-high-resolution-transformer-for","slug":"hrformer-high-resolution-transformer-for","title":"HRFormer: High-Resolution Transformer for Dense Prediction","date":"2021-10-18","arxiv_id":"2110.09408","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":7,"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 7 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; every one of the 7 samples that ran constructed an object rather than computing a result","sample_list":"/paper/hrformer-high-resolution-transformer-for#ran","syntology_url":"https://syntology.ai/paper/2110.09408","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.09408"}},"official":{"repos":["HRNet/HRFormer"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":7,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["official"]}}}],"record_sha256":"c9fe642dc041e090cc0e09ae45e05562ea32293e70da58869a70efab280a8d78","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}