{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:NHFPFIJ2VOCI745KPW7E6NNNX3","short_pith_number":"pith:NHFPFIJ2","schema_version":"1.0","canonical_sha256":"69caf2a13aab848ff3aa7dbe4f35adbed62b374ec7743b6932e178fbaece32f7","source":{"kind":"arxiv","id":"2105.05698","version":1},"attestation_state":"computed","paper":{"title":"Application of the Level-$2$ Quantum Lasserre Hierarchy in Quantum Approximation Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Kevin Thompson, Ojas Parekh","submitted_at":"2021-05-12T14:33:27Z","abstract_excerpt":"The Lasserre Hierarchy is a set of semidefinite programs which yield increasingly tight bounds on optimal solutions to many NP-hard optimization problems. The hierarchy is parameterized by levels, with a higher level corresponding to a more accurate relaxation. High level programs have proven to be invaluable components of approximation algorithms for many NP-hard optimization problems. There is a natural analogous quantum hierarchy, which is also parameterized by level and provides a relaxation of many (QMA-hard) quantum problems of interest. In contrast to the classical case, however, there "},"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":"2105.05698","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-05-12T14:33:27Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"018bcb36082b383bef33838881ec4f713b3a77a6d2ae83225e1c7732afbd2409","abstract_canon_sha256":"ae0fe2ae64a24b6411218ab286cc3179012ca704a67c7824d9593a4e6f81a684"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:31:27.071002Z","signature_b64":"WqkDoXWbMm07sbcBEHdxmhzv3ehzTmVKYgX6Xf0Iu8MksITLrFCBTt1C5CUTGyq1zpec77FdkexL4vq5IuKHAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69caf2a13aab848ff3aa7dbe4f35adbed62b374ec7743b6932e178fbaece32f7","last_reissued_at":"2026-07-05T03:31:27.070461Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:31:27.070461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Application of the Level-$2$ Quantum Lasserre Hierarchy in Quantum Approximation Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Kevin Thompson, Ojas Parekh","submitted_at":"2021-05-12T14:33:27Z","abstract_excerpt":"The Lasserre Hierarchy is a set of semidefinite programs which yield increasingly tight bounds on optimal solutions to many NP-hard optimization problems. The hierarchy is parameterized by levels, with a higher level corresponding to a more accurate relaxation. High level programs have proven to be invaluable components of approximation algorithms for many NP-hard optimization problems. There is a natural analogous quantum hierarchy, which is also parameterized by level and provides a relaxation of many (QMA-hard) quantum problems of interest. In contrast to the classical case, however, there "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.05698","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2105.05698/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":"2105.05698","created_at":"2026-07-05T03:31:27.070523+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.05698v1","created_at":"2026-07-05T03:31:27.070523+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.05698","created_at":"2026-07-05T03:31:27.070523+00:00"},{"alias_kind":"pith_short_12","alias_value":"NHFPFIJ2VOCI","created_at":"2026-07-05T03:31:27.070523+00:00"},{"alias_kind":"pith_short_16","alias_value":"NHFPFIJ2VOCI745K","created_at":"2026-07-05T03:31:27.070523+00:00"},{"alias_kind":"pith_short_8","alias_value":"NHFPFIJ2","created_at":"2026-07-05T03:31:27.070523+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.04940","citing_title":"Convergence rates of Sum-of-Hermitian-Squares Hierarchies for the Pauli algebra","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NHFPFIJ2VOCI745KPW7E6NNNX3","json":"https://pith.science/pith/NHFPFIJ2VOCI745KPW7E6NNNX3.json","graph_json":"https://pith.science/api/pith-number/NHFPFIJ2VOCI745KPW7E6NNNX3/graph.json","events_json":"https://pith.science/api/pith-number/NHFPFIJ2VOCI745KPW7E6NNNX3/events.json","paper":"https://pith.science/paper/NHFPFIJ2"},"agent_actions":{"view_html":"https://pith.science/pith/NHFPFIJ2VOCI745KPW7E6NNNX3","download_json":"https://pith.science/pith/NHFPFIJ2VOCI745KPW7E6NNNX3.json","view_paper":"https://pith.science/paper/NHFPFIJ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.05698&json=true","fetch_graph":"https://pith.science/api/pith-number/NHFPFIJ2VOCI745KPW7E6NNNX3/graph.json","fetch_events":"https://pith.science/api/pith-number/NHFPFIJ2VOCI745KPW7E6NNNX3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NHFPFIJ2VOCI745KPW7E6NNNX3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NHFPFIJ2VOCI745KPW7E6NNNX3/action/storage_attestation","attest_author":"https://pith.science/pith/NHFPFIJ2VOCI745KPW7E6NNNX3/action/author_attestation","sign_citation":"https://pith.science/pith/NHFPFIJ2VOCI745KPW7E6NNNX3/action/citation_signature","submit_replication":"https://pith.science/pith/NHFPFIJ2VOCI745KPW7E6NNNX3/action/replication_record"}},"created_at":"2026-07-05T03:31:27.070523+00:00","updated_at":"2026-07-05T03:31:27.070523+00:00"}