Health Score

0 Poor

Metadata coverage

Abstract

ORCID

References

License

Extended metadata coverage

Informational — signals of interoperability and funding across the corpus. Not part of the health score.

Funding

Funder

Award / grant

Affiliation & institutional identifiers

Affiliation

ROR ID

Update policy

Your prioritized action plan

Ordered by how many DOIs each fix touches — start here, not with every error at once.

Deposit reference lists for 57 records

Deposited references power Crossref's Cited-by links between your articles and the literature.

High impact57 DOIs

Add license metadata to 57 records

License metadata tells indexers and readers how each article may be reused.

High impact57 DOIs

Attach ORCID iDs across 37 articles

ORCID iDs strengthen author disambiguation and institutional reporting.

High impact37 DOIs

DOIs for this ISSN

Showing the top 5 of 56 DOIs, ordered by correction priority.

#	Title	Missing	Priority	Citations
1	On statistical Calderón problems (10.4171/msl/14)	References ORCID License	120.15	39
2	Optimal rates of estimation for multi-reference alignment (10.4171/msl/11)	References ORCID License	111.85	30
3	Optimal low-degree hardness of maximum independent set (10.4171/msl/25)	References ORCID License	106.12	25
4	Multiscale sparse microcanonical models (10.4171/msl/7)	References ORCID License	106.12	25
5	Compressive statistical learning with random feature moments (10.4171/msl/20)	References ORCID License	90.31	15
6	Randomly initialized EM algorithm for two-component Gaussian… (10.4171/msl/29)	References ORCID License	90.31	15
7	Statistical learning guarantees for compressive clustering a… (10.4171/msl/21)	References ORCID License	85.96	13
8	The all-or-nothing phenomenon in sparse linear regression (10.4171/msl/22)	References ORCID License	85.96	13
9	A rigorous framework for the mean field limit of multilayer… (10.4171/msl/42)	References ORCID License	85.96	13
10	Improved regret for zeroth-order adversarial bandit convex o… (10.4171/msl/17)	References ORCID License	83.55	12
11	Deep learning architectures for nonlinear operator functions… (10.4171/msl/28)	References ORCID License	83.55	12
12	The algorithmic hardness threshold for continuous random ene… (10.4171/msl/12)	References ORCID License	78.10	10
13	Near-optimality of linear recovery from indirect observation… (10.4171/msl/1-2-2)	References ORCID License	71.57	8
14	Second-order converses via reverse hypercontractivity (10.4171/msl/13)	References ORCID License	71.57	8
15	Non-backtracking spectra of weighted inhomogeneous random gr… (10.4171/msl/34)	References ORCID License	71.57	8
16	Group synchronization on grids (10.4171/msl/6)	References ORCID License	71.57	8
17	Partial recovery bounds for clustering with the relaxed $K$-… (10.4171/msl/8)	References License	69.01	23
18	Sample complexity of the distinct elements problem (10.4171/msl/1-1-2)	References ORCID License	67.73	7
19	The Le Cam distance between density estimation, Poisson proc… (10.4171/msl/1-2-1)	References ORCID License	67.73	7
20	Subpolynomial trace reconstruction for random strings and ar… (10.4171/msl/16)	References License	63.94	18
21	Application of the information-percolation method to reconst… (10.4171/msl/10)	References ORCID License	58.36	5
22	Optimal Kullback–Leibler aggregation in mixture density esti… (10.4171/msl/1-1-1)	References ORCID License	52.42	4
23	Adaptive estimation of nonparametric geometric graphs (10.4171/msl/15)	References ORCID License	52.42	4
24	AdaBoost and robust one-bit compressed sensing (10.4171/msl/31)	References ORCID License	52.42	4
25	The smoothed complexity of Frank–Wolfe methods via condition… (10.4171/msl/35)	References ORCID License	52.42	4
26	Distribution-free robust linear regression (10.4171/msl/27)	References License	47.71	8
27	Tensor denoising with trend filtering (10.4171/msl/26)	References ORCID License	45.15	3
28	Sharp local minimax rates for goodness-of-fit testing in mul… (10.4171/msl/32)	References License	42.25	6
29	U-statistics of growing order and sub-Gaussian mean estimato… (10.4171/msl/43)	References License	42.25	6
30	A nearest neighbor characterization of Lebesgue points in me… (10.4171/msl/19)	References ORCID License	35.78	2
31	Detecting a botnet in a network (10.4171/msl/23)	References ORCID License	35.78	2
32	Distributed function estimation: Adaptation using minimal co… (10.4171/msl/33)	References ORCID License	35.78	2
33	Estimating graph parameters with random walks (10.4171/msl/9)	References ORCID License	35.78	2
34	Optimal and instance-dependent guarantees for Markovian line… (10.4171/msl/44)	References License	30.10	3
35	Statistically optimal robust mean and covariance estimation… (10.4171/msl/48)	References License	30.10	3
36	Convergence in total variation for the kinetic Langevin algo… (10.4171/msl/49)	References License	23.86	2
37	Structural adaptation in the density model (10.4171/msl/24)	References ORCID License	22.58	1
38	Deconvolution for some singular density errors via a combina… (10.4171/msl/36)	References ORCID License	22.58	1
39	Phase transitions for support recovery under local different… (10.4171/msl/37)	References ORCID License	22.58	1
40	Optimal anytime regret with two experts (10.4171/msl/38)	References ORCID License	22.58	1
41	Adversarial examples in random neural networks with general… (10.4171/msl/41)	References ORCID License	22.58	1
42	A multiscale cavity method for sublinear-rank symmetric matr… (10.4171/msl/57)	References License	15.05	1
43	Exploratory distributions for convex functions (10.4171/msl/1-1-3)	References ORCID License	0.00	0
44	Nonparametric adaptive inference of birth and death models i… (10.4171/msl/18)	References ORCID License	0.00	0
45	Aggregating estimates by convex optimization (10.4171/msl/30)	References ORCID License	0.00	0
46	Pattern reconstruction with restricted Boltzmann machines (10.4171/msl/45)	References License	0.00	0
47	Pair-matching: Link prediction with adaptive queries (10.4171/msl/46)	References License	0.00	0
48	A consistent estimator for confounding strength (10.4171/msl/47)	References License	0.00	0
49	Testing convex truncation (10.4171/msl/50)	References License	0.00	0
50	Counting stars is constant-degree optimal for detecting any… (10.4171/msl/51)	References License	0.00	0