{"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/arc/papers/6","list_of":"/task/arc","task":"ARC","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":6,"pages_in_order":6,"rows_per_page":100,"rows":[501,554],"of":554,"counts":{"archive_papers_tagged":554,"with_a_code_link":155,"where_syntology_ran_a_sample":48,"not_listed_spam_title":0,"listed":554,"listed_where_code_ran":48,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":42,"every_run_a_failure_of_syntologys_instrument":6,"listed_with_a_run_with_no_instrument_failure":42,"listed_every_run_a_failure_of_syntologys_instrument":6,"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/arc","prev":"/task/arc/papers/5","next":null,"papers":[{"url":null,"slug":"the-power-of-arc-consistency-for-csps-defined","title":"The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns","date":"2016-04-27","arxiv_id":"1604.07981","repositories_listed":0,"syntology":null},{"url":null,"slug":"compact-table-efficiently-filtering-table","title":"Compact-Table: Efficiently Filtering Table Constraints with Reversible Sparse Bit-Sets","date":"2016-04-22","arxiv_id":"1604.06641","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-incremental-linear-time-learning-algorithm","title":"An incremental linear-time learning algorithm for the Optimum-Path Forest classifier","date":"2016-04-12","arxiv_id":"1604.03346","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-selection-of-giant-radio-sources-from-nvss","title":"A Selection of Giant Radio Sources from NVSS","date":"2016-03-22","arxiv_id":"1603.06895","repositories_listed":0,"syntology":null},{"url":null,"slug":"real-time-error-detection-in-metal-arc","title":"Real time error detection in metal arc welding process using Artificial Neural Netwroks","date":"2016-03-10","arxiv_id":"1603.03149","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-geometric-invariant-for-the-study-of-planar","title":"A geometric invariant for the study of planar curves and its application to spiral tip meander","date":"2016-02-25","arxiv_id":"1602.07758","repositories_listed":0,"syntology":null},{"url":null,"slug":"affine-differential-geometry-and-smoothness","title":"Affine differential geometry and smoothness maximization as tools for identifying geometric movement primitives","date":"2016-01-27","arxiv_id":"1409.0675","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalized-totalizer-encoding-for-pseudo","title":"Generalized Totalizer Encoding for Pseudo-Boolean Constraints","date":"2015-07-21","arxiv_id":"1507.05920","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-linear-time-transition-system-for-crossing","title":"A Linear-Time Transition System for Crossing Interval Trees","date":"2015-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"transition-based-syntactic-linearization","title":"Transition-Based Syntactic Linearization","date":"2015-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sign-stable-random-projections-for-large","title":"Sign Stable Random Projections for Large-Scale Learning","date":"2015-04-27","arxiv_id":"1504.07235","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalized-support-and-formal-development-of","title":"Generalized Support and Formal Development of Constraint Propagators","date":"2015-04-22","arxiv_id":"1504.05846","repositories_listed":0,"syntology":null},{"url":null,"slug":"variable-and-value-elimination-in-binary","title":"Variable and value elimination in binary constraint satisfaction via forbidden patterns","date":"2015-02-12","arxiv_id":"1502.03796","repositories_listed":0,"syntology":null},{"url":null,"slug":"tractability-and-decompositions-of-global","title":"Tractability and Decompositions of Global Cost Functions","date":"2015-02-09","arxiv_id":"1502.02414","repositories_listed":0,"syntology":null},{"url":null,"slug":"parsing-to-noncrossing-dependency-graphs","title":"Parsing to Noncrossing Dependency Graphs","date":"2015-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"quantifying-error-in-estimates-of-human-brain","title":"Quantifying error in estimates of human brain fiber directions using Earth Mover's Distance","date":"2014-11-19","arxiv_id":"1411.5271","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-chord-and-sagitta-in-mathbb-z2-an-analysis","title":"On Chord and Sagitta in ${\\mathbb Z}^2$: An Analysis towards Fast and Robust Circular Arc Detection","date":"2014-10-26","arxiv_id":"1411.1668","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-shortest-path-method-for-arc-factored","title":"A Shortest-path Method for Arc-factored Semantic Role Labeling","date":"2014-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"cmu-arc-factored-discriminative-semantic","title":"CMU: Arc-Factored, Discriminative Semantic Dependency Parsing","date":"2014-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-propagation-depth-of-local-consistency","title":"The Propagation Depth of Local Consistency","date":"2014-06-18","arxiv_id":"1406.4679","repositories_listed":0,"syntology":null},{"url":null,"slug":"computational-role-of-eccentricity-dependent","title":"Computational role of eccentricity dependent cortical magnification","date":"2014-06-06","arxiv_id":"1406.1770","repositories_listed":0,"syntology":null},{"url":null,"slug":"squibs-arc-eager-parsing-with-the-tree","title":"Squibs: Arc-Eager Parsing with the Tree Constraint","date":"2014-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"squibs-constrained-arc-eager-dependency","title":"Squibs: Constrained Arc-Eager Dependency Parsing","date":"2014-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"flow-graph-corpus-from-recipe-texts","title":"Flow Graph Corpus from Recipe Texts","date":"2014-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"projection-based-annotation-of-a-polish","title":"Projection-based Annotation of a Polish Dependency Treebank","date":"2014-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"matching-image-sets-via-adaptive-multi-convex","title":"Matching Image Sets via Adaptive Multi Convex Hull","date":"2014-03-03","arxiv_id":"1403.0320","repositories_listed":0,"syntology":null},{"url":null,"slug":"to-go-deep-or-wide-in-learning","title":"To go deep or wide in learning?","date":"2014-02-23","arxiv_id":"1402.5634","repositories_listed":0,"syntology":null},{"url":null,"slug":"parameterized-complexity-results-for-exact","title":"Parameterized Complexity Results for Exact Bayesian Network Structure Learning","date":"2014-02-04","arxiv_id":"1402.0558","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-new-look-at-bdds-for-pseudo-boolean","title":"A New Look at BDDs for Pseudo-Boolean Constraints","date":"2014-01-23","arxiv_id":"1401.5860","repositories_listed":0,"syntology":null},{"url":null,"slug":"second-order-consistencies","title":"Second-Order Consistencies","date":"2014-01-16","arxiv_id":"1401.3872","repositories_listed":0,"syntology":null},{"url":null,"slug":"soft-constraints-of-difference-and-equality","title":"Soft Constraints of Difference and Equality","date":"2014-01-16","arxiv_id":"1401.3879","repositories_listed":0,"syntology":null},{"url":null,"slug":"bounds-arc-consistency-for-weighted-csps","title":"Bounds Arc Consistency for Weighted CSPs","date":"2014-01-15","arxiv_id":"1401.3481","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-tabular-method-for-dynamic-oracles-in","title":"A Tabular Method for Dynamic Oracles in Transition-Based Parsing","date":"2014-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-face-recognition-approach-based-on-entropy","title":"A Face Recognition approach based on entropy estimate of the nonlinear DCT features in the Logarithm Domain together with Kernel Entropy Component Analysis","date":"2013-12-05","arxiv_id":"1312.1520","repositories_listed":0,"syntology":null},{"url":null,"slug":"book-embeddings-of-reeb-graphs","title":"Book embeddings of Reeb graphs","date":"2013-12-05","arxiv_id":"1312.1725","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-dynamic-confusion-score-for-dependency-arc","title":"A Dynamic Confusion Score for Dependency Arc Labels","date":"2013-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-sat-representations-of-xor-constraints","title":"On SAT representations of XOR constraints","date":"2013-09-12","arxiv_id":"1309.3060","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-non-monotonic-arc-eager-transition-system","title":"A Non-Monotonic Arc-Eager Transition System for Dependency Parsing","date":"2013-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"an-n-ary-constraint-for-the-stable-marriage","title":"An n-ary Constraint for the Stable Marriage Problem","date":"2013-08-01","arxiv_id":"1308.0183","repositories_listed":0,"syntology":null},{"url":null,"slug":"constraint-satisfaction-over-generalized","title":"Constraint Satisfaction over Generalized Staircase Constraints","date":"2013-04-18","arxiv_id":"1304.5051","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-speed-of-constraint-propagation-and","title":"On the speed of constraint propagation and the time complexity of arc consistency testing","date":"2013-03-28","arxiv_id":"1303.7077","repositories_listed":0,"syntology":null},{"url":null,"slug":"evidence-absorption-and-propagation-through","title":"Evidence Absorption and Propagation through Evidence Reversals","date":"2013-03-27","arxiv_id":"1304.1525","repositories_listed":0,"syntology":null},{"url":null,"slug":"interval-influence-diagrams","title":"Interval Influence Diagrams","date":"2013-03-27","arxiv_id":"1304.1503","repositories_listed":0,"syntology":null},{"url":null,"slug":"kutato-an-entropy-driven-system-for","title":"Kutato: An Entropy-Driven System for Construction of Probabilistic Expert Systems from Databases","date":"2013-03-27","arxiv_id":"1304.1088","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-simulation-of-bayesian-belief","title":"Stochastic Simulation of Bayesian Belief Networks","date":"2013-03-27","arxiv_id":"1304.2722","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-a-theory-of-good-sat-representations","title":"Towards a theory of good SAT representations","date":"2013-02-18","arxiv_id":"1302.4421","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-parsing-for-head-split-dependency","title":"Efficient Parsing for Head-Split Dependency Trees","date":"2013-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-stacked-dependency-parsing-by","title":"Efficient Stacked Dependency Parsing by Forest Reranking","date":"2013-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-arc-factored-parsing-of-syntactic-and","title":"Joint Arc-factored Parsing of Syntactic and Semantic Dependencies","date":"2013-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"training-deterministic-parsers-with-non","title":"Training Deterministic Parsers with Non-Deterministic Oracles","date":"2013-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-dynamic-oracle-for-arc-eager-dependency","title":"A Dynamic Oracle for Arc-Eager Dependency Parsing","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"mesh-learning-for-classifying-cognitive","title":"Mesh Learning for Classifying Cognitive Processes","date":"2012-05-10","arxiv_id":"1205.2382","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-unsupervised-dependency-parsing-with-arc","title":"Fast Unsupervised Dependency Parsing with Arc-Standard Transitions","date":"2012-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-adaboost-flow","title":"The AdaBoost Flow","date":"2011-10-28","arxiv_id":"1110.6228","repositories_listed":0,"syntology":null}],"record_sha256":"61097db7e4d28cf7ea10401fe4908e6408daea20657b50303b5830caa85ba4a7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}