{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:RUOTXVQKAFNJDVOMVKLFRBQ75S","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":"73b67758a89e1d098ec3e663b14bfb01f26a5726aff07a4be718a7ce6ff51c56","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-11-15T04:49:58Z","title_canon_sha256":"f8ac13cd0c834b2f96f1c74003ff07c476b9344d95104f6b9ff727648822e521"},"schema_version":"1.0","source":{"id":"1311.3726","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.3726","created_at":"2026-05-18T02:20:47Z"},{"alias_kind":"arxiv_version","alias_value":"1311.3726v2","created_at":"2026-05-18T02:20:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3726","created_at":"2026-05-18T02:20:47Z"},{"alias_kind":"pith_short_12","alias_value":"RUOTXVQKAFNJ","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"RUOTXVQKAFNJDVOM","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"RUOTXVQK","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:27a331ebeed7b21b0fada6ea5d7745e1a7988ab7048c519179cd40b776e4cb50","target":"graph","created_at":"2026-05-18T02:20:47Z","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":"$f,g_1,...,g_m$ be elements of the polynomial ring $\\mathbb{R}[x_1,...,x_n]$. The paper deals with the general problem of computing a lower bound for $f$ on the subset of $\\mathbb{R}^n$ defined by the inequalities $g_i\\ge 0$, $i=1,...,m$. The paper shows that there is an algorithm for computing such a lower bound, based on geometric programming, which applies in a large number of cases. The algorithm extends and generalizes earlier algorithms of Ghasemi and Marshall, dealing with the case $m=0$, and of Ghasemi, Lasserre and Marshall, dealing with the case $m=1$ and $g_1= M-(x_1^d+\\cdots+x_n^d)","authors_text":"Mehdi Ghasemi, Murray Marshall","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-11-15T04:49:58Z","title":"Lower Bounds for a Polynomial on a basic closed semialgebraic set using geometric programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3726","kind":"arxiv","version":2},"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:7f521dee5d1b6919e87e949bf4a673a339265613ec91f3de73e6ae4bb9579475","target":"record","created_at":"2026-05-18T02:20:47Z","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":"73b67758a89e1d098ec3e663b14bfb01f26a5726aff07a4be718a7ce6ff51c56","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-11-15T04:49:58Z","title_canon_sha256":"f8ac13cd0c834b2f96f1c74003ff07c476b9344d95104f6b9ff727648822e521"},"schema_version":"1.0","source":{"id":"1311.3726","kind":"arxiv","version":2}},"canonical_sha256":"8d1d3bd60a015a91d5ccaa9658861fec96b50709538fcb5c55d1f390b135ca90","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d1d3bd60a015a91d5ccaa9658861fec96b50709538fcb5c55d1f390b135ca90","first_computed_at":"2026-05-18T02:20:47.657817Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:47.657817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Nxw6e4YFQ+wQ0VNXjx5ZTmdYruODMLCtpJDM0yk8gP0fy6PahkrztTuM4VG0kIPB/otTNMXFuSN+i5hREiEqDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:47.658515Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.3726","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f521dee5d1b6919e87e949bf4a673a339265613ec91f3de73e6ae4bb9579475","sha256:27a331ebeed7b21b0fada6ea5d7745e1a7988ab7048c519179cd40b776e4cb50"],"state_sha256":"cf37781db16beaee798d10d82547c94a8897dac45c122915e77ec50924fbcdc5"}