{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:M5UHW2JQS76M4N2F6VVZ6YNC7N","short_pith_number":"pith:M5UHW2JQ","schema_version":"1.0","canonical_sha256":"67687b693097fcce3745f56b9f61a2fb74e5301eec5d776e72d1960650d65a6f","source":{"kind":"arxiv","id":"1304.5214","version":2},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1304.5214","created_at":"2026-05-18T02:59:44.609917+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.5214v2","created_at":"2026-05-18T02:59:44.609917+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5214","created_at":"2026-05-18T02:59:44.609917+00:00"},{"alias_kind":"pith_short_12","alias_value":"M5UHW2JQS76M","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"M5UHW2JQS76M4N2F","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"M5UHW2JQ","created_at":"2026-05-18T12:27:51.066281+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/M5UHW2JQS76M4N2F6VVZ6YNC7N","json":"https://pith.science/pith/M5UHW2JQS76M4N2F6VVZ6YNC7N.json","graph_json":"https://pith.science/api/pith-number/M5UHW2JQS76M4N2F6VVZ6YNC7N/graph.json","events_json":"https://pith.science/api/pith-number/M5UHW2JQS76M4N2F6VVZ6YNC7N/events.json","paper":"https://pith.science/paper/M5UHW2JQ"},"agent_actions":{"view_html":"https://pith.science/pith/M5UHW2JQS76M4N2F6VVZ6YNC7N","download_json":"https://pith.science/pith/M5UHW2JQS76M4N2F6VVZ6YNC7N.json","view_paper":"https://pith.science/paper/M5UHW2JQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.5214&json=true","fetch_graph":"https://pith.science/api/pith-number/M5UHW2JQS76M4N2F6VVZ6YNC7N/graph.json","fetch_events":"https://pith.science/api/pith-number/M5UHW2JQS76M4N2F6VVZ6YNC7N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M5UHW2JQS76M4N2F6VVZ6YNC7N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M5UHW2JQS76M4N2F6VVZ6YNC7N/action/storage_attestation","attest_author":"https://pith.science/pith/M5UHW2JQS76M4N2F6VVZ6YNC7N/action/author_attestation","sign_citation":"https://pith.science/pith/M5UHW2JQS76M4N2F6VVZ6YNC7N/action/citation_signature","submit_replication":"https://pith.science/pith/M5UHW2JQS76M4N2F6VVZ6YNC7N/action/replication_record"}},"created_at":"2026-05-18T02:59:44.609917+00:00","updated_at":"2026-05-18T02:59:44.609917+00:00"}