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.
On the maximal number of real embeddings of spatial minimally rigid
graphs
McKean-Vlasov diffusion and the well-posedness of the Hookean
bead-spring-chain model for dilute polymeric fluids: small-mass limit and
equilibration in momentum space
If you plan to formulate more than one problem all sharing the same background (e.g. they are all from the same paper) then please choose "Group", otherwise select "Single" option.
Social share