{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ERAN6SGMFIMCHNUCEUJZK7VPB3","short_pith_number":"pith:ERAN6SGM","schema_version":"1.0","canonical_sha256":"2440df48cc2a1823b6822513957eaf0ec812ffc81689a5dba68eb456d8f56057","source":{"kind":"arxiv","id":"2502.05627","version":1},"attestation_state":"computed","paper":{"title":"Operator convexity along lines, self-concordance, and sandwiched R\\'enyi entropies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"math.OC","authors_text":"Hamza Fawzi, James Saunderson, Kerry He","submitted_at":"2025-02-08T16:17:57Z","abstract_excerpt":"Barrier methods play a central role in the theory and practice of convex optimization. One of the most general and successful analyses of barrier methods for convex optimization, due to Nesterov and Nemirovskii, relies on the notion of self-concordance. While an extremely powerful concept, proving self-concordance of barrier functions can be very difficult. In this paper we give a simple way to verify that the natural logarithmic barrier of a convex nonlinear constraint is self-concordant via the theory of operator convex functions. Namely, we show that if a convex function is operator convex "},"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":"2502.05627","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-02-08T16:17:57Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"14ca58aa23c4261b89a13848ebaa20e78d368622169e50e1362ff9ea639fbc62","abstract_canon_sha256":"b8a432eab53130ddbf50c3742047c1931fbf10a127ab503f0d3a63f0b5506cd5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:11:40.742356Z","signature_b64":"vXezG/zt6RaeAmIxI0hEQ1Sv08fztK+4KFVlCN5iQ/KHFNJKrPYxcD38MyVSAtzTzIwU82FK9IFV+mx9x/7UBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2440df48cc2a1823b6822513957eaf0ec812ffc81689a5dba68eb456d8f56057","last_reissued_at":"2026-07-05T10:11:40.741904Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:11:40.741904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Operator convexity along lines, self-concordance, and sandwiched R\\'enyi entropies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"math.OC","authors_text":"Hamza Fawzi, James Saunderson, Kerry He","submitted_at":"2025-02-08T16:17:57Z","abstract_excerpt":"Barrier methods play a central role in the theory and practice of convex optimization. One of the most general and successful analyses of barrier methods for convex optimization, due to Nesterov and Nemirovskii, relies on the notion of self-concordance. While an extremely powerful concept, proving self-concordance of barrier functions can be very difficult. In this paper we give a simple way to verify that the natural logarithmic barrier of a convex nonlinear constraint is self-concordant via the theory of operator convex functions. Namely, we show that if a convex function is operator convex "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.05627","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.05627/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":"2502.05627","created_at":"2026-07-05T10:11:40.741956+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.05627v1","created_at":"2026-07-05T10:11:40.741956+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.05627","created_at":"2026-07-05T10:11:40.741956+00:00"},{"alias_kind":"pith_short_12","alias_value":"ERAN6SGMFIMC","created_at":"2026-07-05T10:11:40.741956+00:00"},{"alias_kind":"pith_short_16","alias_value":"ERAN6SGMFIMCHNUC","created_at":"2026-07-05T10:11:40.741956+00:00"},{"alias_kind":"pith_short_8","alias_value":"ERAN6SGM","created_at":"2026-07-05T10:11:40.741956+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2502.02319","citing_title":"Generalized Numerical Framework for Improved Finite-Sized Key Rates with R\\'enyi Entropy","ref_index":46,"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":18,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06249","citing_title":"Finite-size general security for relativistic phase shift keying via variable-length quantum key distribution","ref_index":104,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ERAN6SGMFIMCHNUCEUJZK7VPB3","json":"https://pith.science/pith/ERAN6SGMFIMCHNUCEUJZK7VPB3.json","graph_json":"https://pith.science/api/pith-number/ERAN6SGMFIMCHNUCEUJZK7VPB3/graph.json","events_json":"https://pith.science/api/pith-number/ERAN6SGMFIMCHNUCEUJZK7VPB3/events.json","paper":"https://pith.science/paper/ERAN6SGM"},"agent_actions":{"view_html":"https://pith.science/pith/ERAN6SGMFIMCHNUCEUJZK7VPB3","download_json":"https://pith.science/pith/ERAN6SGMFIMCHNUCEUJZK7VPB3.json","view_paper":"https://pith.science/paper/ERAN6SGM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.05627&json=true","fetch_graph":"https://pith.science/api/pith-number/ERAN6SGMFIMCHNUCEUJZK7VPB3/graph.json","fetch_events":"https://pith.science/api/pith-number/ERAN6SGMFIMCHNUCEUJZK7VPB3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ERAN6SGMFIMCHNUCEUJZK7VPB3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ERAN6SGMFIMCHNUCEUJZK7VPB3/action/storage_attestation","attest_author":"https://pith.science/pith/ERAN6SGMFIMCHNUCEUJZK7VPB3/action/author_attestation","sign_citation":"https://pith.science/pith/ERAN6SGMFIMCHNUCEUJZK7VPB3/action/citation_signature","submit_replication":"https://pith.science/pith/ERAN6SGMFIMCHNUCEUJZK7VPB3/action/replication_record"}},"created_at":"2026-07-05T10:11:40.741956+00:00","updated_at":"2026-07-05T10:11:40.741956+00:00"}