{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:WU2X4BSUFMEZD2TJCW774DJHEH","short_pith_number":"pith:WU2X4BSU","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"},"canonical_sha256":"b5357e06542b0991ea6915bffe0d2721c49ca381aa189135993d9c6a5617d821","source":{"kind":"arxiv","id":"1201.6439","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.6439","created_at":"2026-05-18T02:50:52Z"},{"alias_kind":"arxiv_version","alias_value":"1201.6439v2","created_at":"2026-05-18T02:50:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.6439","created_at":"2026-05-18T02:50:52Z"},{"alias_kind":"pith_short_12","alias_value":"WU2X4BSUFMEZ","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"WU2X4BSUFMEZD2TJ","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"WU2X4BSU","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:WU2X4BSUFMEZD2TJCW774DJHEH","target":"record","payload":{"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"},"canonical_sha256":"b5357e06542b0991ea6915bffe0d2721c49ca381aa189135993d9c6a5617d821","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"},"source_kind":"arxiv","source_id":"1201.6439","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:50:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JbQ5hOPYBlaHbocCp8miDy18cV85Lb1xXb4D2T9qEGoxA1xcj5cYJPr/5QxMH0WkiZFXVC1qJFXzC2KRWJoqBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:05:38.971200Z"},"content_sha256":"0b21e728699c9b91aa63b5a6bfc9bf0a3f73be38f64978098ccb96d1842d3560","schema_version":"1.0","event_id":"sha256:0b21e728699c9b91aa63b5a6bfc9bf0a3f73be38f64978098ccb96d1842d3560"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:WU2X4BSUFMEZD2TJCW774DJHEH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:50:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eYlxrKeVyIACBLpUIlE7LDIHR/4SHsIKbk6T/tPPFuxPF43gSe5zj7fRUAfgBH4gyiB8ZOUUxv4c9z6Xk7vEAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:05:38.971869Z"},"content_sha256":"38906e784c712336c662c33a84cbaecafab6fc1be475430c81948a774e2edbd0","schema_version":"1.0","event_id":"sha256:38906e784c712336c662c33a84cbaecafab6fc1be475430c81948a774e2edbd0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WU2X4BSUFMEZD2TJCW774DJHEH/bundle.json","state_url":"https://pith.science/pith/WU2X4BSUFMEZD2TJCW774DJHEH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WU2X4BSUFMEZD2TJCW774DJHEH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T15:05:38Z","links":{"resolver":"https://pith.science/pith/WU2X4BSUFMEZD2TJCW774DJHEH","bundle":"https://pith.science/pith/WU2X4BSUFMEZD2TJCW774DJHEH/bundle.json","state":"https://pith.science/pith/WU2X4BSUFMEZD2TJCW774DJHEH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WU2X4BSUFMEZD2TJCW774DJHEH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:WU2X4BSUFMEZD2TJCW774DJHEH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a2349a2240752cd2a75f52de2af08d8499cd7dfc46a1dab01d3292dd3b6e530a","cross_cats_sorted":["cs.SC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2012-01-31T04:37:58Z","title_canon_sha256":"21bcd914e6a30ed40f33180a3478098aa9f11702b4777b5b9131aedac69c610a"},"schema_version":"1.0","source":{"id":"1201.6439","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.6439","created_at":"2026-05-18T02:50:52Z"},{"alias_kind":"arxiv_version","alias_value":"1201.6439v2","created_at":"2026-05-18T02:50:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.6439","created_at":"2026-05-18T02:50:52Z"},{"alias_kind":"pith_short_12","alias_value":"WU2X4BSUFMEZ","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"WU2X4BSUFMEZD2TJ","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"WU2X4BSU","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:38906e784c712336c662c33a84cbaecafab6fc1be475430c81948a774e2edbd0","target":"graph","created_at":"2026-05-18T02:50:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"\\'Eric Schost, Marie-Fran\\c{c}oise Roy, Mohab Safey El Din, Saugata Basu","cross_cats":["cs.SC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2012-01-31T04:37:58Z","title":"A baby step-giant step roadmap algorithm for general algebraic sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.6439","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0b21e728699c9b91aa63b5a6bfc9bf0a3f73be38f64978098ccb96d1842d3560","target":"record","created_at":"2026-05-18T02:50:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a2349a2240752cd2a75f52de2af08d8499cd7dfc46a1dab01d3292dd3b6e530a","cross_cats_sorted":["cs.SC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2012-01-31T04:37:58Z","title_canon_sha256":"21bcd914e6a30ed40f33180a3478098aa9f11702b4777b5b9131aedac69c610a"},"schema_version":"1.0","source":{"id":"1201.6439","kind":"arxiv","version":2}},"canonical_sha256":"b5357e06542b0991ea6915bffe0d2721c49ca381aa189135993d9c6a5617d821","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5357e06542b0991ea6915bffe0d2721c49ca381aa189135993d9c6a5617d821","first_computed_at":"2026-05-18T02:50:52.153017Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:52.153017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BKKXFe8Bvts50A5mrCE4zCmAgnuzaPWHP+Ih1/19bRwqmSAkT10kucyqW3SAMwaOlm6oD1yWILhHFFHFi5RrAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:52.153563Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.6439","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b21e728699c9b91aa63b5a6bfc9bf0a3f73be38f64978098ccb96d1842d3560","sha256:38906e784c712336c662c33a84cbaecafab6fc1be475430c81948a774e2edbd0"],"state_sha256":"94795c6372d217d6ced2c7daf4e74e9b84d2f7be314f22c6039b59d4bca9fe09"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w5s4URCpbFWXGmqbVwxleWtj0rqQic4fiB4S/D3vqn/rB/Fu5lIVpwujFkIltj/m9ubV9LVS7ZK9TaKiVljtDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T15:05:38.975643Z","bundle_sha256":"984fb963f246fa3b39bdce98f8a210d505dc57fa2e83b670d9b4c1ef7b62b8ba"}}