{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:33KUQCVATDYRMDQZCZJ7OHIWIO","short_pith_number":"pith:33KUQCVA","schema_version":"1.0","canonical_sha256":"ded5480aa098f1160e191653f71d1643a71f7636cc4ce12435b2fdca2ab10d2f","source":{"kind":"arxiv","id":"1811.11093","version":1},"attestation_state":"computed","paper":{"title":"Counting Polynomial Roots in Isabelle/HOL: A Formal Proof of the Budan-Fourier Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Lawrence C. Paulson, Wenda Li","submitted_at":"2018-11-27T16:48:52Z","abstract_excerpt":"Many problems in computer algebra and numerical analysis can be reduced to counting or approximating the real roots of a polynomial within an interval. Existing verified root-counting procedures in major proof assistants are mainly based on the classical Sturm theorem, which only counts distinct roots.\n  In this paper, we have strengthened the root-counting ability in Isabelle/HOL by first formally proving the Budan-Fourier theorem. Subsequently, based on Descartes' rule of signs and Taylor shift, we have provided a verified procedure to efficiently over-approximate the number of real roots wi"},"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":"1811.11093","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-11-27T16:48:52Z","cross_cats_sorted":[],"title_canon_sha256":"b338f0d96119f1ead1fc64b2ba70fcd06c716c609c2303b178c1ada32cdbccfd","abstract_canon_sha256":"2dcf81975f58f10ce5a6ba01253980510bf92a835e55ae830dafbf791f59e6e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:45.283151Z","signature_b64":"P93kSWyuDOEKg76q485TntfgZWEkP7MsejfF7EVRhzltAWX4xbbHLj/88nEAtMqrbffVCTfSqcVWzZMTL92HAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ded5480aa098f1160e191653f71d1643a71f7636cc4ce12435b2fdca2ab10d2f","last_reissued_at":"2026-05-17T23:59:45.282640Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:45.282640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting Polynomial Roots in Isabelle/HOL: A Formal Proof of the Budan-Fourier Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Lawrence C. Paulson, Wenda Li","submitted_at":"2018-11-27T16:48:52Z","abstract_excerpt":"Many problems in computer algebra and numerical analysis can be reduced to counting or approximating the real roots of a polynomial within an interval. Existing verified root-counting procedures in major proof assistants are mainly based on the classical Sturm theorem, which only counts distinct roots.\n  In this paper, we have strengthened the root-counting ability in Isabelle/HOL by first formally proving the Budan-Fourier theorem. Subsequently, based on Descartes' rule of signs and Taylor shift, we have provided a verified procedure to efficiently over-approximate the number of real roots wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11093","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":"1811.11093","created_at":"2026-05-17T23:59:45.282724+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.11093v1","created_at":"2026-05-17T23:59:45.282724+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11093","created_at":"2026-05-17T23:59:45.282724+00:00"},{"alias_kind":"pith_short_12","alias_value":"33KUQCVATDYR","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"33KUQCVATDYRMDQZ","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"33KUQCVA","created_at":"2026-05-18T12:32:02.567920+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/33KUQCVATDYRMDQZCZJ7OHIWIO","json":"https://pith.science/pith/33KUQCVATDYRMDQZCZJ7OHIWIO.json","graph_json":"https://pith.science/api/pith-number/33KUQCVATDYRMDQZCZJ7OHIWIO/graph.json","events_json":"https://pith.science/api/pith-number/33KUQCVATDYRMDQZCZJ7OHIWIO/events.json","paper":"https://pith.science/paper/33KUQCVA"},"agent_actions":{"view_html":"https://pith.science/pith/33KUQCVATDYRMDQZCZJ7OHIWIO","download_json":"https://pith.science/pith/33KUQCVATDYRMDQZCZJ7OHIWIO.json","view_paper":"https://pith.science/paper/33KUQCVA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.11093&json=true","fetch_graph":"https://pith.science/api/pith-number/33KUQCVATDYRMDQZCZJ7OHIWIO/graph.json","fetch_events":"https://pith.science/api/pith-number/33KUQCVATDYRMDQZCZJ7OHIWIO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/33KUQCVATDYRMDQZCZJ7OHIWIO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/33KUQCVATDYRMDQZCZJ7OHIWIO/action/storage_attestation","attest_author":"https://pith.science/pith/33KUQCVATDYRMDQZCZJ7OHIWIO/action/author_attestation","sign_citation":"https://pith.science/pith/33KUQCVATDYRMDQZCZJ7OHIWIO/action/citation_signature","submit_replication":"https://pith.science/pith/33KUQCVATDYRMDQZCZJ7OHIWIO/action/replication_record"}},"created_at":"2026-05-17T23:59:45.282724+00:00","updated_at":"2026-05-17T23:59:45.282724+00:00"}