{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:43YPT5AA3RH6XA644Q5PCRX3DX","short_pith_number":"pith:43YPT5AA","schema_version":"1.0","canonical_sha256":"e6f0f9f400dc4feb83dce43af146fb1dddc4b47b62e579fef9f771c50eac39dc","source":{"kind":"arxiv","id":"2106.02505","version":4},"attestation_state":"computed","paper":{"title":"New data structure for univariate polynomial approximation and applications to root isolation, numerical multipoint evaluation, and other problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.SC","authors_text":"Guillaume Moroz (GAMBLE)","submitted_at":"2021-06-04T14:20:05Z","abstract_excerpt":"We present a new data structure to approximate accurately and efficiently a polynomial $f$ of degree $d$ given as a list of coefficients.  Its properties allow us to improve the state-of-the-art bounds on the bit complexity for the problems of root isolation and approximate multipoint evaluation. This data structure also leads to a new geometric criterion to detect ill-conditioned polynomials, implying notably that the standard condition number of the zeros of a polynomial is at least exponential in the number of roots of modulus less than $1/2$ or greater than $2$.Given a polynomial $f$ of de"},"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":"2106.02505","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2021-06-04T14:20:05Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"7c5eb978f0680229b68fa0914492a119d02ab80072d19eedbff228702e7b5a34","abstract_canon_sha256":"ee41e3a81c408fe04fdd87e749c69b0a47f11244235fbb0874df7b7e96a6763a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:35:49.675430Z","signature_b64":"mEuwQlOnxU+BHQsc5RxXzyqIYlbrhA5BLyNOWj9y02WfXtHTSPCgs3yGeNFA2QTPavGpCbmjRn9R+LCWwMQiAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6f0f9f400dc4feb83dce43af146fb1dddc4b47b62e579fef9f771c50eac39dc","last_reissued_at":"2026-07-05T03:35:49.674938Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:35:49.674938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New data structure for univariate polynomial approximation and applications to root isolation, numerical multipoint evaluation, and other problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.SC","authors_text":"Guillaume Moroz (GAMBLE)","submitted_at":"2021-06-04T14:20:05Z","abstract_excerpt":"We present a new data structure to approximate accurately and efficiently a polynomial $f$ of degree $d$ given as a list of coefficients.  Its properties allow us to improve the state-of-the-art bounds on the bit complexity for the problems of root isolation and approximate multipoint evaluation. This data structure also leads to a new geometric criterion to detect ill-conditioned polynomials, implying notably that the standard condition number of the zeros of a polynomial is at least exponential in the number of roots of modulus less than $1/2$ or greater than $2$.Given a polynomial $f$ of de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.02505","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2106.02505/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2106.02505","created_at":"2026-07-05T03:35:49.674994+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.02505v4","created_at":"2026-07-05T03:35:49.674994+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.02505","created_at":"2026-07-05T03:35:49.674994+00:00"},{"alias_kind":"pith_short_12","alias_value":"43YPT5AA3RH6","created_at":"2026-07-05T03:35:49.674994+00:00"},{"alias_kind":"pith_short_16","alias_value":"43YPT5AA3RH6XA64","created_at":"2026-07-05T03:35:49.674994+00:00"},{"alias_kind":"pith_short_8","alias_value":"43YPT5AA","created_at":"2026-07-05T03:35:49.674994+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.04436","citing_title":"Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms","ref_index":39,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/43YPT5AA3RH6XA644Q5PCRX3DX","json":"https://pith.science/pith/43YPT5AA3RH6XA644Q5PCRX3DX.json","graph_json":"https://pith.science/api/pith-number/43YPT5AA3RH6XA644Q5PCRX3DX/graph.json","events_json":"https://pith.science/api/pith-number/43YPT5AA3RH6XA644Q5PCRX3DX/events.json","paper":"https://pith.science/paper/43YPT5AA"},"agent_actions":{"view_html":"https://pith.science/pith/43YPT5AA3RH6XA644Q5PCRX3DX","download_json":"https://pith.science/pith/43YPT5AA3RH6XA644Q5PCRX3DX.json","view_paper":"https://pith.science/paper/43YPT5AA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.02505&json=true","fetch_graph":"https://pith.science/api/pith-number/43YPT5AA3RH6XA644Q5PCRX3DX/graph.json","fetch_events":"https://pith.science/api/pith-number/43YPT5AA3RH6XA644Q5PCRX3DX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/43YPT5AA3RH6XA644Q5PCRX3DX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/43YPT5AA3RH6XA644Q5PCRX3DX/action/storage_attestation","attest_author":"https://pith.science/pith/43YPT5AA3RH6XA644Q5PCRX3DX/action/author_attestation","sign_citation":"https://pith.science/pith/43YPT5AA3RH6XA644Q5PCRX3DX/action/citation_signature","submit_replication":"https://pith.science/pith/43YPT5AA3RH6XA644Q5PCRX3DX/action/replication_record"}},"created_at":"2026-07-05T03:35:49.674994+00:00","updated_at":"2026-07-05T03:35:49.674994+00:00"}