{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QUNWGIMGOM666JTPHMIMFHQFNA","short_pith_number":"pith:QUNWGIMG","schema_version":"1.0","canonical_sha256":"851b632186733def266f3b10c29e056835e1dcbe64a8b507ce295a4720c23999","source":{"kind":"arxiv","id":"1901.04921","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1901.04921","created_at":"2026-05-17T23:56:21.256014+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.04921v1","created_at":"2026-05-17T23:56:21.256014+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.04921","created_at":"2026-05-17T23:56:21.256014+00:00"},{"alias_kind":"pith_short_12","alias_value":"QUNWGIMGOM66","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"QUNWGIMGOM666JTP","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"QUNWGIMG","created_at":"2026-05-18T12:33:27.125529+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/QUNWGIMGOM666JTPHMIMFHQFNA","json":"https://pith.science/pith/QUNWGIMGOM666JTPHMIMFHQFNA.json","graph_json":"https://pith.science/api/pith-number/QUNWGIMGOM666JTPHMIMFHQFNA/graph.json","events_json":"https://pith.science/api/pith-number/QUNWGIMGOM666JTPHMIMFHQFNA/events.json","paper":"https://pith.science/paper/QUNWGIMG"},"agent_actions":{"view_html":"https://pith.science/pith/QUNWGIMGOM666JTPHMIMFHQFNA","download_json":"https://pith.science/pith/QUNWGIMGOM666JTPHMIMFHQFNA.json","view_paper":"https://pith.science/paper/QUNWGIMG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.04921&json=true","fetch_graph":"https://pith.science/api/pith-number/QUNWGIMGOM666JTPHMIMFHQFNA/graph.json","fetch_events":"https://pith.science/api/pith-number/QUNWGIMGOM666JTPHMIMFHQFNA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QUNWGIMGOM666JTPHMIMFHQFNA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QUNWGIMGOM666JTPHMIMFHQFNA/action/storage_attestation","attest_author":"https://pith.science/pith/QUNWGIMGOM666JTPHMIMFHQFNA/action/author_attestation","sign_citation":"https://pith.science/pith/QUNWGIMGOM666JTPHMIMFHQFNA/action/citation_signature","submit_replication":"https://pith.science/pith/QUNWGIMGOM666JTPHMIMFHQFNA/action/replication_record"}},"created_at":"2026-05-17T23:56:21.256014+00:00","updated_at":"2026-05-17T23:56:21.256014+00:00"}