{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:V5BVTI5IVUSLL5BIDXJ2HULCXY","short_pith_number":"pith:V5BVTI5I","schema_version":"1.0","canonical_sha256":"af4359a3a8ad24b5f4281dd3a3d162be26f06f7f2212cef8e6fa15d2d656b69f","source":{"kind":"arxiv","id":"2203.04989","version":2},"attestation_state":"computed","paper":{"title":"Generalised entropy accumulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"David Sutter, Omar Fawzi, Renato Renner, Tony Metger","submitted_at":"2022-03-09T19:00:05Z","abstract_excerpt":"Consider a sequential process in which each step outputs a system $A_i$ and updates a side information register $E$. We prove that if this process satisfies a natural \"non-signalling\" condition between past outputs and future side information, the min-entropy of the outputs $A_1, \\dots, A_n$ conditioned on the side information $E$ at the end of the process can be bounded from below by a sum of von Neumann entropies associated with the individual steps. This is a generalisation of the entropy accumulation theorem (EAT), which deals with a more restrictive model of side information: there, past "},"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":"2203.04989","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-03-09T19:00:05Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"5f7ddbc2013f6fd78f5313e91dd120e6c6f698b99da347fa58ffebc734ea131c","abstract_canon_sha256":"fc1936650045f6fcd5daf2ef2306116cbea8293218f1d6abc7184ffc7465ebbd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:33:09.011664Z","signature_b64":"B4IDsNJH2Rni3mlchab60Ya65K51fu6ZJnZowvuBnNsTIW+HR7kLkLiISeVIyIJITxMVdSju1GZEVWrijkq7CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af4359a3a8ad24b5f4281dd3a3d162be26f06f7f2212cef8e6fa15d2d656b69f","last_reissued_at":"2026-07-05T05:33:09.011173Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:33:09.011173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalised entropy accumulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"David Sutter, Omar Fawzi, Renato Renner, Tony Metger","submitted_at":"2022-03-09T19:00:05Z","abstract_excerpt":"Consider a sequential process in which each step outputs a system $A_i$ and updates a side information register $E$. We prove that if this process satisfies a natural \"non-signalling\" condition between past outputs and future side information, the min-entropy of the outputs $A_1, \\dots, A_n$ conditioned on the side information $E$ at the end of the process can be bounded from below by a sum of von Neumann entropies associated with the individual steps. This is a generalisation of the entropy accumulation theorem (EAT), which deals with a more restrictive model of side information: there, past "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.04989","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/2203.04989/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":"2203.04989","created_at":"2026-07-05T05:33:09.011231+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.04989v2","created_at":"2026-07-05T05:33:09.011231+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.04989","created_at":"2026-07-05T05:33:09.011231+00:00"},{"alias_kind":"pith_short_12","alias_value":"V5BVTI5IVUSL","created_at":"2026-07-05T05:33:09.011231+00:00"},{"alias_kind":"pith_short_16","alias_value":"V5BVTI5IVUSLL5BI","created_at":"2026-07-05T05:33:09.011231+00:00"},{"alias_kind":"pith_short_8","alias_value":"V5BVTI5I","created_at":"2026-07-05T05:33:09.011231+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V5BVTI5IVUSLL5BIDXJ2HULCXY","json":"https://pith.science/pith/V5BVTI5IVUSLL5BIDXJ2HULCXY.json","graph_json":"https://pith.science/api/pith-number/V5BVTI5IVUSLL5BIDXJ2HULCXY/graph.json","events_json":"https://pith.science/api/pith-number/V5BVTI5IVUSLL5BIDXJ2HULCXY/events.json","paper":"https://pith.science/paper/V5BVTI5I"},"agent_actions":{"view_html":"https://pith.science/pith/V5BVTI5IVUSLL5BIDXJ2HULCXY","download_json":"https://pith.science/pith/V5BVTI5IVUSLL5BIDXJ2HULCXY.json","view_paper":"https://pith.science/paper/V5BVTI5I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.04989&json=true","fetch_graph":"https://pith.science/api/pith-number/V5BVTI5IVUSLL5BIDXJ2HULCXY/graph.json","fetch_events":"https://pith.science/api/pith-number/V5BVTI5IVUSLL5BIDXJ2HULCXY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V5BVTI5IVUSLL5BIDXJ2HULCXY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V5BVTI5IVUSLL5BIDXJ2HULCXY/action/storage_attestation","attest_author":"https://pith.science/pith/V5BVTI5IVUSLL5BIDXJ2HULCXY/action/author_attestation","sign_citation":"https://pith.science/pith/V5BVTI5IVUSLL5BIDXJ2HULCXY/action/citation_signature","submit_replication":"https://pith.science/pith/V5BVTI5IVUSLL5BIDXJ2HULCXY/action/replication_record"}},"created_at":"2026-07-05T05:33:09.011231+00:00","updated_at":"2026-07-05T05:33:09.011231+00:00"}