{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:BBSKEUZJYMHR4VX7QK7SWNXD6Z","short_pith_number":"pith:BBSKEUZJ","schema_version":"1.0","canonical_sha256":"0864a25329c30f1e56ff82bf2b36e3f669b9662f40948291adc296c4e3d0d511","source":{"kind":"arxiv","id":"1606.02394","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1606.02394","created_at":"2026-05-18T00:17:19.809003+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.02394v3","created_at":"2026-05-18T00:17:19.809003+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02394","created_at":"2026-05-18T00:17:19.809003+00:00"},{"alias_kind":"pith_short_12","alias_value":"BBSKEUZJYMHR","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"BBSKEUZJYMHR4VX7","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"BBSKEUZJ","created_at":"2026-05-18T12:30:07.202191+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/BBSKEUZJYMHR4VX7QK7SWNXD6Z","json":"https://pith.science/pith/BBSKEUZJYMHR4VX7QK7SWNXD6Z.json","graph_json":"https://pith.science/api/pith-number/BBSKEUZJYMHR4VX7QK7SWNXD6Z/graph.json","events_json":"https://pith.science/api/pith-number/BBSKEUZJYMHR4VX7QK7SWNXD6Z/events.json","paper":"https://pith.science/paper/BBSKEUZJ"},"agent_actions":{"view_html":"https://pith.science/pith/BBSKEUZJYMHR4VX7QK7SWNXD6Z","download_json":"https://pith.science/pith/BBSKEUZJYMHR4VX7QK7SWNXD6Z.json","view_paper":"https://pith.science/paper/BBSKEUZJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.02394&json=true","fetch_graph":"https://pith.science/api/pith-number/BBSKEUZJYMHR4VX7QK7SWNXD6Z/graph.json","fetch_events":"https://pith.science/api/pith-number/BBSKEUZJYMHR4VX7QK7SWNXD6Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BBSKEUZJYMHR4VX7QK7SWNXD6Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BBSKEUZJYMHR4VX7QK7SWNXD6Z/action/storage_attestation","attest_author":"https://pith.science/pith/BBSKEUZJYMHR4VX7QK7SWNXD6Z/action/author_attestation","sign_citation":"https://pith.science/pith/BBSKEUZJYMHR4VX7QK7SWNXD6Z/action/citation_signature","submit_replication":"https://pith.science/pith/BBSKEUZJYMHR4VX7QK7SWNXD6Z/action/replication_record"}},"created_at":"2026-05-18T00:17:19.809003+00:00","updated_at":"2026-05-18T00:17:19.809003+00:00"}