{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:SSP6BONAHFG5N6VSRPY7ZY3FGW","short_pith_number":"pith:SSP6BONA","canonical_record":{"source":{"id":"1510.06797","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-23T01:31:30Z","cross_cats_sorted":[],"title_canon_sha256":"bfefa2c9e72e6defa3a1e89927ca9bf01b29b249cee82c335d74b2b454c070e9","abstract_canon_sha256":"af2cc48c0fdf93b7dc0e1a2e608491333f065bc810158dbf404c9829dff3cd56"},"schema_version":"1.0"},"canonical_sha256":"949fe0b9a0394dd6fab28bf1fce36535aa1da26067c39195c85aa0895a841476","source":{"kind":"arxiv","id":"1510.06797","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.06797","created_at":"2026-05-17T23:57:19Z"},{"alias_kind":"arxiv_version","alias_value":"1510.06797v3","created_at":"2026-05-17T23:57:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06797","created_at":"2026-05-17T23:57:19Z"},{"alias_kind":"pith_short_12","alias_value":"SSP6BONAHFG5","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SSP6BONAHFG5N6VS","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SSP6BONA","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:SSP6BONAHFG5N6VSRPY7ZY3FGW","target":"record","payload":{"canonical_record":{"source":{"id":"1510.06797","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-23T01:31:30Z","cross_cats_sorted":[],"title_canon_sha256":"bfefa2c9e72e6defa3a1e89927ca9bf01b29b249cee82c335d74b2b454c070e9","abstract_canon_sha256":"af2cc48c0fdf93b7dc0e1a2e608491333f065bc810158dbf404c9829dff3cd56"},"schema_version":"1.0"},"canonical_sha256":"949fe0b9a0394dd6fab28bf1fce36535aa1da26067c39195c85aa0895a841476","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:19.824364Z","signature_b64":"rBEBe8HoSxChnFLcTGDC/AmWOQjK0QUeCoiK0bn+zyBZ+TynhhYpV4YmKm/w1mpb2xFXcttsvVmmQo5ItNMFBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"949fe0b9a0394dd6fab28bf1fce36535aa1da26067c39195c85aa0895a841476","last_reissued_at":"2026-05-17T23:57:19.823602Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:19.823602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.06797","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:57:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lM+OHGFLCE8GZqtE/NrqDJiuHm00dvv9aVOPxq8kshkgJghbnF58ObY6Y02ME0GyJ2NF2WvhIYWq8eCCf+ToBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:17:40.078078Z"},"content_sha256":"78cebb60e18f116487a31b34f68b052b12f3493fc728563c065ff5c7335ac7f5","schema_version":"1.0","event_id":"sha256:78cebb60e18f116487a31b34f68b052b12f3493fc728563c065ff5c7335ac7f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:SSP6BONAHFG5N6VSRPY7ZY3FGW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Alternative SDP and SOCP Approximations for Polynomial Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bissan Ghaddar, Joe Naoum-Sawaya, Luis F. Zuluaga, Xiaolong Kuang","submitted_at":"2015-10-23T01:31:30Z","abstract_excerpt":"In theory, hierarchies of semidefinite programming (SDP) relaxations based on sum of squares (SOS) polynomials have been shown to provide arbitrarily close approximations for a general polynomial optimization problem (POP). However, due to the computational challenge of solving SDPs, it becomes difficult to use SDP hierarchies for large-scale problems. To address this, hierarchies of second-order cone programming (SOCP) relaxations resulting from a restriction of the SOS polynomial condition have been recently proposed to approximate POPs. Here, we consider alternative ways to use this SOCP re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06797","kind":"arxiv","version":3},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:57:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SlCdWEbC58WUN4ENrRRW2QH1fRsqS1YJGrsS00B+f5jCSGFSCIrsbwcsuzJgPYqNObgRTfwMiSuRyM5ZcDLMCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:17:40.078645Z"},"content_sha256":"1dc8794353a23708c1f33c89b6847f897783180584eab7ccf8fd15d4f45d6ad7","schema_version":"1.0","event_id":"sha256:1dc8794353a23708c1f33c89b6847f897783180584eab7ccf8fd15d4f45d6ad7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SSP6BONAHFG5N6VSRPY7ZY3FGW/bundle.json","state_url":"https://pith.science/pith/SSP6BONAHFG5N6VSRPY7ZY3FGW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SSP6BONAHFG5N6VSRPY7ZY3FGW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T21:17:40Z","links":{"resolver":"https://pith.science/pith/SSP6BONAHFG5N6VSRPY7ZY3FGW","bundle":"https://pith.science/pith/SSP6BONAHFG5N6VSRPY7ZY3FGW/bundle.json","state":"https://pith.science/pith/SSP6BONAHFG5N6VSRPY7ZY3FGW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SSP6BONAHFG5N6VSRPY7ZY3FGW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SSP6BONAHFG5N6VSRPY7ZY3FGW","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":"af2cc48c0fdf93b7dc0e1a2e608491333f065bc810158dbf404c9829dff3cd56","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-23T01:31:30Z","title_canon_sha256":"bfefa2c9e72e6defa3a1e89927ca9bf01b29b249cee82c335d74b2b454c070e9"},"schema_version":"1.0","source":{"id":"1510.06797","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.06797","created_at":"2026-05-17T23:57:19Z"},{"alias_kind":"arxiv_version","alias_value":"1510.06797v3","created_at":"2026-05-17T23:57:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06797","created_at":"2026-05-17T23:57:19Z"},{"alias_kind":"pith_short_12","alias_value":"SSP6BONAHFG5","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SSP6BONAHFG5N6VS","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SSP6BONA","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:1dc8794353a23708c1f33c89b6847f897783180584eab7ccf8fd15d4f45d6ad7","target":"graph","created_at":"2026-05-17T23:57:19Z","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 theory, hierarchies of semidefinite programming (SDP) relaxations based on sum of squares (SOS) polynomials have been shown to provide arbitrarily close approximations for a general polynomial optimization problem (POP). However, due to the computational challenge of solving SDPs, it becomes difficult to use SDP hierarchies for large-scale problems. To address this, hierarchies of second-order cone programming (SOCP) relaxations resulting from a restriction of the SOS polynomial condition have been recently proposed to approximate POPs. Here, we consider alternative ways to use this SOCP re","authors_text":"Bissan Ghaddar, Joe Naoum-Sawaya, Luis F. Zuluaga, Xiaolong Kuang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-23T01:31:30Z","title":"Alternative SDP and SOCP Approximations for Polynomial Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06797","kind":"arxiv","version":3},"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:78cebb60e18f116487a31b34f68b052b12f3493fc728563c065ff5c7335ac7f5","target":"record","created_at":"2026-05-17T23:57:19Z","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":"af2cc48c0fdf93b7dc0e1a2e608491333f065bc810158dbf404c9829dff3cd56","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-23T01:31:30Z","title_canon_sha256":"bfefa2c9e72e6defa3a1e89927ca9bf01b29b249cee82c335d74b2b454c070e9"},"schema_version":"1.0","source":{"id":"1510.06797","kind":"arxiv","version":3}},"canonical_sha256":"949fe0b9a0394dd6fab28bf1fce36535aa1da26067c39195c85aa0895a841476","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"949fe0b9a0394dd6fab28bf1fce36535aa1da26067c39195c85aa0895a841476","first_computed_at":"2026-05-17T23:57:19.823602Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:19.823602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rBEBe8HoSxChnFLcTGDC/AmWOQjK0QUeCoiK0bn+zyBZ+TynhhYpV4YmKm/w1mpb2xFXcttsvVmmQo5ItNMFBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:19.824364Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.06797","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78cebb60e18f116487a31b34f68b052b12f3493fc728563c065ff5c7335ac7f5","sha256:1dc8794353a23708c1f33c89b6847f897783180584eab7ccf8fd15d4f45d6ad7"],"state_sha256":"634f2b9b76ed1d83deb3ad8b4640a1882926337537f785a42380923adeb55627"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m74QP3RTelnjP4Qv8Vkh6MFbOUKcm7U1abh1ZTGQhVoC72zi08sEHKfMppMuGWIcceHycASNiOKsCoHPm1WlBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T21:17:40.081132Z","bundle_sha256":"402fe7992dfd533721a63e1a4dec45a28a3a50f56a6757e84cd3deb981e34761"}}