{"schema_version":"source-reader-v1","record":{"source_id":"sendov-tao-large-degree","versions":[{"work":{"authors":["Terence Tao"],"kind":"research_paper","publication":"published","publication_note":"Acta Mathematica 229 (2022), 347–392, DOI 10.4310/acta.2022.v229.n2.a3 checked against Crossref; arXiv v2 pinned by content hash.","ai_role":"not_reported","ai_note":"No AI contribution is asserted by this source record.","artifacts":[],"published":{"value":"2022"}},"id":"sendov-conjecture:source:tao-large:v1","source_id":"sendov-tao-large-degree","title":"Sendov’s conjecture for sufficiently high degree polynomials","owner":"Terence Tao","url":"https://arxiv.org/abs/2012.04125v2","subject_scope":"Sendov’s conjecture for all sufficiently large degree, with the low-degree history.","revision":"arxiv-2012.04125v2","content_sha256":"d177cb5218a7e06ceea374d5e04fa8e39332c666ca832a4102b2dff2c570687e","update_method":"Source comparison followed by a new immutable curation revision.","identifier_policy":"Stable source and entry identities; changed wording receives a new version.","observed_on":"2026-10-21","source_updated_on":"2026-08-12","rights":"metadata-link","license":"Original document rights remain with its authors.","terms_url":"https://arxiv.org/abs/2012.04125v2","attribution":"Terence Tao","rights_note":"OpenMath supplies original paraphrases and links; no proof text is republished.","check_interval_days":90}],"entries":[{"id":"sendov-conjecture:entry:tao-large:v1","source_version_id":"sendov-conjecture:source:tao-large:v1","item_id":"theorem-1.2","url":"https://arxiv.org/abs/2012.04125v2","wording":"Tao proves that there is an absolute constant n₀ such that Sendov’s conjecture holds for every degree n ≥ n₀; the compactness argument gives no explicit n₀.","wording_kind":"paraphrase","locator":"Abstract; Theorem 1.2","supersedes":null},{"id":"sendov-conjecture:entry:tao-small:v1","source_version_id":"sendov-conjecture:source:tao-large:v1","item_id":"introduction-low-degree","url":"https://arxiv.org/abs/2012.04125v2","wording":"The introduction records that the conjecture is known for all n < 9, citing Brown and Xiang’s proof for polynomials of degree at most eight.","wording_kind":"paraphrase","locator":"§1, before Theorem 1.2; reference [1]","supersedes":null}],"problems":[{"slug":"sendov-conjecture","title":"Sendov’s conjecture","publication_version":8}],"selected_version_id":"sendov-conjecture:source:tao-large:v1","available_versions":[{"id":"sendov-conjecture:source:tao-large:v1","revision":"arxiv-2012.04125v2","observed_on":"2026-10-21","title":"Sendov’s conjecture for sufficiently high degree polynomials","publication":"published","content_sha256":"d177cb5218a7e06ceea374d5e04fa8e39332c666ca832a4102b2dff2c570687e","used_in_current_publications":true}],"usages":[{"id":"source-use-b7d6799b17f9c48bc35f","entry_id":"sendov-conjecture:entry:tao-large:v1","problem":{"slug":"sendov-conjecture","title":"Sendov’s conjecture","publication_version":8},"kind":"assessment","title":"Sendov for n ≥ n₀","claim":{"id":"claim-sendov-large-degree","version":1,"slug":"sendov-large-degree","title":"Sendov for all sufficiently large degree"},"fragment":"claim-sendov-large-degree","assessment":{"id":"sendov-conjecture:report:large-degree:v1","entry_id":"sendov-conjecture:entry:tao-large:v1","state":"resolved","source_label":"Sendov for n ≥ n₀","scope":"Only the exact statement and passage cited here; not an independent OpenMath assessment.","source_date":null,"observed_on":"2026-10-21","evidence_url":"https://arxiv.org/abs/2012.04125v2","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-f67469a0fc39b2e8188f","entry_id":"sendov-conjecture:entry:tao-large:v1","problem":{"slug":"sendov-conjecture","title":"Sendov’s conjecture","publication_version":8},"kind":"question","title":"Sendov’s conjecture","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-eebd71a70f216ce0ef5f","entry_id":"sendov-conjecture:entry:tao-large:v1","problem":{"slug":"sendov-conjecture","title":"Sendov’s conjecture","publication_version":8},"kind":"statement","title":"Sendov for all sufficiently large degree","claim":{"id":"claim-sendov-large-degree","version":1,"slug":"sendov-large-degree","title":"Sendov for all sufficiently large degree"},"fragment":"claim-sendov-large-degree","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-88115780a13633bef0bd","entry_id":"sendov-conjecture:entry:tao-small:v1","problem":{"slug":"sendov-conjecture","title":"Sendov’s conjecture","publication_version":8},"kind":"assessment","title":"Known for n < 9","claim":{"id":"claim-sendov-low-degree","version":1,"slug":"sendov-low-degree","title":"Sendov for degree at most eight"},"fragment":"claim-sendov-low-degree","assessment":{"id":"sendov-conjecture:report:low-degree:v1","entry_id":"sendov-conjecture:entry:tao-small:v1","state":"resolved","source_label":"Known for n < 9","scope":"Only the exact statement and passage cited here; not an independent OpenMath assessment.","source_date":null,"observed_on":"2026-10-21","evidence_url":"https://arxiv.org/abs/2012.04125v2","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-b723cb3e5755469d2ef9","entry_id":"sendov-conjecture:entry:tao-small:v1","problem":{"slug":"sendov-conjecture","title":"Sendov’s conjecture","publication_version":8},"kind":"question","title":"Sendov’s conjecture","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-eb79b40e38540b254bcc","entry_id":"sendov-conjecture:entry:tao-small:v1","problem":{"slug":"sendov-conjecture","title":"Sendov’s conjecture","publication_version":8},"kind":"statement","title":"Sendov for degree at most eight","claim":{"id":"claim-sendov-low-degree","version":1,"slug":"sendov-low-degree","title":"Sendov for degree at most eight"},"fragment":"claim-sendov-low-degree","assessment":null,"superseded":false,"formalization":null,"update":null}],"linked_entries":[],"linked_sources":[]}}