{"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/all/papers/27","list_of":"/task/all","task":"All","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":27,"pages_in_order":27,"rows_per_page":100,"rows":[2601,2646],"of":2646,"counts":{"archive_papers_tagged":2646,"with_a_code_link":951,"where_syntology_ran_a_sample":271,"not_listed_spam_title":0,"listed":2646,"listed_where_code_ran":271,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":232,"every_run_a_failure_of_syntologys_instrument":39,"listed_with_a_run_with_no_instrument_failure":232,"listed_every_run_a_failure_of_syntologys_instrument":39,"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/all","prev":"/task/all/papers/26","next":null,"papers":[{"url":null,"slug":"pac-learning-vc-dimension-and-the-arithmetic","title":"PAC Learning, VC Dimension, and the Arithmetic Hierarchy","date":"2014-06-04","arxiv_id":"1406.1111","repositories_listed":0,"syntology":null},{"url":null,"slug":"active-frame-location-and-detector-selection","title":"Active Frame, Location, and Detector Selection for Automated and Manual Video Annotation","date":"2014-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"building-sentiment-lexicons-for-all-major","title":"Building Sentiment Lexicons for All Major Languages","date":"2014-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"is-it-all-in-the-phrasing-computational","title":"Is It All in the Phrasing? Computational Explorations in How We Say What We Say, and Why It Matters","date":"2014-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"stable-template-based-isometric-3d","title":"Stable Template-Based Isometric 3D Reconstruction in All Imaging Conditions by Linear Least-Squares","date":"2014-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"all-fragments-count-in-parser-evaluation","title":"All Fragments Count in Parser Evaluation","date":"2014-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"finding-a-tradeoff-between-accuracy-and","title":"Finding a Tradeoff between Accuracy and Rater's Workload in Grading Clustered Short Answers","date":"2014-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"meta-classifiers-easily-improve-commercial","title":"Meta-Classifiers Easily Improve Commercial Sentiment Detection Tools","date":"2014-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-setimeshr-linguistically-annotated-corpus","title":"The SETimes.HR Linguistically Annotated Corpus of Croatian","date":"2014-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"vulnerability-in-acquisition-language","title":"Vulnerability in Acquisition, Language Impairments in Dutch: Creating a VALID Data Archive","date":"2014-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"what-substitutes-tell-us-analysis-of-an-all","title":"What Substitutes Tell Us - Analysis of an ``All-Words'' Lexical Substitution Corpus","date":"2014-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-learning-over-infinite-subgraph","title":"Sparse Learning over Infinite Subgraph Features","date":"2014-03-20","arxiv_id":"1403.5177","repositories_listed":0,"syntology":null},{"url":null,"slug":"can-image-level-labels-replace-pixel-level","title":"Can Image-Level Labels Replace Pixel-Level Labels for Image Parsing","date":"2014-03-07","arxiv_id":"1403.1626","repositories_listed":0,"syntology":null},{"url":null,"slug":"its-distributions-all-the-way-down-second","title":"It's distributions all the way down!: Second order changes in statistical distributions also occur","date":"2014-02-27","arxiv_id":"1402.6880","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantile-representation-for-indirect","title":"Quantile Representation for Indirect Immunofluorescence Image Classification","date":"2014-02-06","arxiv_id":"1402.1371","repositories_listed":0,"syntology":null},{"url":null,"slug":"computing-all-pairs-shortest-paths-by","title":"Computing All-Pairs Shortest Paths by Leveraging Low Treewidth","date":"2014-01-18","arxiv_id":"1401.4609","repositories_listed":0,"syntology":null},{"url":null,"slug":"mapp-a-scalable-multi-agent-path-planning","title":"MAPP: a Scalable Multi-Agent Path Planning Algorithm with Tractability and Completeness Guarantees","date":"2014-01-16","arxiv_id":"1401.3905","repositories_listed":0,"syntology":null},{"url":null,"slug":"its-all-fun-and-games-until-someone-annotates","title":"It's All Fun and Games until Someone Annotates: Video Games with a Purpose for Linguistic Annotation","date":"2014-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"heterogeneous-neighborhood-based-multi-task","title":"Heterogeneous-Neighborhood-based Multi-Task Local Learning Algorithms","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"it-is-all-in-the-noise-efficient-multi-task","title":"It is all in the noise: Efficient multi-task Gaussian process inference with structured residuals","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"recurrent-networks-of-coupled-winner-take-all","title":"Recurrent networks of coupled Winner-Take-All oscillators for solving constraint satisfaction problems","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"are-all-training-examples-equally-valuable","title":"Are all training examples equally valuable?","date":"2013-11-25","arxiv_id":"1311.6510","repositories_listed":0,"syntology":null},{"url":"/paper/twitter-part-of-speech-tagging-for-all","slug":"twitter-part-of-speech-tagging-for-all","title":"Twitter Part-of-Speech Tagging for All: Overcoming Sparse and Noisy Data","date":"2013-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"hidden-structure-and-function-in-the-lexicon","title":"Hidden Structure and Function in the Lexicon","date":"2013-08-11","arxiv_id":"1308.2428","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonlinear-time-series-modeling-a-unified","title":"Nonlinear Time Series Modeling: A Unified Perspective, Algorithm, and Application","date":"2013-08-03","arxiv_id":"1308.0642","repositories_listed":0,"syntology":null},{"url":null,"slug":"density-maximization-in-context-sense-metric","title":"Density Maximization in Context-Sense Metric Space for All-words WSD","date":"2013-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-unified-framework-of-elementary-geometric","title":"A Unified Framework of Elementary Geometric Transformation Representation","date":"2013-07-03","arxiv_id":"1307.0998","repositories_listed":0,"syntology":null},{"url":null,"slug":"all-about-vlad","title":"All About VLAD","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"groupwise-registration-via-graph-shrinkage-on","title":"Groupwise Registration via Graph Shrinkage on the Image Manifold","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"supervised-all-words-lexical-substitution","title":"Supervised All-Words Lexical Substitution using Delexicalized Features","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"extending-modern-sat-solvers-for-enumerating","title":"Extending Modern SAT Solvers for Enumerating All Models","date":"2013-05-02","arxiv_id":"1305.0574","repositories_listed":0,"syntology":null},{"url":null,"slug":"polygon-matching-and-indexing-under-affine","title":"Polygon Matching and Indexing Under Affine Transformations","date":"2013-04-18","arxiv_id":"1304.4994","repositories_listed":0,"syntology":null},{"url":null,"slug":"objective-probability","title":"Objective Probability","date":"2013-03-27","arxiv_id":"1304.2727","repositories_listed":0,"syntology":null},{"url":null,"slug":"video-face-matching-using-subset-selection","title":"Video Face Matching using Subset Selection and Clustering of Probabilistic Multi-Region Histograms","date":"2013-03-26","arxiv_id":"1303.6361","repositories_listed":0,"syntology":null},{"url":null,"slug":"multiclass-learning-approaches-a-theoretical","title":"Multiclass Learning Approaches: A Theoretical Comparison with Implications","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"order-independent-constraint-based-causal","title":"Order-independent constraint-based causal structure learning","date":"2012-11-14","arxiv_id":"1211.3295","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-all-possible-worlds-to-small-worlds-a","title":"From All Possible Worlds to Small Worlds: A Story of How We Started and Where We Will Go Doing Semantics","date":"2012-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"closed-set-lattice-of-regular-sets-based-on-a","title":"Closed-set lattice of regular sets based on a serial and transitive relation through matroids","date":"2012-09-25","arxiv_id":"1209.5567","repositories_listed":0,"syntology":null},{"url":null,"slug":"big-data-versus-the-crowd-looking-for","title":"Big Data versus the Crowd: Looking for Relationships in All the Right Places","date":"2012-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"emnlpcph-is-frequency-all-there-is-to","title":"EMNLP@CPH: Is frequency all there is to simplicity?","date":"2012-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"topic-models-latent-space-models-sparse","title":"Topic Models, Latent Space Models, Sparse Coding, and All That: A Systematic Understanding of Probabilistic Semantic Extraction in Large Corpus","date":"2012-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"dimension-independent-similarity-computation","title":"Dimension Independent Similarity Computation","date":"2012-06-11","arxiv_id":"1206.2082","repositories_listed":0,"syntology":null},{"url":null,"slug":"refinement-modal-logic","title":"Refinement Modal Logic","date":"2012-02-16","arxiv_id":"1202.3538","repositories_listed":0,"syntology":null},{"url":null,"slug":"one-sketch-for-all-theory-and-application-of","title":"One sketch for all: Theory and Application of Conditional Random Sampling","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"op-data-on-cd-for-mean-opacities-and","title":"OP data on CD for mean opacities and radiative accelerations","date":"2004-10-30","arxiv_id":"astro-ph/0411010","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-rosat-all-sky-survey-bright-source","title":"The ROSAT All-Sky Survey Bright Source Catalogue","date":"1999-09-17","arxiv_id":"astro-ph/9909315","repositories_listed":0,"syntology":null}],"record_sha256":"8806f896deebdb484541a0fa4231be6b22e7b61dc2bc148d27d39a9c966fbd99","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}