{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:IE6EMBDUS6ZOCXOV6MYVBPZTYO","short_pith_number":"pith:IE6EMBDU","schema_version":"1.0","canonical_sha256":"413c46047497b2e15dd5f33150bf33c3a91fd7c26023df818c427dafa1cd7bb9","source":{"kind":"arxiv","id":"2407.00152","version":3},"attestation_state":"computed","paper":{"title":"Quantum key distribution rates from non-symmetric conic optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andr\\'es Gonz\\'alez Lorente, Mateus Ara\\'ujo, Miguel Castillo-Celeita, Pablo V. Parellada","submitted_at":"2024-06-28T18:00:01Z","abstract_excerpt":"Computing key rates in quantum key distribution (QKD) numerically is essential to unlock more powerful protocols, that use more sophisticated measurement bases or quantum systems of higher dimension. It is a difficult optimization problem, that depends on minimizing a convex non-linear function: the (quantum) relative entropy. Standard conic optimization techniques have for a long time been unable to handle the relative entropy cone, as it is a non-symmetric cone, and the standard algorithms can only handle symmetric ones. Recently, however, a practical algorithm has been discovered for optimi"},"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":"2407.00152","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-06-28T18:00:01Z","cross_cats_sorted":[],"title_canon_sha256":"1ff13c79584273604ae94a8cca69bf098434cefd0c120586369cecabae1f8031","abstract_canon_sha256":"56de1bd0734f5d0a8984a7e0ec010af98fd5ab95c4c30e3acb283b65847d9af4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:28:18.618503Z","signature_b64":"0eP+uATg4/dkJTVznnMQqmXiUj5SrBZ+rBRn9sAvcX8dDqso9G5i8yQF2ywmlQ9wK5fooVZFLjwmEieNEBOsDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"413c46047497b2e15dd5f33150bf33c3a91fd7c26023df818c427dafa1cd7bb9","last_reissued_at":"2026-07-05T10:28:18.617520Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:28:18.617520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum key distribution rates from non-symmetric conic optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andr\\'es Gonz\\'alez Lorente, Mateus Ara\\'ujo, Miguel Castillo-Celeita, Pablo V. Parellada","submitted_at":"2024-06-28T18:00:01Z","abstract_excerpt":"Computing key rates in quantum key distribution (QKD) numerically is essential to unlock more powerful protocols, that use more sophisticated measurement bases or quantum systems of higher dimension. It is a difficult optimization problem, that depends on minimizing a convex non-linear function: the (quantum) relative entropy. Standard conic optimization techniques have for a long time been unable to handle the relative entropy cone, as it is a non-symmetric cone, and the standard algorithms can only handle symmetric ones. Recently, however, a practical algorithm has been discovered for optimi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.00152","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2407.00152/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2407.00152","created_at":"2026-07-05T10:28:18.617645+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.00152v3","created_at":"2026-07-05T10:28:18.617645+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.00152","created_at":"2026-07-05T10:28:18.617645+00:00"},{"alias_kind":"pith_short_12","alias_value":"IE6EMBDUS6ZO","created_at":"2026-07-05T10:28:18.617645+00:00"},{"alias_kind":"pith_short_16","alias_value":"IE6EMBDUS6ZOCXOV","created_at":"2026-07-05T10:28:18.617645+00:00"},{"alias_kind":"pith_short_8","alias_value":"IE6EMBDU","created_at":"2026-07-05T10:28:18.617645+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20346","citing_title":"Effective discrete-modulated continuous variable QKD under general attacks","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2511.10584","citing_title":"Finite-size quantum key distribution rates from R\\'enyi entropies using conic optimization","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IE6EMBDUS6ZOCXOV6MYVBPZTYO","json":"https://pith.science/pith/IE6EMBDUS6ZOCXOV6MYVBPZTYO.json","graph_json":"https://pith.science/api/pith-number/IE6EMBDUS6ZOCXOV6MYVBPZTYO/graph.json","events_json":"https://pith.science/api/pith-number/IE6EMBDUS6ZOCXOV6MYVBPZTYO/events.json","paper":"https://pith.science/paper/IE6EMBDU"},"agent_actions":{"view_html":"https://pith.science/pith/IE6EMBDUS6ZOCXOV6MYVBPZTYO","download_json":"https://pith.science/pith/IE6EMBDUS6ZOCXOV6MYVBPZTYO.json","view_paper":"https://pith.science/paper/IE6EMBDU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.00152&json=true","fetch_graph":"https://pith.science/api/pith-number/IE6EMBDUS6ZOCXOV6MYVBPZTYO/graph.json","fetch_events":"https://pith.science/api/pith-number/IE6EMBDUS6ZOCXOV6MYVBPZTYO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IE6EMBDUS6ZOCXOV6MYVBPZTYO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IE6EMBDUS6ZOCXOV6MYVBPZTYO/action/storage_attestation","attest_author":"https://pith.science/pith/IE6EMBDUS6ZOCXOV6MYVBPZTYO/action/author_attestation","sign_citation":"https://pith.science/pith/IE6EMBDUS6ZOCXOV6MYVBPZTYO/action/citation_signature","submit_replication":"https://pith.science/pith/IE6EMBDUS6ZOCXOV6MYVBPZTYO/action/replication_record"}},"created_at":"2026-07-05T10:28:18.617645+00:00","updated_at":"2026-07-05T10:28:18.617645+00:00"}