{"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/math/papers/16","list_of":"/task/math","task":"Math","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":16,"pages_in_order":16,"rows_per_page":100,"rows":[1501,1596],"of":1596,"counts":{"archive_papers_tagged":1596,"with_a_code_link":765,"where_syntology_ran_a_sample":349,"not_listed_spam_title":0,"listed":1596,"listed_where_code_ran":349,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":286,"every_run_a_failure_of_syntologys_instrument":63,"listed_with_a_run_with_no_instrument_failure":286,"listed_every_run_a_failure_of_syntologys_instrument":63,"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/math","prev":"/task/math/papers/15","next":null,"papers":[{"url":null,"slug":"a-two-stage-framework-for-mathematical","title":"A TWO-STAGE FRAMEWORK FOR MATHEMATICAL EXPRESSION RECOGNITION","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"natural-to-formal-language-generation-using","title":"Natural- to formal-language generation using Tensor Product Representations","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-quasi-sure-superhedging-duality-with","title":"On the quasi-sure superhedging duality with frictions","date":"2019-09-18","arxiv_id":"1809.07516","repositories_listed":0,"syntology":null},{"url":null,"slug":"visual-analytics-of-student-learning","title":"Visual Analytics of Student Learning Behaviors on K-12 Mathematics E-learning Platforms","date":"2019-09-07","arxiv_id":"1909.04749","repositories_listed":0,"syntology":null},{"url":"/paper/giving-bert-a-calculator-finding-operations","slug":"giving-bert-a-calculator-finding-operations","title":"Giving BERT a Calculator: Finding Operations and Arguments with Reading Comprehension","date":"2019-08-31","arxiv_id":"1909.00109","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-math-word-problems-with-double","title":"Solving Math Word Problems with Double-Decoder Transformer","date":"2019-08-28","arxiv_id":"1908.10924","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-scheduling-of-mpi-based-distributed","title":"Dynamic Scheduling of MPI-based Distributed Deep Learning Training Jobs","date":"2019-08-21","arxiv_id":"1908.08082","repositories_listed":0,"syntology":null},{"url":null,"slug":"oxford-handbook-on-ai-ethics-book-chapter-on","title":"Oxford Handbook on AI Ethics Book Chapter on Race and Gender","date":"2019-08-08","arxiv_id":"1908.06165","repositories_listed":0,"syntology":null},{"url":null,"slug":"dolphin-a-verbal-fluency-evaluation-system","title":"Dolphin: A Spoken Language Proficiency Assessment System for Elementary Education","date":"2019-08-01","arxiv_id":"1908.00358","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-diffusion-inhibits-disease-outbreaks","title":"Fast Diffusion Inhibits Disease Outbreaks","date":"2019-07-29","arxiv_id":"1907.12229","repositories_listed":0,"syntology":null},{"url":null,"slug":"connecting-lyapunov-control-theory-to","title":"Connecting Lyapunov Control Theory to Adversarial Attacks","date":"2019-07-17","arxiv_id":"1907.07732","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-academic-plagiarism-detection-for","title":"Improving Academic Plagiarism Detection for STEM Documents by Analyzing Mathematical Content and Citations","date":"2019-06-27","arxiv_id":"1906.11761","repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-generation-of-high-quality-ccgbanks","title":"Automatic Generation of High Quality CCGbanks for Parser Domain Adaptation","date":"2019-06-05","arxiv_id":"1906.01834","repositories_listed":0,"syntology":null},{"url":null,"slug":"aifu-at-semeval-2019-task-10-a-symbolic-and","title":"AiFu at SemEval-2019 Task 10: A Symbolic and Sub-symbolic Integrated System for SAT Math Question Answering","date":"2019-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"problemsolver-at-semeval-2019-task-10","title":"ProblemSolver at SemEval-2019 Task 10: Sequence-to-Sequence Learning and Expression Trees","date":"2019-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/mathqa-towards-interpretable-math-word","slug":"mathqa-towards-interpretable-math-word","title":"MathQA: Towards Interpretable Math Word Problem Solving with Operation-Based Formalisms","date":"2019-05-30","arxiv_id":"1905.13319","repositories_listed":0,"syntology":null},{"url":null,"slug":"integer-networks-for-data-compression-with","title":"Integer Networks for Data Compression with Latent-Variable Models","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"prediction-with-expert-advice-a-pde","title":"Prediction with Expert Advice: a PDE Perspective","date":"2019-04-25","arxiv_id":"1904.11401","repositories_listed":0,"syntology":null},{"url":null,"slug":"big-math-and-the-one-brain-barrier-a-position","title":"Big Math and the One-Brain Barrier A Position Paper and Architecture Proposal","date":"2019-04-23","arxiv_id":"1904.10405","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-improved-coarse-to-fine-method-for-solving","title":"An Improved Coarse-to-Fine Method for Solving Generation Tasks","date":"2019-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-entropic-measure-transform","title":"The Entropic Measure Transform","date":"2019-02-21","arxiv_id":"1511.06032","repositories_listed":0,"syntology":null},{"url":null,"slug":"svm-based-deep-stacking-networks","title":"SVM-based Deep Stacking Networks","date":"2019-02-15","arxiv_id":"1902.05731","repositories_listed":0,"syntology":null},{"url":null,"slug":"kappa-learning-a-new-method-for-measuring","title":"Kappa Learning: A New Method for Measuring Similarity Between Educational Items Using Performance Data","date":"2018-12-20","arxiv_id":"1812.08390","repositories_listed":0,"syntology":null},{"url":null,"slug":"fixation-probabilities-for-the-moran-process-1","title":"Fixation probabilities for the Moran process with three or more strategies: general and coupling results","date":"2018-11-23","arxiv_id":"1811.09552","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-fixation-probabilities-to-d-player-games","title":"From fixation probabilities to d-player games: an inverse problem in evolutionary dynamics","date":"2018-11-20","arxiv_id":"1801.02550","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-you-see-me","title":"How You See Me","date":"2018-11-20","arxiv_id":"1811.08152","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-case-study-influence-of-dimension-reduction","title":"A case study : Influence of Dimension Reduction on regression trees-based Algorithms -Predicting Aeronautics Loads of a Derivative Aircraft","date":"2018-11-16","arxiv_id":"1812.02310","repositories_listed":0,"syntology":null},{"url":null,"slug":"modeling-student-response-times-towards","title":"Modeling Student Response Times: Towards Efficient One-on-one Tutoring Dialogues","date":"2018-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"constructing-classification-trees-using","title":"Column generation based math-heuristic for classification trees","date":"2018-10-15","arxiv_id":"1810.06684","repositories_listed":0,"syntology":null},{"url":null,"slug":"translating-a-math-word-problem-to-a","title":"Translating a Math Word Problem to a Expression Tree","date":"2018-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-language-agnostic-universal","title":"Towards Language Agnostic Universal Representations","date":"2018-09-23","arxiv_id":"1809.08510","repositories_listed":0,"syntology":null},{"url":null,"slug":"mias-math-aware-retrieval-in-digital","title":"MIaS: Math-Aware Retrieval in Digital Mathematical Libraries","date":"2018-08-28","arxiv_id":"1808.09224","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-gap-of-semantic-parsing-a-survey-on","title":"The Gap of Semantic Parsing: A Survey on Automatic Math Word Problem Solvers","date":"2018-08-22","arxiv_id":"1808.07290","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-function-transformation-omics-funomics","title":"The Function Transformation Omics - Funomics","date":"2018-08-17","arxiv_id":"1808.05766","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-math-word-problem-solver-with","title":"Neural Math Word Problem Solver with Reinforcement Learning","date":"2018-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sensitivity-to-initial-conditions-in-an","title":"Sensitivity to initial conditions in an extended activator-inhibitor model for the formation of patterns","date":"2018-07-10","arxiv_id":"1804.06228","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-hierarchical-structures-on-the-fly","title":"Learning Hierarchical Structures On-The-Fly with a Recurrent-Recursive Model for Sequences","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-multimodal-dialog-technology-for","title":"Leveraging Multimodal Dialog Technology for the Design of Automated and Interactive Student Agents for Teacher Training","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"using-intermediate-representations-to-solve","title":"Using Intermediate Representations to Solve Math Word Problems","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"hep-th","title":"hep-th","date":"2018-06-27","arxiv_id":"1807.00735","repositories_listed":0,"syntology":null},{"url":null,"slug":"fixation-probabilities-for-the-moran-process","title":"Fixation probabilities for the Moran process in evolutionary games with two strategies: graph shapes and large population asymptotics","date":"2018-04-30","arxiv_id":"1805.00117","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-driven-methods-for-solving-algebra-word","title":"Data-Driven Methods for Solving Algebra Word Problems","date":"2018-04-28","arxiv_id":"1804.10718","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-evolutive-systems-fuzzy","title":"Hierarchical evolutive systems, fuzzy categories and the living single cell","date":"2018-01-31","arxiv_id":"1802.00858","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-mathematics-of-market-timing","title":"The Mathematics of Market Timing","date":"2017-12-13","arxiv_id":"1712.05031","repositories_listed":0,"syntology":null},{"url":null,"slug":"coreference-resolution-on-math-problem-text","title":"Coreference Resolution on Math Problem Text in Japanese","date":"2017-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-neural-network-based-system-for-solving","title":"Deep Neural Network based system for solving Arithmetic Word problems","date":"2017-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-large-scale-quantitative-exploration-of","title":"A Large Scale Quantitative Exploration of Modeling Strategies for Content Scoring","date":"2017-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-sentential-semantic-parsing-tackling","title":"Beyond Sentential Semantic Parsing: Tackling the Math SAT with a Cascade of Tree Transducers","date":"2017-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/deep-neural-solver-for-math-word-problems","slug":"deep-neural-solver-for-math-word-problems","title":"Deep Neural Solver for Math Word Problems","date":"2017-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"from-textbooks-to-knowledge-a-case-study-in","title":"From Textbooks to Knowledge: A Case Study in Harvesting Axiomatic Knowledge from Textbooks to Solve Geometry Problems","date":"2017-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-fine-grained-expressions-to-solve","title":"Learning Fine-Grained Expressions to Solve Math Word Problems","date":"2017-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"stem-ming-the-tide-predicting-stem-attrition","title":"Stem-ming the Tide: Predicting STEM attrition using student transcript data","date":"2017-08-28","arxiv_id":"1708.09344","repositories_listed":0,"syntology":null},{"url":"/paper/wordsup-exploiting-word-annotations-for","slug":"wordsup-exploiting-word-annotations-for","title":"WordSup: Exploiting Word Annotations for Character based Text Detection","date":"2017-08-22","arxiv_id":"1708.06720","repositories_listed":0,"syntology":null},{"url":null,"slug":"enabling-massive-deep-neural-networks-with","title":"Enabling Massive Deep Neural Networks with the GraphBLAS","date":"2017-08-09","arxiv_id":"1708.02937","repositories_listed":0,"syntology":null},{"url":null,"slug":"simplified-energy-landscape-for-modularity","title":"Simplified Energy Landscape for Modularity Using Total Variation","date":"2017-07-28","arxiv_id":"1707.09285","repositories_listed":0,"syntology":null},{"url":null,"slug":"semantic-parsing-of-pre-university-math","title":"Semantic Parsing of Pre-university Math Problems","date":"2017-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"atari-games-and-intel-processors","title":"Atari games and Intel processors","date":"2017-05-19","arxiv_id":"1705.06936","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-of-question-answering-for-math-and","title":"A Survey of Question Answering for Math and Science Problem","date":"2017-05-10","arxiv_id":"1705.04530","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-rule-based-computational-model-of-cognitive","title":"A Rule-Based Computational Model of Cognitive Arithmetic","date":"2017-05-03","arxiv_id":"1705.01208","repositories_listed":0,"syntology":null},{"url":null,"slug":"working-memory-capacity-and-gender","title":"Working memory capacity and gender","date":"2017-03-21","arxiv_id":"1703.07639","repositories_listed":0,"syntology":null},{"url":null,"slug":"unit-dependency-graph-and-its-application-to","title":"Unit Dependency Graph and its Application to Arithmetic Word Problem Solving","date":"2016-12-03","arxiv_id":"1612.00969","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-meaning-based-english-math-word-problem","title":"A Meaning-based English Math Word Problem Solver with Understanding, Reasoning and Explanation","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"dmath-distributed-linear-algebra-for-dl","title":"dMath: Distributed Linear Algebra for DL","date":"2016-11-19","arxiv_id":"1611.07819","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-theme-rewriting-approach-for-generating","title":"A Theme-Rewriting Approach for Generating Algebra Word Problems","date":"2016-10-19","arxiv_id":"1610.06210","repositories_listed":0,"syntology":null},{"url":null,"slug":"aoa-aa-aa-a-aaeeaaobuilding-a-corpus-for","title":"構建一個中文國小數學文字問題語料庫(Building a Corpus for Developing the Chinese Elementary School Math Word Problem Solver)[In Chinese]","date":"2016-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/how-well-do-computers-solve-math-word","slug":"how-well-do-computers-solve-math-word","title":"How well do Computers Solve Math Word Problems? Large-Scale Dataset Construction and Evaluation","date":"2016-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-tag-based-english-math-word-problem-solver","title":"A Tag-based English Math Word Problem Solver with Understanding, Reasoning and Explanation","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"illinois-math-solver-math-reasoning-on-the","title":"Illinois Math Solver: Math Reasoning on the Web","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"dmath-a-scalable-linear-algebra-and-math","title":"dMath: A Scalable Linear Algebra and Math Library for Heterogeneous GP-GPU Architectures","date":"2016-04-05","arxiv_id":"1604.01416","repositories_listed":0,"syntology":null},{"url":null,"slug":"asymptotic-expression-for-the-fixation","title":"Asymptotic expression for the fixation probability of a mutant in star graphs","date":"2016-03-18","arxiv_id":"1404.3944","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-method-to-support-difficult-re-finding","title":"A Method to Support Difficult Re-finding Tasks","date":"2016-01-27","arxiv_id":"1601.07273","repositories_listed":0,"syntology":null},{"url":null,"slug":"designing-a-tag-based-statistical-math-word","title":"Designing a Tag-Based Statistical Math Word Problem Solver with Reasoning and Explanation","date":"2015-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"explanation-generation-for-a-math-word","title":"Explanation Generation for a Math Word Problem Solver","date":"2015-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-risk-analysis-for-a-system-stabilized-by-a","title":"A risk analysis for a system stabilized by a central agent","date":"2015-08-17","arxiv_id":"1507.08333","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-tangent-search-engine-improved-similarity","title":"The Tangent Search Engine: Improved Similarity Metrics and Scalability for Math Formula Search","date":"2015-07-22","arxiv_id":"1507.06235","repositories_listed":0,"syntology":null},{"url":null,"slug":"embedded-phase-shifting-robust-phase-shifting","title":"Embedded Phase Shifting: Robust Phase Shifting With Embedded Signals","date":"2015-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"performance-evaluation-and-optimization-of","title":"Performance Evaluation and Optimization of Math-Similarity Search","date":"2015-05-29","arxiv_id":"1505.08155","repositories_listed":0,"syntology":null},{"url":null,"slug":"math-search-for-the-masses-multimodal-search","title":"Math Search for the Masses: Multimodal Search Interfaces and Appearance-Based Retrieval","date":"2015-05-11","arxiv_id":"1505.02798","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-novel-variational-model-for-image","title":"A novel variational model for image registration using Gaussian curvature","date":"2015-04-28","arxiv_id":"1504.07643","repositories_listed":0,"syntology":null},{"url":null,"slug":"approximating-sparse-pca-from-incomplete-data","title":"Approximating Sparse PCA from Incomplete Data","date":"2015-03-12","arxiv_id":"1503.03903","repositories_listed":0,"syntology":null},{"url":null,"slug":"reasoning-about-quantities-in-natural","title":"Reasoning about Quantities in Natural Language","date":"2015-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"weighted-polynomial-approximations-limits-for","title":"Weighted Polynomial Approximations: Limits for Learning and Pseudorandomness","date":"2014-12-08","arxiv_id":"1412.2457","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-joint-probabilistic-classification-model-of","title":"A Joint Probabilistic Classification Model of Relevant and Irrelevant Sentences in Mathematical Word Problems","date":"2014-11-21","arxiv_id":"1411.5732","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-effect-of-teacher-gender-on-student","title":"The Effect of Teacher Gender on Student Achievement in Primary School","date":"2014-10-31","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"feature-selection-based-on-confidence-machine","title":"Feature Selection Based on Confidence Machine","date":"2014-10-20","arxiv_id":"1410.5473","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-bayesian-model-for-recognizing-handwritten","title":"A Bayesian model for recognizing handwritten mathematical expressions","date":"2014-09-18","arxiv_id":"1409.5317","repositories_listed":0,"syntology":null},{"url":null,"slug":"les-mathematiques-de-la-langue-lapproche","title":"Les mathématiques de la langue : l'approche formelle de Montague","date":"2014-05-16","arxiv_id":"1405.4248","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-complexity-of-math-problems-linguistic-or","title":"The Complexity of Math Problems -- Linguistic, or Computational?","date":"2013-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"empirical-entropy-minimax-regret-and-minimax","title":"Empirical entropy, minimax regret and minimax risk","date":"2013-08-06","arxiv_id":"1308.1147","repositories_listed":0,"syntology":null},{"url":null,"slug":"dimension-reduction-via-colour-refinement","title":"Dimension Reduction via Colour Refinement","date":"2013-07-22","arxiv_id":"1307.5697","repositories_listed":0,"syntology":null},{"url":null,"slug":"zero-sum-repeated-games-counterexamples-to","title":"Zero-sum repeated games: Counterexamples to the existence of the asymptotic value and the conjecture $\\operatorname{maxmin}=\\operatorname{lim}v_n$","date":"2013-05-21","arxiv_id":"1305.4778","repositories_listed":0,"syntology":null},{"url":null,"slug":"digenes-genetic-algorithms-to-discover","title":"Digenes: genetic algorithms to discover conjectures about directed and undirected graphs","date":"2013-04-30","arxiv_id":"1304.7993","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-definition-of-a-confounder","title":"On the definition of a confounder","date":"2013-04-02","arxiv_id":"1304.0564","repositories_listed":0,"syntology":null},{"url":null,"slug":"local-and-global-asymptotic-inference-in","title":"Local and global asymptotic inference in smoothing spline models","date":"2012-12-30","arxiv_id":"1212.6788","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-classification-in-sparse-gaussian","title":"Optimal classification in sparse Gaussian graphic model","date":"2012-12-21","arxiv_id":"1212.5332","repositories_listed":0,"syntology":null},{"url":null,"slug":"permutation-complexity-bound-on-out-sample","title":"Permutation Complexity Bound on Out-Sample Error","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"18e516fc405e9361a741851d4096cc8259ca318ef198aa2d0abd41e26f1f5ef7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}