{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FCW3B6FZEJKKOI5XQYJ6VSIOJ2","short_pith_number":"pith:FCW3B6FZ","canonical_record":{"source":{"id":"1804.05524","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-16T07:20:10Z","cross_cats_sorted":[],"title_canon_sha256":"8ddf622f15ea62fb97a421eb05f43c91a390a1e4a83a630ab9fdafb91bf766e3","abstract_canon_sha256":"84a78f2982048e9efe68bb67f8de408af2f6852aa650c683622f66871715475c"},"schema_version":"1.0"},"canonical_sha256":"28adb0f8b92254a723b78613eac90e4e843847140447e9234d80c52f171eeb89","source":{"kind":"arxiv","id":"1804.05524","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.05524","created_at":"2026-05-18T00:18:27Z"},{"alias_kind":"arxiv_version","alias_value":"1804.05524v1","created_at":"2026-05-18T00:18:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05524","created_at":"2026-05-18T00:18:27Z"},{"alias_kind":"pith_short_12","alias_value":"FCW3B6FZEJKK","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FCW3B6FZEJKKOI5X","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FCW3B6FZ","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FCW3B6FZEJKKOI5XQYJ6VSIOJ2","target":"record","payload":{"canonical_record":{"source":{"id":"1804.05524","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-16T07:20:10Z","cross_cats_sorted":[],"title_canon_sha256":"8ddf622f15ea62fb97a421eb05f43c91a390a1e4a83a630ab9fdafb91bf766e3","abstract_canon_sha256":"84a78f2982048e9efe68bb67f8de408af2f6852aa650c683622f66871715475c"},"schema_version":"1.0"},"canonical_sha256":"28adb0f8b92254a723b78613eac90e4e843847140447e9234d80c52f171eeb89","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:27.945595Z","signature_b64":"uUeVp53iYvyMQoirS5XZ4xpCUXBGgY50D4bz/KwWkCsOEl5sDHItDzRcSIHpBn7S8oLb90iFKDXdfQCKo6ghCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28adb0f8b92254a723b78613eac90e4e843847140447e9234d80c52f171eeb89","last_reissued_at":"2026-05-18T00:18:27.945058Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:27.945058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.05524","source_version":1,"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-18T00:18:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mwuFqMf+YSootR7rDrWgKqaZRdOmo9LWdzSIwEUS+/W0/XXtfA4V3Ks/QAtlM5MSti7aqBxDtl4+gogAmgQOBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T11:54:39.487851Z"},"content_sha256":"16c1d53e2ba767c4c936be31d0b4b74ffdeb5354bec34bf9e984c81b93fe4fb1","schema_version":"1.0","event_id":"sha256:16c1d53e2ba767c4c936be31d0b4b74ffdeb5354bec34bf9e984c81b93fe4fb1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FCW3B6FZEJKKOI5XQYJ6VSIOJ2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Worst-case examples for Lasserre's measure--based hierarchy for polynomial optimization on the hypercube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Etienne de Klerk, Monique Laurent","submitted_at":"2018-04-16T07:20:10Z","abstract_excerpt":"We study the convergence rate of a hierarchy of upper bounds for polynomial optimization problems, proposed by Lasserre [SIAM J. Optim. 21(3) (2011), pp. 864-885], and a related hierarchy by De Klerk, Hess and Laurent [SIAM J. Optim. 27(1), (2017) pp. 347-367]. For polynomial optimization over the hypercube, we show a refined convergence analysis for the first hierarchy. We also show lower bounds on the convergence rate for both hierarchies on a class of examples. These lower bounds match the upper bounds and thus establish the true rate of convergence on these examples. Interestingly, these c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05524","kind":"arxiv","version":1},"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-18T00:18:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FMoVe6hYV3zdzxfdnlw0TrsYXc7/vuNY2eZu9jXo0v1C6RFsstMfgNJp8Di7X1ERsF9k4QOpYUWBmZwopT7LDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T11:54:39.488244Z"},"content_sha256":"33a7bb4837572b4f540b640e71122f5c762305d2e07c0aa9d1199975ff4a9e73","schema_version":"1.0","event_id":"sha256:33a7bb4837572b4f540b640e71122f5c762305d2e07c0aa9d1199975ff4a9e73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FCW3B6FZEJKKOI5XQYJ6VSIOJ2/bundle.json","state_url":"https://pith.science/pith/FCW3B6FZEJKKOI5XQYJ6VSIOJ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FCW3B6FZEJKKOI5XQYJ6VSIOJ2/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-25T11:54:39Z","links":{"resolver":"https://pith.science/pith/FCW3B6FZEJKKOI5XQYJ6VSIOJ2","bundle":"https://pith.science/pith/FCW3B6FZEJKKOI5XQYJ6VSIOJ2/bundle.json","state":"https://pith.science/pith/FCW3B6FZEJKKOI5XQYJ6VSIOJ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FCW3B6FZEJKKOI5XQYJ6VSIOJ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FCW3B6FZEJKKOI5XQYJ6VSIOJ2","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":"84a78f2982048e9efe68bb67f8de408af2f6852aa650c683622f66871715475c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-16T07:20:10Z","title_canon_sha256":"8ddf622f15ea62fb97a421eb05f43c91a390a1e4a83a630ab9fdafb91bf766e3"},"schema_version":"1.0","source":{"id":"1804.05524","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.05524","created_at":"2026-05-18T00:18:27Z"},{"alias_kind":"arxiv_version","alias_value":"1804.05524v1","created_at":"2026-05-18T00:18:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05524","created_at":"2026-05-18T00:18:27Z"},{"alias_kind":"pith_short_12","alias_value":"FCW3B6FZEJKK","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FCW3B6FZEJKKOI5X","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FCW3B6FZ","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:33a7bb4837572b4f540b640e71122f5c762305d2e07c0aa9d1199975ff4a9e73","target":"graph","created_at":"2026-05-18T00:18:27Z","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":"We study the convergence rate of a hierarchy of upper bounds for polynomial optimization problems, proposed by Lasserre [SIAM J. Optim. 21(3) (2011), pp. 864-885], and a related hierarchy by De Klerk, Hess and Laurent [SIAM J. Optim. 27(1), (2017) pp. 347-367]. For polynomial optimization over the hypercube, we show a refined convergence analysis for the first hierarchy. We also show lower bounds on the convergence rate for both hierarchies on a class of examples. These lower bounds match the upper bounds and thus establish the true rate of convergence on these examples. Interestingly, these c","authors_text":"Etienne de Klerk, Monique Laurent","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-16T07:20:10Z","title":"Worst-case examples for Lasserre's measure--based hierarchy for polynomial optimization on the hypercube"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05524","kind":"arxiv","version":1},"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:16c1d53e2ba767c4c936be31d0b4b74ffdeb5354bec34bf9e984c81b93fe4fb1","target":"record","created_at":"2026-05-18T00:18:27Z","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":"84a78f2982048e9efe68bb67f8de408af2f6852aa650c683622f66871715475c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-16T07:20:10Z","title_canon_sha256":"8ddf622f15ea62fb97a421eb05f43c91a390a1e4a83a630ab9fdafb91bf766e3"},"schema_version":"1.0","source":{"id":"1804.05524","kind":"arxiv","version":1}},"canonical_sha256":"28adb0f8b92254a723b78613eac90e4e843847140447e9234d80c52f171eeb89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"28adb0f8b92254a723b78613eac90e4e843847140447e9234d80c52f171eeb89","first_computed_at":"2026-05-18T00:18:27.945058Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:27.945058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uUeVp53iYvyMQoirS5XZ4xpCUXBGgY50D4bz/KwWkCsOEl5sDHItDzRcSIHpBn7S8oLb90iFKDXdfQCKo6ghCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:27.945595Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.05524","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16c1d53e2ba767c4c936be31d0b4b74ffdeb5354bec34bf9e984c81b93fe4fb1","sha256:33a7bb4837572b4f540b640e71122f5c762305d2e07c0aa9d1199975ff4a9e73"],"state_sha256":"af9a503418eee70dcd99ded0538753c759fd270409aaf784aa918270b013d74d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YawdgqDp8+cfYqpMzMLnTZHB4nxh26d5rYKByNMIjXf5Ei3CVh7o4EswZTWDm5wZOjdsaDmanzrGSPvOnw2SCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T11:54:39.490572Z","bundle_sha256":"18e4a18dd4c54473ce23163f1ff19d2bedd4e53d0a48d35f2ce4b9b4a450e693"}}