{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:CSLXM3RD7QUFVIMGPS3NT57ME6","short_pith_number":"pith:CSLXM3RD","canonical_record":{"source":{"id":"1307.8281","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2013-07-31T11:01:20Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"ea0d66672013972ea0e46387a4f36a77b7f98b2e25a62c1c1a86c501b67edd1d","abstract_canon_sha256":"2c402449979c0bd6bd34da8770a5df8af22b3962df4c7063fc9e256a7cb47e2d"},"schema_version":"1.0"},"canonical_sha256":"1497766e23fc285aa1867cb6d9f7ec27b40d7b27c193e2ab8256f0afd29dbf21","source":{"kind":"arxiv","id":"1307.8281","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.8281","created_at":"2026-05-18T02:52:32Z"},{"alias_kind":"arxiv_version","alias_value":"1307.8281v2","created_at":"2026-05-18T02:52:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.8281","created_at":"2026-05-18T02:52:32Z"},{"alias_kind":"pith_short_12","alias_value":"CSLXM3RD7QUF","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CSLXM3RD7QUFVIMG","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CSLXM3RD","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:CSLXM3RD7QUFVIMGPS3NT57ME6","target":"record","payload":{"canonical_record":{"source":{"id":"1307.8281","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2013-07-31T11:01:20Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"ea0d66672013972ea0e46387a4f36a77b7f98b2e25a62c1c1a86c501b67edd1d","abstract_canon_sha256":"2c402449979c0bd6bd34da8770a5df8af22b3962df4c7063fc9e256a7cb47e2d"},"schema_version":"1.0"},"canonical_sha256":"1497766e23fc285aa1867cb6d9f7ec27b40d7b27c193e2ab8256f0afd29dbf21","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:32.360251Z","signature_b64":"Vtc85DKr31X1ARWKjd4MtE5FfWVb0Q5Rv1Zn+GvhR3Vum9oUflH+ndzj7R9b7pMvVzrG1PyUGK7BW8eYzasgDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1497766e23fc285aa1867cb6d9f7ec27b40d7b27c193e2ab8256f0afd29dbf21","last_reissued_at":"2026-05-18T02:52:32.359697Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:32.359697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.8281","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:52:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pfrNAdOBFAI+iJdx9UZMGpjvdiqUGVA3NkagbnAczZiLJuzoMXgR2r6V8TMYjy1xrg+PmidcOJ7tPvg9u6iiAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:35:06.304813Z"},"content_sha256":"0b28f3b08b18db6f952532aebd9d4df5ff719426279e95e67bd9fcff940ba80f","schema_version":"1.0","event_id":"sha256:0b28f3b08b18db6f952532aebd9d4df5ff719426279e95e67bd9fcff940ba80f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:CSLXM3RD7QUFVIMGPS3NT57ME6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SC","authors_text":"Aur\\'elien Greuet (INRIA Paris-Rocquencourt, LIFL), LIP6, LIP6), LM-Versailles, Mohab Safey El Din (INRIA Paris-Rocquencourt","submitted_at":"2013-07-31T11:01:20Z","abstract_excerpt":"Let $f, f_1, \\ldots, f_\\nV$ be polynomials with rational coefficients in the indeterminates $\\bfX=X_1, \\ldots, X_n$ of maximum degree $D$ and $V$ be the set of common complex solutions of $\\F=(f_1,\\ldots, f_\\nV)$. We give an algorithm which, up to some regularity assumptions on $\\F$, computes an exact representation of the global infimum $f^\\star=\\inf_{x\\in V\\cap\\R^n} f\\Par{x}$, i.e. a univariate polynomial vanishing at $f^\\star$ and an isolating interval for $f^\\star$. Furthermore, this algorithm decides whether $f^\\star$ is reached and if so, it returns $x^\\star\\in V\\cap\\R^n$ such that $f\\Pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.8281","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:52:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5idCFyYHANaqkj3mjOYWd1esfbL8gyksI76xgDGCQP52YqWQXKLLGpuPZBYoFnn7SiBblIDr4APS3T5GJ5nmCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:35:06.305162Z"},"content_sha256":"23174ccec1633d3bc6832d801566ea90c9e34c6351b4488234a703174999de0f","schema_version":"1.0","event_id":"sha256:23174ccec1633d3bc6832d801566ea90c9e34c6351b4488234a703174999de0f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CSLXM3RD7QUFVIMGPS3NT57ME6/bundle.json","state_url":"https://pith.science/pith/CSLXM3RD7QUFVIMGPS3NT57ME6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CSLXM3RD7QUFVIMGPS3NT57ME6/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-01T14:35:06Z","links":{"resolver":"https://pith.science/pith/CSLXM3RD7QUFVIMGPS3NT57ME6","bundle":"https://pith.science/pith/CSLXM3RD7QUFVIMGPS3NT57ME6/bundle.json","state":"https://pith.science/pith/CSLXM3RD7QUFVIMGPS3NT57ME6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CSLXM3RD7QUFVIMGPS3NT57ME6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CSLXM3RD7QUFVIMGPS3NT57ME6","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":"2c402449979c0bd6bd34da8770a5df8af22b3962df4c7063fc9e256a7cb47e2d","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2013-07-31T11:01:20Z","title_canon_sha256":"ea0d66672013972ea0e46387a4f36a77b7f98b2e25a62c1c1a86c501b67edd1d"},"schema_version":"1.0","source":{"id":"1307.8281","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.8281","created_at":"2026-05-18T02:52:32Z"},{"alias_kind":"arxiv_version","alias_value":"1307.8281v2","created_at":"2026-05-18T02:52:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.8281","created_at":"2026-05-18T02:52:32Z"},{"alias_kind":"pith_short_12","alias_value":"CSLXM3RD7QUF","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CSLXM3RD7QUFVIMG","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CSLXM3RD","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:23174ccec1633d3bc6832d801566ea90c9e34c6351b4488234a703174999de0f","target":"graph","created_at":"2026-05-18T02:52:32Z","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 $f, f_1, \\ldots, f_\\nV$ be polynomials with rational coefficients in the indeterminates $\\bfX=X_1, \\ldots, X_n$ of maximum degree $D$ and $V$ be the set of common complex solutions of $\\F=(f_1,\\ldots, f_\\nV)$. We give an algorithm which, up to some regularity assumptions on $\\F$, computes an exact representation of the global infimum $f^\\star=\\inf_{x\\in V\\cap\\R^n} f\\Par{x}$, i.e. a univariate polynomial vanishing at $f^\\star$ and an isolating interval for $f^\\star$. Furthermore, this algorithm decides whether $f^\\star$ is reached and if so, it returns $x^\\star\\in V\\cap\\R^n$ such that $f\\Pa","authors_text":"Aur\\'elien Greuet (INRIA Paris-Rocquencourt, LIFL), LIP6, LIP6), LM-Versailles, Mohab Safey El Din (INRIA Paris-Rocquencourt","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2013-07-31T11:01:20Z","title":"Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.8281","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:0b28f3b08b18db6f952532aebd9d4df5ff719426279e95e67bd9fcff940ba80f","target":"record","created_at":"2026-05-18T02:52:32Z","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":"2c402449979c0bd6bd34da8770a5df8af22b3962df4c7063fc9e256a7cb47e2d","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2013-07-31T11:01:20Z","title_canon_sha256":"ea0d66672013972ea0e46387a4f36a77b7f98b2e25a62c1c1a86c501b67edd1d"},"schema_version":"1.0","source":{"id":"1307.8281","kind":"arxiv","version":2}},"canonical_sha256":"1497766e23fc285aa1867cb6d9f7ec27b40d7b27c193e2ab8256f0afd29dbf21","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1497766e23fc285aa1867cb6d9f7ec27b40d7b27c193e2ab8256f0afd29dbf21","first_computed_at":"2026-05-18T02:52:32.359697Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:32.359697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Vtc85DKr31X1ARWKjd4MtE5FfWVb0Q5Rv1Zn+GvhR3Vum9oUflH+ndzj7R9b7pMvVzrG1PyUGK7BW8eYzasgDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:32.360251Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.8281","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b28f3b08b18db6f952532aebd9d4df5ff719426279e95e67bd9fcff940ba80f","sha256:23174ccec1633d3bc6832d801566ea90c9e34c6351b4488234a703174999de0f"],"state_sha256":"65d96fc3b1fe5e233463492861a3196b29120ba77c23b9921caa4f13257d7a36"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JZMdnRCQJMA0RYEjF9uLMUQKKWcEkTKC/7tMPFP/cqFeEOEcQ4TFkPcJfA9YjQARYxwH/Fu6MBtCnF0dwztxAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:35:06.307429Z","bundle_sha256":"677cc43ce7d9ba4e47ce3bab3ab59e3b4c31e752a9d2a682e3efb208d61795bc"}}