Health Score

0 Fair

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 80 records

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

High impact80 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 35 articles

ORCID iDs strengthen author disambiguation and institutional reporting.

Medium impact35 DOIs

DOIs for this ISSN

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

#	Title	Missing	Priority	Citations
1	A Refined Laser Method and Faster Matrix Multiplication (10.46298/theoretics.24.21)	References License	60.21	15
2	Framework for $\exists \mathbb{R}$-Completeness of Two-Dimen… (10.46298/theoretics.24.11)	References ORCID License	52.42	4
3	Improved quantum data analysis (10.46298/theoretics.24.7)	References ORCID License	52.42	4
4	Fast Symbolic Algorithms for Omega-Regular Games under Stron… (10.46298/theoretics.23.4)	References ORCID	52.07	10
5	Conditional Dichotomy of Boolean Ordered Promise CSPs (10.46298/theoretics.23.2)	References ORCID	47.71	8
6	Characterizing Omega-Regularity through Finite-Memory Determ… (10.46298/theoretics.23.1)	References ORCID	38.91	5
7	All about unambiguous polynomial closure (10.46298/theoretics.23.11)	References License	38.91	5
8	Brooks' Theorem in Graph Streams: A Single-Pass Semi-Streami… (10.46298/theoretics.23.9)	References ORCID License	35.78	2
9	Constructing Deterministic Parity Automata from Positive and… (10.46298/theoretics.24.17)	References ORCID License	35.78	2
10	The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic… (10.46298/theoretics.24.22)	References ORCID License	35.78	2
11	DeepSec: Deciding Equivalence Properties for Security Protoc… (10.46298/theoretics.24.4)	References ORCID License	35.78	2
12	PPSZ is better than you think (10.46298/theoretics.24.5)	References ORCID License	35.78	2
13	Linear Hashing with $\ell_\infty$ guarantees and two-sided K… (10.46298/theoretics.24.8)	References ORCID License	35.78	2
14	Robustly Self-Ordered Graphs: Constructions and Applications… (10.46298/theoretics.22.1)	References ORCID	34.95	4
15	Fully Dynamic Connectivity in $O(\log n(\log\log n)^2)$ Amor… (10.46298/theoretics.23.6)	References ORCID	34.95	4
16	Boosting Simple Learners (10.46298/theoretics.23.8)	References ORCID	30.10	3
17	From Muller to Parity and Rabin Automata: Optimal Transforma… (10.46298/theoretics.24.12)	References ORCID	30.10	3
18	Approximate Distance Sensitivity Oracles in Subquadratic Spa… (10.46298/theoretics.24.15)	References License	30.10	3
19	Parameterized algorithms for block-structured integer progra… (10.46298/theoretics.25.15)	References License	30.10	3
20	On Classifying Continuous Constraint Satisfaction Problems (10.46298/theoretics.24.10)	References ORCID	23.86	2
21	Lasserre Hierarchy for Graph Isomorphism and Homomorphism In… (10.46298/theoretics.24.20)	References License	23.86	2
22	Quantum Money from Abelian Group Actions (10.46298/theoretics.25.18)	References License	23.86	2
23	On the Constant-Depth Circuit Complexity of Generating Quasi… (10.46298/theoretics.25.19)	References License	23.86	2
24	A simple polynomial-time approximation algorithm for the tot… (10.46298/theoretics.23.7)	References ORCID License	22.58	1
25	Spectral Independence via Stability and Applications to Hola… (10.46298/theoretics.24.16)	References ORCID License	22.58	1
26	Faster parameterized algorithms for modification problems to… (10.46298/theoretics.24.19)	References ORCID License	22.58	1
27	Optimal Algorithm for the Planar Two-Center Problem (10.46298/theoretics.24.23)	References ORCID License	22.58	1
28	Positivity-hardness results on Markov decision processes (10.46298/theoretics.24.9)	References ORCID License	22.58	1
29	Unifying the Three Algebraic Approaches to the CSP via Minim… (10.46298/theoretics.24.14)	References	17.47	4
30	PANDA: Query Evaluation in Submodular Width (10.46298/theoretics.25.12)	References	17.47	4
31	Perfect Matching in Random Graphs is as Hard as Tseitin (10.46298/theoretics.22.2)	References ORCID	15.05	1
32	The Complexity of Iterated Reversible Computation (10.46298/theoretics.23.10)	References ORCID	15.05	1
33	Testing Distributions of Huge Objects (10.46298/theoretics.23.12)	References ORCID	15.05	1
34	Characterizing Positionality in Games of Infinite Duration o… (10.46298/theoretics.23.3)	References ORCID	15.05	1
35	Orbit-Finite-Dimensional Vector Spaces and Weighted Register… (10.46298/theoretics.24.13)	References License	15.05	1
36	The Descriptive Complexity of Graph Neural Networks (10.46298/theoretics.24.25)	References License	15.05	1
37	Constructive Separations and Their Consequences (10.46298/theoretics.24.3)	References ORCID	15.05	1
38	A $4/3$ Approximation for $2$-Vertex-Connectivity (10.46298/theoretics.25.13)	References License	15.05	1
39	Minimizing Tardy Processing Time on a Single Machine in Near… (10.46298/theoretics.25.14)	References License	15.05	1
40	A Simple $(1-ε)$-Approximation Semi-Streaming Algorithm for… (10.46298/theoretics.25.16)	References License	15.05	1
41	Upper and Lower Bounds on the Smoothed Complexity of the Sim… (10.46298/theoretics.25.23)	References License	15.05	1
42	On Approximability of Steiner Tree in $\ell_p$-metrics (10.46298/theoretics.25.4)	References License	15.05	1
43	Exponential Resolution Lower Bounds for Weak Pigeonhole Prin… (10.46298/theoretics.25.9)	References License	15.05	1
44	Sparse juntas on the biased hypercube (10.46298/theoretics.24.18)	References	11.93	2
45	Learning Algorithms for Verification of Markov Decision Proc… (10.46298/theoretics.25.10)	References	7.53	1
46	A Robust Version of Heged\H{u}s's Lemma, with Applications (10.46298/theoretics.23.5)	References ORCID	0.00	0
47	Strongly Sublinear Algorithms for Testing Pattern Freeness (10.46298/theoretics.24.1)	References ORCID License	0.00	0
48	Realizable Learning is All You Need (10.46298/theoretics.24.2)	References ORCID	0.00	0
49	On complete classes of valuated matroids (10.46298/theoretics.24.24)	References License	0.00	0
50	An Enumerative Perspective on Connectivity (10.46298/theoretics.24.26)	References License	0.00	0