{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:2TNG3E2GUVTPFKVJVAZADRHLDW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"df2fbc8aa1226b5e7596a0a5fd7ceaef08b29b94ed2a5af3666d7e8b59fea144","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-08-22T18:55:16Z","title_canon_sha256":"c28ff30c966780437a3a8c74ea48dbfaa7ef3b01272faceb2d7d6fc184de6246"},"schema_version":"1.0","source":{"id":"2308.11736","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.11736","created_at":"2026-07-05T07:43:10Z"},{"alias_kind":"arxiv_version","alias_value":"2308.11736v2","created_at":"2026-07-05T07:43:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.11736","created_at":"2026-07-05T07:43:10Z"},{"alias_kind":"pith_short_12","alias_value":"2TNG3E2GUVTP","created_at":"2026-07-05T07:43:10Z"},{"alias_kind":"pith_short_16","alias_value":"2TNG3E2GUVTPFKVJ","created_at":"2026-07-05T07:43:10Z"},{"alias_kind":"pith_short_8","alias_value":"2TNG3E2G","created_at":"2026-07-05T07:43:10Z"}],"graph_snapshots":[{"event_id":"sha256:2472d987c75996900364d57a4760c4148782ee4681d7c7732c2a3f115ea343fa","target":"graph","created_at":"2026-07-05T07:43:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2308.11736/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ashutosh Marwah, Fr\\'ed\\'eric Dupuis","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-08-22T18:55:16Z","title":"Smooth min-entropy lower bounds for approximation chains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.11736","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7d3b18c5a4cd5ffb18d01b7bf85840afee441163a60b07c35ed0f8696e3a88e4","target":"record","created_at":"2026-07-05T07:43:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"df2fbc8aa1226b5e7596a0a5fd7ceaef08b29b94ed2a5af3666d7e8b59fea144","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-08-22T18:55:16Z","title_canon_sha256":"c28ff30c966780437a3a8c74ea48dbfaa7ef3b01272faceb2d7d6fc184de6246"},"schema_version":"1.0","source":{"id":"2308.11736","kind":"arxiv","version":2}},"canonical_sha256":"d4da6d9346a566f2aaa9a83201c4eb1d9eefb5144a368122c00217f4d75120cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d4da6d9346a566f2aaa9a83201c4eb1d9eefb5144a368122c00217f4d75120cf","first_computed_at":"2026-07-05T07:43:10.945815Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:43:10.945815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SJ2md24Z6w/DySJtM2rcq8UEpGFOrc20mNfE+fawEPVWKOsIOmVp6cS+5Ho5x2s3UMemqSzH15PzCl9Xo0NBBA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:43:10.946251Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.11736","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d3b18c5a4cd5ffb18d01b7bf85840afee441163a60b07c35ed0f8696e3a88e4","sha256:2472d987c75996900364d57a4760c4148782ee4681d7c7732c2a3f115ea343fa"],"state_sha256":"4b3a937e3143a374760b0099b069b4dce13f81204c82ec8df9d392b493bddc0e"}