{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:QU7Q3TBMMFEC7BDN62KWKF6SNW","short_pith_number":"pith:QU7Q3TBM","schema_version":"1.0","canonical_sha256":"853f0dcc2c61482f846df6956517d26d9a5cc4d9a74097d8811f4fd229ebc910","source":{"kind":"arxiv","id":"0903.1340","version":1},"attestation_state":"computed","paper":{"title":"Concurrence and Entanglement Entropy of Stochastic 1-Qubit Maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Armin Uhlmann, Meik Hellmund","submitted_at":"2009-03-07T11:59:35Z","abstract_excerpt":"Explicit expressions for the concurrence of all positive and trace-preserving (\"stochastic\") 1-qubit maps are presented. We construct the relevant convex roof patterns by a new method. We conclude that two component optimal decompositions always exist. Our results can be transferred to 2xN-quantumsystems providing the concurrence for all rank two density operators as well as lower and upper bounds for their entanglement of formation.\n  We apply these results to a study of the entanglement entropy of 1-qubit stochastic maps which preserve axial symmetry. Using analytic and numeric results we an"},"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":"0903.1340","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-03-07T11:59:35Z","cross_cats_sorted":[],"title_canon_sha256":"bf102eeffddb0030ca5e1e386ee97e4ca24aaff88455aa6a167c04d69b6f3215","abstract_canon_sha256":"a01ef110bc5c437e06351b9b4ab98050d129d6b80b4830d3c04385f75cfe96bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:24:42.338087Z","signature_b64":"oE3AoTk2vkB9og6kzTy1NveBkHvLmG+VVw7JJksmdaFq3SDvJKsuDAbana9UWfZOWqc/0nXDeUTFIkfiemcmDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"853f0dcc2c61482f846df6956517d26d9a5cc4d9a74097d8811f4fd229ebc910","last_reissued_at":"2026-05-18T03:24:42.337416Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:24:42.337416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Concurrence and Entanglement Entropy of Stochastic 1-Qubit Maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Armin Uhlmann, Meik Hellmund","submitted_at":"2009-03-07T11:59:35Z","abstract_excerpt":"Explicit expressions for the concurrence of all positive and trace-preserving (\"stochastic\") 1-qubit maps are presented. We construct the relevant convex roof patterns by a new method. We conclude that two component optimal decompositions always exist. Our results can be transferred to 2xN-quantumsystems providing the concurrence for all rank two density operators as well as lower and upper bounds for their entanglement of formation.\n  We apply these results to a study of the entanglement entropy of 1-qubit stochastic maps which preserve axial symmetry. Using analytic and numeric results we an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.1340","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":"0903.1340","created_at":"2026-05-18T03:24:42.337530+00:00"},{"alias_kind":"arxiv_version","alias_value":"0903.1340v1","created_at":"2026-05-18T03:24:42.337530+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.1340","created_at":"2026-05-18T03:24:42.337530+00:00"},{"alias_kind":"pith_short_12","alias_value":"QU7Q3TBMMFEC","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"QU7Q3TBMMFEC7BDN","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"QU7Q3TBM","created_at":"2026-05-18T12:26:01.383474+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/QU7Q3TBMMFEC7BDN62KWKF6SNW","json":"https://pith.science/pith/QU7Q3TBMMFEC7BDN62KWKF6SNW.json","graph_json":"https://pith.science/api/pith-number/QU7Q3TBMMFEC7BDN62KWKF6SNW/graph.json","events_json":"https://pith.science/api/pith-number/QU7Q3TBMMFEC7BDN62KWKF6SNW/events.json","paper":"https://pith.science/paper/QU7Q3TBM"},"agent_actions":{"view_html":"https://pith.science/pith/QU7Q3TBMMFEC7BDN62KWKF6SNW","download_json":"https://pith.science/pith/QU7Q3TBMMFEC7BDN62KWKF6SNW.json","view_paper":"https://pith.science/paper/QU7Q3TBM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0903.1340&json=true","fetch_graph":"https://pith.science/api/pith-number/QU7Q3TBMMFEC7BDN62KWKF6SNW/graph.json","fetch_events":"https://pith.science/api/pith-number/QU7Q3TBMMFEC7BDN62KWKF6SNW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QU7Q3TBMMFEC7BDN62KWKF6SNW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QU7Q3TBMMFEC7BDN62KWKF6SNW/action/storage_attestation","attest_author":"https://pith.science/pith/QU7Q3TBMMFEC7BDN62KWKF6SNW/action/author_attestation","sign_citation":"https://pith.science/pith/QU7Q3TBMMFEC7BDN62KWKF6SNW/action/citation_signature","submit_replication":"https://pith.science/pith/QU7Q3TBMMFEC7BDN62KWKF6SNW/action/replication_record"}},"created_at":"2026-05-18T03:24:42.337530+00:00","updated_at":"2026-05-18T03:24:42.337530+00:00"}