{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:2TNG3E2GUVTPFKVJVAZADRHLDW","short_pith_number":"pith:2TNG3E2G","schema_version":"1.0","canonical_sha256":"d4da6d9346a566f2aaa9a83201c4eb1d9eefb5144a368122c00217f4d75120cf","source":{"kind":"arxiv","id":"2308.11736","version":2},"attestation_state":"computed","paper":{"title":"Smooth min-entropy lower bounds for approximation chains","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Ashutosh Marwah, Fr\\'ed\\'eric Dupuis","submitted_at":"2023-08-22T18:55:16Z","abstract_excerpt":"For a state $\\rho_{A_1^n B}$, we call a sequence of states $(\\sigma_{A_1^k B}^{(k)})_{k=1}^n$ an approximation chain if for every $1 \\leq k \\leq n$, $\\rho_{A_1^k B} \\approx_\\epsilon \\sigma_{A_1^k B}^{(k)}$. In general, it is not possible to lower bound the smooth min-entropy of such a $\\rho_{A_1^n B}$, in terms of the entropies of $\\sigma_{A_1^k B}^{(k)}$ without incurring very large penalty factors. In this paper, we study such approximation chains under additional assumptions. We begin by proving a simple entropic triangle inequality, which allows us to bound the smooth min-entropy of a stat"},"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":"2308.11736","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-08-22T18:55:16Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"c28ff30c966780437a3a8c74ea48dbfaa7ef3b01272faceb2d7d6fc184de6246","abstract_canon_sha256":"df2fbc8aa1226b5e7596a0a5fd7ceaef08b29b94ed2a5af3666d7e8b59fea144"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:43:10.946251Z","signature_b64":"SJ2md24Z6w/DySJtM2rcq8UEpGFOrc20mNfE+fawEPVWKOsIOmVp6cS+5Ho5x2s3UMemqSzH15PzCl9Xo0NBBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4da6d9346a566f2aaa9a83201c4eb1d9eefb5144a368122c00217f4d75120cf","last_reissued_at":"2026-07-05T07:43:10.945815Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:43:10.945815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Smooth min-entropy lower bounds for approximation chains","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Ashutosh Marwah, Fr\\'ed\\'eric Dupuis","submitted_at":"2023-08-22T18:55:16Z","abstract_excerpt":"For a state $\\rho_{A_1^n B}$, we call a sequence of states $(\\sigma_{A_1^k B}^{(k)})_{k=1}^n$ an approximation chain if for every $1 \\leq k \\leq n$, $\\rho_{A_1^k B} \\approx_\\epsilon \\sigma_{A_1^k B}^{(k)}$. In general, it is not possible to lower bound the smooth min-entropy of such a $\\rho_{A_1^n B}$, in terms of the entropies of $\\sigma_{A_1^k B}^{(k)}$ without incurring very large penalty factors. In this paper, we study such approximation chains under additional assumptions. We begin by proving a simple entropic triangle inequality, which allows us to bound the smooth min-entropy of a stat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.11736","kind":"arxiv","version":2},"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/2308.11736/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":"2308.11736","created_at":"2026-07-05T07:43:10.945872+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.11736v2","created_at":"2026-07-05T07:43:10.945872+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.11736","created_at":"2026-07-05T07:43:10.945872+00:00"},{"alias_kind":"pith_short_12","alias_value":"2TNG3E2GUVTP","created_at":"2026-07-05T07:43:10.945872+00:00"},{"alias_kind":"pith_short_16","alias_value":"2TNG3E2GUVTPFKVJ","created_at":"2026-07-05T07:43:10.945872+00:00"},{"alias_kind":"pith_short_8","alias_value":"2TNG3E2G","created_at":"2026-07-05T07:43:10.945872+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2601.21265","citing_title":"A Quantum-Memory-Free Quantum Secure Direct Communication Protocol Based on Privacy Amplification of Coded Sequences","ref_index":41,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2TNG3E2GUVTPFKVJVAZADRHLDW","json":"https://pith.science/pith/2TNG3E2GUVTPFKVJVAZADRHLDW.json","graph_json":"https://pith.science/api/pith-number/2TNG3E2GUVTPFKVJVAZADRHLDW/graph.json","events_json":"https://pith.science/api/pith-number/2TNG3E2GUVTPFKVJVAZADRHLDW/events.json","paper":"https://pith.science/paper/2TNG3E2G"},"agent_actions":{"view_html":"https://pith.science/pith/2TNG3E2GUVTPFKVJVAZADRHLDW","download_json":"https://pith.science/pith/2TNG3E2GUVTPFKVJVAZADRHLDW.json","view_paper":"https://pith.science/paper/2TNG3E2G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.11736&json=true","fetch_graph":"https://pith.science/api/pith-number/2TNG3E2GUVTPFKVJVAZADRHLDW/graph.json","fetch_events":"https://pith.science/api/pith-number/2TNG3E2GUVTPFKVJVAZADRHLDW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2TNG3E2GUVTPFKVJVAZADRHLDW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2TNG3E2GUVTPFKVJVAZADRHLDW/action/storage_attestation","attest_author":"https://pith.science/pith/2TNG3E2GUVTPFKVJVAZADRHLDW/action/author_attestation","sign_citation":"https://pith.science/pith/2TNG3E2GUVTPFKVJVAZADRHLDW/action/citation_signature","submit_replication":"https://pith.science/pith/2TNG3E2GUVTPFKVJVAZADRHLDW/action/replication_record"}},"created_at":"2026-07-05T07:43:10.945872+00:00","updated_at":"2026-07-05T07:43:10.945872+00:00"}