{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:QBW5CVW5N2IXHEVA6J6WUNDPDZ","short_pith_number":"pith:QBW5CVW5","schema_version":"1.0","canonical_sha256":"806dd156dd6e917392a0f27d6a346f1e52965533c47cb4bb2749fae8e28e757b","source":{"kind":"arxiv","id":"1104.1000","version":1},"attestation_state":"computed","paper":{"title":"Lower Bound of Concurrence Based on Positive Maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Shao-Ming Fei, Xiao-Sheng Li, Xiu-Hong Gao","submitted_at":"2011-04-06T04:02:26Z","abstract_excerpt":"We study the concurrence of arbitrary dimensional bipartite quantum systems. An explicit analytical lower bound of concurrence is obtained, which detects entanglement for some quantum states better than some well-known separability criteria, and improves the lower bounds such as from the PPT, realignment criteria and the Breuer's entanglement witness."},"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":"1104.1000","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-04-06T04:02:26Z","cross_cats_sorted":[],"title_canon_sha256":"df0c1844449b736cda09c7b61d352473415377397e39ff6b34f367151b91c708","abstract_canon_sha256":"44d23fce51ace0135250fa80373ae474f5ac398c125a21dc4e169aff04365d1d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:53.820287Z","signature_b64":"UfGQk+BOlF94NwRv+awSiO37GUHy6UQfXiK78lA4hpz2wDfbTMvzxSeWVZMKk8m+H+4eErTSnUX80eR6jRvPAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"806dd156dd6e917392a0f27d6a346f1e52965533c47cb4bb2749fae8e28e757b","last_reissued_at":"2026-05-18T04:24:53.819563Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:53.819563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bound of Concurrence Based on Positive Maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Shao-Ming Fei, Xiao-Sheng Li, Xiu-Hong Gao","submitted_at":"2011-04-06T04:02:26Z","abstract_excerpt":"We study the concurrence of arbitrary dimensional bipartite quantum systems. An explicit analytical lower bound of concurrence is obtained, which detects entanglement for some quantum states better than some well-known separability criteria, and improves the lower bounds such as from the PPT, realignment criteria and the Breuer's entanglement witness."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.1000","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":"1104.1000","created_at":"2026-05-18T04:24:53.819706+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.1000v1","created_at":"2026-05-18T04:24:53.819706+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.1000","created_at":"2026-05-18T04:24:53.819706+00:00"},{"alias_kind":"pith_short_12","alias_value":"QBW5CVW5N2IX","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"QBW5CVW5N2IXHEVA","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"QBW5CVW5","created_at":"2026-05-18T12:26:39.201973+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/QBW5CVW5N2IXHEVA6J6WUNDPDZ","json":"https://pith.science/pith/QBW5CVW5N2IXHEVA6J6WUNDPDZ.json","graph_json":"https://pith.science/api/pith-number/QBW5CVW5N2IXHEVA6J6WUNDPDZ/graph.json","events_json":"https://pith.science/api/pith-number/QBW5CVW5N2IXHEVA6J6WUNDPDZ/events.json","paper":"https://pith.science/paper/QBW5CVW5"},"agent_actions":{"view_html":"https://pith.science/pith/QBW5CVW5N2IXHEVA6J6WUNDPDZ","download_json":"https://pith.science/pith/QBW5CVW5N2IXHEVA6J6WUNDPDZ.json","view_paper":"https://pith.science/paper/QBW5CVW5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.1000&json=true","fetch_graph":"https://pith.science/api/pith-number/QBW5CVW5N2IXHEVA6J6WUNDPDZ/graph.json","fetch_events":"https://pith.science/api/pith-number/QBW5CVW5N2IXHEVA6J6WUNDPDZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QBW5CVW5N2IXHEVA6J6WUNDPDZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QBW5CVW5N2IXHEVA6J6WUNDPDZ/action/storage_attestation","attest_author":"https://pith.science/pith/QBW5CVW5N2IXHEVA6J6WUNDPDZ/action/author_attestation","sign_citation":"https://pith.science/pith/QBW5CVW5N2IXHEVA6J6WUNDPDZ/action/citation_signature","submit_replication":"https://pith.science/pith/QBW5CVW5N2IXHEVA6J6WUNDPDZ/action/replication_record"}},"created_at":"2026-05-18T04:24:53.819706+00:00","updated_at":"2026-05-18T04:24:53.819706+00:00"}