{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FG5L5SQIJTET7EF2JRH7WY27NS","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":"34f2083af8100d186df2996117ce194c10e55c9f2d24e574863f67c8bed68bb3","cross_cats_sorted":["math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-25T14:57:06Z","title_canon_sha256":"49822e1af5c930189da9576eb62327a763a68876b4d5be4ea4b50ca49dcfb865"},"schema_version":"1.0","source":{"id":"1402.6185","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.6185","created_at":"2026-05-18T01:20:02Z"},{"alias_kind":"arxiv_version","alias_value":"1402.6185v4","created_at":"2026-05-18T01:20:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.6185","created_at":"2026-05-18T01:20:02Z"},{"alias_kind":"pith_short_12","alias_value":"FG5L5SQIJTET","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FG5L5SQIJTET7EF2","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FG5L5SQI","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:694640c0c2538e016e19d46701ef4379b5188fecc25b76419b55aa72eb332d7f","target":"graph","created_at":"2026-05-18T01:20:02Z","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":"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","authors_text":"Sadik Iliman, Timo de Wolff","cross_cats":["math.AG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-25T14:57:06Z","title":"Lower Bounds for Polynomials with Simplex Newton Polytopes Based on Geometric Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.6185","kind":"arxiv","version":4},"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:8a952b84a9aaaed99e4e9576b56a0f2f20c698b85571bfa313f06807e2d43977","target":"record","created_at":"2026-05-18T01:20:02Z","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":"34f2083af8100d186df2996117ce194c10e55c9f2d24e574863f67c8bed68bb3","cross_cats_sorted":["math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-25T14:57:06Z","title_canon_sha256":"49822e1af5c930189da9576eb62327a763a68876b4d5be4ea4b50ca49dcfb865"},"schema_version":"1.0","source":{"id":"1402.6185","kind":"arxiv","version":4}},"canonical_sha256":"29babeca084cc93f90ba4c4ffb635f6cb91535ea79b381bc07cbeda891b1d608","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29babeca084cc93f90ba4c4ffb635f6cb91535ea79b381bc07cbeda891b1d608","first_computed_at":"2026-05-18T01:20:02.116700Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:02.116700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ut9awJcnNnFa6Aa9qACALMoBSViJJOECFNODLWvgzkqD8uI8QUr1FSgcCqgotVnxYfyqPXSB3IJ+B5h/+pUQCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:02.117495Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.6185","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a952b84a9aaaed99e4e9576b56a0f2f20c698b85571bfa313f06807e2d43977","sha256:694640c0c2538e016e19d46701ef4379b5188fecc25b76419b55aa72eb332d7f"],"state_sha256":"9e7d6d6f4b84d4ca5949f3df357f33ff3119fb83dd4027ee797a39270ee58da4"}