{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CNFACDJRR2BGOKLC6R5ZFYGDJL","short_pith_number":"pith:CNFACDJR","schema_version":"1.0","canonical_sha256":"134a010d318e82672962f47b92e0c34afec7c329a66898f0e0cd9b4b790962f7","source":{"kind":"arxiv","id":"1708.08114","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1708.08114","created_at":"2026-05-18T00:36:36.971760+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.08114v1","created_at":"2026-05-18T00:36:36.971760+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.08114","created_at":"2026-05-18T00:36:36.971760+00:00"},{"alias_kind":"pith_short_12","alias_value":"CNFACDJRR2BG","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CNFACDJRR2BGOKLC","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CNFACDJR","created_at":"2026-05-18T12:31:10.602751+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CNFACDJRR2BGOKLC6R5ZFYGDJL","json":"https://pith.science/pith/CNFACDJRR2BGOKLC6R5ZFYGDJL.json","graph_json":"https://pith.science/api/pith-number/CNFACDJRR2BGOKLC6R5ZFYGDJL/graph.json","events_json":"https://pith.science/api/pith-number/CNFACDJRR2BGOKLC6R5ZFYGDJL/events.json","paper":"https://pith.science/paper/CNFACDJR"},"agent_actions":{"view_html":"https://pith.science/pith/CNFACDJRR2BGOKLC6R5ZFYGDJL","download_json":"https://pith.science/pith/CNFACDJRR2BGOKLC6R5ZFYGDJL.json","view_paper":"https://pith.science/paper/CNFACDJR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.08114&json=true","fetch_graph":"https://pith.science/api/pith-number/CNFACDJRR2BGOKLC6R5ZFYGDJL/graph.json","fetch_events":"https://pith.science/api/pith-number/CNFACDJRR2BGOKLC6R5ZFYGDJL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CNFACDJRR2BGOKLC6R5ZFYGDJL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CNFACDJRR2BGOKLC6R5ZFYGDJL/action/storage_attestation","attest_author":"https://pith.science/pith/CNFACDJRR2BGOKLC6R5ZFYGDJL/action/author_attestation","sign_citation":"https://pith.science/pith/CNFACDJRR2BGOKLC6R5ZFYGDJL/action/citation_signature","submit_replication":"https://pith.science/pith/CNFACDJRR2BGOKLC6R5ZFYGDJL/action/replication_record"}},"created_at":"2026-05-18T00:36:36.971760+00:00","updated_at":"2026-05-18T00:36:36.971760+00:00"}