{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:WU2X4BSUFMEZD2TJCW774DJHEH","short_pith_number":"pith:WU2X4BSU","schema_version":"1.0","canonical_sha256":"b5357e06542b0991ea6915bffe0d2721c49ca381aa189135993d9c6a5617d821","source":{"kind":"arxiv","id":"1201.6439","version":2},"attestation_state":"computed","paper":{"title":"A baby step-giant step roadmap algorithm for general algebraic sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC"],"primary_cat":"math.AG","authors_text":"\\'Eric Schost, Marie-Fran\\c{c}oise Roy, Mohab Safey El Din, Saugata Basu","submitted_at":"2012-01-31T04:37:58Z","abstract_excerpt":"Let $\\mathrm{R}$ be a real closed field and $\\mathrm{D} \\subset \\mathrm{R}$ an ordered domain. We give an algorithm that takes as input a polynomial $Q \\in \\mathrm{D}[X_1,\\ldots,X_k]$, and computes a description of a roadmap of the set of zeros, $\\mathrm{Zer}(Q,\\mathrm{R}^k)$, of $Q$ in $\\mathrm{R}^k$. The complexity of the algorithm, measured by the number of arithmetic operations in the ordered domain $\\mathrm{D}$, is bounded by $d^{O(k \\sqrt{k})}$, where $d = \\mathrm{deg}(Q)\\ge 2$. As a consequence, there exist algorithms for computing the number of semi-algebraically connected components o"},"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":"1201.6439","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2012-01-31T04:37:58Z","cross_cats_sorted":["cs.SC"],"title_canon_sha256":"21bcd914e6a30ed40f33180a3478098aa9f11702b4777b5b9131aedac69c610a","abstract_canon_sha256":"a2349a2240752cd2a75f52de2af08d8499cd7dfc46a1dab01d3292dd3b6e530a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:52.153563Z","signature_b64":"BKKXFe8Bvts50A5mrCE4zCmAgnuzaPWHP+Ih1/19bRwqmSAkT10kucyqW3SAMwaOlm6oD1yWILhHFFHFi5RrAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5357e06542b0991ea6915bffe0d2721c49ca381aa189135993d9c6a5617d821","last_reissued_at":"2026-05-18T02:50:52.153017Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:52.153017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A baby step-giant step roadmap algorithm for general algebraic sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC"],"primary_cat":"math.AG","authors_text":"\\'Eric Schost, Marie-Fran\\c{c}oise Roy, Mohab Safey El Din, Saugata Basu","submitted_at":"2012-01-31T04:37:58Z","abstract_excerpt":"Let $\\mathrm{R}$ be a real closed field and $\\mathrm{D} \\subset \\mathrm{R}$ an ordered domain. We give an algorithm that takes as input a polynomial $Q \\in \\mathrm{D}[X_1,\\ldots,X_k]$, and computes a description of a roadmap of the set of zeros, $\\mathrm{Zer}(Q,\\mathrm{R}^k)$, of $Q$ in $\\mathrm{R}^k$. The complexity of the algorithm, measured by the number of arithmetic operations in the ordered domain $\\mathrm{D}$, is bounded by $d^{O(k \\sqrt{k})}$, where $d = \\mathrm{deg}(Q)\\ge 2$. As a consequence, there exist algorithms for computing the number of semi-algebraically connected components o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.6439","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":"1201.6439","created_at":"2026-05-18T02:50:52.153097+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.6439v2","created_at":"2026-05-18T02:50:52.153097+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.6439","created_at":"2026-05-18T02:50:52.153097+00:00"},{"alias_kind":"pith_short_12","alias_value":"WU2X4BSUFMEZ","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"WU2X4BSUFMEZD2TJ","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"WU2X4BSU","created_at":"2026-05-18T12:27:27.928770+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/WU2X4BSUFMEZD2TJCW774DJHEH","json":"https://pith.science/pith/WU2X4BSUFMEZD2TJCW774DJHEH.json","graph_json":"https://pith.science/api/pith-number/WU2X4BSUFMEZD2TJCW774DJHEH/graph.json","events_json":"https://pith.science/api/pith-number/WU2X4BSUFMEZD2TJCW774DJHEH/events.json","paper":"https://pith.science/paper/WU2X4BSU"},"agent_actions":{"view_html":"https://pith.science/pith/WU2X4BSUFMEZD2TJCW774DJHEH","download_json":"https://pith.science/pith/WU2X4BSUFMEZD2TJCW774DJHEH.json","view_paper":"https://pith.science/paper/WU2X4BSU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.6439&json=true","fetch_graph":"https://pith.science/api/pith-number/WU2X4BSUFMEZD2TJCW774DJHEH/graph.json","fetch_events":"https://pith.science/api/pith-number/WU2X4BSUFMEZD2TJCW774DJHEH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WU2X4BSUFMEZD2TJCW774DJHEH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WU2X4BSUFMEZD2TJCW774DJHEH/action/storage_attestation","attest_author":"https://pith.science/pith/WU2X4BSUFMEZD2TJCW774DJHEH/action/author_attestation","sign_citation":"https://pith.science/pith/WU2X4BSUFMEZD2TJCW774DJHEH/action/citation_signature","submit_replication":"https://pith.science/pith/WU2X4BSUFMEZD2TJCW774DJHEH/action/replication_record"}},"created_at":"2026-05-18T02:50:52.153097+00:00","updated_at":"2026-05-18T02:50:52.153097+00:00"}