{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4XYZ4DINWZRBVYYAQL6D7F2OOX","short_pith_number":"pith:4XYZ4DIN","schema_version":"1.0","canonical_sha256":"e5f19e0d0db6621ae30082fc3f974e75ffd8f026082f23b95da090acec0a06fb","source":{"kind":"arxiv","id":"2507.02120","version":1},"attestation_state":"computed","paper":{"title":"A novel exact approach to polynomial optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dick den Hertog, Dimitris Bertsimas, Thodoris Koukouvinos","submitted_at":"2025-07-02T20:05:27Z","abstract_excerpt":"Polynomial optimization problems represent a wide class of optimization problems, with a large number of real-world applications. Current approaches for polynomial optimization, such as the sum of squares (SOS) method, rely on large-scale semidefinite programs, and therefore the scale of problems to which they can be applied is limited and an optimality guarantee is not always provided. Moreover, the problem can have other convex nonlinear parts, that cannot be handled by these approaches. In this paper, we propose an alternative approach for polynomial optimization. We obtain a convex relaxat"},"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":"2507.02120","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-07-02T20:05:27Z","cross_cats_sorted":[],"title_canon_sha256":"01c5d45f81f1e6b9cf7e4e85032941c550e16bfd89ee1bc223c1385345b7a486","abstract_canon_sha256":"a25c4e6819b8902208bfd546e6f678013dbb0b6d698f4e2ce685d221a902113a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:31:12.391849Z","signature_b64":"11yuOEykchFAdPA4EGG+2JKo7KsrHe+5+h9qTX6YKRaJ4bQbGWHldButmLWX1xmeSUB25/ocDn/XdDeU6AyABg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5f19e0d0db6621ae30082fc3f974e75ffd8f026082f23b95da090acec0a06fb","last_reissued_at":"2026-07-05T11:31:12.391330Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:31:12.391330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A novel exact approach to polynomial optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dick den Hertog, Dimitris Bertsimas, Thodoris Koukouvinos","submitted_at":"2025-07-02T20:05:27Z","abstract_excerpt":"Polynomial optimization problems represent a wide class of optimization problems, with a large number of real-world applications. Current approaches for polynomial optimization, such as the sum of squares (SOS) method, rely on large-scale semidefinite programs, and therefore the scale of problems to which they can be applied is limited and an optimality guarantee is not always provided. Moreover, the problem can have other convex nonlinear parts, that cannot be handled by these approaches. In this paper, we propose an alternative approach for polynomial optimization. We obtain a convex relaxat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.02120","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.02120/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2507.02120","created_at":"2026-07-05T11:31:12.391393+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.02120v1","created_at":"2026-07-05T11:31:12.391393+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.02120","created_at":"2026-07-05T11:31:12.391393+00:00"},{"alias_kind":"pith_short_12","alias_value":"4XYZ4DINWZRB","created_at":"2026-07-05T11:31:12.391393+00:00"},{"alias_kind":"pith_short_16","alias_value":"4XYZ4DINWZRBVYYA","created_at":"2026-07-05T11:31:12.391393+00:00"},{"alias_kind":"pith_short_8","alias_value":"4XYZ4DIN","created_at":"2026-07-05T11:31:12.391393+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/4XYZ4DINWZRBVYYAQL6D7F2OOX","json":"https://pith.science/pith/4XYZ4DINWZRBVYYAQL6D7F2OOX.json","graph_json":"https://pith.science/api/pith-number/4XYZ4DINWZRBVYYAQL6D7F2OOX/graph.json","events_json":"https://pith.science/api/pith-number/4XYZ4DINWZRBVYYAQL6D7F2OOX/events.json","paper":"https://pith.science/paper/4XYZ4DIN"},"agent_actions":{"view_html":"https://pith.science/pith/4XYZ4DINWZRBVYYAQL6D7F2OOX","download_json":"https://pith.science/pith/4XYZ4DINWZRBVYYAQL6D7F2OOX.json","view_paper":"https://pith.science/paper/4XYZ4DIN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.02120&json=true","fetch_graph":"https://pith.science/api/pith-number/4XYZ4DINWZRBVYYAQL6D7F2OOX/graph.json","fetch_events":"https://pith.science/api/pith-number/4XYZ4DINWZRBVYYAQL6D7F2OOX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4XYZ4DINWZRBVYYAQL6D7F2OOX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4XYZ4DINWZRBVYYAQL6D7F2OOX/action/storage_attestation","attest_author":"https://pith.science/pith/4XYZ4DINWZRBVYYAQL6D7F2OOX/action/author_attestation","sign_citation":"https://pith.science/pith/4XYZ4DINWZRBVYYAQL6D7F2OOX/action/citation_signature","submit_replication":"https://pith.science/pith/4XYZ4DINWZRBVYYAQL6D7F2OOX/action/replication_record"}},"created_at":"2026-07-05T11:31:12.391393+00:00","updated_at":"2026-07-05T11:31:12.391393+00:00"}