{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:JY2O3FQOWVTJDSI7NFBHDZ4DDU","short_pith_number":"pith:JY2O3FQO","canonical_record":{"source":{"id":"2505.18580","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-24T08:09:17Z","cross_cats_sorted":[],"title_canon_sha256":"a655543d7616f4e801e8ef5cc9c1715b7aa42d77609929257dfb4c9255182b7a","abstract_canon_sha256":"09aaeb50cb49720d43706fec8cc16b22c93012e8fa34f638182dfa0a3858339d"},"schema_version":"1.0"},"canonical_sha256":"4e34ed960eb56691c91f694271e7831d3c4d83c5cd53aeef65d3b909735e983a","source":{"kind":"arxiv","id":"2505.18580","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.18580","created_at":"2026-06-05T01:14:26Z"},{"alias_kind":"arxiv_version","alias_value":"2505.18580v4","created_at":"2026-06-05T01:14:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.18580","created_at":"2026-06-05T01:14:26Z"},{"alias_kind":"pith_short_12","alias_value":"JY2O3FQOWVTJ","created_at":"2026-06-05T01:14:26Z"},{"alias_kind":"pith_short_16","alias_value":"JY2O3FQOWVTJDSI7","created_at":"2026-06-05T01:14:26Z"},{"alias_kind":"pith_short_8","alias_value":"JY2O3FQO","created_at":"2026-06-05T01:14:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:JY2O3FQOWVTJDSI7NFBHDZ4DDU","target":"record","payload":{"canonical_record":{"source":{"id":"2505.18580","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-24T08:09:17Z","cross_cats_sorted":[],"title_canon_sha256":"a655543d7616f4e801e8ef5cc9c1715b7aa42d77609929257dfb4c9255182b7a","abstract_canon_sha256":"09aaeb50cb49720d43706fec8cc16b22c93012e8fa34f638182dfa0a3858339d"},"schema_version":"1.0"},"canonical_sha256":"4e34ed960eb56691c91f694271e7831d3c4d83c5cd53aeef65d3b909735e983a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-05T01:14:26.957731Z","signature_b64":"EeALF/jvomqY80XTjS2yiJYOQeNjpPR4obgha0cYQdiZfocYvII5O7L6uLU+a8Bd9tzrrjK62p0RbEtymuu0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e34ed960eb56691c91f694271e7831d3c4d83c5cd53aeef65d3b909735e983a","last_reissued_at":"2026-06-05T01:14:26.957147Z","signature_status":"signed_v1","first_computed_at":"2026-06-05T01:14:26.957147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.18580","source_version":4,"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-06-05T01:14:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fzVIgsGXaMiAHs6hcnJt0X1wgZDxydbEDAisgfcCDfezolwQv6O6hmh3NSZmtXRUbWUdFSurVwOzNsZV479iBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T17:00:45.806630Z"},"content_sha256":"2c2d9bf48b62d0cba68181309482e2796ac8446ec342a576ef1b667439033b62","schema_version":"1.0","event_id":"sha256:2c2d9bf48b62d0cba68181309482e2796ac8446ec342a576ef1b667439033b62"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:JY2O3FQOWVTJDSI7NFBHDZ4DDU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convergence rates for polynomial optimization on set products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Victor Magron","submitted_at":"2025-05-24T08:09:17Z","abstract_excerpt":"We consider polynomial optimization problems on Cartesian products of basic compact semialgebraic sets. The solution of such problems can be approximated as closely as desired by hierarchies of semidefinite programming relaxations, based on classical sums of squares certificates due to Putinar and Schm\\\"udgen. When the feasible set is the bi-sphere, i.e., the Cartesian product of two unit spheres, we show that the hierarchies based on the Schm\\\"udgen-type certificates converge to the global minimum of the objective polynomial at a rate in $O(1/t^2)$, where $t$ is the relaxation order. Our proo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.18580","kind":"arxiv","version":4},"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/2505.18580/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-06-05T01:14:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fHiniemVjb0i2BmrZCUAeCs/V/Yu+1tw7L0Sp6a9r8gW5qxBWBEs9EDBUiloT4XGGIAXSp6IuDpGWPI7kuZaAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T17:00:45.807327Z"},"content_sha256":"2a3569e4ac8ddfdb660cd749d2809f978341b0b48191d7061c06895b3174308e","schema_version":"1.0","event_id":"sha256:2a3569e4ac8ddfdb660cd749d2809f978341b0b48191d7061c06895b3174308e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JY2O3FQOWVTJDSI7NFBHDZ4DDU/bundle.json","state_url":"https://pith.science/pith/JY2O3FQOWVTJDSI7NFBHDZ4DDU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JY2O3FQOWVTJDSI7NFBHDZ4DDU/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-06T17:00:45Z","links":{"resolver":"https://pith.science/pith/JY2O3FQOWVTJDSI7NFBHDZ4DDU","bundle":"https://pith.science/pith/JY2O3FQOWVTJDSI7NFBHDZ4DDU/bundle.json","state":"https://pith.science/pith/JY2O3FQOWVTJDSI7NFBHDZ4DDU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JY2O3FQOWVTJDSI7NFBHDZ4DDU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:JY2O3FQOWVTJDSI7NFBHDZ4DDU","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":"09aaeb50cb49720d43706fec8cc16b22c93012e8fa34f638182dfa0a3858339d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-24T08:09:17Z","title_canon_sha256":"a655543d7616f4e801e8ef5cc9c1715b7aa42d77609929257dfb4c9255182b7a"},"schema_version":"1.0","source":{"id":"2505.18580","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.18580","created_at":"2026-06-05T01:14:26Z"},{"alias_kind":"arxiv_version","alias_value":"2505.18580v4","created_at":"2026-06-05T01:14:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.18580","created_at":"2026-06-05T01:14:26Z"},{"alias_kind":"pith_short_12","alias_value":"JY2O3FQOWVTJ","created_at":"2026-06-05T01:14:26Z"},{"alias_kind":"pith_short_16","alias_value":"JY2O3FQOWVTJDSI7","created_at":"2026-06-05T01:14:26Z"},{"alias_kind":"pith_short_8","alias_value":"JY2O3FQO","created_at":"2026-06-05T01:14:26Z"}],"graph_snapshots":[{"event_id":"sha256:2a3569e4ac8ddfdb660cd749d2809f978341b0b48191d7061c06895b3174308e","target":"graph","created_at":"2026-06-05T01:14:26Z","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/2505.18580/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider polynomial optimization problems on Cartesian products of basic compact semialgebraic sets. The solution of such problems can be approximated as closely as desired by hierarchies of semidefinite programming relaxations, based on classical sums of squares certificates due to Putinar and Schm\\\"udgen. When the feasible set is the bi-sphere, i.e., the Cartesian product of two unit spheres, we show that the hierarchies based on the Schm\\\"udgen-type certificates converge to the global minimum of the objective polynomial at a rate in $O(1/t^2)$, where $t$ is the relaxation order. Our proo","authors_text":"Victor Magron","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-24T08:09:17Z","title":"Convergence rates for polynomial optimization on set products"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.18580","kind":"arxiv","version":4},"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:2c2d9bf48b62d0cba68181309482e2796ac8446ec342a576ef1b667439033b62","target":"record","created_at":"2026-06-05T01:14:26Z","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":"09aaeb50cb49720d43706fec8cc16b22c93012e8fa34f638182dfa0a3858339d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-24T08:09:17Z","title_canon_sha256":"a655543d7616f4e801e8ef5cc9c1715b7aa42d77609929257dfb4c9255182b7a"},"schema_version":"1.0","source":{"id":"2505.18580","kind":"arxiv","version":4}},"canonical_sha256":"4e34ed960eb56691c91f694271e7831d3c4d83c5cd53aeef65d3b909735e983a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e34ed960eb56691c91f694271e7831d3c4d83c5cd53aeef65d3b909735e983a","first_computed_at":"2026-06-05T01:14:26.957147Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-05T01:14:26.957147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EeALF/jvomqY80XTjS2yiJYOQeNjpPR4obgha0cYQdiZfocYvII5O7L6uLU+a8Bd9tzrrjK62p0RbEtymuu0Ag==","signature_status":"signed_v1","signed_at":"2026-06-05T01:14:26.957731Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.18580","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c2d9bf48b62d0cba68181309482e2796ac8446ec342a576ef1b667439033b62","sha256:2a3569e4ac8ddfdb660cd749d2809f978341b0b48191d7061c06895b3174308e"],"state_sha256":"d3df7b726524d4118d7bcb9e1a4e686d6d20e45c20768c5bdb09c0a42b843abb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w3Y+u219dAa9/wa5fys/T1utO10ndcDOZlsZxvbu4/SSWCnZajC825n5Ltd+JoGpCzqEL2vdkhDeGDtJ8eBqDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T17:00:45.810480Z","bundle_sha256":"fbdb98bcda142d37dc35baaf83f893be2ab44e836aef1781d3022a14579b4bd8"}}