{"as_of":"2026-07-15T07:22:00Z","canonical_paper_id":"BEJHGDJP","canonical_url":"https://pith.science/paper/BEJHGDJP/integrity","context_digest":"sha256:04de3b02dff1b7d50c296cf1c3720f71ae6d3960164cab31bb4dc4f32024d531","coverage_summary":[],"findings":[],"findings_empty_copy":"No checks are listed for this paper yet.","findings_observation_state":"no_listed_checks","links":{"arxiv":"https://arxiv.org/abs/quant-ph/0405149","bundle_json":"/pith/BEJHGDJP2U3YEZWS5VJ3YI3MEM/bundle.json","citation_record":"/paper/BEJHGDJP/citation-record","evidence":"/evidence","html":"/paper/BEJHGDJP/integrity","integrity_json":"/paper/BEJHGDJP/integrity.json","json":"/paper/BEJHGDJP/integrity.json","legacy_integrity_json":"/pith/BEJHGDJP/integrity.json","paper":"/paper/BEJHGDJP","reference_changes":"/flags?citing=BEJHGDJP"},"paper":{"arxiv_id":"quant-ph/0405149","latest_version":1,"primary_cat":"quant-ph","title":"Bounds on localisable information via semidefinite programming"},"pith_number":"pith:2004:BEJHGDJP2U3YEZWS5VJ3YI3MEM","pith_short":"BEJHGDJP2U3YEZWS5VJ3YI3MEM","record":{"arxiv_id":"quant-ph/0405149","claim":"As of an unrecorded date, Pith completed 0 of 0 listed checks against arXiv:quant-ph/0405149. No listed check completed, so this record makes no findings claim.","counts":{"completed":0,"failed":0,"listed":0,"not_collected":0,"not_requested":0,"partial":0,"public_findings_from_completed":0,"skipped":0,"unavailable":0,"withheld":0},"coverage":[],"observed_at":null,"refusal":"This is a record of named checks, not a clean-status claim or a paper verdict.","schema":"pith.integrity.v1"},"schema":"pith.paper-integrity-record.v1","species":"LEDGER"}