{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:XHXIJ5J2QRJK72QOTDWRGBKL3O","short_pith_number":"pith:XHXIJ5J2","schema_version":"1.0","canonical_sha256":"b9ee84f53a8452afea0e98ed13054bdbbb54c5351e1fa6f3ad3e4dfaf9e15928","source":{"kind":"arxiv","id":"0903.3674","version":3},"attestation_state":"computed","paper":{"title":"Geometry of Polynomials and Root-Finding via Path-Lifting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"math.NA","authors_text":"Marco Martens, Myong-Hi Kim, Scott Sutherland","submitted_at":"2009-03-21T17:26:01Z","abstract_excerpt":"Using the interplay between topological, combinatorial, and geometric properties of polynomials and analytic results (primarily the covering structure and distortion estimates), we analyze a path-lifting method for finding approximate zeros, similar to those studied by Smale, Shub, Kim, and others. Given any polynomial, this simple algorithm always converges to a root, except on a finite set of initial points lying on a circle of a given radius.\n  Specifically, the algorithm we analyze consists of iterating $$z - \\frac{f(z)-t_kf(z_0)}{f'(z)}$$ where the $t_k$ form a decreasing sequence of real"},"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":"0903.3674","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2009-03-21T17:26:01Z","cross_cats_sorted":["math.DS"],"title_canon_sha256":"ca94b953f1f0326ac3314b270cc68fdaafc7c511e9d519c91d1eb7e837ef2b3b","abstract_canon_sha256":"414336169246ff74dcc4fb9607a5f4f5eefd313b29453c4074dfb8402d89265e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:47.689302Z","signature_b64":"F1rZNVru/4p6fYUhtj3/4ZerOdVWTxxklcrMNKj3PkTJdJ/mQ5vUqnvEPwmPZC9+AtGKiMnHfwdZuAWsyuVZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9ee84f53a8452afea0e98ed13054bdbbb54c5351e1fa6f3ad3e4dfaf9e15928","last_reissued_at":"2026-05-18T00:26:47.688619Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:47.688619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Geometry of Polynomials and Root-Finding via Path-Lifting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"math.NA","authors_text":"Marco Martens, Myong-Hi Kim, Scott Sutherland","submitted_at":"2009-03-21T17:26:01Z","abstract_excerpt":"Using the interplay between topological, combinatorial, and geometric properties of polynomials and analytic results (primarily the covering structure and distortion estimates), we analyze a path-lifting method for finding approximate zeros, similar to those studied by Smale, Shub, Kim, and others. Given any polynomial, this simple algorithm always converges to a root, except on a finite set of initial points lying on a circle of a given radius.\n  Specifically, the algorithm we analyze consists of iterating $$z - \\frac{f(z)-t_kf(z_0)}{f'(z)}$$ where the $t_k$ form a decreasing sequence of real"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.3674","kind":"arxiv","version":3},"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":"0903.3674","created_at":"2026-05-18T00:26:47.688744+00:00"},{"alias_kind":"arxiv_version","alias_value":"0903.3674v3","created_at":"2026-05-18T00:26:47.688744+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.3674","created_at":"2026-05-18T00:26:47.688744+00:00"},{"alias_kind":"pith_short_12","alias_value":"XHXIJ5J2QRJK","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_16","alias_value":"XHXIJ5J2QRJK72QO","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_8","alias_value":"XHXIJ5J2","created_at":"2026-05-18T12:26:02.257875+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/XHXIJ5J2QRJK72QOTDWRGBKL3O","json":"https://pith.science/pith/XHXIJ5J2QRJK72QOTDWRGBKL3O.json","graph_json":"https://pith.science/api/pith-number/XHXIJ5J2QRJK72QOTDWRGBKL3O/graph.json","events_json":"https://pith.science/api/pith-number/XHXIJ5J2QRJK72QOTDWRGBKL3O/events.json","paper":"https://pith.science/paper/XHXIJ5J2"},"agent_actions":{"view_html":"https://pith.science/pith/XHXIJ5J2QRJK72QOTDWRGBKL3O","download_json":"https://pith.science/pith/XHXIJ5J2QRJK72QOTDWRGBKL3O.json","view_paper":"https://pith.science/paper/XHXIJ5J2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0903.3674&json=true","fetch_graph":"https://pith.science/api/pith-number/XHXIJ5J2QRJK72QOTDWRGBKL3O/graph.json","fetch_events":"https://pith.science/api/pith-number/XHXIJ5J2QRJK72QOTDWRGBKL3O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XHXIJ5J2QRJK72QOTDWRGBKL3O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XHXIJ5J2QRJK72QOTDWRGBKL3O/action/storage_attestation","attest_author":"https://pith.science/pith/XHXIJ5J2QRJK72QOTDWRGBKL3O/action/author_attestation","sign_citation":"https://pith.science/pith/XHXIJ5J2QRJK72QOTDWRGBKL3O/action/citation_signature","submit_replication":"https://pith.science/pith/XHXIJ5J2QRJK72QOTDWRGBKL3O/action/replication_record"}},"created_at":"2026-05-18T00:26:47.688744+00:00","updated_at":"2026-05-18T00:26:47.688744+00:00"}