{"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/lemma/papers/7","list_of":"/task/lemma","task":"LEMMA","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":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":7,"pages_in_order":7,"rows_per_page":100,"rows":[601,628],"of":628,"counts":{"archive_papers_tagged":628,"with_a_code_link":102,"where_syntology_ran_a_sample":18,"not_listed_spam_title":0,"listed":628,"listed_where_code_ran":18,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":17,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":17,"listed_every_run_a_failure_of_syntologys_instrument":1,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/lemma","prev":"/task/lemma/papers/6","next":null,"papers":[{"url":null,"slug":"chasing-ghosts-competing-with-stateful","title":"Chasing Ghosts: Competing with Stateful Policies","date":"2014-07-29","arxiv_id":"1407.7635","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-complexity-of-best-arm-identification","title":"On the Complexity of Best Arm Identification in Multi-Armed Bandit Models","date":"2014-07-16","arxiv_id":"1407.4443","repositories_listed":0,"syntology":null},{"url":null,"slug":"constituency-parsing-of-bulgarian-word-vs","title":"Constituency Parsing of Bulgarian: Word- vs Class-based Parsing","date":"2014-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"lexical-substitution-dataset-for-german","title":"Lexical Substitution Dataset for German","date":"2014-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"recognising-suicidal-messages-in-dutch-social","title":"Recognising suicidal messages in Dutch social media","date":"2014-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sharing-cultural-heritage-the-clavius-on-the","title":"Sharing Cultural Heritage: the Clavius on the Web Project","date":"2014-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"implementing-anti-unification-modulo","title":"Implementing Anti-Unification Modulo Equational Theory","date":"2014-04-01","arxiv_id":"1404.0953","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-lemma-based-evaluator-for-semitic-language","title":"A Lemma Based Evaluator for Semitic Language Text Summarization Systems","date":"2014-03-22","arxiv_id":"1403.5596","repositories_listed":0,"syntology":null},{"url":null,"slug":"applying-supervised-learning-algorithms-and-a","title":"Applying Supervised Learning Algorithms and a New Feature Selection Method to Predict Coronary Artery Disease","date":"2014-02-03","arxiv_id":"1402.0459","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-factorization-with-binary-components","title":"Matrix factorization with Binary Components","date":"2014-01-23","arxiv_id":"1401.6024","repositories_listed":0,"syntology":null},{"url":null,"slug":"computing-small-unsatisfiable-cores-in","title":"Computing Small Unsatisfiable Cores in Satisfiability Modulo Theories","date":"2014-01-16","arxiv_id":"1401.3878","repositories_listed":0,"syntology":null},{"url":"/paper/entity-linking-meets-word-sense","slug":"entity-linking-meets-word-sense","title":"Entity Linking meets Word Sense Disambiguation: a Unified Approach","date":"2014-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"universal-codes-from-switching-strategies","title":"Universal Codes from Switching Strategies","date":"2013-11-26","arxiv_id":"1311.6536","repositories_listed":0,"syntology":null},{"url":null,"slug":"toward-a-unified-theory-of-sparse","title":"Toward a unified theory of sparse dimensionality reduction in Euclidean space","date":"2013-11-11","arxiv_id":"1311.2542","repositories_listed":0,"syntology":null},{"url":null,"slug":"lemma-mining-over-hol-light","title":"Lemma Mining over HOL Light","date":"2013-10-10","arxiv_id":"1310.2797","repositories_listed":0,"syntology":null},{"url":null,"slug":"asymptotic-normality-and-optimalities-in","title":"Asymptotic normality and optimalities in estimation of large Gaussian graphical models","date":"2013-09-24","arxiv_id":"1309.6024","repositories_listed":0,"syntology":null},{"url":null,"slug":"tight-lower-bounds-for-homology-inference","title":"Tight Lower Bounds for Homology Inference","date":"2013-07-29","arxiv_id":"1307.7666","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-open-diachronic-corpus-of-historical","title":"An open diachronic corpus of historical Spanish: annotation criteria and automatic modernisation of spelling","date":"2013-06-16","arxiv_id":"1306.3692","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-pseudo-boolean-k-dnf-and-submodular","title":"Learning pseudo-Boolean k-DNF and Submodular Functions","date":"2012-08-10","arxiv_id":"1208.2294","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-goo300k-corpus-of-historical-slovene","title":"The goo300k corpus of historical Slovene","date":"2012-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"visualizing-word-senses-in-wordnet-atlas","title":"Visualizing word senses in WordNet Atlas","date":"2012-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"outlier-detection-in-default-logics-the","title":"Outlier detection in default logics: the tractability/intractability frontier","date":"2011-09-21","arxiv_id":"1109.4623","repositories_listed":0,"syntology":null},{"url":null,"slug":"random-design-analysis-of-ridge-regression","title":"Random design analysis of ridge regression","date":"2011-06-13","arxiv_id":"1106.2363","repositories_listed":0,"syntology":null},{"url":null,"slug":"random-projection-trees-revisited","title":"Random Projection Trees Revisited","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-achievability-of-cramer-rao-bound-in","title":"On the Achievability of Cramér-Rao Bound In Noisy Compressed Sensing","date":"2010-06-13","arxiv_id":"1006.2513","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-roc-curve-for-a-combination-of","title":"Optimal ROC Curve for a Combination of Classifiers","date":"2007-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/transductive-inference-and-semi-supervised","slug":"transductive-inference-and-semi-supervised","title":"Transductive Inference and Semi-Supervised Learning","date":"2006-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"rental-harmony-sperner-s-lemma-in-fair","title":"Rental Harmony: Sperner's Lemma in Fair Division","date":"1999-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"34a58541cc7f332436dcb3a29a64006b243e82efb58af12d14716eabbb5141f5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}