{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:LMITZNNNZZ3NZPT4AIRW3ZTLXJ","short_pith_number":"pith:LMITZNNN","canonical_record":{"source":{"id":"2408.04417","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-08-08T12:44:48Z","cross_cats_sorted":[],"title_canon_sha256":"dd00786a0ff74a313218eb16fbf78443b30bc886bee398a0915071e779b77391","abstract_canon_sha256":"e236ff402c19c29c5a1378f504b4850390b8a4080290f9770050ea0f6143a54b"},"schema_version":"1.0"},"canonical_sha256":"5b113cb5adce76dcbe7c02236de66bba5feaa4bcaaec61e381c549099846c978","source":{"kind":"arxiv","id":"2408.04417","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.04417","created_at":"2026-07-05T10:01:15Z"},{"alias_kind":"arxiv_version","alias_value":"2408.04417v2","created_at":"2026-07-05T10:01:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.04417","created_at":"2026-07-05T10:01:15Z"},{"alias_kind":"pith_short_12","alias_value":"LMITZNNNZZ3N","created_at":"2026-07-05T10:01:15Z"},{"alias_kind":"pith_short_16","alias_value":"LMITZNNNZZ3NZPT4","created_at":"2026-07-05T10:01:15Z"},{"alias_kind":"pith_short_8","alias_value":"LMITZNNN","created_at":"2026-07-05T10:01:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:LMITZNNNZZ3NZPT4AIRW3ZTLXJ","target":"record","payload":{"canonical_record":{"source":{"id":"2408.04417","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-08-08T12:44:48Z","cross_cats_sorted":[],"title_canon_sha256":"dd00786a0ff74a313218eb16fbf78443b30bc886bee398a0915071e779b77391","abstract_canon_sha256":"e236ff402c19c29c5a1378f504b4850390b8a4080290f9770050ea0f6143a54b"},"schema_version":"1.0"},"canonical_sha256":"5b113cb5adce76dcbe7c02236de66bba5feaa4bcaaec61e381c549099846c978","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:01:15.283920Z","signature_b64":"WL92s+pJrY0UB3eVI1zktNXLx+ulZA6n84eJrwj45oqsyFVhkOID5Ho4VmnLgalMEDy4VTHu37cezwetlCajAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b113cb5adce76dcbe7c02236de66bba5feaa4bcaaec61e381c549099846c978","last_reissued_at":"2026-07-05T10:01:15.283442Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:01:15.283442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2408.04417","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-07-05T10:01:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4mPXRBnjwhaFzCHNOfO4feX8clWfGbUfFzFooGQdx2yJKrGmMPfPdn3cj4qHEXwnwsgMAwuVGTJYEyLluqa4CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T00:57:34.433547Z"},"content_sha256":"7375dbb3d93bec26b09b131c324d756640e495615d76920e3600cd2c0682867a","schema_version":"1.0","event_id":"sha256:7375dbb3d93bec26b09b131c324d756640e495615d76920e3600cd2c0682867a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:LMITZNNNZZ3NZPT4AIRW3ZTLXJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Overview of Convergence Rates for Sum of Squares Hierarchies in Polynomial Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Lucas Slot, Monique Laurent","submitted_at":"2024-08-08T12:44:48Z","abstract_excerpt":"In this survey we consider polynomial optimization problems, asking to minimize a polynomial function over a compact semialgebraic set, defined by polynomial inequalities. This models a great variety of (in general, nonlinear nonconvex) optimization problems. Various hierarchies of (lower and upper) bounds have been introduced, having the remarkable property that they converge asymptotically to the global minimum. These bounds exploit algebraic representations of positive polynomials in terms of sums of squares and can be computed using semidefinite optimization. Our focus lies in the performa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.04417","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2408.04417/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-05T10:01:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/0ygcgO5Wryv+T4FTODf84lCXY8x88E/SXPpcQ6fCnJU2u4uPsdXYA6ClbfYnPaz5KYp5Ar3V7QtbEU9mJ8NAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T00:57:34.434046Z"},"content_sha256":"ac8f7b7a67f892c570e6fb0f72bfe9a63707ef59136dcc1b73d5de1c92a992ec","schema_version":"1.0","event_id":"sha256:ac8f7b7a67f892c570e6fb0f72bfe9a63707ef59136dcc1b73d5de1c92a992ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LMITZNNNZZ3NZPT4AIRW3ZTLXJ/bundle.json","state_url":"https://pith.science/pith/LMITZNNNZZ3NZPT4AIRW3ZTLXJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LMITZNNNZZ3NZPT4AIRW3ZTLXJ/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-08-10T00:57:34Z","links":{"resolver":"https://pith.science/pith/LMITZNNNZZ3NZPT4AIRW3ZTLXJ","bundle":"https://pith.science/pith/LMITZNNNZZ3NZPT4AIRW3ZTLXJ/bundle.json","state":"https://pith.science/pith/LMITZNNNZZ3NZPT4AIRW3ZTLXJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LMITZNNNZZ3NZPT4AIRW3ZTLXJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:LMITZNNNZZ3NZPT4AIRW3ZTLXJ","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":"e236ff402c19c29c5a1378f504b4850390b8a4080290f9770050ea0f6143a54b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-08-08T12:44:48Z","title_canon_sha256":"dd00786a0ff74a313218eb16fbf78443b30bc886bee398a0915071e779b77391"},"schema_version":"1.0","source":{"id":"2408.04417","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.04417","created_at":"2026-07-05T10:01:15Z"},{"alias_kind":"arxiv_version","alias_value":"2408.04417v2","created_at":"2026-07-05T10:01:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.04417","created_at":"2026-07-05T10:01:15Z"},{"alias_kind":"pith_short_12","alias_value":"LMITZNNNZZ3N","created_at":"2026-07-05T10:01:15Z"},{"alias_kind":"pith_short_16","alias_value":"LMITZNNNZZ3NZPT4","created_at":"2026-07-05T10:01:15Z"},{"alias_kind":"pith_short_8","alias_value":"LMITZNNN","created_at":"2026-07-05T10:01:15Z"}],"graph_snapshots":[{"event_id":"sha256:ac8f7b7a67f892c570e6fb0f72bfe9a63707ef59136dcc1b73d5de1c92a992ec","target":"graph","created_at":"2026-07-05T10:01:15Z","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/2408.04417/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this survey we consider polynomial optimization problems, asking to minimize a polynomial function over a compact semialgebraic set, defined by polynomial inequalities. This models a great variety of (in general, nonlinear nonconvex) optimization problems. Various hierarchies of (lower and upper) bounds have been introduced, having the remarkable property that they converge asymptotically to the global minimum. These bounds exploit algebraic representations of positive polynomials in terms of sums of squares and can be computed using semidefinite optimization. Our focus lies in the performa","authors_text":"Lucas Slot, Monique Laurent","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-08-08T12:44:48Z","title":"An Overview of Convergence Rates for Sum of Squares Hierarchies in Polynomial Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.04417","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:7375dbb3d93bec26b09b131c324d756640e495615d76920e3600cd2c0682867a","target":"record","created_at":"2026-07-05T10:01:15Z","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":"e236ff402c19c29c5a1378f504b4850390b8a4080290f9770050ea0f6143a54b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-08-08T12:44:48Z","title_canon_sha256":"dd00786a0ff74a313218eb16fbf78443b30bc886bee398a0915071e779b77391"},"schema_version":"1.0","source":{"id":"2408.04417","kind":"arxiv","version":2}},"canonical_sha256":"5b113cb5adce76dcbe7c02236de66bba5feaa4bcaaec61e381c549099846c978","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b113cb5adce76dcbe7c02236de66bba5feaa4bcaaec61e381c549099846c978","first_computed_at":"2026-07-05T10:01:15.283442Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:01:15.283442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WL92s+pJrY0UB3eVI1zktNXLx+ulZA6n84eJrwj45oqsyFVhkOID5Ho4VmnLgalMEDy4VTHu37cezwetlCajAw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:01:15.283920Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.04417","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7375dbb3d93bec26b09b131c324d756640e495615d76920e3600cd2c0682867a","sha256:ac8f7b7a67f892c570e6fb0f72bfe9a63707ef59136dcc1b73d5de1c92a992ec"],"state_sha256":"0343657da175437ef040260fcf1a7af2dcc4b6f9aacb0a02a84d2285b5a1e512"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WQexpqztp/f1rSdCW+En4BxQ+Tm8nSYFaLqDvjajSyIARcKClILks/em+602hNTzNr9R5bMzDyC1voPFpbJSBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T00:57:34.437387Z","bundle_sha256":"fe6472a9c2005a62442978b2a92ceb2ce3739d81fac7ddac3c14794ec1ad8f2e"}}