{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SBMRCTUS6VBJELGO6352U2RDQY","short_pith_number":"pith:SBMRCTUS","schema_version":"1.0","canonical_sha256":"9059114e92f542922ccef6fbaa6a238632cb03251baf9ad02f5dd7051ba4494d","source":{"kind":"arxiv","id":"1902.06041","version":2},"attestation_state":"computed","paper":{"title":"Tangencies and Polynomial Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Tien-Son Pham","submitted_at":"2019-02-16T04:45:06Z","abstract_excerpt":"Given a polynomial function $f \\colon \\mathbb{R}^n \\rightarrow \\mathbb{R}$ and a unbounded basic closed semi-algebraic set $S \\subset \\mathbb{R}^n,$ in this paper we show that the conditions listed below are characterized exactly in terms of the so-called {\\em tangency variety} of $f$ on $S$:\n  (i) The $f$ is bounded from below on $S;$\n  (ii) The $f$ attains its infimum on $S;$\n  (iii) The sublevel set $\\{x \\in S \\ | \\ f(x) \\le \\lambda\\}$ for $\\lambda \\in \\mathbb{R}$ is compact;\n  (iv) The $f$ is coercive on $S.$\n  Besides, we also provide some stability criteria for boundedness and coercivity"},"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":"1902.06041","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-16T04:45:06Z","cross_cats_sorted":[],"title_canon_sha256":"446b688b5ba0487b95f393c7771360e4f75324bf446b44a3e1b08cc451322c04","abstract_canon_sha256":"dbcce357856b56f174f866927e7ee260dd9554d536548962ff3dd921c7212d5d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:41.703869Z","signature_b64":"5oHj4pgikESlWygf4/xu1uKqoHE8qq0XSGG+Wj9MPK5gc+LLg9zQW0cwRu9AWu45WTAIPTUBjY4XcVPD7G3zAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9059114e92f542922ccef6fbaa6a238632cb03251baf9ad02f5dd7051ba4494d","last_reissued_at":"2026-05-17T23:51:41.703436Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:41.703436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tangencies and Polynomial Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Tien-Son Pham","submitted_at":"2019-02-16T04:45:06Z","abstract_excerpt":"Given a polynomial function $f \\colon \\mathbb{R}^n \\rightarrow \\mathbb{R}$ and a unbounded basic closed semi-algebraic set $S \\subset \\mathbb{R}^n,$ in this paper we show that the conditions listed below are characterized exactly in terms of the so-called {\\em tangency variety} of $f$ on $S$:\n  (i) The $f$ is bounded from below on $S;$\n  (ii) The $f$ attains its infimum on $S;$\n  (iii) The sublevel set $\\{x \\in S \\ | \\ f(x) \\le \\lambda\\}$ for $\\lambda \\in \\mathbb{R}$ is compact;\n  (iv) The $f$ is coercive on $S.$\n  Besides, we also provide some stability criteria for boundedness and coercivity"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.06041","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":"1902.06041","created_at":"2026-05-17T23:51:41.703500+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.06041v2","created_at":"2026-05-17T23:51:41.703500+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06041","created_at":"2026-05-17T23:51:41.703500+00:00"},{"alias_kind":"pith_short_12","alias_value":"SBMRCTUS6VBJ","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"SBMRCTUS6VBJELGO","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"SBMRCTUS","created_at":"2026-05-18T12:33:27.125529+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2112.15289","citing_title":"Homogenization for polynomial optimization with unbounded sets","ref_index":45,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SBMRCTUS6VBJELGO6352U2RDQY","json":"https://pith.science/pith/SBMRCTUS6VBJELGO6352U2RDQY.json","graph_json":"https://pith.science/api/pith-number/SBMRCTUS6VBJELGO6352U2RDQY/graph.json","events_json":"https://pith.science/api/pith-number/SBMRCTUS6VBJELGO6352U2RDQY/events.json","paper":"https://pith.science/paper/SBMRCTUS"},"agent_actions":{"view_html":"https://pith.science/pith/SBMRCTUS6VBJELGO6352U2RDQY","download_json":"https://pith.science/pith/SBMRCTUS6VBJELGO6352U2RDQY.json","view_paper":"https://pith.science/paper/SBMRCTUS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.06041&json=true","fetch_graph":"https://pith.science/api/pith-number/SBMRCTUS6VBJELGO6352U2RDQY/graph.json","fetch_events":"https://pith.science/api/pith-number/SBMRCTUS6VBJELGO6352U2RDQY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SBMRCTUS6VBJELGO6352U2RDQY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SBMRCTUS6VBJELGO6352U2RDQY/action/storage_attestation","attest_author":"https://pith.science/pith/SBMRCTUS6VBJELGO6352U2RDQY/action/author_attestation","sign_citation":"https://pith.science/pith/SBMRCTUS6VBJELGO6352U2RDQY/action/citation_signature","submit_replication":"https://pith.science/pith/SBMRCTUS6VBJELGO6352U2RDQY/action/replication_record"}},"created_at":"2026-05-17T23:51:41.703500+00:00","updated_at":"2026-05-17T23:51:41.703500+00:00"}