{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2000:ACR3KBWG6PYNO52C5XTBLNTWFJ","short_pith_number":"pith:ACR3KBWG","canonical_record":{"source":{"id":"math/0005041","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.AG","submitted_at":"2000-05-04T14:37:37Z","cross_cats_sorted":[],"title_canon_sha256":"479616adb4317f077753eeceda8134f0c39ff8e15ed9be3b538eb48e7cbee28c","abstract_canon_sha256":"077e6a0dcc7352cd717de345ed97ae5f6f4056fa23788b0eea32bd34476b40b0"},"schema_version":"1.0"},"canonical_sha256":"00a3b506c6f3f0d77742ede615b6762a7d44b918e71d69fca7a7aa2b1f3a075b","source":{"kind":"arxiv","id":"math/0005041","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0005041","created_at":"2026-07-04T14:34:29Z"},{"alias_kind":"arxiv_version","alias_value":"math/0005041v1","created_at":"2026-07-04T14:34:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0005041","created_at":"2026-07-04T14:34:29Z"},{"alias_kind":"pith_short_12","alias_value":"ACR3KBWG6PYN","created_at":"2026-07-04T14:34:29Z"},{"alias_kind":"pith_short_16","alias_value":"ACR3KBWG6PYNO52C","created_at":"2026-07-04T14:34:29Z"},{"alias_kind":"pith_short_8","alias_value":"ACR3KBWG","created_at":"2026-07-04T14:34:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2000:ACR3KBWG6PYNO52C5XTBLNTWFJ","target":"record","payload":{"canonical_record":{"source":{"id":"math/0005041","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.AG","submitted_at":"2000-05-04T14:37:37Z","cross_cats_sorted":[],"title_canon_sha256":"479616adb4317f077753eeceda8134f0c39ff8e15ed9be3b538eb48e7cbee28c","abstract_canon_sha256":"077e6a0dcc7352cd717de345ed97ae5f6f4056fa23788b0eea32bd34476b40b0"},"schema_version":"1.0"},"canonical_sha256":"00a3b506c6f3f0d77742ede615b6762a7d44b918e71d69fca7a7aa2b1f3a075b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:34:29.391025Z","signature_b64":"Us4v7gl5o9UYrNw2s9rHEblSPkca5aO2EmmDLEUKRTRF4bdIPschPaoKvbRRFsQiWsovV8MdopMwb8HNExTmCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00a3b506c6f3f0d77742ede615b6762a7d44b918e71d69fca7a7aa2b1f3a075b","last_reissued_at":"2026-07-04T14:34:29.390611Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:34:29.390611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0005041","source_version":1,"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-07-04T14:34:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iTdHulECE4Uvsyy31tMU5GMcImxIZA4XQuD2SokhY4zQgEFkU/2PVXBporqF2bVAt25e+zmUR3Y+iDYck7PiAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T05:00:37.406171Z"},"content_sha256":"2ca0f3f5ef04bd7c359700770a57c62b0281cf51244f4d6ed588aa02765adfec","schema_version":"1.0","event_id":"sha256:2ca0f3f5ef04bd7c359700770a57c62b0281cf51244f4d6ed588aa02765adfec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2000:ACR3KBWG6PYNO52C5XTBLNTWFJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polar Varieties and Efficient Real Elimination","license":"","headline":"","cross_cats":[],"primary_cat":"math.AG","authors_text":"B. Bank, G. M. Mbakop, J. Heintz, M. Giusti","submitted_at":"2000-05-04T14:37:37Z","abstract_excerpt":"Let $S_0$ be a smooth and compact real variety given by a reduced regular sequence of polynomials $f_1, ..., f_p$. This paper is devoted to the algorithmic problem of finding {\\em efficiently} a representative point for each connected component of $S_0$ . For this purpose we exhibit explicit polynomial equations that describe the generic polar varieties of $S_0$. This leads to a procedure which solves our algorithmic problem in time that is polynomial in the (extrinsic) description length of the input equations $f_1, >..., f_p$ and in a suitably introduced, intrinsic geometric parameter, calle"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0005041","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/math/0005041/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T14:34:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kqsU1edE3Twp6MESLlPbQjsfORyTxYCCzY0Y+82PnT4j+yCNeaU+19ej6VsUmFF23f9+ycnq03RsCGrJ/+U+AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T05:00:37.406563Z"},"content_sha256":"34d9f20a38c38386b47660f73410164c8701cb07f85b5e05dc7afc6f032c2435","schema_version":"1.0","event_id":"sha256:34d9f20a38c38386b47660f73410164c8701cb07f85b5e05dc7afc6f032c2435"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ACR3KBWG6PYNO52C5XTBLNTWFJ/bundle.json","state_url":"https://pith.science/pith/ACR3KBWG6PYNO52C5XTBLNTWFJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ACR3KBWG6PYNO52C5XTBLNTWFJ/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-07-09T05:00:37Z","links":{"resolver":"https://pith.science/pith/ACR3KBWG6PYNO52C5XTBLNTWFJ","bundle":"https://pith.science/pith/ACR3KBWG6PYNO52C5XTBLNTWFJ/bundle.json","state":"https://pith.science/pith/ACR3KBWG6PYNO52C5XTBLNTWFJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ACR3KBWG6PYNO52C5XTBLNTWFJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2000:ACR3KBWG6PYNO52C5XTBLNTWFJ","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":"077e6a0dcc7352cd717de345ed97ae5f6f4056fa23788b0eea32bd34476b40b0","cross_cats_sorted":[],"license":"","primary_cat":"math.AG","submitted_at":"2000-05-04T14:37:37Z","title_canon_sha256":"479616adb4317f077753eeceda8134f0c39ff8e15ed9be3b538eb48e7cbee28c"},"schema_version":"1.0","source":{"id":"math/0005041","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0005041","created_at":"2026-07-04T14:34:29Z"},{"alias_kind":"arxiv_version","alias_value":"math/0005041v1","created_at":"2026-07-04T14:34:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0005041","created_at":"2026-07-04T14:34:29Z"},{"alias_kind":"pith_short_12","alias_value":"ACR3KBWG6PYN","created_at":"2026-07-04T14:34:29Z"},{"alias_kind":"pith_short_16","alias_value":"ACR3KBWG6PYNO52C","created_at":"2026-07-04T14:34:29Z"},{"alias_kind":"pith_short_8","alias_value":"ACR3KBWG","created_at":"2026-07-04T14:34:29Z"}],"graph_snapshots":[{"event_id":"sha256:34d9f20a38c38386b47660f73410164c8701cb07f85b5e05dc7afc6f032c2435","target":"graph","created_at":"2026-07-04T14:34:29Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/math/0005041/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $S_0$ be a smooth and compact real variety given by a reduced regular sequence of polynomials $f_1, ..., f_p$. This paper is devoted to the algorithmic problem of finding {\\em efficiently} a representative point for each connected component of $S_0$ . For this purpose we exhibit explicit polynomial equations that describe the generic polar varieties of $S_0$. This leads to a procedure which solves our algorithmic problem in time that is polynomial in the (extrinsic) description length of the input equations $f_1, >..., f_p$ and in a suitably introduced, intrinsic geometric parameter, calle","authors_text":"B. Bank, G. M. Mbakop, J. Heintz, M. Giusti","cross_cats":[],"headline":"","license":"","primary_cat":"math.AG","submitted_at":"2000-05-04T14:37:37Z","title":"Polar Varieties and Efficient Real Elimination"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0005041","kind":"arxiv","version":1},"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:2ca0f3f5ef04bd7c359700770a57c62b0281cf51244f4d6ed588aa02765adfec","target":"record","created_at":"2026-07-04T14:34:29Z","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":"077e6a0dcc7352cd717de345ed97ae5f6f4056fa23788b0eea32bd34476b40b0","cross_cats_sorted":[],"license":"","primary_cat":"math.AG","submitted_at":"2000-05-04T14:37:37Z","title_canon_sha256":"479616adb4317f077753eeceda8134f0c39ff8e15ed9be3b538eb48e7cbee28c"},"schema_version":"1.0","source":{"id":"math/0005041","kind":"arxiv","version":1}},"canonical_sha256":"00a3b506c6f3f0d77742ede615b6762a7d44b918e71d69fca7a7aa2b1f3a075b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"00a3b506c6f3f0d77742ede615b6762a7d44b918e71d69fca7a7aa2b1f3a075b","first_computed_at":"2026-07-04T14:34:29.390611Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:34:29.390611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Us4v7gl5o9UYrNw2s9rHEblSPkca5aO2EmmDLEUKRTRF4bdIPschPaoKvbRRFsQiWsovV8MdopMwb8HNExTmCg==","signature_status":"signed_v1","signed_at":"2026-07-04T14:34:29.391025Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0005041","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ca0f3f5ef04bd7c359700770a57c62b0281cf51244f4d6ed588aa02765adfec","sha256:34d9f20a38c38386b47660f73410164c8701cb07f85b5e05dc7afc6f032c2435"],"state_sha256":"ec5367f6c75c3cd88fce12bb94a44c6536063e382dd0c3dbec7f4a8edf3594ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7mxEQI1JsbZUfX3KWSHfTdzzy75HG7Pur636NjY5WdyVu9L0Bmk1NpxQhX9E7Mac0+mUEeEbygxo10rNNbYEAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T05:00:37.408438Z","bundle_sha256":"0ac20df2ded0ec015369be36da1ca1c44240e9b9c2f1bb80b6f6cb2a8da926f2"}}