{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:BCKTJTTLT7XFR3457GNLSHWYJT","short_pith_number":"pith:BCKTJTTL","schema_version":"1.0","canonical_sha256":"089534ce6b9fee58ef9df99ab91ed84ccadb74c555068ba4bddee16309980059","source":{"kind":"arxiv","id":"1401.6011","version":1},"attestation_state":"computed","paper":{"title":"A Near-Optimal Algorithm for Computing Real Roots of Sparse Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.SC","math.NA"],"primary_cat":"cs.NA","authors_text":"Michael Sagraloff","submitted_at":"2014-01-23T15:43:06Z","abstract_excerpt":"Let $p\\in\\mathbb{Z}[x]$ be an arbitrary polynomial of degree $n$ with $k$ non-zero integer coefficients of absolute value less than $2^\\tau$. In this paper, we answer the open question whether the real roots of $p$ can be computed with a number of arithmetic operations over the rational numbers that is polynomial in the input size of the sparse representation of $p$. More precisely, we give a deterministic, complete, and certified algorithm that determines isolating intervals for all real roots of $p$ with $O(k^3\\cdot\\log(n\\tau)\\cdot \\log n)$ many exact arithmetic operations over the rational "},"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":"1401.6011","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2014-01-23T15:43:06Z","cross_cats_sorted":["cs.CC","cs.SC","math.NA"],"title_canon_sha256":"b1faef898d684e27c5a52ec54e592bb2d7e350379c6cdd6c7bb3fa6ff04cd21f","abstract_canon_sha256":"3dcc57d804c46c99d7409a970f0cafd16f60576f17a1bd34f04a7520ea7244f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:23.131976Z","signature_b64":"9e8T973ZMjn56xDaO+ydtyJmP38Y1tqTAE2axLfCA26hg9nCpHEHJyCWtr3bxN/5vqQ7N1d0jDDBW1UWBUc7Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"089534ce6b9fee58ef9df99ab91ed84ccadb74c555068ba4bddee16309980059","last_reissued_at":"2026-05-18T03:01:23.131161Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:23.131161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Near-Optimal Algorithm for Computing Real Roots of Sparse Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.SC","math.NA"],"primary_cat":"cs.NA","authors_text":"Michael Sagraloff","submitted_at":"2014-01-23T15:43:06Z","abstract_excerpt":"Let $p\\in\\mathbb{Z}[x]$ be an arbitrary polynomial of degree $n$ with $k$ non-zero integer coefficients of absolute value less than $2^\\tau$. In this paper, we answer the open question whether the real roots of $p$ can be computed with a number of arithmetic operations over the rational numbers that is polynomial in the input size of the sparse representation of $p$. More precisely, we give a deterministic, complete, and certified algorithm that determines isolating intervals for all real roots of $p$ with $O(k^3\\cdot\\log(n\\tau)\\cdot \\log n)$ many exact arithmetic operations over the rational "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6011","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":"1401.6011","created_at":"2026-05-18T03:01:23.131296+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.6011v1","created_at":"2026-05-18T03:01:23.131296+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6011","created_at":"2026-05-18T03:01:23.131296+00:00"},{"alias_kind":"pith_short_12","alias_value":"BCKTJTTLT7XF","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"BCKTJTTLT7XFR345","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"BCKTJTTL","created_at":"2026-05-18T12:28:22.404517+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/BCKTJTTLT7XFR3457GNLSHWYJT","json":"https://pith.science/pith/BCKTJTTLT7XFR3457GNLSHWYJT.json","graph_json":"https://pith.science/api/pith-number/BCKTJTTLT7XFR3457GNLSHWYJT/graph.json","events_json":"https://pith.science/api/pith-number/BCKTJTTLT7XFR3457GNLSHWYJT/events.json","paper":"https://pith.science/paper/BCKTJTTL"},"agent_actions":{"view_html":"https://pith.science/pith/BCKTJTTLT7XFR3457GNLSHWYJT","download_json":"https://pith.science/pith/BCKTJTTLT7XFR3457GNLSHWYJT.json","view_paper":"https://pith.science/paper/BCKTJTTL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.6011&json=true","fetch_graph":"https://pith.science/api/pith-number/BCKTJTTLT7XFR3457GNLSHWYJT/graph.json","fetch_events":"https://pith.science/api/pith-number/BCKTJTTLT7XFR3457GNLSHWYJT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BCKTJTTLT7XFR3457GNLSHWYJT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BCKTJTTLT7XFR3457GNLSHWYJT/action/storage_attestation","attest_author":"https://pith.science/pith/BCKTJTTLT7XFR3457GNLSHWYJT/action/author_attestation","sign_citation":"https://pith.science/pith/BCKTJTTLT7XFR3457GNLSHWYJT/action/citation_signature","submit_replication":"https://pith.science/pith/BCKTJTTLT7XFR3457GNLSHWYJT/action/replication_record"}},"created_at":"2026-05-18T03:01:23.131296+00:00","updated_at":"2026-05-18T03:01:23.131296+00:00"}