{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:TERJLUTHFIPD3EPIPPU2PRVLB3","short_pith_number":"pith:TERJLUTH","schema_version":"1.0","canonical_sha256":"992295d2672a1e3d91e87be9a7c6ab0eda78738b6f8f63ba621ca0cb32074482","source":{"kind":"arxiv","id":"2305.16122","version":3},"attestation_state":"computed","paper":{"title":"Hybrid Methods in Polynomial Optimisation","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Gilles Bareilles, Jakub Marecek, Johannes Aspman, Martin Tak\\'a\\v{c}, Vyacheslav Kungurtsev","submitted_at":"2023-05-25T14:55:36Z","abstract_excerpt":"The Moment/Sum-of-squares hierarchy provides a way to compute the global minimizers of polynomial optimization problems (POP), at the cost of solving a sequence of increasingly large semidefinite programs (SDPs). We consider large-scale POPs, for which interior-point methods are no longer able to solve the resulting SDPs. We propose an algorithm that combines a first-order method for solving the SDP relaxation, and a second-order method on a non-convex problem obtained from the POP. The switch from the first to the second-order method is based on a quantitative criterion, whose satisfaction en"},"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":"2305.16122","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2023-05-25T14:55:36Z","cross_cats_sorted":[],"title_canon_sha256":"6a58b58b2b3859a92b57f4f4fa6b267b91132a4aff900cf1975ea4676becacd0","abstract_canon_sha256":"78d636749d81595aedaddecacf6b2f3504a625b11028d6add13be0b14a256ef7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:50:00.296914Z","signature_b64":"BW+ntG++ljZUDRa6P3pv3OEttvreXQCijXESmsfkpCkVxIWtrVxtSsk2pjQz6K7ap7oaJlRdiEbcBKr0bdPRDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"992295d2672a1e3d91e87be9a7c6ab0eda78738b6f8f63ba621ca0cb32074482","last_reissued_at":"2026-07-05T06:50:00.296418Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:50:00.296418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hybrid Methods in Polynomial Optimisation","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Gilles Bareilles, Jakub Marecek, Johannes Aspman, Martin Tak\\'a\\v{c}, Vyacheslav Kungurtsev","submitted_at":"2023-05-25T14:55:36Z","abstract_excerpt":"The Moment/Sum-of-squares hierarchy provides a way to compute the global minimizers of polynomial optimization problems (POP), at the cost of solving a sequence of increasingly large semidefinite programs (SDPs). We consider large-scale POPs, for which interior-point methods are no longer able to solve the resulting SDPs. We propose an algorithm that combines a first-order method for solving the SDP relaxation, and a second-order method on a non-convex problem obtained from the POP. The switch from the first to the second-order method is based on a quantitative criterion, whose satisfaction en"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.16122","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2305.16122/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2305.16122","created_at":"2026-07-05T06:50:00.296477+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.16122v3","created_at":"2026-07-05T06:50:00.296477+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.16122","created_at":"2026-07-05T06:50:00.296477+00:00"},{"alias_kind":"pith_short_12","alias_value":"TERJLUTHFIPD","created_at":"2026-07-05T06:50:00.296477+00:00"},{"alias_kind":"pith_short_16","alias_value":"TERJLUTHFIPD3EPI","created_at":"2026-07-05T06:50:00.296477+00:00"},{"alias_kind":"pith_short_8","alias_value":"TERJLUTH","created_at":"2026-07-05T06:50:00.296477+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/TERJLUTHFIPD3EPIPPU2PRVLB3","json":"https://pith.science/pith/TERJLUTHFIPD3EPIPPU2PRVLB3.json","graph_json":"https://pith.science/api/pith-number/TERJLUTHFIPD3EPIPPU2PRVLB3/graph.json","events_json":"https://pith.science/api/pith-number/TERJLUTHFIPD3EPIPPU2PRVLB3/events.json","paper":"https://pith.science/paper/TERJLUTH"},"agent_actions":{"view_html":"https://pith.science/pith/TERJLUTHFIPD3EPIPPU2PRVLB3","download_json":"https://pith.science/pith/TERJLUTHFIPD3EPIPPU2PRVLB3.json","view_paper":"https://pith.science/paper/TERJLUTH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.16122&json=true","fetch_graph":"https://pith.science/api/pith-number/TERJLUTHFIPD3EPIPPU2PRVLB3/graph.json","fetch_events":"https://pith.science/api/pith-number/TERJLUTHFIPD3EPIPPU2PRVLB3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TERJLUTHFIPD3EPIPPU2PRVLB3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TERJLUTHFIPD3EPIPPU2PRVLB3/action/storage_attestation","attest_author":"https://pith.science/pith/TERJLUTHFIPD3EPIPPU2PRVLB3/action/author_attestation","sign_citation":"https://pith.science/pith/TERJLUTHFIPD3EPIPPU2PRVLB3/action/citation_signature","submit_replication":"https://pith.science/pith/TERJLUTHFIPD3EPIPPU2PRVLB3/action/replication_record"}},"created_at":"2026-07-05T06:50:00.296477+00:00","updated_at":"2026-07-05T06:50:00.296477+00:00"}