{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:MX2G7Z5NIE3U2CRMOD72XIH3ZR","short_pith_number":"pith:MX2G7Z5N","schema_version":"1.0","canonical_sha256":"65f46fe7ad41374d0a2c70ffaba0fbcc4e7d4911b2c44bce3800e875b112e27d","source":{"kind":"arxiv","id":"2507.05205","version":1},"attestation_state":"computed","paper":{"title":"Alternating minimization for computing doubly minimized Petz Renyi mutual information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Laura Burri","submitted_at":"2025-07-07T17:11:58Z","abstract_excerpt":"The doubly minimized Petz Renyi mutual information (PRMI) of order $\\alpha$ is defined as the minimization of the Petz divergence of order $\\alpha$ of a fixed bipartite quantum state $\\rho_{AB}$ relative to any product state $\\sigma_A\\otimes \\tau_B$. To date, no closed-form expression for this measure has been found, necessitating the development of numerical methods for its computation. In this work, we show that alternating minimization over $\\sigma_A$ and $\\tau_B$ asymptotically converges to the doubly minimized PRMI for any $\\alpha\\in (\\frac{1}{2},1)\\cup (1,2]$, by proving linear convergen"},"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":"2507.05205","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-07-07T17:11:58Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"5228bdc14f41888c892f1e19640fa6f9689ecc75da7841715b81451724368e69","abstract_canon_sha256":"f0f2caf97282bb889721b7073ed814a32ae97aceabb16f44a5b5ebee55d0ba8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:33:10.656447Z","signature_b64":"b3amIReOHx9/Vzge0cEj38m4SwqxuyTZX6S2ZgVZA0mRnJZDamRFJ+GUjUa4xdFB49JbLFQrtjNHf4Q2pukIAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65f46fe7ad41374d0a2c70ffaba0fbcc4e7d4911b2c44bce3800e875b112e27d","last_reissued_at":"2026-07-05T11:33:10.655826Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:33:10.655826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Alternating minimization for computing doubly minimized Petz Renyi mutual information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Laura Burri","submitted_at":"2025-07-07T17:11:58Z","abstract_excerpt":"The doubly minimized Petz Renyi mutual information (PRMI) of order $\\alpha$ is defined as the minimization of the Petz divergence of order $\\alpha$ of a fixed bipartite quantum state $\\rho_{AB}$ relative to any product state $\\sigma_A\\otimes \\tau_B$. To date, no closed-form expression for this measure has been found, necessitating the development of numerical methods for its computation. In this work, we show that alternating minimization over $\\sigma_A$ and $\\tau_B$ asymptotically converges to the doubly minimized PRMI for any $\\alpha\\in (\\frac{1}{2},1)\\cup (1,2]$, by proving linear convergen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.05205","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/2507.05205/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":"2507.05205","created_at":"2026-07-05T11:33:10.655901+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.05205v1","created_at":"2026-07-05T11:33:10.655901+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.05205","created_at":"2026-07-05T11:33:10.655901+00:00"},{"alias_kind":"pith_short_12","alias_value":"MX2G7Z5NIE3U","created_at":"2026-07-05T11:33:10.655901+00:00"},{"alias_kind":"pith_short_16","alias_value":"MX2G7Z5NIE3U2CRM","created_at":"2026-07-05T11:33:10.655901+00:00"},{"alias_kind":"pith_short_8","alias_value":"MX2G7Z5N","created_at":"2026-07-05T11:33:10.655901+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.06399","citing_title":"A Linearly Convergent Algorithm for Computing the Petz-Augustin Mean","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MX2G7Z5NIE3U2CRMOD72XIH3ZR","json":"https://pith.science/pith/MX2G7Z5NIE3U2CRMOD72XIH3ZR.json","graph_json":"https://pith.science/api/pith-number/MX2G7Z5NIE3U2CRMOD72XIH3ZR/graph.json","events_json":"https://pith.science/api/pith-number/MX2G7Z5NIE3U2CRMOD72XIH3ZR/events.json","paper":"https://pith.science/paper/MX2G7Z5N"},"agent_actions":{"view_html":"https://pith.science/pith/MX2G7Z5NIE3U2CRMOD72XIH3ZR","download_json":"https://pith.science/pith/MX2G7Z5NIE3U2CRMOD72XIH3ZR.json","view_paper":"https://pith.science/paper/MX2G7Z5N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.05205&json=true","fetch_graph":"https://pith.science/api/pith-number/MX2G7Z5NIE3U2CRMOD72XIH3ZR/graph.json","fetch_events":"https://pith.science/api/pith-number/MX2G7Z5NIE3U2CRMOD72XIH3ZR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MX2G7Z5NIE3U2CRMOD72XIH3ZR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MX2G7Z5NIE3U2CRMOD72XIH3ZR/action/storage_attestation","attest_author":"https://pith.science/pith/MX2G7Z5NIE3U2CRMOD72XIH3ZR/action/author_attestation","sign_citation":"https://pith.science/pith/MX2G7Z5NIE3U2CRMOD72XIH3ZR/action/citation_signature","submit_replication":"https://pith.science/pith/MX2G7Z5NIE3U2CRMOD72XIH3ZR/action/replication_record"}},"created_at":"2026-07-05T11:33:10.655901+00:00","updated_at":"2026-07-05T11:33:10.655901+00:00"}