{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BBSKEUZJYMHR4VX7QK7SWNXD6Z","short_pith_number":"pith:BBSKEUZJ","canonical_record":{"source":{"id":"1606.02394","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-06-08T04:39:48Z","cross_cats_sorted":["cs.IT","cs.NI","math-ph","math.IT","math.MP"],"title_canon_sha256":"a032c4a7a11fb67153a3e396c0e7761942ae08d97e0632d79db249ce6b5a8a61","abstract_canon_sha256":"e76c3f5b399781d2b974e9659340ccce2cadb9032b211f54ac95d4cfedb85ae0"},"schema_version":"1.0"},"canonical_sha256":"0864a25329c30f1e56ff82bf2b36e3f669b9662f40948291adc296c4e3d0d511","source":{"kind":"arxiv","id":"1606.02394","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.02394","created_at":"2026-05-18T00:17:19Z"},{"alias_kind":"arxiv_version","alias_value":"1606.02394v3","created_at":"2026-05-18T00:17:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02394","created_at":"2026-05-18T00:17:19Z"},{"alias_kind":"pith_short_12","alias_value":"BBSKEUZJYMHR","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BBSKEUZJYMHR4VX7","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BBSKEUZJ","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BBSKEUZJYMHR4VX7QK7SWNXD6Z","target":"record","payload":{"canonical_record":{"source":{"id":"1606.02394","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-06-08T04:39:48Z","cross_cats_sorted":["cs.IT","cs.NI","math-ph","math.IT","math.MP"],"title_canon_sha256":"a032c4a7a11fb67153a3e396c0e7761942ae08d97e0632d79db249ce6b5a8a61","abstract_canon_sha256":"e76c3f5b399781d2b974e9659340ccce2cadb9032b211f54ac95d4cfedb85ae0"},"schema_version":"1.0"},"canonical_sha256":"0864a25329c30f1e56ff82bf2b36e3f669b9662f40948291adc296c4e3d0d511","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:19.809426Z","signature_b64":"MWZC9Eu37FQzrdlv/mPwcb8SOn0mCHs7XG2fMAWOD2ebtggl8fAobVIYW46i5d2bTQAHX5/+9JUXq0UR2em+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0864a25329c30f1e56ff82bf2b36e3f669b9662f40948291adc296c4e3d0d511","last_reissued_at":"2026-05-18T00:17:19.808929Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:19.808929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.02394","source_version":3,"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-18T00:17:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"geybDJlAVUuA8vQ66H06Ev2QjDQZ0k0ShbUEbevM5/8cDKmSR99saL91YPO7XaMRamuySx8l6p5oFdFusNe6Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:01:40.077046Z"},"content_sha256":"1bbee2ac06e4b0f823cfdc36210ee413885b4309c84c4e67b704a80496b926ca","schema_version":"1.0","event_id":"sha256:1bbee2ac06e4b0f823cfdc36210ee413885b4309c84c4e67b704a80496b926ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BBSKEUZJYMHR4VX7QK7SWNXD6Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal quantum networks and one-shot entropies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NI","math-ph","math.IT","math.MP"],"primary_cat":"quant-ph","authors_text":"Daniel Ebler, Giulio Chiribella","submitted_at":"2016-06-08T04:39:48Z","abstract_excerpt":"We develop a semidefinite programming method for the optimization of quantum networks, including both causal networks and networks with indefinite causal structure. Our method applies to a broad class of performance measures, defined operationally in terms of interactive tests set up by a verifier. We show that the optimal performance is equal to a max relative entropy, which quantifies the informativeness of the test. Building on this result, we extend the notion of conditional min-entropy from quantum states to quantum causal networks. The optimization method is illustrated in a number of ap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02394","kind":"arxiv","version":3},"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-18T00:17:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IwBQ+ZFxO6iTQ20O21wx9wlpXNDjJSTQQtC8GPbkXLiBwkIB6oSXmtV/zNE65R4/MNye95zHVHRSgVVF5aSvCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:01:40.077698Z"},"content_sha256":"da8ee40005eeefb942d8932b9e79d15d2d59d8fd04b4d96ba5785528a8d8abca","schema_version":"1.0","event_id":"sha256:da8ee40005eeefb942d8932b9e79d15d2d59d8fd04b4d96ba5785528a8d8abca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BBSKEUZJYMHR4VX7QK7SWNXD6Z/bundle.json","state_url":"https://pith.science/pith/BBSKEUZJYMHR4VX7QK7SWNXD6Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BBSKEUZJYMHR4VX7QK7SWNXD6Z/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-05-25T19:01:40Z","links":{"resolver":"https://pith.science/pith/BBSKEUZJYMHR4VX7QK7SWNXD6Z","bundle":"https://pith.science/pith/BBSKEUZJYMHR4VX7QK7SWNXD6Z/bundle.json","state":"https://pith.science/pith/BBSKEUZJYMHR4VX7QK7SWNXD6Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BBSKEUZJYMHR4VX7QK7SWNXD6Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BBSKEUZJYMHR4VX7QK7SWNXD6Z","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":"e76c3f5b399781d2b974e9659340ccce2cadb9032b211f54ac95d4cfedb85ae0","cross_cats_sorted":["cs.IT","cs.NI","math-ph","math.IT","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-06-08T04:39:48Z","title_canon_sha256":"a032c4a7a11fb67153a3e396c0e7761942ae08d97e0632d79db249ce6b5a8a61"},"schema_version":"1.0","source":{"id":"1606.02394","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.02394","created_at":"2026-05-18T00:17:19Z"},{"alias_kind":"arxiv_version","alias_value":"1606.02394v3","created_at":"2026-05-18T00:17:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02394","created_at":"2026-05-18T00:17:19Z"},{"alias_kind":"pith_short_12","alias_value":"BBSKEUZJYMHR","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BBSKEUZJYMHR4VX7","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BBSKEUZJ","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:da8ee40005eeefb942d8932b9e79d15d2d59d8fd04b4d96ba5785528a8d8abca","target":"graph","created_at":"2026-05-18T00:17:19Z","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 develop a semidefinite programming method for the optimization of quantum networks, including both causal networks and networks with indefinite causal structure. Our method applies to a broad class of performance measures, defined operationally in terms of interactive tests set up by a verifier. We show that the optimal performance is equal to a max relative entropy, which quantifies the informativeness of the test. Building on this result, we extend the notion of conditional min-entropy from quantum states to quantum causal networks. The optimization method is illustrated in a number of ap","authors_text":"Daniel Ebler, Giulio Chiribella","cross_cats":["cs.IT","cs.NI","math-ph","math.IT","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-06-08T04:39:48Z","title":"Optimal quantum networks and one-shot entropies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02394","kind":"arxiv","version":3},"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:1bbee2ac06e4b0f823cfdc36210ee413885b4309c84c4e67b704a80496b926ca","target":"record","created_at":"2026-05-18T00:17:19Z","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":"e76c3f5b399781d2b974e9659340ccce2cadb9032b211f54ac95d4cfedb85ae0","cross_cats_sorted":["cs.IT","cs.NI","math-ph","math.IT","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-06-08T04:39:48Z","title_canon_sha256":"a032c4a7a11fb67153a3e396c0e7761942ae08d97e0632d79db249ce6b5a8a61"},"schema_version":"1.0","source":{"id":"1606.02394","kind":"arxiv","version":3}},"canonical_sha256":"0864a25329c30f1e56ff82bf2b36e3f669b9662f40948291adc296c4e3d0d511","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0864a25329c30f1e56ff82bf2b36e3f669b9662f40948291adc296c4e3d0d511","first_computed_at":"2026-05-18T00:17:19.808929Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:19.808929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MWZC9Eu37FQzrdlv/mPwcb8SOn0mCHs7XG2fMAWOD2ebtggl8fAobVIYW46i5d2bTQAHX5/+9JUXq0UR2em+Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:19.809426Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.02394","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1bbee2ac06e4b0f823cfdc36210ee413885b4309c84c4e67b704a80496b926ca","sha256:da8ee40005eeefb942d8932b9e79d15d2d59d8fd04b4d96ba5785528a8d8abca"],"state_sha256":"76cbcb84d9babfea147040b163ee00b63de58d8a6998c5c438651ef3fd35122c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"arXSMWpY28UwdVJDOPmdli0c1o1NdZdgphx6uV9vZMjToO77/tqHZgT4YpRXQoH6ohGEG0yRsLibopQgJ34jDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:01:40.080913Z","bundle_sha256":"fb60cc45e6624cb49442a2fcdf8712bdfe1e06a483981ed7edf098929fa03630"}}