{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FIW2XUGYB2VZSBUGN4AFYFMG6W","short_pith_number":"pith:FIW2XUGY","schema_version":"1.0","canonical_sha256":"2a2dabd0d80eab9906866f005c1586f5941cf262fd407eec41ccbde2fae88004","source":{"kind":"arxiv","id":"1706.05410","version":1},"attestation_state":"computed","paper":{"title":"On approximate Gauss-Lucas theorems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CV","authors_text":"Trevor Richards","submitted_at":"2017-06-16T19:28:34Z","abstract_excerpt":"The Gauss--Lucas theorem states that any convex set $K\\subset\\mathbb{C}$ which contains all $n$ zeros of a degree $n$ polynomial $p\\in\\mathbb{C}[z]$ must also contain all $n-1$ critical points of $p$. In this paper we explore the following question: for which choices of positive integers $n$ and $k$, and positive real number $\\epsilon$, will it follow that for every degree $n$ polynomial $p$ with at least $k$ zeros lying in $K$, $p$ will have at least $k-1$ critical points lying in the $\\epsilon$-neighborhood of $K$. We supply an inequality relating $n$, $k$, and $\\epsilon$ which, when satisfi"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1706.05410","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CV","submitted_at":"2017-06-16T19:28:34Z","cross_cats_sorted":[],"title_canon_sha256":"3d3a34e93c19e3c5fd38f2c5907f33a8f222533442553b6ca9e7a430cac9e889","abstract_canon_sha256":"cfb6054c3e5553bedad1a9d847b4a6b74ee0b86ab6327aa6b26e21926c24f0f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:11.721696Z","signature_b64":"KJDY32Acz405eq/2QadsEnyeMYG6g8v5OP6seoZqDlDhb8PEsKzkUiUbibujnKi4Y4trAnfS0BkFXqZDMjBKAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a2dabd0d80eab9906866f005c1586f5941cf262fd407eec41ccbde2fae88004","last_reissued_at":"2026-05-18T00:42:11.721260Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:11.721260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On approximate Gauss-Lucas theorems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CV","authors_text":"Trevor Richards","submitted_at":"2017-06-16T19:28:34Z","abstract_excerpt":"The Gauss--Lucas theorem states that any convex set $K\\subset\\mathbb{C}$ which contains all $n$ zeros of a degree $n$ polynomial $p\\in\\mathbb{C}[z]$ must also contain all $n-1$ critical points of $p$. In this paper we explore the following question: for which choices of positive integers $n$ and $k$, and positive real number $\\epsilon$, will it follow that for every degree $n$ polynomial $p$ with at least $k$ zeros lying in $K$, $p$ will have at least $k-1$ critical points lying in the $\\epsilon$-neighborhood of $K$. We supply an inequality relating $n$, $k$, and $\\epsilon$ which, when satisfi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05410","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.05410","created_at":"2026-05-18T00:42:11.721323+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.05410v1","created_at":"2026-05-18T00:42:11.721323+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05410","created_at":"2026-05-18T00:42:11.721323+00:00"},{"alias_kind":"pith_short_12","alias_value":"FIW2XUGYB2VZ","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FIW2XUGYB2VZSBUG","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FIW2XUGY","created_at":"2026-05-18T12:31:15.632608+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FIW2XUGYB2VZSBUGN4AFYFMG6W","json":"https://pith.science/pith/FIW2XUGYB2VZSBUGN4AFYFMG6W.json","graph_json":"https://pith.science/api/pith-number/FIW2XUGYB2VZSBUGN4AFYFMG6W/graph.json","events_json":"https://pith.science/api/pith-number/FIW2XUGYB2VZSBUGN4AFYFMG6W/events.json","paper":"https://pith.science/paper/FIW2XUGY"},"agent_actions":{"view_html":"https://pith.science/pith/FIW2XUGYB2VZSBUGN4AFYFMG6W","download_json":"https://pith.science/pith/FIW2XUGYB2VZSBUGN4AFYFMG6W.json","view_paper":"https://pith.science/paper/FIW2XUGY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.05410&json=true","fetch_graph":"https://pith.science/api/pith-number/FIW2XUGYB2VZSBUGN4AFYFMG6W/graph.json","fetch_events":"https://pith.science/api/pith-number/FIW2XUGYB2VZSBUGN4AFYFMG6W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FIW2XUGYB2VZSBUGN4AFYFMG6W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FIW2XUGYB2VZSBUGN4AFYFMG6W/action/storage_attestation","attest_author":"https://pith.science/pith/FIW2XUGYB2VZSBUGN4AFYFMG6W/action/author_attestation","sign_citation":"https://pith.science/pith/FIW2XUGYB2VZSBUGN4AFYFMG6W/action/citation_signature","submit_replication":"https://pith.science/pith/FIW2XUGYB2VZSBUGN4AFYFMG6W/action/replication_record"}},"created_at":"2026-05-18T00:42:11.721323+00:00","updated_at":"2026-05-18T00:42:11.721323+00:00"}