{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:QY2GQ6QFNNJHALPKVPB7YOYQ7Y","short_pith_number":"pith:QY2GQ6QF","canonical_record":{"source":{"id":"2603.19388","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-03-19T18:25:31Z","cross_cats_sorted":[],"title_canon_sha256":"d730da73719740af085b62e99d58b46165d167d161db360f6644120c07c00350","abstract_canon_sha256":"8c12060d1920915ce602d6a7d2ce74acf1a198abcee679a4c71827ed6a13d468"},"schema_version":"1.0"},"canonical_sha256":"8634687a056b52702deaabc3fc3b10fe22d017f04549d34b1dfeb4102d805be3","source":{"kind":"arxiv","id":"2603.19388","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.19388","created_at":"2026-07-30T01:19:43Z"},{"alias_kind":"arxiv_version","alias_value":"2603.19388v2","created_at":"2026-07-30T01:19:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.19388","created_at":"2026-07-30T01:19:43Z"},{"alias_kind":"pith_short_12","alias_value":"QY2GQ6QFNNJH","created_at":"2026-07-30T01:19:43Z"},{"alias_kind":"pith_short_16","alias_value":"QY2GQ6QFNNJHALPK","created_at":"2026-07-30T01:19:43Z"},{"alias_kind":"pith_short_8","alias_value":"QY2GQ6QF","created_at":"2026-07-30T01:19:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:QY2GQ6QFNNJHALPKVPB7YOYQ7Y","target":"record","payload":{"canonical_record":{"source":{"id":"2603.19388","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-03-19T18:25:31Z","cross_cats_sorted":[],"title_canon_sha256":"d730da73719740af085b62e99d58b46165d167d161db360f6644120c07c00350","abstract_canon_sha256":"8c12060d1920915ce602d6a7d2ce74acf1a198abcee679a4c71827ed6a13d468"},"schema_version":"1.0"},"canonical_sha256":"8634687a056b52702deaabc3fc3b10fe22d017f04549d34b1dfeb4102d805be3","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8634687a056b52702deaabc3fc3b10fe22d017f04549d34b1dfeb4102d805be3","last_reissued_at":"2026-07-30T01:19:43.046663Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-30T01:19:43.046663Z"},"source_kind":"arxiv","source_id":"2603.19388","source_version":2,"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-30T01:19:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GPmeuPEsmFfDJGVwlnId/jyTz/9WIjkV6MwAhGkt/3NrmWY3RRhbmkZ2b5Pqcxcy7yY1t65Nxxmz7EyRjP19Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T10:49:10.076273Z"},"content_sha256":"6772490729d43015b60b836abf5d8c15c36919b9e4ad7049804eab1f57bc56ab","schema_version":"1.0","event_id":"sha256:6772490729d43015b60b836abf5d8c15c36919b9e4ad7049804eab1f57bc56ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:QY2GQ6QFNNJHALPKVPB7YOYQ7Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Semidefinite block-matrix relaxations for computing quantum correlations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Armin Tavakoli, Carles Roch I Carceller, Nicola D'Alessandro","submitted_at":"2026-03-19T18:25:31Z","abstract_excerpt":"Bounding the correlations predicted by quantum theory is an important challenge in quantum information science. Today's leading approach is semidefinite programming relaxations, but existing methods still cannot account for many relevant types of constraints. Here, we propose a semidefinite relaxation methodology that can incorporate a breadth of constraints needed in various quantum correlation problems, thereby generalising the seminal Navascu\\'es-Pironio-Ac\\'in hierarchy. It yields useful results at reasonable computational cost. We showcase the methodology and its features by using it to a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.19388","kind":"arxiv","version":2},"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/2603.19388/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-30T01:19:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SiGPwMJ6GHirhSK0jGmjINFzd7jGja3YCtlQu25Dm7td7uepB3zpgSEOUIzyNjVgS0eExZ+gDcj+AEkuC9xIAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T10:49:10.076602Z"},"content_sha256":"f789392a3591b0e9f9771b497578f0ecb257d1dbcd9dcb281cb7407b2423cc14","schema_version":"1.0","event_id":"sha256:f789392a3591b0e9f9771b497578f0ecb257d1dbcd9dcb281cb7407b2423cc14"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QY2GQ6QFNNJHALPKVPB7YOYQ7Y/bundle.json","state_url":"https://pith.science/pith/QY2GQ6QFNNJHALPKVPB7YOYQ7Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QY2GQ6QFNNJHALPKVPB7YOYQ7Y/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-14T10:49:10Z","links":{"resolver":"https://pith.science/pith/QY2GQ6QFNNJHALPKVPB7YOYQ7Y","bundle":"https://pith.science/pith/QY2GQ6QFNNJHALPKVPB7YOYQ7Y/bundle.json","state":"https://pith.science/pith/QY2GQ6QFNNJHALPKVPB7YOYQ7Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QY2GQ6QFNNJHALPKVPB7YOYQ7Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:QY2GQ6QFNNJHALPKVPB7YOYQ7Y","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":"8c12060d1920915ce602d6a7d2ce74acf1a198abcee679a4c71827ed6a13d468","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-03-19T18:25:31Z","title_canon_sha256":"d730da73719740af085b62e99d58b46165d167d161db360f6644120c07c00350"},"schema_version":"1.0","source":{"id":"2603.19388","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.19388","created_at":"2026-07-30T01:19:43Z"},{"alias_kind":"arxiv_version","alias_value":"2603.19388v2","created_at":"2026-07-30T01:19:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.19388","created_at":"2026-07-30T01:19:43Z"},{"alias_kind":"pith_short_12","alias_value":"QY2GQ6QFNNJH","created_at":"2026-07-30T01:19:43Z"},{"alias_kind":"pith_short_16","alias_value":"QY2GQ6QFNNJHALPK","created_at":"2026-07-30T01:19:43Z"},{"alias_kind":"pith_short_8","alias_value":"QY2GQ6QF","created_at":"2026-07-30T01:19:43Z"}],"graph_snapshots":[{"event_id":"sha256:f789392a3591b0e9f9771b497578f0ecb257d1dbcd9dcb281cb7407b2423cc14","target":"graph","created_at":"2026-07-30T01:19:43Z","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/2603.19388/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Bounding the correlations predicted by quantum theory is an important challenge in quantum information science. Today's leading approach is semidefinite programming relaxations, but existing methods still cannot account for many relevant types of constraints. Here, we propose a semidefinite relaxation methodology that can incorporate a breadth of constraints needed in various quantum correlation problems, thereby generalising the seminal Navascu\\'es-Pironio-Ac\\'in hierarchy. It yields useful results at reasonable computational cost. We showcase the methodology and its features by using it to a","authors_text":"Armin Tavakoli, Carles Roch I Carceller, Nicola D'Alessandro","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-03-19T18:25:31Z","title":"Semidefinite block-matrix relaxations for computing quantum correlations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.19388","kind":"arxiv","version":2},"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:6772490729d43015b60b836abf5d8c15c36919b9e4ad7049804eab1f57bc56ab","target":"record","created_at":"2026-07-30T01:19:43Z","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":"8c12060d1920915ce602d6a7d2ce74acf1a198abcee679a4c71827ed6a13d468","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-03-19T18:25:31Z","title_canon_sha256":"d730da73719740af085b62e99d58b46165d167d161db360f6644120c07c00350"},"schema_version":"1.0","source":{"id":"2603.19388","kind":"arxiv","version":2}},"canonical_sha256":"8634687a056b52702deaabc3fc3b10fe22d017f04549d34b1dfeb4102d805be3","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8634687a056b52702deaabc3fc3b10fe22d017f04549d34b1dfeb4102d805be3","first_computed_at":"2026-07-30T01:19:43.046663Z","kind":"pith_receipt","last_reissued_at":"2026-07-30T01:19:43.046663Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2603.19388","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6772490729d43015b60b836abf5d8c15c36919b9e4ad7049804eab1f57bc56ab","sha256:f789392a3591b0e9f9771b497578f0ecb257d1dbcd9dcb281cb7407b2423cc14"],"state_sha256":"092afd6db6b14e42a71544848b8764627ea4fbf5b15bf71f1cc789e2eb0eea0b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tooeKazqMdsXfOvTkA7r24/bexQs31r/KPnkSQ7DPCUDvISQpuwblKqGC8FvO1aemjFJ2DZ2MFyrqdlts+oCAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T10:49:10.079401Z","bundle_sha256":"a68541efbbf6cf9843be99ea4c247b1321026d8ab4c333ebc29ecec65464e3a7"}}