{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MJWDPZRGUSTAPBUJ5V7DEXIE4N","short_pith_number":"pith:MJWDPZRG","schema_version":"1.0","canonical_sha256":"626c37e626a4a6078689ed7e325d04e37a55e63a994b82fef49bd06ba506e2ff","source":{"kind":"arxiv","id":"1710.03214","version":1},"attestation_state":"computed","paper":{"title":"Discovering the roots: Uniform closure results for algebraic classes under factoring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Amit Sinhababu, Nitin Saxena, Pranjal Dutta","submitted_at":"2017-10-09T17:48:20Z","abstract_excerpt":"Newton iteration (NI) is an almost 350 years old recursive formula that approximates a simple root of a polynomial quite rapidly. We generalize it to a matrix recurrence (allRootsNI) that approximates all the roots simultaneously. In this form, the process yields a better circuit complexity in the case when the number of roots $r$ is small but the multiplicities are exponentially large. Our method sets up a linear system in $r$ unknowns and iteratively builds the roots as formal power series. For an algebraic circuit $f(x_1,\\ldots,x_n)$ of size $s$ we prove that each factor has size at most a "},"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":"1710.03214","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-10-09T17:48:20Z","cross_cats_sorted":[],"title_canon_sha256":"a11c2888f7e2e41ec397237654545dda2c4813d39dfb45d9fb8e42e27311e3fb","abstract_canon_sha256":"5783110447a10a22dea15aeb1f0288fdd5187084e313d53444ce47f4889f3057"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:26.729898Z","signature_b64":"I+3ND68aKsMwstDH0EKR16hyIfixFloZ3WFFg1h6ps9O7u/FzwU5p6uJl9RWJ5dHn6dyOcnQv1bcEZLWvgsjAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"626c37e626a4a6078689ed7e325d04e37a55e63a994b82fef49bd06ba506e2ff","last_reissued_at":"2026-05-18T00:33:26.729084Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:26.729084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discovering the roots: Uniform closure results for algebraic classes under factoring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Amit Sinhababu, Nitin Saxena, Pranjal Dutta","submitted_at":"2017-10-09T17:48:20Z","abstract_excerpt":"Newton iteration (NI) is an almost 350 years old recursive formula that approximates a simple root of a polynomial quite rapidly. We generalize it to a matrix recurrence (allRootsNI) that approximates all the roots simultaneously. In this form, the process yields a better circuit complexity in the case when the number of roots $r$ is small but the multiplicities are exponentially large. Our method sets up a linear system in $r$ unknowns and iteratively builds the roots as formal power series. For an algebraic circuit $f(x_1,\\ldots,x_n)$ of size $s$ we prove that each factor has size at most a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03214","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":"1710.03214","created_at":"2026-05-18T00:33:26.729222+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.03214v1","created_at":"2026-05-18T00:33:26.729222+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03214","created_at":"2026-05-18T00:33:26.729222+00:00"},{"alias_kind":"pith_short_12","alias_value":"MJWDPZRGUSTA","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MJWDPZRGUSTAPBUJ","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MJWDPZRG","created_at":"2026-05-18T12:31:31.346846+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/MJWDPZRGUSTAPBUJ5V7DEXIE4N","json":"https://pith.science/pith/MJWDPZRGUSTAPBUJ5V7DEXIE4N.json","graph_json":"https://pith.science/api/pith-number/MJWDPZRGUSTAPBUJ5V7DEXIE4N/graph.json","events_json":"https://pith.science/api/pith-number/MJWDPZRGUSTAPBUJ5V7DEXIE4N/events.json","paper":"https://pith.science/paper/MJWDPZRG"},"agent_actions":{"view_html":"https://pith.science/pith/MJWDPZRGUSTAPBUJ5V7DEXIE4N","download_json":"https://pith.science/pith/MJWDPZRGUSTAPBUJ5V7DEXIE4N.json","view_paper":"https://pith.science/paper/MJWDPZRG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.03214&json=true","fetch_graph":"https://pith.science/api/pith-number/MJWDPZRGUSTAPBUJ5V7DEXIE4N/graph.json","fetch_events":"https://pith.science/api/pith-number/MJWDPZRGUSTAPBUJ5V7DEXIE4N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MJWDPZRGUSTAPBUJ5V7DEXIE4N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MJWDPZRGUSTAPBUJ5V7DEXIE4N/action/storage_attestation","attest_author":"https://pith.science/pith/MJWDPZRGUSTAPBUJ5V7DEXIE4N/action/author_attestation","sign_citation":"https://pith.science/pith/MJWDPZRGUSTAPBUJ5V7DEXIE4N/action/citation_signature","submit_replication":"https://pith.science/pith/MJWDPZRGUSTAPBUJ5V7DEXIE4N/action/replication_record"}},"created_at":"2026-05-18T00:33:26.729222+00:00","updated_at":"2026-05-18T00:33:26.729222+00:00"}