{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:O7BCDNCI7XNL5PA2SJX4QFCGCN","short_pith_number":"pith:O7BCDNCI","schema_version":"1.0","canonical_sha256":"77c221b448fddabebc1a926fc814461344ed51ee2e9afa22688ffc6e678375f7","source":{"kind":"arxiv","id":"1602.00401","version":1},"attestation_state":"computed","paper":{"title":"Quantum Capacities for Entanglement Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Bei Zeng, Nengkun Yu, Shawn X Cui, Zhengfeng Ji","submitted_at":"2016-02-01T06:23:55Z","abstract_excerpt":"We discuss quantum capacities for two types of entanglement networks: $\\mathcal{Q}$ for the quantum repeater network with free classical communication, and $\\mathcal{R}$ for the tensor network as the rank of the linear operation represented by the tensor network. We find that $\\mathcal{Q}$ always equals $\\mathcal{R}$ in the regularized case for the samenetwork graph. However, the relationships between the corresponding one-shot capacities $\\mathcal{Q}_1$ and $\\mathcal{R}_1$ are more complicated, and the min-cut upper bound is in general not achievable. We show that the tensor network can be vi"},"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":"1602.00401","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-02-01T06:23:55Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"5582b5ec1c5a8911057a67ee52032d908ca73f79f95553e45428aee181c7ab5b","abstract_canon_sha256":"59f524c129c4d386bca554a1361a3e24f5cad43ac63137c30ffa12d723f61993"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:35.462585Z","signature_b64":"TsQgzyTknGTV1RK9QnAr0ov6M8CxNaNmxu05lSR0X+BAivixKsNimxbJuykVTgsg9cQhCdVdf39s9awCLDQpAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77c221b448fddabebc1a926fc814461344ed51ee2e9afa22688ffc6e678375f7","last_reissued_at":"2026-05-18T01:21:35.461884Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:35.461884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Capacities for Entanglement Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Bei Zeng, Nengkun Yu, Shawn X Cui, Zhengfeng Ji","submitted_at":"2016-02-01T06:23:55Z","abstract_excerpt":"We discuss quantum capacities for two types of entanglement networks: $\\mathcal{Q}$ for the quantum repeater network with free classical communication, and $\\mathcal{R}$ for the tensor network as the rank of the linear operation represented by the tensor network. We find that $\\mathcal{Q}$ always equals $\\mathcal{R}$ in the regularized case for the samenetwork graph. However, the relationships between the corresponding one-shot capacities $\\mathcal{Q}_1$ and $\\mathcal{R}_1$ are more complicated, and the min-cut upper bound is in general not achievable. We show that the tensor network can be vi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00401","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":"1602.00401","created_at":"2026-05-18T01:21:35.461996+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.00401v1","created_at":"2026-05-18T01:21:35.461996+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00401","created_at":"2026-05-18T01:21:35.461996+00:00"},{"alias_kind":"pith_short_12","alias_value":"O7BCDNCI7XNL","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"O7BCDNCI7XNL5PA2","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"O7BCDNCI","created_at":"2026-05-18T12:30:36.002864+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/O7BCDNCI7XNL5PA2SJX4QFCGCN","json":"https://pith.science/pith/O7BCDNCI7XNL5PA2SJX4QFCGCN.json","graph_json":"https://pith.science/api/pith-number/O7BCDNCI7XNL5PA2SJX4QFCGCN/graph.json","events_json":"https://pith.science/api/pith-number/O7BCDNCI7XNL5PA2SJX4QFCGCN/events.json","paper":"https://pith.science/paper/O7BCDNCI"},"agent_actions":{"view_html":"https://pith.science/pith/O7BCDNCI7XNL5PA2SJX4QFCGCN","download_json":"https://pith.science/pith/O7BCDNCI7XNL5PA2SJX4QFCGCN.json","view_paper":"https://pith.science/paper/O7BCDNCI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.00401&json=true","fetch_graph":"https://pith.science/api/pith-number/O7BCDNCI7XNL5PA2SJX4QFCGCN/graph.json","fetch_events":"https://pith.science/api/pith-number/O7BCDNCI7XNL5PA2SJX4QFCGCN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O7BCDNCI7XNL5PA2SJX4QFCGCN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O7BCDNCI7XNL5PA2SJX4QFCGCN/action/storage_attestation","attest_author":"https://pith.science/pith/O7BCDNCI7XNL5PA2SJX4QFCGCN/action/author_attestation","sign_citation":"https://pith.science/pith/O7BCDNCI7XNL5PA2SJX4QFCGCN/action/citation_signature","submit_replication":"https://pith.science/pith/O7BCDNCI7XNL5PA2SJX4QFCGCN/action/replication_record"}},"created_at":"2026-05-18T01:21:35.461996+00:00","updated_at":"2026-05-18T01:21:35.461996+00:00"}