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

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

High impact62 DOIs

Add license metadata to 60 records

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

High impact60 DOIs

Attach ORCID iDs across 49 articles

ORCID iDs strengthen author disambiguation and institutional reporting.

High impact49 DOIs

DOIs for this ISSN

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

#	Title	Missing	Priority	Citations
1	An improved procedure for colouring graphs of bounded local… (10.19086/aic.2022.7)	Abstract References ORCID License	95.42	8
2	Separating the edges of a graph by a linear number of paths (10.19086/aic.2023.6)	Abstract References ORCID License	90.31	7
3	Robust (rainbow) subdivisions and simplicial cycle (10.19086/aic.2024.1)	Abstract References ORCID License	90.31	7
4	An aperiodic set of 11 Wang tiles (10.19086/aic.18614)	References ORCID License	88.21	14
5	Random Reed-Solomon codes achieve list-decoding capacity wit… (10.19086/aic.2025.8)	Abstract References ORCID License	69.90	4
6	Induced subgraphs and tree decompositions XIII. Basic obstru… (10.19086/aic.2024.6)	Abstract References ORCID License	60.21	3
7	Planar graphs have bounded nonrepetitive chromatic number (10.19086/aic.12100)	References License	57.31	13
8	Upper density of monochromatic infinite paths (10.19086/aic.10810)	References ORCID License	52.42	4
9	The maximum number of triangles in a graph of given maximum… (10.19086/aic.16788)	References ORCID License	52.42	4
10	Box and Segment Intersection Graphs with Large Girth and Chr… (10.19086/aic.25431)	References ORCID License	52.42	4
11	Ramsey goodness of books revisited (10.19086/aic.2023.4)	Abstract References ORCID License	47.71	2
12	Big Ramsey degrees and infinite languages (10.19086/aic.2024.4)	Abstract References ORCID License	47.71	2
13	Improved Bounds for Centered Colorings (10.19086/aic.27351)	References License	47.71	8
14	Exact stability for Turán’s Theorem (10.19086/aic.31079)	References License	47.71	8
15	The Bandwidth Theorem in sparse graphs (10.19086/aic.12849)	References ORCID License	45.15	3
16	Transversal factors and spanning trees (10.19086/aic.2022.3)	References ORCID	45.15	7
17	The number of partial Steiner systems and d-partitions (10.19086/aic.32563)	References ORCID License	45.15	3
18	A tight Erdős-Pósa function for planar minors (10.19086/aic.10807)	References License	38.91	5
19	A rainbow version of Mantel's Theorem (10.19086/aic.12043)	References License	38.91	5
20	Graphs of bounded cliquewidth are polynomially $χ$-bounded (10.19086/aic.13668)	References ORCID License	35.78	2
21	Unitary signings and induced subgraphs of Cayley graphs of $… (10.19086/aic.17912)	References ORCID License	35.78	2
22	Induced subgraphs and tree decompositions III. Three-path-co… (10.19086/aic.2022.6)	References ORCID License	35.78	2
23	The size-Ramsey number of 3-uniform tight paths (10.19086/aic.24581)	References ORCID License	35.78	2
24	The Ramsey number of books (10.19086/aic.10808)	References License	30.10	3
25	Improved bounds for the Erdős-Rogers function (10.19086/aic.12048)	References License	30.10	3
26	Ramsey multiplicity and the Turán coloring (10.19086/aic.2023.2)	Abstract References ORCID License	30.10	1
27	The sparse parity matrix (10.19086/aic.2023.5)	Abstract References ORCID License	30.10	1
28	Balanced supersaturation and Turán numbers in random graphs (10.19086/aic.2024.3)	Abstract References ORCID License	30.10	1
29	On polynomial degree-boundedness (10.19086/aic.2024.5)	Abstract References ORCID License	30.10	1
30	Romain Bourneuf and Stéphan Thomassé: Bounded twin-width gra… (10.19086/aic.2025.2)	Abstract References ORCID License	30.10	1
31	Homomorphism Tensors and Linear Equations (10.19086/aic.2025.4)	Abstract References ORCID License	30.10	1
32	Cycle Lengths Modulo k in Large 3-connected Cubic Graphs, Ad… (10.19086/aic.18971)	References License	23.86	2
33	A 4-choosable graph that is not (8:2)-choosable (10.19086/aic.10811)	References ORCID License	22.58	1
34	Tight paths in convex geometric hypergraphs (10.19086/aic.12044)	References ORCID License	22.58	1
35	A completion of the proof of the Edge-statistics Conjecture (10.19086/aic.12047)	References ORCID License	22.58	1
36	Large independent sets in triangle-free cubic graphs: beyond… (10.19086/aic.13667)	References ORCID License	22.58	1
37	Local Girth Choosability of Planar Graphs (10.19086/aic.2022.8)	References ORCID License	22.58	1
38	Rational Exponents Near Two (10.19086/aic.2022.9)	References ORCID License	22.58	1
39	Tight Ramsey Bounds for Multiple Copies of a Graph (10.19086/aic.2023.1)	References ORCID License	22.58	1
40	Anticoncentration versus the Number of Subset Sums (10.19086/aic.24872)	References ORCID License	22.58	1
41	The Structure of Binary Matroids with no Induced Claw or Fan… (10.19086/aic.10256)	References ORCID License	0.00	0
42	Tangles are Decided by Weighted Vertex Sets (10.19086/aic.13691)	References License	0.00	0
43	On Partitioning the Edges of an Infinite Digraph into Direct… (10.19086/aic.18702)	References ORCID License	0.00	0
44	Leaper Tours (10.19086/aic.2022.4)	References ORCID	0.00	0
45	Towards a Hypergraph version of the Pósa–Seymour Conjecture (10.19086/aic.2023.3)	Abstract References ORCID License	0.00	0
46	There are only a finite number of excluded minors for the cl… (10.19086/aic.2023.7)	Abstract References ORCID License	0.00	0
47	The Kakeya Set conjecture over Z/NZ for general N (10.19086/aic.2024.2)	Abstract References ORCID License	0.00	0
48	Decomposing a Signed Graph into Rooted Circuits (10.19086/aic.2024.7)	Abstract References ORCID License	0.00	0
49	Convex polytopes in restricted point sets in R^d (10.19086/aic.2025)	Abstract References ORCID License	0.00	0
50	Convex polytopes in restricted point sets in R^d (10.19086/aic.2025.1)	Abstract References ORCID License	0.00	0