{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ZB5R3F723SYD4E7DIQSJITFSSY","short_pith_number":"pith:ZB5R3F72","canonical_record":{"source":{"id":"1305.3211","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2013-05-14T17:10:02Z","cross_cats_sorted":[],"title_canon_sha256":"ca3bed65bd2eba26f11278d3fe5439fc67a4394237fd835bc2d5a41eefabbaea","abstract_canon_sha256":"9672e3a2f98b5290320a3e5e5425c5dc69d87ccf38dc383e2df13f752086008c"},"schema_version":"1.0"},"canonical_sha256":"c87b1d97fadcb03e13e34424944cb2961e748453cf0a150800b7420e0625519b","source":{"kind":"arxiv","id":"1305.3211","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.3211","created_at":"2026-05-18T01:02:57Z"},{"alias_kind":"arxiv_version","alias_value":"1305.3211v6","created_at":"2026-05-18T01:02:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3211","created_at":"2026-05-18T01:02:57Z"},{"alias_kind":"pith_short_12","alias_value":"ZB5R3F723SYD","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZB5R3F723SYD4E7D","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZB5R3F72","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ZB5R3F723SYD4E7DIQSJITFSSY","target":"record","payload":{"canonical_record":{"source":{"id":"1305.3211","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2013-05-14T17:10:02Z","cross_cats_sorted":[],"title_canon_sha256":"ca3bed65bd2eba26f11278d3fe5439fc67a4394237fd835bc2d5a41eefabbaea","abstract_canon_sha256":"9672e3a2f98b5290320a3e5e5425c5dc69d87ccf38dc383e2df13f752086008c"},"schema_version":"1.0"},"canonical_sha256":"c87b1d97fadcb03e13e34424944cb2961e748453cf0a150800b7420e0625519b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:57.302166Z","signature_b64":"/tbj9bXyXN0TugwWCJ8g8RJAI4zj3KfCkeV00B+uBMBBw8y8/Q0QQbUJNwQnyRH22OfuONY0KWtC1EmsK42eCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c87b1d97fadcb03e13e34424944cb2961e748453cf0a150800b7420e0625519b","last_reissued_at":"2026-05-18T01:02:57.301609Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:57.301609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.3211","source_version":6,"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-18T01:02:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l1WwpxFN6kwCoR/5M97TH01J9pk5J07qteNrAD1Rt2/4B3VDunQ9dyQ65vouuY/s+SyiRlWDok1XlrvJEqj2DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:11:42.505900Z"},"content_sha256":"068027f634f3ea82bdf580e9c73bd1c912319180ccbcfb1f011475d88fc6cc5b","schema_version":"1.0","event_id":"sha256:068027f634f3ea82bdf580e9c73bd1c912319180ccbcfb1f011475d88fc6cc5b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ZB5R3F723SYD4E7DIQSJITFSSY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Divide and Conquer Roadmap for Algebraic Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AG","authors_text":"Marie-Francoise Roy, Saugata Basu","submitted_at":"2013-05-14T17:10:02Z","abstract_excerpt":"Let $\\mathrm{R}$ be a real closed field, and $\\mathrm{D} \\subset \\mathrm{R}$ an ordered domain. We describe an algorithm that given as input a polynomial $P \\in \\mathrm{D} [ X_{1},\\ldots,X_{k} ]$, and a finite set, $\\mathcal{A}= \\{ p_{1}, \\ldots,p_{m} \\}$, of points contained in $V= \\mathrm{Zer}( P, \\mathrm{R}^{k})$ described by real univariate representations, computes a roadmap of $V$ containing $\\mathcal{A}$. The complexity of the algorithm, measured by the number of arithmetic operations in $\\mathrm{D} $ is bounded by $\\left( \\sum_{i=1}^{m} D^{O ( \\log^{2} ( k ) )}_{i} +1 \\right) ( k^{\\log"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3211","kind":"arxiv","version":6},"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-18T01:02:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jj9nVAzr9o72dTOEKvhsuJTM+/SdAvDw7OXUArfrIkIHUQnZ324Fq2b2lCstworD6JadekSg+0GGi+NTOwxEAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:11:42.506241Z"},"content_sha256":"8d53bd8066431a49cd6b1a6ea0b2d993a80863a1d94259e59bbdfa47303d1cbb","schema_version":"1.0","event_id":"sha256:8d53bd8066431a49cd6b1a6ea0b2d993a80863a1d94259e59bbdfa47303d1cbb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZB5R3F723SYD4E7DIQSJITFSSY/bundle.json","state_url":"https://pith.science/pith/ZB5R3F723SYD4E7DIQSJITFSSY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZB5R3F723SYD4E7DIQSJITFSSY/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-28T14:11:42Z","links":{"resolver":"https://pith.science/pith/ZB5R3F723SYD4E7DIQSJITFSSY","bundle":"https://pith.science/pith/ZB5R3F723SYD4E7DIQSJITFSSY/bundle.json","state":"https://pith.science/pith/ZB5R3F723SYD4E7DIQSJITFSSY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZB5R3F723SYD4E7DIQSJITFSSY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ZB5R3F723SYD4E7DIQSJITFSSY","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":"9672e3a2f98b5290320a3e5e5425c5dc69d87ccf38dc383e2df13f752086008c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2013-05-14T17:10:02Z","title_canon_sha256":"ca3bed65bd2eba26f11278d3fe5439fc67a4394237fd835bc2d5a41eefabbaea"},"schema_version":"1.0","source":{"id":"1305.3211","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.3211","created_at":"2026-05-18T01:02:57Z"},{"alias_kind":"arxiv_version","alias_value":"1305.3211v6","created_at":"2026-05-18T01:02:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3211","created_at":"2026-05-18T01:02:57Z"},{"alias_kind":"pith_short_12","alias_value":"ZB5R3F723SYD","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZB5R3F723SYD4E7D","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZB5R3F72","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:8d53bd8066431a49cd6b1a6ea0b2d993a80863a1d94259e59bbdfa47303d1cbb","target":"graph","created_at":"2026-05-18T01:02:57Z","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 describe an algorithm that given as input a polynomial $P \\in \\mathrm{D} [ X_{1},\\ldots,X_{k} ]$, and a finite set, $\\mathcal{A}= \\{ p_{1}, \\ldots,p_{m} \\}$, of points contained in $V= \\mathrm{Zer}( P, \\mathrm{R}^{k})$ described by real univariate representations, computes a roadmap of $V$ containing $\\mathcal{A}$. The complexity of the algorithm, measured by the number of arithmetic operations in $\\mathrm{D} $ is bounded by $\\left( \\sum_{i=1}^{m} D^{O ( \\log^{2} ( k ) )}_{i} +1 \\right) ( k^{\\log","authors_text":"Marie-Francoise Roy, Saugata Basu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2013-05-14T17:10:02Z","title":"Divide and Conquer Roadmap for Algebraic Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3211","kind":"arxiv","version":6},"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:068027f634f3ea82bdf580e9c73bd1c912319180ccbcfb1f011475d88fc6cc5b","target":"record","created_at":"2026-05-18T01:02:57Z","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":"9672e3a2f98b5290320a3e5e5425c5dc69d87ccf38dc383e2df13f752086008c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2013-05-14T17:10:02Z","title_canon_sha256":"ca3bed65bd2eba26f11278d3fe5439fc67a4394237fd835bc2d5a41eefabbaea"},"schema_version":"1.0","source":{"id":"1305.3211","kind":"arxiv","version":6}},"canonical_sha256":"c87b1d97fadcb03e13e34424944cb2961e748453cf0a150800b7420e0625519b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c87b1d97fadcb03e13e34424944cb2961e748453cf0a150800b7420e0625519b","first_computed_at":"2026-05-18T01:02:57.301609Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:57.301609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/tbj9bXyXN0TugwWCJ8g8RJAI4zj3KfCkeV00B+uBMBBw8y8/Q0QQbUJNwQnyRH22OfuONY0KWtC1EmsK42eCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:57.302166Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.3211","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:068027f634f3ea82bdf580e9c73bd1c912319180ccbcfb1f011475d88fc6cc5b","sha256:8d53bd8066431a49cd6b1a6ea0b2d993a80863a1d94259e59bbdfa47303d1cbb"],"state_sha256":"3adc6fc69ec27c6239c5415f1bf99b4c7e5fd3d46f2e024579b167612a3a6d58"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N2iuWG47vEmF2Y5i3rsJR1PineoWa+LanGvVkZI1wliIpa0LUTisWM+wxNVLZZ8cUraQ5XcGIKkx8T/oTMUsAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T14:11:42.508393Z","bundle_sha256":"48bb34f91d6d1d0bcdf49294a6c5ca49dea6eb8413e1921d14804563d5ab554b"}}