{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4G2CNAO75NPGUL75FHFA564GUI","short_pith_number":"pith:4G2CNAO7","canonical_record":{"source":{"id":"1407.2108","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-08T14:32:49Z","cross_cats_sorted":[],"title_canon_sha256":"ad968a51408aaa9073de71b8326322c5a757f3483702d6173cbfaab956613df1","abstract_canon_sha256":"69b8fdf5bd0643358cf1bfe96d7c016d62dd22a59b19ecb5719445b82840358c"},"schema_version":"1.0"},"canonical_sha256":"e1b42681dfeb5e6a2ffd29ca0efb86a2227d3050ac40287a4956a81aab9c4957","source":{"kind":"arxiv","id":"1407.2108","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.2108","created_at":"2026-05-18T02:48:08Z"},{"alias_kind":"arxiv_version","alias_value":"1407.2108v1","created_at":"2026-05-18T02:48:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2108","created_at":"2026-05-18T02:48:08Z"},{"alias_kind":"pith_short_12","alias_value":"4G2CNAO75NPG","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4G2CNAO75NPGUL75","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4G2CNAO7","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4G2CNAO75NPGUL75FHFA564GUI","target":"record","payload":{"canonical_record":{"source":{"id":"1407.2108","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-08T14:32:49Z","cross_cats_sorted":[],"title_canon_sha256":"ad968a51408aaa9073de71b8326322c5a757f3483702d6173cbfaab956613df1","abstract_canon_sha256":"69b8fdf5bd0643358cf1bfe96d7c016d62dd22a59b19ecb5719445b82840358c"},"schema_version":"1.0"},"canonical_sha256":"e1b42681dfeb5e6a2ffd29ca0efb86a2227d3050ac40287a4956a81aab9c4957","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:08.410261Z","signature_b64":"VCGiX/nJTJjNFzWA5f7cIxz7z9nVx9c10M0goXbBT4su0FUuUAjIRYhZhHxJL57CzF6guyobAiqp+O0jg7cXAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1b42681dfeb5e6a2ffd29ca0efb86a2227d3050ac40287a4956a81aab9c4957","last_reissued_at":"2026-05-18T02:48:08.409590Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:08.409590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.2108","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-18T02:48:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/USXLsaFhb3O+tRkngNgzbgmdz++6Lr+06MIIaiwawHbBLJAzR8iMTaLbAa2Eh0QiedltgeYFnVxm3fUvpCoAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:24:16.719021Z"},"content_sha256":"47be74ee133a718e20d527f65fff9f582b9952d38f5f0ad09e50b43c939fad49","schema_version":"1.0","event_id":"sha256:47be74ee133a718e20d527f65fff9f582b9952d38f5f0ad09e50b43c939fad49"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4G2CNAO75NPGUL75FHFA564GUI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An error analysis for polynomial optimization over the simplex based on the multivariate hypergeometric distribution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Etienne de Klerk, Monique Laurent, Zhao Sun","submitted_at":"2014-07-08T14:32:49Z","abstract_excerpt":"We study the minimization of fixed-degree polynomials over the simplex. This problem is well-known to be NP-hard, as it contains the maximum stable set problem in graph theory as a special case. In this paper, we consider a rational approximation by taking the minimum over the regular grid, which consists of rational points with denominator $r$ (for given $r$). We show that the associated convergence rate is $O(1/r^2)$ for quadratic polynomials. For general polynomials, if there exists a rational global minimizer over the simplex, we show that the convergence rate is also of the order $O(1/r^2"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2108","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-18T02:48:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J4hp4Z+9lJSUtEhIYHTe1ZsjK/3/3EDhTY8rexxsk5EYYg7BNV1Ahbx3L0qQGt/pG8LIso3nFIxJbg51foyVDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:24:16.719559Z"},"content_sha256":"415f29861127647a58fbb1c4efc57335c88c4b32928d875b19cdac9dbd397b9d","schema_version":"1.0","event_id":"sha256:415f29861127647a58fbb1c4efc57335c88c4b32928d875b19cdac9dbd397b9d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4G2CNAO75NPGUL75FHFA564GUI/bundle.json","state_url":"https://pith.science/pith/4G2CNAO75NPGUL75FHFA564GUI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4G2CNAO75NPGUL75FHFA564GUI/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-05-30T20:24:16Z","links":{"resolver":"https://pith.science/pith/4G2CNAO75NPGUL75FHFA564GUI","bundle":"https://pith.science/pith/4G2CNAO75NPGUL75FHFA564GUI/bundle.json","state":"https://pith.science/pith/4G2CNAO75NPGUL75FHFA564GUI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4G2CNAO75NPGUL75FHFA564GUI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4G2CNAO75NPGUL75FHFA564GUI","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":"69b8fdf5bd0643358cf1bfe96d7c016d62dd22a59b19ecb5719445b82840358c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-08T14:32:49Z","title_canon_sha256":"ad968a51408aaa9073de71b8326322c5a757f3483702d6173cbfaab956613df1"},"schema_version":"1.0","source":{"id":"1407.2108","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.2108","created_at":"2026-05-18T02:48:08Z"},{"alias_kind":"arxiv_version","alias_value":"1407.2108v1","created_at":"2026-05-18T02:48:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2108","created_at":"2026-05-18T02:48:08Z"},{"alias_kind":"pith_short_12","alias_value":"4G2CNAO75NPG","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4G2CNAO75NPGUL75","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4G2CNAO7","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:415f29861127647a58fbb1c4efc57335c88c4b32928d875b19cdac9dbd397b9d","target":"graph","created_at":"2026-05-18T02:48:08Z","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 minimization of fixed-degree polynomials over the simplex. This problem is well-known to be NP-hard, as it contains the maximum stable set problem in graph theory as a special case. In this paper, we consider a rational approximation by taking the minimum over the regular grid, which consists of rational points with denominator $r$ (for given $r$). We show that the associated convergence rate is $O(1/r^2)$ for quadratic polynomials. For general polynomials, if there exists a rational global minimizer over the simplex, we show that the convergence rate is also of the order $O(1/r^2","authors_text":"Etienne de Klerk, Monique Laurent, Zhao Sun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-08T14:32:49Z","title":"An error analysis for polynomial optimization over the simplex based on the multivariate hypergeometric distribution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2108","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:47be74ee133a718e20d527f65fff9f582b9952d38f5f0ad09e50b43c939fad49","target":"record","created_at":"2026-05-18T02:48:08Z","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":"69b8fdf5bd0643358cf1bfe96d7c016d62dd22a59b19ecb5719445b82840358c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-08T14:32:49Z","title_canon_sha256":"ad968a51408aaa9073de71b8326322c5a757f3483702d6173cbfaab956613df1"},"schema_version":"1.0","source":{"id":"1407.2108","kind":"arxiv","version":1}},"canonical_sha256":"e1b42681dfeb5e6a2ffd29ca0efb86a2227d3050ac40287a4956a81aab9c4957","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1b42681dfeb5e6a2ffd29ca0efb86a2227d3050ac40287a4956a81aab9c4957","first_computed_at":"2026-05-18T02:48:08.409590Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:08.409590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VCGiX/nJTJjNFzWA5f7cIxz7z9nVx9c10M0goXbBT4su0FUuUAjIRYhZhHxJL57CzF6guyobAiqp+O0jg7cXAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:08.410261Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.2108","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47be74ee133a718e20d527f65fff9f582b9952d38f5f0ad09e50b43c939fad49","sha256:415f29861127647a58fbb1c4efc57335c88c4b32928d875b19cdac9dbd397b9d"],"state_sha256":"4ccb3a5d05c7a9e556525ea54123027277592b65307341b6b4660485d4a6b9cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wlUNsz9sw35XrlnISb2edk6cjKX8bRY+6q9jlcES7R/v3soik7IMecewQZ2F18506ynSPPJbl8CnDOfyAPUwDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:24:16.722774Z","bundle_sha256":"16557a0ac81fa1245a8af20842f2f92260f5278c9099a84fa51e1fa45fc7056a"}}