{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:D65EWN54OLLHT5FLZNLV43RTLB","short_pith_number":"pith:D65EWN54","schema_version":"1.0","canonical_sha256":"1fba4b37bc72d679f4abcb575e6e33586f8135f94bbf38f68698e08d9ad3fafe","source":{"kind":"arxiv","id":"1204.3912","version":1},"attestation_state":"computed","paper":{"title":"X-matrices provide a lower bound of concurrence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"S. Agarwal, S. M. Hashemi Rafsanjani","submitted_at":"2012-04-17T20:37:41Z","abstract_excerpt":"By focusing on the X-matrix part of a density matrix of two qubits we provide an algebraic lower bound for the concurrence. The lower bound is generalized for cases beyond two qubits and can serve as a sufficient condition for non-separability for bipartite density matrices of arbitrary dimension. Experimentally, our lower bound can be used to confirm non-separability without performing a complete state tomography."},"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":"1204.3912","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-04-17T20:37:41Z","cross_cats_sorted":[],"title_canon_sha256":"0a39030f8ad8cd82852312da1ae33d4343cff2f2f3d2b44a6d2418b2b03995f1","abstract_canon_sha256":"bd58a1de67496e06b98bca3df6e0175e836380f3b5115a8f391838fe10ebd76a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:38.344072Z","signature_b64":"6LtVh4Hm51wkh7ZNl4zrsOx0kpVIIXhRBss7s8K8lcZGqkrJ/p9okMSMaZJ/BDMi2a+++3B8xJCSEXZkkkVTAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1fba4b37bc72d679f4abcb575e6e33586f8135f94bbf38f68698e08d9ad3fafe","last_reissued_at":"2026-05-18T03:57:38.343398Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:38.343398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"X-matrices provide a lower bound of concurrence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"S. Agarwal, S. M. Hashemi Rafsanjani","submitted_at":"2012-04-17T20:37:41Z","abstract_excerpt":"By focusing on the X-matrix part of a density matrix of two qubits we provide an algebraic lower bound for the concurrence. The lower bound is generalized for cases beyond two qubits and can serve as a sufficient condition for non-separability for bipartite density matrices of arbitrary dimension. Experimentally, our lower bound can be used to confirm non-separability without performing a complete state tomography."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.3912","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":"1204.3912","created_at":"2026-05-18T03:57:38.343502+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.3912v1","created_at":"2026-05-18T03:57:38.343502+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.3912","created_at":"2026-05-18T03:57:38.343502+00:00"},{"alias_kind":"pith_short_12","alias_value":"D65EWN54OLLH","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"D65EWN54OLLHT5FL","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"D65EWN54","created_at":"2026-05-18T12:27:01.376967+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/D65EWN54OLLHT5FLZNLV43RTLB","json":"https://pith.science/pith/D65EWN54OLLHT5FLZNLV43RTLB.json","graph_json":"https://pith.science/api/pith-number/D65EWN54OLLHT5FLZNLV43RTLB/graph.json","events_json":"https://pith.science/api/pith-number/D65EWN54OLLHT5FLZNLV43RTLB/events.json","paper":"https://pith.science/paper/D65EWN54"},"agent_actions":{"view_html":"https://pith.science/pith/D65EWN54OLLHT5FLZNLV43RTLB","download_json":"https://pith.science/pith/D65EWN54OLLHT5FLZNLV43RTLB.json","view_paper":"https://pith.science/paper/D65EWN54","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.3912&json=true","fetch_graph":"https://pith.science/api/pith-number/D65EWN54OLLHT5FLZNLV43RTLB/graph.json","fetch_events":"https://pith.science/api/pith-number/D65EWN54OLLHT5FLZNLV43RTLB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D65EWN54OLLHT5FLZNLV43RTLB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D65EWN54OLLHT5FLZNLV43RTLB/action/storage_attestation","attest_author":"https://pith.science/pith/D65EWN54OLLHT5FLZNLV43RTLB/action/author_attestation","sign_citation":"https://pith.science/pith/D65EWN54OLLHT5FLZNLV43RTLB/action/citation_signature","submit_replication":"https://pith.science/pith/D65EWN54OLLHT5FLZNLV43RTLB/action/replication_record"}},"created_at":"2026-05-18T03:57:38.343502+00:00","updated_at":"2026-05-18T03:57:38.343502+00:00"}