Pith. sign in

REVIEW 2 cited by

Randomstrasse101: Open Problems of 2024

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2504.20539 v1 pith:CURP3GSX submitted 2025-04-29 math.PR cs.ITmath.COmath.ITmath.OCmath.STstat.TH

classification math.PRcs.ITmath.COmath.ITmath.OCmath.STstat.TH
keywords openproblemsrandomstrasse101blogtextttacademicaccessedcombinatorics
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

$\texttt{Randomstrasse101}$ is a blog dedicated to Open Problems in Mathematics, with a focus on Probability Theory, Computation, Combinatorics, Statistics, and related topics. This manuscript serves as a stable record of the Open Problems posted in 2024, with the goal of easing academic referencing. The blog can currently be accessed at $\texttt{randomstrasse101.math.ethz.ch}$.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Weak Poincar\'e Inequalities via Approximate Stochastic Localization: Application to Sampling the Sherrington-Kirkpatrick Model

    math.PR 2026-07 conditional novelty 7.0 of 10

    Approximate stochastic localization plus conductance transfers yield a weak Poincaré inequality for the SK model at β < 1/2, enabling efficient Glauber sampling from a warm start.

  2. A Smooth Computational Transition in Tensor PCA

    math.ST 2025-09 conditional novelty 7.0 of 10

    Counting 2-regular hypergraphs yields a polynomial-time tensor PCA algorithm that works at constant SNR and exhibits a smooth signal-to-runtime tradeoff.

Pith tools