{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FG5L5SQIJTET7EF2JRH7WY27NS","short_pith_number":"pith:FG5L5SQI","schema_version":"1.0","canonical_sha256":"29babeca084cc93f90ba4c4ffb635f6cb91535ea79b381bc07cbeda891b1d608","source":{"kind":"arxiv","id":"1402.6185","version":4},"attestation_state":"computed","paper":{"title":"Lower Bounds for Polynomials with Simplex Newton Polytopes Based on Geometric Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.OC","authors_text":"Sadik Iliman, Timo de Wolff","submitted_at":"2014-02-25T14:57:06Z","abstract_excerpt":"In this article, we propose a geometric programming method in order to compute lower bounds for real polynomials. We provide new sufficient conditions for polynomials to be nonnegative as well as to have a sum of binomial squares representation. These criteria rely on the coefficients and the support of a polynomial and generalize all previous ones by Lasserre, Ghasemi, Marshall, Fidalgo and Kovacec to polynomials with arbitrary simplex Newton polytopes.\n  This generalization yields a geometric programming approach for computing lower bounds for polynomials that significantly extends the geome"},"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":"1402.6185","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-25T14:57:06Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"49822e1af5c930189da9576eb62327a763a68876b4d5be4ea4b50ca49dcfb865","abstract_canon_sha256":"34f2083af8100d186df2996117ce194c10e55c9f2d24e574863f67c8bed68bb3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:02.117495Z","signature_b64":"Ut9awJcnNnFa6Aa9qACALMoBSViJJOECFNODLWvgzkqD8uI8QUr1FSgcCqgotVnxYfyqPXSB3IJ+B5h/+pUQCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29babeca084cc93f90ba4c4ffb635f6cb91535ea79b381bc07cbeda891b1d608","last_reissued_at":"2026-05-18T01:20:02.116700Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:02.116700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds for Polynomials with Simplex Newton Polytopes Based on Geometric Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.OC","authors_text":"Sadik Iliman, Timo de Wolff","submitted_at":"2014-02-25T14:57:06Z","abstract_excerpt":"In this article, we propose a geometric programming method in order to compute lower bounds for real polynomials. We provide new sufficient conditions for polynomials to be nonnegative as well as to have a sum of binomial squares representation. These criteria rely on the coefficients and the support of a polynomial and generalize all previous ones by Lasserre, Ghasemi, Marshall, Fidalgo and Kovacec to polynomials with arbitrary simplex Newton polytopes.\n  This generalization yields a geometric programming approach for computing lower bounds for polynomials that significantly extends the geome"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.6185","kind":"arxiv","version":4},"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":"1402.6185","created_at":"2026-05-18T01:20:02.116825+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.6185v4","created_at":"2026-05-18T01:20:02.116825+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.6185","created_at":"2026-05-18T01:20:02.116825+00:00"},{"alias_kind":"pith_short_12","alias_value":"FG5L5SQIJTET","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FG5L5SQIJTET7EF2","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FG5L5SQI","created_at":"2026-05-18T12:28:28.263976+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/FG5L5SQIJTET7EF2JRH7WY27NS","json":"https://pith.science/pith/FG5L5SQIJTET7EF2JRH7WY27NS.json","graph_json":"https://pith.science/api/pith-number/FG5L5SQIJTET7EF2JRH7WY27NS/graph.json","events_json":"https://pith.science/api/pith-number/FG5L5SQIJTET7EF2JRH7WY27NS/events.json","paper":"https://pith.science/paper/FG5L5SQI"},"agent_actions":{"view_html":"https://pith.science/pith/FG5L5SQIJTET7EF2JRH7WY27NS","download_json":"https://pith.science/pith/FG5L5SQIJTET7EF2JRH7WY27NS.json","view_paper":"https://pith.science/paper/FG5L5SQI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.6185&json=true","fetch_graph":"https://pith.science/api/pith-number/FG5L5SQIJTET7EF2JRH7WY27NS/graph.json","fetch_events":"https://pith.science/api/pith-number/FG5L5SQIJTET7EF2JRH7WY27NS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FG5L5SQIJTET7EF2JRH7WY27NS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FG5L5SQIJTET7EF2JRH7WY27NS/action/storage_attestation","attest_author":"https://pith.science/pith/FG5L5SQIJTET7EF2JRH7WY27NS/action/author_attestation","sign_citation":"https://pith.science/pith/FG5L5SQIJTET7EF2JRH7WY27NS/action/citation_signature","submit_replication":"https://pith.science/pith/FG5L5SQIJTET7EF2JRH7WY27NS/action/replication_record"}},"created_at":"2026-05-18T01:20:02.116825+00:00","updated_at":"2026-05-18T01:20:02.116825+00:00"}