{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:VBYJZ4EDB3WZZUILFZLWSXGS6X","short_pith_number":"pith:VBYJZ4ED","schema_version":"1.0","canonical_sha256":"a8709cf0830eed9cd10b2e57695cd2f5cc31bb8a0f1d8dcc03c0e2749ace8402","source":{"kind":"arxiv","id":"1901.02179","version":1},"attestation_state":"computed","paper":{"title":"A Geometrical Analysis of a Class of Nonconvex Conic Programs for Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kim-Chuan Toh, Masakazu Kojima, Sunyoung Kim","submitted_at":"2019-01-08T07:11:10Z","abstract_excerpt":"We present a geometrical analysis on the completely positive programming reformulation of quadratic optimization problems and its extension to polynomial optimization problems with a class of geometrically defined nonconvex conic programs and their covexification. The class of nonconvex conic programs is described with a linear objective functionin a linear space $V$, and the constraint set is represented geometrically as the intersection of a nonconvex cone $K \\subset V$, a face $J$ of the convex hull of $K$ and a parallel translation $L$ of a supporting hyperplane of the nonconvex cone $K$. "},"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":"1901.02179","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-08T07:11:10Z","cross_cats_sorted":[],"title_canon_sha256":"5ea6585d4f8b009a5fd957bd8d1d05e4cbca1bebeea4b96272676a0ebdc25895","abstract_canon_sha256":"c0df129f18878cbe96ef80f595467ec4e4f3b2e04cc87e790982da752a5ec384"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:43.853310Z","signature_b64":"kw2jNy/C4azzh9HCDHmG5Ir/U81mmu2Tkxxg4kaGLtV9xEKF/BFQ3ucLsctaeK9/q+5sHlTn3d2Jq/mhZZSJDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8709cf0830eed9cd10b2e57695cd2f5cc31bb8a0f1d8dcc03c0e2749ace8402","last_reissued_at":"2026-05-17T23:56:43.852970Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:43.852970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Geometrical Analysis of a Class of Nonconvex Conic Programs for Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kim-Chuan Toh, Masakazu Kojima, Sunyoung Kim","submitted_at":"2019-01-08T07:11:10Z","abstract_excerpt":"We present a geometrical analysis on the completely positive programming reformulation of quadratic optimization problems and its extension to polynomial optimization problems with a class of geometrically defined nonconvex conic programs and their covexification. The class of nonconvex conic programs is described with a linear objective functionin a linear space $V$, and the constraint set is represented geometrically as the intersection of a nonconvex cone $K \\subset V$, a face $J$ of the convex hull of $K$ and a parallel translation $L$ of a supporting hyperplane of the nonconvex cone $K$. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02179","kind":"arxiv","version":1},"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":"1901.02179","created_at":"2026-05-17T23:56:43.853025+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.02179v1","created_at":"2026-05-17T23:56:43.853025+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02179","created_at":"2026-05-17T23:56:43.853025+00:00"},{"alias_kind":"pith_short_12","alias_value":"VBYJZ4EDB3WZ","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"VBYJZ4EDB3WZZUIL","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"VBYJZ4ED","created_at":"2026-05-18T12:33:30.264802+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/VBYJZ4EDB3WZZUILFZLWSXGS6X","json":"https://pith.science/pith/VBYJZ4EDB3WZZUILFZLWSXGS6X.json","graph_json":"https://pith.science/api/pith-number/VBYJZ4EDB3WZZUILFZLWSXGS6X/graph.json","events_json":"https://pith.science/api/pith-number/VBYJZ4EDB3WZZUILFZLWSXGS6X/events.json","paper":"https://pith.science/paper/VBYJZ4ED"},"agent_actions":{"view_html":"https://pith.science/pith/VBYJZ4EDB3WZZUILFZLWSXGS6X","download_json":"https://pith.science/pith/VBYJZ4EDB3WZZUILFZLWSXGS6X.json","view_paper":"https://pith.science/paper/VBYJZ4ED","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.02179&json=true","fetch_graph":"https://pith.science/api/pith-number/VBYJZ4EDB3WZZUILFZLWSXGS6X/graph.json","fetch_events":"https://pith.science/api/pith-number/VBYJZ4EDB3WZZUILFZLWSXGS6X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VBYJZ4EDB3WZZUILFZLWSXGS6X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VBYJZ4EDB3WZZUILFZLWSXGS6X/action/storage_attestation","attest_author":"https://pith.science/pith/VBYJZ4EDB3WZZUILFZLWSXGS6X/action/author_attestation","sign_citation":"https://pith.science/pith/VBYJZ4EDB3WZZUILFZLWSXGS6X/action/citation_signature","submit_replication":"https://pith.science/pith/VBYJZ4EDB3WZZUILFZLWSXGS6X/action/replication_record"}},"created_at":"2026-05-17T23:56:43.853025+00:00","updated_at":"2026-05-17T23:56:43.853025+00:00"}