{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:NHFPFIJ2VOCI745KPW7E6NNNX3","short_pith_number":"pith:NHFPFIJ2","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"},"canonical_sha256":"69caf2a13aab848ff3aa7dbe4f35adbed62b374ec7743b6932e178fbaece32f7","source":{"kind":"arxiv","id":"2105.05698","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.05698","created_at":"2026-07-05T03:31:27Z"},{"alias_kind":"arxiv_version","alias_value":"2105.05698v1","created_at":"2026-07-05T03:31:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.05698","created_at":"2026-07-05T03:31:27Z"},{"alias_kind":"pith_short_12","alias_value":"NHFPFIJ2VOCI","created_at":"2026-07-05T03:31:27Z"},{"alias_kind":"pith_short_16","alias_value":"NHFPFIJ2VOCI745K","created_at":"2026-07-05T03:31:27Z"},{"alias_kind":"pith_short_8","alias_value":"NHFPFIJ2","created_at":"2026-07-05T03:31:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:NHFPFIJ2VOCI745KPW7E6NNNX3","target":"record","payload":{"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"},"canonical_sha256":"69caf2a13aab848ff3aa7dbe4f35adbed62b374ec7743b6932e178fbaece32f7","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"},"source_kind":"arxiv","source_id":"2105.05698","source_version":1,"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-07-05T03:31:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hINeHmONYi5bBa5t9P1zKIX5TEy6VNd+zW5UOjgayumzgP4UNIU5cSFL4/puUXguYUxt23ShK1a7/fOgMJTbBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T08:21:16.360839Z"},"content_sha256":"4c9a367d458c58f0cadbb0596406513c7316a4df11d877c36723a304ff625709","schema_version":"1.0","event_id":"sha256:4c9a367d458c58f0cadbb0596406513c7316a4df11d877c36723a304ff625709"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:NHFPFIJ2VOCI745KPW7E6NNNX3","target":"graph","payload":{"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"},"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-07-05T03:31:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/LNwGqFeaQgueoKJjIPrr2OMt5Bsrx29KSSKXCCTpbLjXKjxXpN6IOqhOz0YqB8vWsqUXhLDo9ZZyqJInqjHCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T08:21:16.361333Z"},"content_sha256":"2cbadb27c52728c275f1d98118e2d6b3e74bca7923c1bbe6f27f1ed962d94db5","schema_version":"1.0","event_id":"sha256:2cbadb27c52728c275f1d98118e2d6b3e74bca7923c1bbe6f27f1ed962d94db5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NHFPFIJ2VOCI745KPW7E6NNNX3/bundle.json","state_url":"https://pith.science/pith/NHFPFIJ2VOCI745KPW7E6NNNX3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NHFPFIJ2VOCI745KPW7E6NNNX3/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-08-11T08:21:16Z","links":{"resolver":"https://pith.science/pith/NHFPFIJ2VOCI745KPW7E6NNNX3","bundle":"https://pith.science/pith/NHFPFIJ2VOCI745KPW7E6NNNX3/bundle.json","state":"https://pith.science/pith/NHFPFIJ2VOCI745KPW7E6NNNX3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NHFPFIJ2VOCI745KPW7E6NNNX3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:NHFPFIJ2VOCI745KPW7E6NNNX3","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":"ae0fe2ae64a24b6411218ab286cc3179012ca704a67c7824d9593a4e6f81a684","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-05-12T14:33:27Z","title_canon_sha256":"018bcb36082b383bef33838881ec4f713b3a77a6d2ae83225e1c7732afbd2409"},"schema_version":"1.0","source":{"id":"2105.05698","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.05698","created_at":"2026-07-05T03:31:27Z"},{"alias_kind":"arxiv_version","alias_value":"2105.05698v1","created_at":"2026-07-05T03:31:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.05698","created_at":"2026-07-05T03:31:27Z"},{"alias_kind":"pith_short_12","alias_value":"NHFPFIJ2VOCI","created_at":"2026-07-05T03:31:27Z"},{"alias_kind":"pith_short_16","alias_value":"NHFPFIJ2VOCI745K","created_at":"2026-07-05T03:31:27Z"},{"alias_kind":"pith_short_8","alias_value":"NHFPFIJ2","created_at":"2026-07-05T03:31:27Z"}],"graph_snapshots":[{"event_id":"sha256:2cbadb27c52728c275f1d98118e2d6b3e74bca7923c1bbe6f27f1ed962d94db5","target":"graph","created_at":"2026-07-05T03:31:27Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2105.05698/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Kevin Thompson, Ojas Parekh","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-05-12T14:33:27Z","title":"Application of the Level-$2$ Quantum Lasserre Hierarchy in Quantum Approximation Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.05698","kind":"arxiv","version":1},"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:4c9a367d458c58f0cadbb0596406513c7316a4df11d877c36723a304ff625709","target":"record","created_at":"2026-07-05T03:31:27Z","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":"ae0fe2ae64a24b6411218ab286cc3179012ca704a67c7824d9593a4e6f81a684","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-05-12T14:33:27Z","title_canon_sha256":"018bcb36082b383bef33838881ec4f713b3a77a6d2ae83225e1c7732afbd2409"},"schema_version":"1.0","source":{"id":"2105.05698","kind":"arxiv","version":1}},"canonical_sha256":"69caf2a13aab848ff3aa7dbe4f35adbed62b374ec7743b6932e178fbaece32f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69caf2a13aab848ff3aa7dbe4f35adbed62b374ec7743b6932e178fbaece32f7","first_computed_at":"2026-07-05T03:31:27.070461Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:31:27.070461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WqkDoXWbMm07sbcBEHdxmhzv3ehzTmVKYgX6Xf0Iu8MksITLrFCBTt1C5CUTGyq1zpec77FdkexL4vq5IuKHAg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:31:27.071002Z","signed_message":"canonical_sha256_bytes"},"source_id":"2105.05698","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c9a367d458c58f0cadbb0596406513c7316a4df11d877c36723a304ff625709","sha256:2cbadb27c52728c275f1d98118e2d6b3e74bca7923c1bbe6f27f1ed962d94db5"],"state_sha256":"14c0b4affd937e3d32eaf12f7e01d6f39e51e44dd46f0fc43d5b56010f6584cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I0xEC/TtC4JOUGj7rodGYXyRvpRAlyi6dZt8AEr/px8uQRXe0jWdw5L5UpIzIf/BykqNSxlLuZ/DdDDQLPBCDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T08:21:16.365781Z","bundle_sha256":"60232de91d3d025ac99d7287d6eb9402b1150f1de8ceae1654f8e00cef5c1610"}}