{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:L3UTBITWXAUREAWS2TQEKBA5YX","short_pith_number":"pith:L3UTBITW","canonical_record":{"source":{"id":"1304.0065","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.OC","submitted_at":"2013-03-30T03:59:23Z","cross_cats_sorted":[],"title_canon_sha256":"0d1bd4c8d0ece2e232e27600fbeeae10bf1d172a726e2091ab51d71aebeb584f","abstract_canon_sha256":"4f21a154274f14ad7bc2891efe01d0d8540426613d239420c20363a25f7a4a0d"},"schema_version":"1.0"},"canonical_sha256":"5ee930a276b8291202d2d4e045041dc5c959769ac51c1cb6cd0f82e71cd73532","source":{"kind":"arxiv","id":"1304.0065","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.0065","created_at":"2026-05-18T01:14:53Z"},{"alias_kind":"arxiv_version","alias_value":"1304.0065v2","created_at":"2026-05-18T01:14:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0065","created_at":"2026-05-18T01:14:53Z"},{"alias_kind":"pith_short_12","alias_value":"L3UTBITWXAUR","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"L3UTBITWXAUREAWS","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"L3UTBITW","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:L3UTBITWXAUREAWS2TQEKBA5YX","target":"record","payload":{"canonical_record":{"source":{"id":"1304.0065","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.OC","submitted_at":"2013-03-30T03:59:23Z","cross_cats_sorted":[],"title_canon_sha256":"0d1bd4c8d0ece2e232e27600fbeeae10bf1d172a726e2091ab51d71aebeb584f","abstract_canon_sha256":"4f21a154274f14ad7bc2891efe01d0d8540426613d239420c20363a25f7a4a0d"},"schema_version":"1.0"},"canonical_sha256":"5ee930a276b8291202d2d4e045041dc5c959769ac51c1cb6cd0f82e71cd73532","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:53.603700Z","signature_b64":"dE7Okg8XQTtklzsErTOOfjmY6Jn01pEkAI8n3c0uvTADOgqfwQ5OC5j+zaZgLlYmcdmKmegyPL08pbaenc8wDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ee930a276b8291202d2d4e045041dc5c959769ac51c1cb6cd0f82e71cd73532","last_reissued_at":"2026-05-18T01:14:53.603157Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:53.603157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.0065","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-18T01:14:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7gtMdqSNcpLhNeqHqieq90CjLtCJcLdxpx7jMhl7w3BzgREVeEHipN539iItN44XQf0pYys++CEwjpjpO9AHCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T04:16:24.307233Z"},"content_sha256":"47862e1a5e1eb0c2bec36bfa0f89e2b7ae672cda4c300b663026b8275874d760","schema_version":"1.0","event_id":"sha256:47862e1a5e1eb0c2bec36bfa0f89e2b7ae672cda4c300b663026b8275874d760"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:L3UTBITWXAUREAWS2TQEKBA5YX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Perturbed Sums of Squares Theorem for Polynomial Optimization and its Applications","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hayato Waki, Levent Tuncel, Masakazu Muramatsu","submitted_at":"2013-03-30T03:59:23Z","abstract_excerpt":"We consider a property of positive polynomials on a compact set with a small perturbation. When applied to a Polynomial Optimization Problem (POP), the property implies that the optimal value of the corresponding SemiDefinite Programming (SDP) relaxation with sufficiently large relaxation order is bounded from below by $(f^\\ast - \\epsilon)$ and from above by $f^\\ast + \\epsilon (n+1)$, where $f^\\ast$ is the optimal value of the POP. We propose new SDP relaxations for POP based on modifications of existing sums-of-squares representation theorems. An advantage of our SDP relaxations is that in ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0065","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-18T01:14:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v7CanxK0XE1VEsV7QQhFRgLPVJdjGeID1B7ySdDCLnNTQu3tCfpbi9ohtmviaEDMs/a0/501Y3/i6p28UUicCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T04:16:24.307605Z"},"content_sha256":"666a3ca35c51939ec0d11a3a9d043fbc4cdc44dfd12fb1ad0c53cca238967597","schema_version":"1.0","event_id":"sha256:666a3ca35c51939ec0d11a3a9d043fbc4cdc44dfd12fb1ad0c53cca238967597"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L3UTBITWXAUREAWS2TQEKBA5YX/bundle.json","state_url":"https://pith.science/pith/L3UTBITWXAUREAWS2TQEKBA5YX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L3UTBITWXAUREAWS2TQEKBA5YX/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-22T04:16:24Z","links":{"resolver":"https://pith.science/pith/L3UTBITWXAUREAWS2TQEKBA5YX","bundle":"https://pith.science/pith/L3UTBITWXAUREAWS2TQEKBA5YX/bundle.json","state":"https://pith.science/pith/L3UTBITWXAUREAWS2TQEKBA5YX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L3UTBITWXAUREAWS2TQEKBA5YX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:L3UTBITWXAUREAWS2TQEKBA5YX","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":"4f21a154274f14ad7bc2891efe01d0d8540426613d239420c20363a25f7a4a0d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.OC","submitted_at":"2013-03-30T03:59:23Z","title_canon_sha256":"0d1bd4c8d0ece2e232e27600fbeeae10bf1d172a726e2091ab51d71aebeb584f"},"schema_version":"1.0","source":{"id":"1304.0065","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.0065","created_at":"2026-05-18T01:14:53Z"},{"alias_kind":"arxiv_version","alias_value":"1304.0065v2","created_at":"2026-05-18T01:14:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0065","created_at":"2026-05-18T01:14:53Z"},{"alias_kind":"pith_short_12","alias_value":"L3UTBITWXAUR","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"L3UTBITWXAUREAWS","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"L3UTBITW","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:666a3ca35c51939ec0d11a3a9d043fbc4cdc44dfd12fb1ad0c53cca238967597","target":"graph","created_at":"2026-05-18T01:14:53Z","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 consider a property of positive polynomials on a compact set with a small perturbation. When applied to a Polynomial Optimization Problem (POP), the property implies that the optimal value of the corresponding SemiDefinite Programming (SDP) relaxation with sufficiently large relaxation order is bounded from below by $(f^\\ast - \\epsilon)$ and from above by $f^\\ast + \\epsilon (n+1)$, where $f^\\ast$ is the optimal value of the POP. We propose new SDP relaxations for POP based on modifications of existing sums-of-squares representation theorems. An advantage of our SDP relaxations is that in ma","authors_text":"Hayato Waki, Levent Tuncel, Masakazu Muramatsu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.OC","submitted_at":"2013-03-30T03:59:23Z","title":"A Perturbed Sums of Squares Theorem for Polynomial Optimization and its Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0065","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:47862e1a5e1eb0c2bec36bfa0f89e2b7ae672cda4c300b663026b8275874d760","target":"record","created_at":"2026-05-18T01:14:53Z","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":"4f21a154274f14ad7bc2891efe01d0d8540426613d239420c20363a25f7a4a0d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.OC","submitted_at":"2013-03-30T03:59:23Z","title_canon_sha256":"0d1bd4c8d0ece2e232e27600fbeeae10bf1d172a726e2091ab51d71aebeb584f"},"schema_version":"1.0","source":{"id":"1304.0065","kind":"arxiv","version":2}},"canonical_sha256":"5ee930a276b8291202d2d4e045041dc5c959769ac51c1cb6cd0f82e71cd73532","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ee930a276b8291202d2d4e045041dc5c959769ac51c1cb6cd0f82e71cd73532","first_computed_at":"2026-05-18T01:14:53.603157Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:53.603157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dE7Okg8XQTtklzsErTOOfjmY6Jn01pEkAI8n3c0uvTADOgqfwQ5OC5j+zaZgLlYmcdmKmegyPL08pbaenc8wDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:53.603700Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.0065","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47862e1a5e1eb0c2bec36bfa0f89e2b7ae672cda4c300b663026b8275874d760","sha256:666a3ca35c51939ec0d11a3a9d043fbc4cdc44dfd12fb1ad0c53cca238967597"],"state_sha256":"8324fe9fdba5b80c015f4cfb80601fb77ac395ac903599ac2b95e5de907bea20"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gULUsKbaKmcl/5lalahZKIZlL5502AIUByvzntOKwhTwvudIbGlIFP3xrHUbrGhfKpc7ACZG77G8ZFL9aNH9Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T04:16:24.309545Z","bundle_sha256":"04bc6a104cd8405559aeb94cd312ed8acd4ecde0ece7d23e9a502e695f100c81"}}