{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KY3Q7H2ZIPBKA62P6T7QHBYZHC","short_pith_number":"pith:KY3Q7H2Z","schema_version":"1.0","canonical_sha256":"56370f9f5943c2a07b4ff4ff0387193886f189f15a6e048e4a4bcf661cdfb77b","source":{"kind":"arxiv","id":"2412.08532","version":2},"attestation_state":"computed","paper":{"title":"Bounding Large-Scale Bell Inequalities","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Luke Mortimer","submitted_at":"2024-12-11T16:45:15Z","abstract_excerpt":"Bell inequalities are an important tool for studying non-locality, however quickly become computationally intractable as the system size grows. We consider a novel method for finding an upper bound for the quantum violation of such inequalities by combining the NPA hierarchy, the method of alternating projections, and the memory-efficient optimisation algorithm L-BFGS. Whilst our method may not give the tightest upper bound possible, it often does so several orders of magnitude faster than state-of-the-art solvers, with minimal memory usage, thus allowing solutions to problems that would other"},"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":"2412.08532","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-12-11T16:45:15Z","cross_cats_sorted":[],"title_canon_sha256":"4bc8ad96ce6b663c48540b882b5b345f833df24beec2c1ec4514a9e39d0fd5c9","abstract_canon_sha256":"fe1d01340cfadf561686fece4e268b17219600878013fc4e55d78ef1492ed38e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:20:48.818138Z","signature_b64":"IeJwKlw/cD4xPxAFib3CXgZY7yCs81azppcwbS2BhiuJEYWPmttzAu20cN8sR/19kFn5wubhQEs10ZCs++rgAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56370f9f5943c2a07b4ff4ff0387193886f189f15a6e048e4a4bcf661cdfb77b","last_reissued_at":"2026-07-05T11:20:48.817642Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:20:48.817642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounding Large-Scale Bell Inequalities","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Luke Mortimer","submitted_at":"2024-12-11T16:45:15Z","abstract_excerpt":"Bell inequalities are an important tool for studying non-locality, however quickly become computationally intractable as the system size grows. We consider a novel method for finding an upper bound for the quantum violation of such inequalities by combining the NPA hierarchy, the method of alternating projections, and the memory-efficient optimisation algorithm L-BFGS. Whilst our method may not give the tightest upper bound possible, it often does so several orders of magnitude faster than state-of-the-art solvers, with minimal memory usage, thus allowing solutions to problems that would other"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.08532","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/2412.08532/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":"2412.08532","created_at":"2026-07-05T11:20:48.817703+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.08532v2","created_at":"2026-07-05T11:20:48.817703+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.08532","created_at":"2026-07-05T11:20:48.817703+00:00"},{"alias_kind":"pith_short_12","alias_value":"KY3Q7H2ZIPBK","created_at":"2026-07-05T11:20:48.817703+00:00"},{"alias_kind":"pith_short_16","alias_value":"KY3Q7H2ZIPBKA62P","created_at":"2026-07-05T11:20:48.817703+00:00"},{"alias_kind":"pith_short_8","alias_value":"KY3Q7H2Z","created_at":"2026-07-05T11:20:48.817703+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/KY3Q7H2ZIPBKA62P6T7QHBYZHC","json":"https://pith.science/pith/KY3Q7H2ZIPBKA62P6T7QHBYZHC.json","graph_json":"https://pith.science/api/pith-number/KY3Q7H2ZIPBKA62P6T7QHBYZHC/graph.json","events_json":"https://pith.science/api/pith-number/KY3Q7H2ZIPBKA62P6T7QHBYZHC/events.json","paper":"https://pith.science/paper/KY3Q7H2Z"},"agent_actions":{"view_html":"https://pith.science/pith/KY3Q7H2ZIPBKA62P6T7QHBYZHC","download_json":"https://pith.science/pith/KY3Q7H2ZIPBKA62P6T7QHBYZHC.json","view_paper":"https://pith.science/paper/KY3Q7H2Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.08532&json=true","fetch_graph":"https://pith.science/api/pith-number/KY3Q7H2ZIPBKA62P6T7QHBYZHC/graph.json","fetch_events":"https://pith.science/api/pith-number/KY3Q7H2ZIPBKA62P6T7QHBYZHC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KY3Q7H2ZIPBKA62P6T7QHBYZHC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KY3Q7H2ZIPBKA62P6T7QHBYZHC/action/storage_attestation","attest_author":"https://pith.science/pith/KY3Q7H2ZIPBKA62P6T7QHBYZHC/action/author_attestation","sign_citation":"https://pith.science/pith/KY3Q7H2ZIPBKA62P6T7QHBYZHC/action/citation_signature","submit_replication":"https://pith.science/pith/KY3Q7H2ZIPBKA62P6T7QHBYZHC/action/replication_record"}},"created_at":"2026-07-05T11:20:48.817703+00:00","updated_at":"2026-07-05T11:20:48.817703+00:00"}