{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CNFACDJRR2BGOKLC6R5ZFYGDJL","short_pith_number":"pith:CNFACDJR","canonical_record":{"source":{"id":"1708.08114","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-27T17:27:50Z","cross_cats_sorted":[],"title_canon_sha256":"1fd0efdd5b679d87724ecd93b2e3592c8d85dcd179b91218f63d8014f04f542a","abstract_canon_sha256":"b214de59d58b9a5c7b18487c4235af45c7d8520390d6721ab00735dabec127ee"},"schema_version":"1.0"},"canonical_sha256":"134a010d318e82672962f47b92e0c34afec7c329a66898f0e0cd9b4b790962f7","source":{"kind":"arxiv","id":"1708.08114","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.08114","created_at":"2026-05-18T00:36:36Z"},{"alias_kind":"arxiv_version","alias_value":"1708.08114v1","created_at":"2026-05-18T00:36:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.08114","created_at":"2026-05-18T00:36:36Z"},{"alias_kind":"pith_short_12","alias_value":"CNFACDJRR2BG","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CNFACDJRR2BGOKLC","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CNFACDJR","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CNFACDJRR2BGOKLC6R5ZFYGDJL","target":"record","payload":{"canonical_record":{"source":{"id":"1708.08114","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-27T17:27:50Z","cross_cats_sorted":[],"title_canon_sha256":"1fd0efdd5b679d87724ecd93b2e3592c8d85dcd179b91218f63d8014f04f542a","abstract_canon_sha256":"b214de59d58b9a5c7b18487c4235af45c7d8520390d6721ab00735dabec127ee"},"schema_version":"1.0"},"canonical_sha256":"134a010d318e82672962f47b92e0c34afec7c329a66898f0e0cd9b4b790962f7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:36.972291Z","signature_b64":"zXAMirfEJwAte6wugwOrU0tRaX+l/REcYG0nv1actQnryPISNTRYJ3SHqFKPv5QMXfDgqXQKh59UyCgYeL3nCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"134a010d318e82672962f47b92e0c34afec7c329a66898f0e0cd9b4b790962f7","last_reissued_at":"2026-05-18T00:36:36.971663Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:36.971663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.08114","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:36:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vj1pUZReH81inTwpl+FTim+rinMwtyUrxm6+To17+gWuShbGpuhvc/pAghxTFtOrZ/YZ7F/IwizCOXLXp3pHAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:11:04.041851Z"},"content_sha256":"7df2603a24d89fdac890584a458e417eb84301ead14d7c7f9373bc24e500ddc2","schema_version":"1.0","event_id":"sha256:7df2603a24d89fdac890584a458e417eb84301ead14d7c7f9373bc24e500ddc2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CNFACDJRR2BGOKLC6R5ZFYGDJL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploiting Algebraic Structure in Global Optimization and the Belgian Chocolate Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Nigel Boston, Zachary Charles","submitted_at":"2017-08-27T17:27:50Z","abstract_excerpt":"The Belgian chocolate problem involves maximizing a parameter {\\delta} over a non-convex region of polynomials. In this paper we detail a global optimization method for this problem that outperforms previous such methods by exploiting underlying algebraic structure. Previous work has focused on iterative methods that, due to the complicated non-convex feasible region, may require many iterations or result in non-optimal {\\delta}. By contrast, our method locates the largest known value of {\\delta} in a non-iterative manner. We do this by using the algebraic structure to go directly to large lim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.08114","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:36:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ozlz3Hv7yMG9QoT8gVNNnaDlFRX5y8RkE8N6uxX/mXmh5K1dBln7jX32IEheIzmWM+3tI7+8zirnsYRRW/GBBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:11:04.042362Z"},"content_sha256":"613fb5f89431840064ea854f7aa0ed29b06463f09fca3ac2ed697e3f14d331c5","schema_version":"1.0","event_id":"sha256:613fb5f89431840064ea854f7aa0ed29b06463f09fca3ac2ed697e3f14d331c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CNFACDJRR2BGOKLC6R5ZFYGDJL/bundle.json","state_url":"https://pith.science/pith/CNFACDJRR2BGOKLC6R5ZFYGDJL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CNFACDJRR2BGOKLC6R5ZFYGDJL/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-27T07:11:04Z","links":{"resolver":"https://pith.science/pith/CNFACDJRR2BGOKLC6R5ZFYGDJL","bundle":"https://pith.science/pith/CNFACDJRR2BGOKLC6R5ZFYGDJL/bundle.json","state":"https://pith.science/pith/CNFACDJRR2BGOKLC6R5ZFYGDJL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CNFACDJRR2BGOKLC6R5ZFYGDJL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CNFACDJRR2BGOKLC6R5ZFYGDJL","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":"b214de59d58b9a5c7b18487c4235af45c7d8520390d6721ab00735dabec127ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-27T17:27:50Z","title_canon_sha256":"1fd0efdd5b679d87724ecd93b2e3592c8d85dcd179b91218f63d8014f04f542a"},"schema_version":"1.0","source":{"id":"1708.08114","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.08114","created_at":"2026-05-18T00:36:36Z"},{"alias_kind":"arxiv_version","alias_value":"1708.08114v1","created_at":"2026-05-18T00:36:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.08114","created_at":"2026-05-18T00:36:36Z"},{"alias_kind":"pith_short_12","alias_value":"CNFACDJRR2BG","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CNFACDJRR2BGOKLC","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CNFACDJR","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:613fb5f89431840064ea854f7aa0ed29b06463f09fca3ac2ed697e3f14d331c5","target":"graph","created_at":"2026-05-18T00:36:36Z","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":"The Belgian chocolate problem involves maximizing a parameter {\\delta} over a non-convex region of polynomials. In this paper we detail a global optimization method for this problem that outperforms previous such methods by exploiting underlying algebraic structure. Previous work has focused on iterative methods that, due to the complicated non-convex feasible region, may require many iterations or result in non-optimal {\\delta}. By contrast, our method locates the largest known value of {\\delta} in a non-iterative manner. We do this by using the algebraic structure to go directly to large lim","authors_text":"Nigel Boston, Zachary Charles","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-27T17:27:50Z","title":"Exploiting Algebraic Structure in Global Optimization and the Belgian Chocolate Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.08114","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:7df2603a24d89fdac890584a458e417eb84301ead14d7c7f9373bc24e500ddc2","target":"record","created_at":"2026-05-18T00:36:36Z","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":"b214de59d58b9a5c7b18487c4235af45c7d8520390d6721ab00735dabec127ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-27T17:27:50Z","title_canon_sha256":"1fd0efdd5b679d87724ecd93b2e3592c8d85dcd179b91218f63d8014f04f542a"},"schema_version":"1.0","source":{"id":"1708.08114","kind":"arxiv","version":1}},"canonical_sha256":"134a010d318e82672962f47b92e0c34afec7c329a66898f0e0cd9b4b790962f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"134a010d318e82672962f47b92e0c34afec7c329a66898f0e0cd9b4b790962f7","first_computed_at":"2026-05-18T00:36:36.971663Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:36.971663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zXAMirfEJwAte6wugwOrU0tRaX+l/REcYG0nv1actQnryPISNTRYJ3SHqFKPv5QMXfDgqXQKh59UyCgYeL3nCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:36.972291Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.08114","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7df2603a24d89fdac890584a458e417eb84301ead14d7c7f9373bc24e500ddc2","sha256:613fb5f89431840064ea854f7aa0ed29b06463f09fca3ac2ed697e3f14d331c5"],"state_sha256":"0603186d48266db731b5aa61cf5f5720d2233a9c315e6616c2e1962deb5e3470"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xVJPgem+IU+1mKN3J9KnrHBW8XrUmPOuT0XZx/INMwW15QR8P9yHTupxhSdGso4gx/tTwUn2XurRg948zJOmCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T07:11:04.045863Z","bundle_sha256":"9f33152e5034e058634e982115b0201aab023171636ddc78495fc9b3250f756e"}}