What is Problem Mining? This is a tool based on data of arXiv.org which periodically scans packets of full texts of papers hosted on arXiv and available through arXiv's bulk data access policy, with the aim to automatically detect papers containing discussions on open problems or conjectures. It then creates a list from the detected papers putting together papers' descriptive data and some short snippets extracted from the full texts displaying an information on open problems or conjectures presented in the paper. The papers appearing on this list are only references to the arXiv's versions and we do NOT store the actual papers (TeX sources or PDFs) on our servers. To read any of the papers in this list one needs to follow the arXiv link displayed on the papers' blocks.

You can search within the list using keywords, author names, and subject area. By a simple click of the Interesting button, you may anonymously indicate your interest in the problem. If you think the automatic extraction resulted in incorrect data, you may click on the False positive button instead. The Stats section shows the worldwide interest by our users on a specific problem.

  • Conspiratorial cosmology - the case against the Universe


    year of publication: 2013 arXiv

    • Cosmology and Nongalactic Astrophysics
    • Popular Physics
  • Infinitely imbalanced binomial regression and deformed exponential families


    year of publication: 2013 arXiv

    • Machine Learning
    • Statistics Theory

    MSC 2010: 62E20 62H30 62J12

  • Operators, Correlators and Free Fermions for SO(N) and Sp(N)


    year of publication: 2013 arXiv

  • A Full-Diversity Beamforming Scheme in Two-Way Amplified-and-Forward Relay Systems


    year of publication: 2013 arXiv

    • Information Theory
  • A multi-opinion evolving voter model with infinitely many phase transitions


    year of publication: 2013 arXiv

    • Adaptation and Self-Organizing Systems
    • Disordered Systems and Neural Networks
    • Physics and Society
    • Probability
    • Social and Information Networks
  • Approximate Inference for Observation Driven Time Series Models with Intractable Likelihoods


    year of publication: 2013 arXiv

    • Computation
  • Upper bounds for the number of resonances on geometrically finite hyperbolic manifolds


    year of publication: 2013 arXiv

    • Differential Geometry
    • Spectral Theory

    MSC 2010: 58J50

  • A problem of Erdos and Sos on 3-graphs


    year of publication: 2013 arXiv

    • Combinatorics
  • Latency-Bounded Target Set Selection in Social Networks


    year of publication: 2013 arXiv

    • Combinatorics
    • Data Structures and Algorithms
    • Social and Information Networks
  • Instantons in G2 manifolds from J-holomorphic curves in coassociative submanifolds


    year of publication: 2013 arXiv

    • Differential Geometry
    • Mathematical Physics
    • Symplectic Geometry

    MSC 2010: 53C07 53D40 81T30

  1. 1
  2. ...
  3. 210
  4. ...
  5. 272