{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:PGXVHECIEJUWLNA5QICNZ3ES5C","short_pith_number":"pith:PGXVHECI","canonical_record":{"source":{"id":"1312.5873","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-20T10:23:16Z","cross_cats_sorted":[],"title_canon_sha256":"fc627ca443ee735ed5cf8bf9b9ca9fcd67f3e3d86bbec4fa0663a86d2185e94e","abstract_canon_sha256":"cbbb40aef45bedff597b93e8cddefefabfd48c56677cff1534b5a6a1aaf72d75"},"schema_version":"1.0"},"canonical_sha256":"79af539048226965b41d8204dcec92e889e4d34f7897954ee653878c6f7078e5","source":{"kind":"arxiv","id":"1312.5873","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.5873","created_at":"2026-05-18T02:45:04Z"},{"alias_kind":"arxiv_version","alias_value":"1312.5873v3","created_at":"2026-05-18T02:45:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5873","created_at":"2026-05-18T02:45:04Z"},{"alias_kind":"pith_short_12","alias_value":"PGXVHECIEJUW","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PGXVHECIEJUWLNA5","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PGXVHECI","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:PGXVHECIEJUWLNA5QICNZ3ES5C","target":"record","payload":{"canonical_record":{"source":{"id":"1312.5873","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-20T10:23:16Z","cross_cats_sorted":[],"title_canon_sha256":"fc627ca443ee735ed5cf8bf9b9ca9fcd67f3e3d86bbec4fa0663a86d2185e94e","abstract_canon_sha256":"cbbb40aef45bedff597b93e8cddefefabfd48c56677cff1534b5a6a1aaf72d75"},"schema_version":"1.0"},"canonical_sha256":"79af539048226965b41d8204dcec92e889e4d34f7897954ee653878c6f7078e5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:04.460873Z","signature_b64":"SgidVXfQw8f2MQCkAooH+QjgC/XaWlzSbqUU0AcmWDKnw2i8gKsU7WhLufx0o39fgI3yByra2kxztuOW22hADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79af539048226965b41d8204dcec92e889e4d34f7897954ee653878c6f7078e5","last_reissued_at":"2026-05-18T02:45:04.460035Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:04.460035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.5873","source_version":3,"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:45:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wGtMJqYhh82M/WY/FdFQNIRsBZc8a/XHETCeoUPhM9Pp7/tebKXuEXObWcHQOdkNwWRCC36W+vrm8nU86odJDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:28:04.408089Z"},"content_sha256":"05817653cba16986afafb20e2f4c355e34dcf1228b148875a704e4dcec62e922","schema_version":"1.0","event_id":"sha256:05817653cba16986afafb20e2f4c355e34dcf1228b148875a704e4dcec62e922"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:PGXVHECIEJUWLNA5QICNZ3ES5C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A refined error analysis for fixed-degree polynomial optimization over the simplex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Zhao Sun","submitted_at":"2013-12-20T10:23:16Z","abstract_excerpt":"We consider the problem of minimizing a fixed-degree polynomial over the standard simplex. This problem is well known to be NP-hard, since it contains the maximum stable set problem in combinatorial optimization as a special case. In this paper, we revisit a known upper bound obtained by taking the minimum value on a regular grid, and a known lower bound based on P\\'olya's representation theorem. More precisely, we consider the difference between these two bounds and we provide upper bounds for this difference in terms of the range of function values. Our results refine the known upper bounds "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5873","kind":"arxiv","version":3},"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:45:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EDitHkfsdUIv17NZKw8lrc+5i5wx4AvsTK+E8N3v796lc+XtdIAj147VBtqzSh5fVbP7BUizpXQm2rXS7rSyCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:28:04.408468Z"},"content_sha256":"167c804d0b0a027dbe354269840048ee3c9bc8aff758fb31125e0954d351646d","schema_version":"1.0","event_id":"sha256:167c804d0b0a027dbe354269840048ee3c9bc8aff758fb31125e0954d351646d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PGXVHECIEJUWLNA5QICNZ3ES5C/bundle.json","state_url":"https://pith.science/pith/PGXVHECIEJUWLNA5QICNZ3ES5C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PGXVHECIEJUWLNA5QICNZ3ES5C/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-04T17:28:04Z","links":{"resolver":"https://pith.science/pith/PGXVHECIEJUWLNA5QICNZ3ES5C","bundle":"https://pith.science/pith/PGXVHECIEJUWLNA5QICNZ3ES5C/bundle.json","state":"https://pith.science/pith/PGXVHECIEJUWLNA5QICNZ3ES5C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PGXVHECIEJUWLNA5QICNZ3ES5C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:PGXVHECIEJUWLNA5QICNZ3ES5C","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":"cbbb40aef45bedff597b93e8cddefefabfd48c56677cff1534b5a6a1aaf72d75","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-20T10:23:16Z","title_canon_sha256":"fc627ca443ee735ed5cf8bf9b9ca9fcd67f3e3d86bbec4fa0663a86d2185e94e"},"schema_version":"1.0","source":{"id":"1312.5873","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.5873","created_at":"2026-05-18T02:45:04Z"},{"alias_kind":"arxiv_version","alias_value":"1312.5873v3","created_at":"2026-05-18T02:45:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5873","created_at":"2026-05-18T02:45:04Z"},{"alias_kind":"pith_short_12","alias_value":"PGXVHECIEJUW","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PGXVHECIEJUWLNA5","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PGXVHECI","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:167c804d0b0a027dbe354269840048ee3c9bc8aff758fb31125e0954d351646d","target":"graph","created_at":"2026-05-18T02:45:04Z","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 the problem of minimizing a fixed-degree polynomial over the standard simplex. This problem is well known to be NP-hard, since it contains the maximum stable set problem in combinatorial optimization as a special case. In this paper, we revisit a known upper bound obtained by taking the minimum value on a regular grid, and a known lower bound based on P\\'olya's representation theorem. More precisely, we consider the difference between these two bounds and we provide upper bounds for this difference in terms of the range of function values. Our results refine the known upper bounds ","authors_text":"Zhao Sun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-20T10:23:16Z","title":"A refined error analysis for fixed-degree polynomial optimization over the simplex"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5873","kind":"arxiv","version":3},"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:05817653cba16986afafb20e2f4c355e34dcf1228b148875a704e4dcec62e922","target":"record","created_at":"2026-05-18T02:45:04Z","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":"cbbb40aef45bedff597b93e8cddefefabfd48c56677cff1534b5a6a1aaf72d75","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-20T10:23:16Z","title_canon_sha256":"fc627ca443ee735ed5cf8bf9b9ca9fcd67f3e3d86bbec4fa0663a86d2185e94e"},"schema_version":"1.0","source":{"id":"1312.5873","kind":"arxiv","version":3}},"canonical_sha256":"79af539048226965b41d8204dcec92e889e4d34f7897954ee653878c6f7078e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79af539048226965b41d8204dcec92e889e4d34f7897954ee653878c6f7078e5","first_computed_at":"2026-05-18T02:45:04.460035Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:04.460035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SgidVXfQw8f2MQCkAooH+QjgC/XaWlzSbqUU0AcmWDKnw2i8gKsU7WhLufx0o39fgI3yByra2kxztuOW22hADA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:04.460873Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.5873","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05817653cba16986afafb20e2f4c355e34dcf1228b148875a704e4dcec62e922","sha256:167c804d0b0a027dbe354269840048ee3c9bc8aff758fb31125e0954d351646d"],"state_sha256":"e1b724564bc78c77b479c58dccea6136aada30ccfd481cabc818a1fd91f1b86d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oDXfvI7lKpPr187M/6oqXin1oWVPS0yr5X3AuI42Cd10U1QdDSJ5Gu0hhcQ08zGGEhQUm0rTxNhzjSUVrm3OAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T17:28:04.410547Z","bundle_sha256":"a5b787ad9d11cb6b7b83b46fd00ca8a5a9e53e54a6f9b90159fc39b007a74a4b"}}