{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:3H2VBN4IRADL6QUJNQJZ6ZE7SB","short_pith_number":"pith:3H2VBN4I","schema_version":"1.0","canonical_sha256":"d9f550b7888806bf42896c139f649f90438af6a6c822f324d8b184460614a8ce","source":{"kind":"arxiv","id":"1010.2006","version":2},"attestation_state":"computed","paper":{"title":"Improved complexity bounds for real root isolation using Continued Fractions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Elias Tsigaridas","submitted_at":"2010-10-11T06:02:43Z","abstract_excerpt":"We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a novel way to compute a lower bound on the positive real roots of univariate polynomials. This allows us to derive a worst case bound of $\\sOB(d^6 + d^4\\tau^2 + d^3\\tau^2)$ for isolating the real roots of a polynomial with integer coefficients using the classic variant \\cite{Akritas:implementation} of CF, where $d$ is the degree of the polynomial and $\\tau$ the maximum bitsize of its coefficients. This improves the pr"},"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":"1010.2006","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2010-10-11T06:02:43Z","cross_cats_sorted":[],"title_canon_sha256":"69919ad500da810aff854b698761eb84e4faba033ad7d141006482f0289c9ec7","abstract_canon_sha256":"56382cfae975a127af7aa2435662037f8d19f40c59560a9f4ce06331d842b359"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:24.897107Z","signature_b64":"ju+6vHAatwI2rs/Yisz2LlH5d64smavaCJv9L4h6xoYD9LIsj/2ZFpWFe3ZehrImxNyDq7W2QoCrbfZCMd9fCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9f550b7888806bf42896c139f649f90438af6a6c822f324d8b184460614a8ce","last_reissued_at":"2026-05-18T04:20:24.896483Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:24.896483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved complexity bounds for real root isolation using Continued Fractions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Elias Tsigaridas","submitted_at":"2010-10-11T06:02:43Z","abstract_excerpt":"We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a novel way to compute a lower bound on the positive real roots of univariate polynomials. This allows us to derive a worst case bound of $\\sOB(d^6 + d^4\\tau^2 + d^3\\tau^2)$ for isolating the real roots of a polynomial with integer coefficients using the classic variant \\cite{Akritas:implementation} of CF, where $d$ is the degree of the polynomial and $\\tau$ the maximum bitsize of its coefficients. This improves the pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.2006","kind":"arxiv","version":2},"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":"1010.2006","created_at":"2026-05-18T04:20:24.896594+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.2006v2","created_at":"2026-05-18T04:20:24.896594+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.2006","created_at":"2026-05-18T04:20:24.896594+00:00"},{"alias_kind":"pith_short_12","alias_value":"3H2VBN4IRADL","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"3H2VBN4IRADL6QUJ","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"3H2VBN4I","created_at":"2026-05-18T12:26:03.138858+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/3H2VBN4IRADL6QUJNQJZ6ZE7SB","json":"https://pith.science/pith/3H2VBN4IRADL6QUJNQJZ6ZE7SB.json","graph_json":"https://pith.science/api/pith-number/3H2VBN4IRADL6QUJNQJZ6ZE7SB/graph.json","events_json":"https://pith.science/api/pith-number/3H2VBN4IRADL6QUJNQJZ6ZE7SB/events.json","paper":"https://pith.science/paper/3H2VBN4I"},"agent_actions":{"view_html":"https://pith.science/pith/3H2VBN4IRADL6QUJNQJZ6ZE7SB","download_json":"https://pith.science/pith/3H2VBN4IRADL6QUJNQJZ6ZE7SB.json","view_paper":"https://pith.science/paper/3H2VBN4I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.2006&json=true","fetch_graph":"https://pith.science/api/pith-number/3H2VBN4IRADL6QUJNQJZ6ZE7SB/graph.json","fetch_events":"https://pith.science/api/pith-number/3H2VBN4IRADL6QUJNQJZ6ZE7SB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3H2VBN4IRADL6QUJNQJZ6ZE7SB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3H2VBN4IRADL6QUJNQJZ6ZE7SB/action/storage_attestation","attest_author":"https://pith.science/pith/3H2VBN4IRADL6QUJNQJZ6ZE7SB/action/author_attestation","sign_citation":"https://pith.science/pith/3H2VBN4IRADL6QUJNQJZ6ZE7SB/action/citation_signature","submit_replication":"https://pith.science/pith/3H2VBN4IRADL6QUJNQJZ6ZE7SB/action/replication_record"}},"created_at":"2026-05-18T04:20:24.896594+00:00","updated_at":"2026-05-18T04:20:24.896594+00:00"}