{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:M5UHW2JQS76M4N2F6VVZ6YNC7N","short_pith_number":"pith:M5UHW2JQ","canonical_record":{"source":{"id":"1304.5214","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2013-04-18T18:42:46Z","cross_cats_sorted":[],"title_canon_sha256":"7e5b048811e13a2284bfecae0c27082fa55b5c63919ca0e1b5b9df7ab242e334","abstract_canon_sha256":"af3c4f5a4e3ae1125752f68be4a010744706bba8ed9cba34611e1372a57f6d8f"},"schema_version":"1.0"},"canonical_sha256":"67687b693097fcce3745f56b9f61a2fb74e5301eec5d776e72d1960650d65a6f","source":{"kind":"arxiv","id":"1304.5214","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5214","created_at":"2026-05-18T02:59:44Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5214v2","created_at":"2026-05-18T02:59:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5214","created_at":"2026-05-18T02:59:44Z"},{"alias_kind":"pith_short_12","alias_value":"M5UHW2JQS76M","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"M5UHW2JQS76M4N2F","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"M5UHW2JQ","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:M5UHW2JQS76M4N2F6VVZ6YNC7N","target":"record","payload":{"canonical_record":{"source":{"id":"1304.5214","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2013-04-18T18:42:46Z","cross_cats_sorted":[],"title_canon_sha256":"7e5b048811e13a2284bfecae0c27082fa55b5c63919ca0e1b5b9df7ab242e334","abstract_canon_sha256":"af3c4f5a4e3ae1125752f68be4a010744706bba8ed9cba34611e1372a57f6d8f"},"schema_version":"1.0"},"canonical_sha256":"67687b693097fcce3745f56b9f61a2fb74e5301eec5d776e72d1960650d65a6f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:44.610586Z","signature_b64":"ZfIUnuPtfZ+b5D67tz9aWF3d2+adSe4ujQoq4jKiUxd3HLr8nTVmum401Vxvhz2jwaiBp0jVooCB9Gi4NSg7BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67687b693097fcce3745f56b9f61a2fb74e5301eec5d776e72d1960650d65a6f","last_reissued_at":"2026-05-18T02:59:44.609776Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:44.609776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.5214","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:59:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lWsctREThqWbIGyJH+jXPesOy0FqXMjIuu/dqNCu07quEiqtqzcsgHbKMXIcn6tl8CDRGuFvnHrqQV/cPRQMCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:50:54.299088Z"},"content_sha256":"56ce1ab60e22774e2570cf24c0be8b80eba95615a0a210f77ed1ec6e87f7f400","schema_version":"1.0","event_id":"sha256:56ce1ab60e22774e2570cf24c0be8b80eba95615a0a210f77ed1ec6e87f7f400"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:M5UHW2JQS76M4N2F6VVZ6YNC7N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Intrinsic complexity estimates in polynomial optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Bernd Bank, Inria Paris-Rocquencourt), Joos Heintz, Marc Giusti (LIX), Mohab Safey El Din (LIP6","submitted_at":"2013-04-18T18:42:46Z","abstract_excerpt":"It is known that point searching in basic semialgebraic sets and the search for globally minimal points in polynomial optimization tasks can be carried out using $(s\\,d)^{O(n)}$ arithmetic operations, where $n$ and $s$ are the numbers of variables and constraints and $d$ is the maximal degree of the polynomials involved.\\spar \\noindent We associate to each of these problems an intrinsic system degree which becomes in worst case of order $(n\\,d)^{O(n)}$ and which measures the intrinsic complexity of the task under consideration.\\spar \\noindent We design non-uniformly deterministic or uniformly "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5214","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:59:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qhgLqucGnDBrUIVW77I18cVsQ/2ha6TuPQqJ2Tz8NAAP7a4GaACjMeYETzl+PencahA0OoBBWc9RA0uFZaFWBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:50:54.299448Z"},"content_sha256":"00158f519e6471694bc00d32e31a82840089a9dc65e551c99b364a8882846eb0","schema_version":"1.0","event_id":"sha256:00158f519e6471694bc00d32e31a82840089a9dc65e551c99b364a8882846eb0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M5UHW2JQS76M4N2F6VVZ6YNC7N/bundle.json","state_url":"https://pith.science/pith/M5UHW2JQS76M4N2F6VVZ6YNC7N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M5UHW2JQS76M4N2F6VVZ6YNC7N/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-06-24T07:50:54Z","links":{"resolver":"https://pith.science/pith/M5UHW2JQS76M4N2F6VVZ6YNC7N","bundle":"https://pith.science/pith/M5UHW2JQS76M4N2F6VVZ6YNC7N/bundle.json","state":"https://pith.science/pith/M5UHW2JQS76M4N2F6VVZ6YNC7N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M5UHW2JQS76M4N2F6VVZ6YNC7N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:M5UHW2JQS76M4N2F6VVZ6YNC7N","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":"af3c4f5a4e3ae1125752f68be4a010744706bba8ed9cba34611e1372a57f6d8f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2013-04-18T18:42:46Z","title_canon_sha256":"7e5b048811e13a2284bfecae0c27082fa55b5c63919ca0e1b5b9df7ab242e334"},"schema_version":"1.0","source":{"id":"1304.5214","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5214","created_at":"2026-05-18T02:59:44Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5214v2","created_at":"2026-05-18T02:59:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5214","created_at":"2026-05-18T02:59:44Z"},{"alias_kind":"pith_short_12","alias_value":"M5UHW2JQS76M","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"M5UHW2JQS76M4N2F","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"M5UHW2JQ","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:00158f519e6471694bc00d32e31a82840089a9dc65e551c99b364a8882846eb0","target":"graph","created_at":"2026-05-18T02:59:44Z","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":"It is known that point searching in basic semialgebraic sets and the search for globally minimal points in polynomial optimization tasks can be carried out using $(s\\,d)^{O(n)}$ arithmetic operations, where $n$ and $s$ are the numbers of variables and constraints and $d$ is the maximal degree of the polynomials involved.\\spar \\noindent We associate to each of these problems an intrinsic system degree which becomes in worst case of order $(n\\,d)^{O(n)}$ and which measures the intrinsic complexity of the task under consideration.\\spar \\noindent We design non-uniformly deterministic or uniformly ","authors_text":"Bernd Bank, Inria Paris-Rocquencourt), Joos Heintz, Marc Giusti (LIX), Mohab Safey El Din (LIP6","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2013-04-18T18:42:46Z","title":"Intrinsic complexity estimates in polynomial optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5214","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:56ce1ab60e22774e2570cf24c0be8b80eba95615a0a210f77ed1ec6e87f7f400","target":"record","created_at":"2026-05-18T02:59:44Z","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":"af3c4f5a4e3ae1125752f68be4a010744706bba8ed9cba34611e1372a57f6d8f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2013-04-18T18:42:46Z","title_canon_sha256":"7e5b048811e13a2284bfecae0c27082fa55b5c63919ca0e1b5b9df7ab242e334"},"schema_version":"1.0","source":{"id":"1304.5214","kind":"arxiv","version":2}},"canonical_sha256":"67687b693097fcce3745f56b9f61a2fb74e5301eec5d776e72d1960650d65a6f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67687b693097fcce3745f56b9f61a2fb74e5301eec5d776e72d1960650d65a6f","first_computed_at":"2026-05-18T02:59:44.609776Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:44.609776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZfIUnuPtfZ+b5D67tz9aWF3d2+adSe4ujQoq4jKiUxd3HLr8nTVmum401Vxvhz2jwaiBp0jVooCB9Gi4NSg7BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:44.610586Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.5214","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56ce1ab60e22774e2570cf24c0be8b80eba95615a0a210f77ed1ec6e87f7f400","sha256:00158f519e6471694bc00d32e31a82840089a9dc65e551c99b364a8882846eb0"],"state_sha256":"e0f9c5548451794520f6738120e8d951bc87f78dad18b83ca9d9c0ba6b7997db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QVuofl8n6ZIzydkm2Pg3KOCQ7R3EfmEjKPeuIzCcwlT+DRM+jiMkkXs99tuegHvUP4mEdQVCusHi7YdYXtH1DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T07:50:54.301377Z","bundle_sha256":"226d3be5a1cc8a55ec8272e1a7eeca78cd7250fda2523c9663ba3dbe6e9b6a6e"}}