{"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/type/papers/ran/1","list_of":"/task/type","task":"Vocal Bursts Type 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":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,16],"of":16,"counts":{"archive_papers_tagged":675,"with_a_code_link":155,"where_syntology_ran_a_sample":16,"not_listed_spam_title":0,"listed":675,"listed_where_code_ran":16,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":14,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":14,"listed_every_run_a_failure_of_syntologys_instrument":2,"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/type/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/typet5-seq2seq-type-inference-using-static","slug":"typet5-seq2seq-type-inference-using-static","title":"TypeT5: Seq2seq Type Inference using Static Analysis","date":"2023-03-16","arxiv_id":"2303.09564","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/typet5-seq2seq-type-inference-using-static#ran","syntology_url":"https://syntology.ai/paper/2303.09564","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.09564"}},"official":{"repos":["utopia-group/typet5"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/open-relation-and-event-type-discovery-with","slug":"open-relation-and-event-type-discovery-with","title":"Open Relation and Event Type Discovery with Type Abstraction","date":"2022-11-30","arxiv_id":"2212.00178","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/open-relation-and-event-type-discovery-with#ran","syntology_url":"https://syntology.ai/paper/2212.00178","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.00178"}},"official":{"repos":["raspberryice/type-discovery-abs"],"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/universal-post-training-backdoor-detection","slug":"universal-post-training-backdoor-detection","title":"MM-BD: Post-Training Detection of Backdoor Attacks with Arbitrary Backdoor Pattern Types Using a Maximum Margin Statistic","date":"2022-05-13","arxiv_id":"2205.06900","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/universal-post-training-backdoor-detection#ran","syntology_url":"https://syntology.ai/paper/2205.06900","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.06900"}},"official":{"repos":["wanghangpsu/mm-bd"],"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/typilus-neural-type-hints","slug":"typilus-neural-type-hints","title":"Typilus: Neural Type Hints","date":"2020-04-06","arxiv_id":"2004.10657","repositories_listed":3,"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/typilus-neural-type-hints#ran","syntology_url":"https://syntology.ai/paper/2004.10657","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.10657"}},"official":{"repos":["typilus/typilus"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/multi-type-mean-field-reinforcement-learning","slug":"multi-type-mean-field-reinforcement-learning","title":"Multi Type Mean Field Reinforcement Learning","date":"2020-02-06","arxiv_id":"2002.02513","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"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) · 2 unverified","sample_list":"/paper/multi-type-mean-field-reinforcement-learning#ran","syntology_url":"https://syntology.ai/paper/2002.02513","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.02513"}},"official":{"repos":["BorealisAI/mtmfrl"],"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","unlocated"]}}},{"url":"/paper/feddane-a-federated-newton-type-method","slug":"feddane-a-federated-newton-type-method","title":"FedDANE: A Federated Newton-Type Method","date":"2020-01-07","arxiv_id":"2001.01920","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":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) · 0 unverified","sample_list":"/paper/feddane-a-federated-newton-type-method#ran","syntology_url":"https://syntology.ai/paper/2001.01920","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.01920"}},"official":{"repos":["litian96/FedDANE"],"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/differentially-private-mixed-type-data-1","slug":"differentially-private-mixed-type-data-1","title":"Differentially Private Synthetic Mixed-Type Data Generation For Unsupervised Learning","date":"2019-12-06","arxiv_id":"1912.03250","repositories_listed":1,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":9,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/differentially-private-mixed-type-data-1#ran","syntology_url":"https://syntology.ai/paper/1912.03250","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.03250"}},"official":{"repos":["DPautoGAN/DPautoGAN"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/sato-contextual-semantic-type-detection-in","slug":"sato-contextual-semantic-type-detection-in","title":"Sato: Contextual Semantic Type Detection in Tables","date":"2019-11-14","arxiv_id":"1911.06311","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":1,"n_no_contract":5,"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, 1 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/sato-contextual-semantic-type-detection-in#ran","syntology_url":"https://syntology.ai/paper/1911.06311","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.06311"}},"official":{"repos":["megagonlabs/sato"],"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/fine-grained-entity-typing-in-hyperbolic","slug":"fine-grained-entity-typing-in-hyperbolic","title":"Fine-Grained Entity Typing in Hyperbolic Space","date":"2019-06-06","arxiv_id":"1906.02505","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fine-grained-entity-typing-in-hyperbolic#ran","syntology_url":"https://syntology.ai/paper/1906.02505","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.02505"}},"official":{"repos":["nlpAThits/figet-hyperbolic-space"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/breizhcrops-a-satellite-time-series-dataset","slug":"breizhcrops-a-satellite-time-series-dataset","title":"BreizhCrops: A Time Series Dataset for Crop Type Mapping","date":"2019-05-28","arxiv_id":"1905.11893","repositories_listed":2,"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/breizhcrops-a-satellite-time-series-dataset#ran","syntology_url":"https://syntology.ai/paper/1905.11893","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.11893"}},"official":{"repos":["TUM-LMF/BreizhCrops","dl4sits/BreizhCrops"],"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/sherlock-a-deep-learning-approach-to-semantic","slug":"sherlock-a-deep-learning-approach-to-semantic","title":"Sherlock: A Deep Learning Approach to Semantic Data Type Detection","date":"2019-05-25","arxiv_id":"1905.10688","repositories_listed":2,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/sherlock-a-deep-learning-approach-to-semantic#ran","syntology_url":"https://syntology.ai/paper/1905.10688","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10688"}},"official":{"repos":["mitmedialab/sherlock-project"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/dingo-distributed-newton-type-method-for","slug":"dingo-distributed-newton-type-method-for","title":"DINGO: Distributed Newton-Type Method for Gradient-Norm Optimization","date":"2019-01-16","arxiv_id":"1901.05134","repositories_listed":1,"syntology":{"n":19,"n_ran":16,"n_constructed":0,"n_ran_checked":16,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/dingo-distributed-newton-type-method-for#ran","syntology_url":"https://syntology.ai/paper/1901.05134","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.05134"}},"official":{"repos":["RixonC/DINGO"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":16,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/preconditioner-on-matrix-lie-group-for-sgd","slug":"preconditioner-on-matrix-lie-group-for-sgd","title":"Preconditioner on Matrix Lie Group for SGD","date":"2018-09-26","arxiv_id":"1809.10232","repositories_listed":2,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"5 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; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/preconditioner-on-matrix-lie-group-for-sgd#ran","syntology_url":"https://syntology.ai/paper/1809.10232","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.10232"}},"official":{"repos":["lixilinx/psgd_torch"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-type-aware-embeddings-for-fashion","slug":"learning-type-aware-embeddings-for-fashion","title":"Learning Type-Aware Embeddings for Fashion Compatibility","date":"2018-03-25","arxiv_id":"1803.09196","repositories_listed":3,"syntology":{"n":16,"n_ran":15,"n_constructed":0,"n_ran_checked":14,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":1,"phrase":"15 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-type-aware-embeddings-for-fashion#ran","syntology_url":"https://syntology.ai/paper/1803.09196","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.09196"}},"official":{"repos":["mvasil/fashion-compatibility"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/deeptype-multilingual-entity-linking-by","slug":"deeptype-multilingual-entity-linking-by","title":"DeepType: Multilingual Entity Linking by Neural Type System Evolution","date":"2018-02-03","arxiv_id":"1802.01021","repositories_listed":1,"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":2,"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/deeptype-multilingual-entity-linking-by#ran","syntology_url":"https://syntology.ai/paper/1802.01021","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.01021"}},"official":{"repos":["openai/deeptype"],"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/privit-private-and-sample-efficient-identity","slug":"privit-private-and-sample-efficient-identity","title":"Priv'IT: Private and Sample Efficient Identity Testing","date":"2017-03-29","arxiv_id":"1703.10127","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/privit-private-and-sample-efficient-identity#ran","syntology_url":"https://syntology.ai/paper/1703.10127","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.10127"}},"official":{"repos":["hoonose/privit"],"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"]}}}],"record_sha256":"997303898d5a4d7625daca9524deb143997895c58cf51ffbc042182443470891","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}