{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:RUOTXVQKAFNJDVOMVKLFRBQ75S","short_pith_number":"pith:RUOTXVQK","schema_version":"1.0","canonical_sha256":"8d1d3bd60a015a91d5ccaa9658861fec96b50709538fcb5c55d1f390b135ca90","source":{"kind":"arxiv","id":"1311.3726","version":2},"attestation_state":"computed","paper":{"title":"Lower Bounds for a Polynomial on a basic closed semialgebraic set using geometric programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Mehdi Ghasemi, Murray Marshall","submitted_at":"2013-11-15T04:49:58Z","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)"},"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":"1311.3726","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-11-15T04:49:58Z","cross_cats_sorted":[],"title_canon_sha256":"f8ac13cd0c834b2f96f1c74003ff07c476b9344d95104f6b9ff727648822e521","abstract_canon_sha256":"73b67758a89e1d098ec3e663b14bfb01f26a5726aff07a4be718a7ce6ff51c56"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:47.658515Z","signature_b64":"Nxw6e4YFQ+wQ0VNXjx5ZTmdYruODMLCtpJDM0yk8gP0fy6PahkrztTuM4VG0kIPB/otTNMXFuSN+i5hREiEqDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d1d3bd60a015a91d5ccaa9658861fec96b50709538fcb5c55d1f390b135ca90","last_reissued_at":"2026-05-18T02:20:47.657817Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:47.657817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds for a Polynomial on a basic closed semialgebraic set using geometric programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Mehdi Ghasemi, Murray Marshall","submitted_at":"2013-11-15T04:49:58Z","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)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3726","kind":"arxiv","version":2},"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":"1311.3726","created_at":"2026-05-18T02:20:47.657936+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.3726v2","created_at":"2026-05-18T02:20:47.657936+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3726","created_at":"2026-05-18T02:20:47.657936+00:00"},{"alias_kind":"pith_short_12","alias_value":"RUOTXVQKAFNJ","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"RUOTXVQKAFNJDVOM","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"RUOTXVQK","created_at":"2026-05-18T12:27:59.945178+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/RUOTXVQKAFNJDVOMVKLFRBQ75S","json":"https://pith.science/pith/RUOTXVQKAFNJDVOMVKLFRBQ75S.json","graph_json":"https://pith.science/api/pith-number/RUOTXVQKAFNJDVOMVKLFRBQ75S/graph.json","events_json":"https://pith.science/api/pith-number/RUOTXVQKAFNJDVOMVKLFRBQ75S/events.json","paper":"https://pith.science/paper/RUOTXVQK"},"agent_actions":{"view_html":"https://pith.science/pith/RUOTXVQKAFNJDVOMVKLFRBQ75S","download_json":"https://pith.science/pith/RUOTXVQKAFNJDVOMVKLFRBQ75S.json","view_paper":"https://pith.science/paper/RUOTXVQK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.3726&json=true","fetch_graph":"https://pith.science/api/pith-number/RUOTXVQKAFNJDVOMVKLFRBQ75S/graph.json","fetch_events":"https://pith.science/api/pith-number/RUOTXVQKAFNJDVOMVKLFRBQ75S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RUOTXVQKAFNJDVOMVKLFRBQ75S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RUOTXVQKAFNJDVOMVKLFRBQ75S/action/storage_attestation","attest_author":"https://pith.science/pith/RUOTXVQKAFNJDVOMVKLFRBQ75S/action/author_attestation","sign_citation":"https://pith.science/pith/RUOTXVQKAFNJDVOMVKLFRBQ75S/action/citation_signature","submit_replication":"https://pith.science/pith/RUOTXVQKAFNJDVOMVKLFRBQ75S/action/replication_record"}},"created_at":"2026-05-18T02:20:47.657936+00:00","updated_at":"2026-05-18T02:20:47.657936+00:00"}