{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:5SV4GPNZAGA5ZEWRKMD2IIZZ5C","short_pith_number":"pith:5SV4GPNZ","schema_version":"1.0","canonical_sha256":"ecabc33db90181dc92d15307a42339e8818ef39c773c17f8e65f67478880eb90","source":{"kind":"arxiv","id":"2310.17827","version":3},"attestation_state":"computed","paper":{"title":"A hierarchy of eigencomputations for polynomial optimization on the sphere","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math.AG","quant-ph"],"primary_cat":"math.OC","authors_text":"Benjamin Lovitz, Nathaniel Johnston","submitted_at":"2023-10-27T00:28:12Z","abstract_excerpt":"We introduce a convergent hierarchy of lower bounds on the minimum value of a real form over the unit sphere. The main practical advantage of our hierarchy over the real sum-of-squares (RSOS) hierarchy is that the lower bound at each level of our hierarchy is obtained by a minimum eigenvalue computation, as opposed to the full semidefinite program (SDP) required at each level of RSOS. In practice, this allows us to compute bounds on much larger forms than are computationally feasible for RSOS. Our hierarchy outperforms previous alternatives to RSOS, both asymptotically and in numerical experim"},"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":"2310.17827","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-10-27T00:28:12Z","cross_cats_sorted":["cs.DS","math.AG","quant-ph"],"title_canon_sha256":"82f7c142869cb909e6a4c8a88d8c590c3d73f4ba22be9b25e119842228aa14c1","abstract_canon_sha256":"a988dd6866cd1e33d49e0941f276224c9f29bf7e3ffcf8ae52ac26e4fcff63ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:36:18.452667Z","signature_b64":"SU/TmKer5gIDPGMUtKX7s/QTr4pjI5GqR7x+rS+aZsV0ReM6ja8/FylAkxvA0oCORD6QMS3BPmjKg3qCXw9yDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecabc33db90181dc92d15307a42339e8818ef39c773c17f8e65f67478880eb90","last_reissued_at":"2026-07-05T11:36:18.452177Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:36:18.452177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A hierarchy of eigencomputations for polynomial optimization on the sphere","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math.AG","quant-ph"],"primary_cat":"math.OC","authors_text":"Benjamin Lovitz, Nathaniel Johnston","submitted_at":"2023-10-27T00:28:12Z","abstract_excerpt":"We introduce a convergent hierarchy of lower bounds on the minimum value of a real form over the unit sphere. The main practical advantage of our hierarchy over the real sum-of-squares (RSOS) hierarchy is that the lower bound at each level of our hierarchy is obtained by a minimum eigenvalue computation, as opposed to the full semidefinite program (SDP) required at each level of RSOS. In practice, this allows us to compute bounds on much larger forms than are computationally feasible for RSOS. Our hierarchy outperforms previous alternatives to RSOS, both asymptotically and in numerical experim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.17827","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/2310.17827/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":"2310.17827","created_at":"2026-07-05T11:36:18.452236+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.17827v3","created_at":"2026-07-05T11:36:18.452236+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.17827","created_at":"2026-07-05T11:36:18.452236+00:00"},{"alias_kind":"pith_short_12","alias_value":"5SV4GPNZAGA5","created_at":"2026-07-05T11:36:18.452236+00:00"},{"alias_kind":"pith_short_16","alias_value":"5SV4GPNZAGA5ZEWR","created_at":"2026-07-05T11:36:18.452236+00:00"},{"alias_kind":"pith_short_8","alias_value":"5SV4GPNZ","created_at":"2026-07-05T11:36:18.452236+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.18580","citing_title":"Convergence rates for polynomial optimization on set products","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5SV4GPNZAGA5ZEWRKMD2IIZZ5C","json":"https://pith.science/pith/5SV4GPNZAGA5ZEWRKMD2IIZZ5C.json","graph_json":"https://pith.science/api/pith-number/5SV4GPNZAGA5ZEWRKMD2IIZZ5C/graph.json","events_json":"https://pith.science/api/pith-number/5SV4GPNZAGA5ZEWRKMD2IIZZ5C/events.json","paper":"https://pith.science/paper/5SV4GPNZ"},"agent_actions":{"view_html":"https://pith.science/pith/5SV4GPNZAGA5ZEWRKMD2IIZZ5C","download_json":"https://pith.science/pith/5SV4GPNZAGA5ZEWRKMD2IIZZ5C.json","view_paper":"https://pith.science/paper/5SV4GPNZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.17827&json=true","fetch_graph":"https://pith.science/api/pith-number/5SV4GPNZAGA5ZEWRKMD2IIZZ5C/graph.json","fetch_events":"https://pith.science/api/pith-number/5SV4GPNZAGA5ZEWRKMD2IIZZ5C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5SV4GPNZAGA5ZEWRKMD2IIZZ5C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5SV4GPNZAGA5ZEWRKMD2IIZZ5C/action/storage_attestation","attest_author":"https://pith.science/pith/5SV4GPNZAGA5ZEWRKMD2IIZZ5C/action/author_attestation","sign_citation":"https://pith.science/pith/5SV4GPNZAGA5ZEWRKMD2IIZZ5C/action/citation_signature","submit_replication":"https://pith.science/pith/5SV4GPNZAGA5ZEWRKMD2IIZZ5C/action/replication_record"}},"created_at":"2026-07-05T11:36:18.452236+00:00","updated_at":"2026-07-05T11:36:18.452236+00:00"}