{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:PBNVDBZ4SC54ZNZVAMOIERNWDQ","short_pith_number":"pith:PBNVDBZ4","schema_version":"1.0","canonical_sha256":"785b51873c90bbccb735031c8245b61c1a5326f42754fb938dd84afa9ae58075","source":{"kind":"arxiv","id":"1010.1750","version":5},"attestation_state":"computed","paper":{"title":"Faithful Squashed Entanglement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Fernando G. S. L. Brandao, Jon Yard, Matthias Christandl","submitted_at":"2010-10-08T17:55:29Z","abstract_excerpt":"Squashed entanglement is a measure for the entanglement of bipartite quantum states. In this paper we present a lower bound for squashed entanglement in terms of a distance to the set of separable states. This implies that squashed entanglement is faithful, that is, strictly positive if and only if the state is entangled. We derive the bound on squashed entanglement from a bound on quantum conditional mutual information, which is used to define squashed entanglement and corresponds to the amount by which strong subadditivity of von Neumann entropy fails to be saturated. Our result therefore sh"},"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":"1010.1750","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-10-08T17:55:29Z","cross_cats_sorted":[],"title_canon_sha256":"0c8631144fbded8e11c7893cf51846b25b3fcdbf2e72785bdbbc4e854c8b5898","abstract_canon_sha256":"2e9e43872e68a65d23afa1df535397495dda585b774e868a7e7c6d5b0c956db5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:35.724417Z","signature_b64":"7Z34EmMiD+tDcN8qEl2GAP1r/4BbreTrDpJffgT1r7JxyO7DFqDClAsYVykjqTwWx02dPnX7YEaRDL1c4RUeBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"785b51873c90bbccb735031c8245b61c1a5326f42754fb938dd84afa9ae58075","last_reissued_at":"2026-05-18T03:50:35.723942Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:35.723942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faithful Squashed Entanglement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Fernando G. S. L. Brandao, Jon Yard, Matthias Christandl","submitted_at":"2010-10-08T17:55:29Z","abstract_excerpt":"Squashed entanglement is a measure for the entanglement of bipartite quantum states. In this paper we present a lower bound for squashed entanglement in terms of a distance to the set of separable states. This implies that squashed entanglement is faithful, that is, strictly positive if and only if the state is entangled. We derive the bound on squashed entanglement from a bound on quantum conditional mutual information, which is used to define squashed entanglement and corresponds to the amount by which strong subadditivity of von Neumann entropy fails to be saturated. Our result therefore sh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1750","kind":"arxiv","version":5},"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":"1010.1750","created_at":"2026-05-18T03:50:35.724005+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.1750v5","created_at":"2026-05-18T03:50:35.724005+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1750","created_at":"2026-05-18T03:50:35.724005+00:00"},{"alias_kind":"pith_short_12","alias_value":"PBNVDBZ4SC54","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"PBNVDBZ4SC54ZNZV","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"PBNVDBZ4","created_at":"2026-05-18T12:26:12.377268+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.16249","citing_title":"The Collapse of Unentangled Stoquastic Merlin-Arthur Proof Systems","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PBNVDBZ4SC54ZNZVAMOIERNWDQ","json":"https://pith.science/pith/PBNVDBZ4SC54ZNZVAMOIERNWDQ.json","graph_json":"https://pith.science/api/pith-number/PBNVDBZ4SC54ZNZVAMOIERNWDQ/graph.json","events_json":"https://pith.science/api/pith-number/PBNVDBZ4SC54ZNZVAMOIERNWDQ/events.json","paper":"https://pith.science/paper/PBNVDBZ4"},"agent_actions":{"view_html":"https://pith.science/pith/PBNVDBZ4SC54ZNZVAMOIERNWDQ","download_json":"https://pith.science/pith/PBNVDBZ4SC54ZNZVAMOIERNWDQ.json","view_paper":"https://pith.science/paper/PBNVDBZ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.1750&json=true","fetch_graph":"https://pith.science/api/pith-number/PBNVDBZ4SC54ZNZVAMOIERNWDQ/graph.json","fetch_events":"https://pith.science/api/pith-number/PBNVDBZ4SC54ZNZVAMOIERNWDQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PBNVDBZ4SC54ZNZVAMOIERNWDQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PBNVDBZ4SC54ZNZVAMOIERNWDQ/action/storage_attestation","attest_author":"https://pith.science/pith/PBNVDBZ4SC54ZNZVAMOIERNWDQ/action/author_attestation","sign_citation":"https://pith.science/pith/PBNVDBZ4SC54ZNZVAMOIERNWDQ/action/citation_signature","submit_replication":"https://pith.science/pith/PBNVDBZ4SC54ZNZVAMOIERNWDQ/action/replication_record"}},"created_at":"2026-05-18T03:50:35.724005+00:00","updated_at":"2026-05-18T03:50:35.724005+00:00"}