{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:QUNWGIMGOM666JTPHMIMFHQFNA","short_pith_number":"pith:QUNWGIMG","canonical_record":{"source":{"id":"1901.04921","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-01-15T16:35:03Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"b92c5afcfdecd5ae9d7f638d77bafd73b6fd42dc1d2cac3fe3d641c3faa001e4","abstract_canon_sha256":"7974053766fb8c9695d1176c0f564cda70f49003e12afa0466514ee1809ececc"},"schema_version":"1.0"},"canonical_sha256":"851b632186733def266f3b10c29e056835e1dcbe64a8b507ce295a4720c23999","source":{"kind":"arxiv","id":"1901.04921","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.04921","created_at":"2026-05-17T23:56:21Z"},{"alias_kind":"arxiv_version","alias_value":"1901.04921v1","created_at":"2026-05-17T23:56:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.04921","created_at":"2026-05-17T23:56:21Z"},{"alias_kind":"pith_short_12","alias_value":"QUNWGIMGOM66","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QUNWGIMGOM666JTP","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QUNWGIMG","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:QUNWGIMGOM666JTPHMIMFHQFNA","target":"record","payload":{"canonical_record":{"source":{"id":"1901.04921","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-01-15T16:35:03Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"b92c5afcfdecd5ae9d7f638d77bafd73b6fd42dc1d2cac3fe3d641c3faa001e4","abstract_canon_sha256":"7974053766fb8c9695d1176c0f564cda70f49003e12afa0466514ee1809ececc"},"schema_version":"1.0"},"canonical_sha256":"851b632186733def266f3b10c29e056835e1dcbe64a8b507ce295a4720c23999","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:21.256583Z","signature_b64":"qAyChsUhBjHsltDCrWKIWESUVeIy2KgtPOoKWW7v4BsR9na+YtEbxt4o7Y3iQWA0AFWZFdNrA2IAanzFZaiHDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"851b632186733def266f3b10c29e056835e1dcbe64a8b507ce295a4720c23999","last_reissued_at":"2026-05-17T23:56:21.255908Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:21.255908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.04921","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-05-17T23:56:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y5zItShckI5OMPtIRhYsURNu2ij4a9QDN4mzZexXXgU1jUi09TN5RQtimXqeQRH+8Oygzf1AMQRt9ZuYP4Y5DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T22:59:30.085983Z"},"content_sha256":"9ce509bbe072ba24f2096e8513a7c56b47fe9a4395b449d19471125f5bb15b64","schema_version":"1.0","event_id":"sha256:9ce509bbe072ba24f2096e8513a7c56b47fe9a4395b449d19471125f5bb15b64"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:QUNWGIMGOM666JTPHMIMFHQFNA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Semidefinite programming formulations for the completely bounded norm of a tensor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"quant-ph","authors_text":"Monique Laurent, Sander Gribling","submitted_at":"2019-01-15T16:35:03Z","abstract_excerpt":"We show that a certain tensor norm, the completely bounded norm, can be expressed by a semidefinite program. This tensor norm recently attracted attention in the field of quantum computing, where it was used by Arunachalam, Bri\\\"{e}t and Palazuelos for characterizing the quantum query complexity of Boolean functions. Combined with their results, we obtain a new characterization of the quantum query complexity through semidefinite programming. Using the duality theory of semidefinite programming we obtain a new type of certificates for large query complexity. We show that our class of certifica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.04921","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":""},"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:56:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DYTUIXzOXFkM0O3pgEWWtdORnlGa/fr/paAHcwc7dE4UUioXdmBW+g34nO8OlmLvf3EnXg2TaCmHc1r/r/VWCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T22:59:30.086365Z"},"content_sha256":"55859855075bfb20eca419f2cf6808b48b72f58e1dfd26f60baee1f34bcda180","schema_version":"1.0","event_id":"sha256:55859855075bfb20eca419f2cf6808b48b72f58e1dfd26f60baee1f34bcda180"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QUNWGIMGOM666JTPHMIMFHQFNA/bundle.json","state_url":"https://pith.science/pith/QUNWGIMGOM666JTPHMIMFHQFNA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QUNWGIMGOM666JTPHMIMFHQFNA/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-06-20T22:59:30Z","links":{"resolver":"https://pith.science/pith/QUNWGIMGOM666JTPHMIMFHQFNA","bundle":"https://pith.science/pith/QUNWGIMGOM666JTPHMIMFHQFNA/bundle.json","state":"https://pith.science/pith/QUNWGIMGOM666JTPHMIMFHQFNA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QUNWGIMGOM666JTPHMIMFHQFNA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QUNWGIMGOM666JTPHMIMFHQFNA","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":"7974053766fb8c9695d1176c0f564cda70f49003e12afa0466514ee1809ececc","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-01-15T16:35:03Z","title_canon_sha256":"b92c5afcfdecd5ae9d7f638d77bafd73b6fd42dc1d2cac3fe3d641c3faa001e4"},"schema_version":"1.0","source":{"id":"1901.04921","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.04921","created_at":"2026-05-17T23:56:21Z"},{"alias_kind":"arxiv_version","alias_value":"1901.04921v1","created_at":"2026-05-17T23:56:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.04921","created_at":"2026-05-17T23:56:21Z"},{"alias_kind":"pith_short_12","alias_value":"QUNWGIMGOM66","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QUNWGIMGOM666JTP","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QUNWGIMG","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:55859855075bfb20eca419f2cf6808b48b72f58e1dfd26f60baee1f34bcda180","target":"graph","created_at":"2026-05-17T23:56:21Z","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":"We show that a certain tensor norm, the completely bounded norm, can be expressed by a semidefinite program. This tensor norm recently attracted attention in the field of quantum computing, where it was used by Arunachalam, Bri\\\"{e}t and Palazuelos for characterizing the quantum query complexity of Boolean functions. Combined with their results, we obtain a new characterization of the quantum query complexity through semidefinite programming. Using the duality theory of semidefinite programming we obtain a new type of certificates for large query complexity. We show that our class of certifica","authors_text":"Monique Laurent, Sander Gribling","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-01-15T16:35:03Z","title":"Semidefinite programming formulations for the completely bounded norm of a tensor"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.04921","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:9ce509bbe072ba24f2096e8513a7c56b47fe9a4395b449d19471125f5bb15b64","target":"record","created_at":"2026-05-17T23:56:21Z","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":"7974053766fb8c9695d1176c0f564cda70f49003e12afa0466514ee1809ececc","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-01-15T16:35:03Z","title_canon_sha256":"b92c5afcfdecd5ae9d7f638d77bafd73b6fd42dc1d2cac3fe3d641c3faa001e4"},"schema_version":"1.0","source":{"id":"1901.04921","kind":"arxiv","version":1}},"canonical_sha256":"851b632186733def266f3b10c29e056835e1dcbe64a8b507ce295a4720c23999","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"851b632186733def266f3b10c29e056835e1dcbe64a8b507ce295a4720c23999","first_computed_at":"2026-05-17T23:56:21.255908Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:21.255908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qAyChsUhBjHsltDCrWKIWESUVeIy2KgtPOoKWW7v4BsR9na+YtEbxt4o7Y3iQWA0AFWZFdNrA2IAanzFZaiHDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:21.256583Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.04921","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ce509bbe072ba24f2096e8513a7c56b47fe9a4395b449d19471125f5bb15b64","sha256:55859855075bfb20eca419f2cf6808b48b72f58e1dfd26f60baee1f34bcda180"],"state_sha256":"e91703ca7498602c53cb75943b9f8966847804f22fb307dd297e103d8371ff28"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CVSOkqhpNE8SauK4KU08Z5nLaTI6v+o7D6kQ13BPj2HEB1t6oD1xbqVylNbHoZpJPpZMUNWLisD3Z4tZbnkWAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T22:59:30.088300Z","bundle_sha256":"0a631dc632d7666d03c53623b625624cb7384417b134fbcef472e9629f2ea9f9"}}