{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:O7BCDNCI7XNL5PA2SJX4QFCGCN","short_pith_number":"pith:O7BCDNCI","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"},"canonical_sha256":"77c221b448fddabebc1a926fc814461344ed51ee2e9afa22688ffc6e678375f7","source":{"kind":"arxiv","id":"1602.00401","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00401","created_at":"2026-05-18T01:21:35Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00401v1","created_at":"2026-05-18T01:21:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00401","created_at":"2026-05-18T01:21:35Z"},{"alias_kind":"pith_short_12","alias_value":"O7BCDNCI7XNL","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"O7BCDNCI7XNL5PA2","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"O7BCDNCI","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:O7BCDNCI7XNL5PA2SJX4QFCGCN","target":"record","payload":{"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"},"canonical_sha256":"77c221b448fddabebc1a926fc814461344ed51ee2e9afa22688ffc6e678375f7","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"},"source_kind":"arxiv","source_id":"1602.00401","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:21:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y2/fPjwHI3GFSarzN+E/+Roksbms4FvbrTjyQgEM/8t5Kfj7NGuOfTWjo+6D14gKw/U2MLCPb9xtOSQ711D9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T05:51:09.041013Z"},"content_sha256":"87b888799d668a64bb5da146f0f333d0980b4e59cc58d907f20f987fce5356f6","schema_version":"1.0","event_id":"sha256:87b888799d668a64bb5da146f0f333d0980b4e59cc58d907f20f987fce5356f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:O7BCDNCI7XNL5PA2SJX4QFCGCN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:21:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hQtwZAuyTgaMbZcRZKfYdozRwaHHBl0QzGNDP4szzXfifyol0uvH68pyaaNlO1Q/sndLzV7oNRBnNg9uxNJjCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T05:51:09.041564Z"},"content_sha256":"3ba9274294b62179b1a7cdd543165946104d1ce6ad4e3b51feb5b2003f287734","schema_version":"1.0","event_id":"sha256:3ba9274294b62179b1a7cdd543165946104d1ce6ad4e3b51feb5b2003f287734"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O7BCDNCI7XNL5PA2SJX4QFCGCN/bundle.json","state_url":"https://pith.science/pith/O7BCDNCI7XNL5PA2SJX4QFCGCN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O7BCDNCI7XNL5PA2SJX4QFCGCN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T05:51:09Z","links":{"resolver":"https://pith.science/pith/O7BCDNCI7XNL5PA2SJX4QFCGCN","bundle":"https://pith.science/pith/O7BCDNCI7XNL5PA2SJX4QFCGCN/bundle.json","state":"https://pith.science/pith/O7BCDNCI7XNL5PA2SJX4QFCGCN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O7BCDNCI7XNL5PA2SJX4QFCGCN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:O7BCDNCI7XNL5PA2SJX4QFCGCN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"59f524c129c4d386bca554a1361a3e24f5cad43ac63137c30ffa12d723f61993","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-02-01T06:23:55Z","title_canon_sha256":"5582b5ec1c5a8911057a67ee52032d908ca73f79f95553e45428aee181c7ab5b"},"schema_version":"1.0","source":{"id":"1602.00401","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00401","created_at":"2026-05-18T01:21:35Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00401v1","created_at":"2026-05-18T01:21:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00401","created_at":"2026-05-18T01:21:35Z"},{"alias_kind":"pith_short_12","alias_value":"O7BCDNCI7XNL","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"O7BCDNCI7XNL5PA2","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"O7BCDNCI","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:3ba9274294b62179b1a7cdd543165946104d1ce6ad4e3b51feb5b2003f287734","target":"graph","created_at":"2026-05-18T01:21:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Bei Zeng, Nengkun Yu, Shawn X Cui, Zhengfeng Ji","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-02-01T06:23:55Z","title":"Quantum Capacities for Entanglement Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00401","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:87b888799d668a64bb5da146f0f333d0980b4e59cc58d907f20f987fce5356f6","target":"record","created_at":"2026-05-18T01:21:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"59f524c129c4d386bca554a1361a3e24f5cad43ac63137c30ffa12d723f61993","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-02-01T06:23:55Z","title_canon_sha256":"5582b5ec1c5a8911057a67ee52032d908ca73f79f95553e45428aee181c7ab5b"},"schema_version":"1.0","source":{"id":"1602.00401","kind":"arxiv","version":1}},"canonical_sha256":"77c221b448fddabebc1a926fc814461344ed51ee2e9afa22688ffc6e678375f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77c221b448fddabebc1a926fc814461344ed51ee2e9afa22688ffc6e678375f7","first_computed_at":"2026-05-18T01:21:35.461884Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:35.461884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TsQgzyTknGTV1RK9QnAr0ov6M8CxNaNmxu05lSR0X+BAivixKsNimxbJuykVTgsg9cQhCdVdf39s9awCLDQpAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:35.462585Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.00401","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87b888799d668a64bb5da146f0f333d0980b4e59cc58d907f20f987fce5356f6","sha256:3ba9274294b62179b1a7cdd543165946104d1ce6ad4e3b51feb5b2003f287734"],"state_sha256":"84b7f9dea28be59fa57120a3b776d7f78b5a97d76c3e855f0b90ae03e37038b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4vslBrxJ5tbzRnE210gT33T1DhWkD/EMLWybjAFoOpg7P/+kJQDanZgFIvGSItAXlLT4hJc2NRzRwvKCd87ODQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T05:51:09.044206Z","bundle_sha256":"ed678cace48fd9cfe067cd9fc94ef38aef4a9148b6d37f87aa698aa317187a7a"}}