{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:YRUCRXUQUV2XW2CSHOF53MLLKW","short_pith_number":"pith:YRUCRXUQ","schema_version":"1.0","canonical_sha256":"c46828de90a5757b68523b8bddb16b5599e661f7311398a2855fe9cb3c527f49","source":{"kind":"arxiv","id":"2502.02563","version":4},"attestation_state":"computed","paper":{"title":"Marginal-constrained entropy accumulation theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Amir Arqand, Ernest Y.-Z. Tan","submitted_at":"2025-02-04T18:37:34Z","abstract_excerpt":"We derive a novel chain rule for a family of channel conditional entropies, covering von Neumann and sandwiched R\\'{e}nyi entropies. In the process, we show that these channel conditional entropies are equal to their regularized version, and more generally, additive across tensor products of channels. For the purposes of cryptography, applying our chain rule to sequences of channels yields a new variant of R\\'{e}nyi entropy accumulation, in which we can impose some specific forms of marginal-state constraint on the input states to each individual channel. This generalizes a recently introduced"},"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.02563","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-02-04T18:37:34Z","cross_cats_sorted":[],"title_canon_sha256":"494a93ac5006cdf018d67efb11735fd987f90678784860d86fc4f127e8bdcbc6","abstract_canon_sha256":"1ba983d8eeb5b3ad23a35b391eb737ff13fb1e3af603214bb9f4019111f83976"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:43:30.636671Z","signature_b64":"aaFDLo6FVqgIXm/K5FAd9ZNK59SSfVNbPAQDA1lB4KDsW16iUvSD2xiyCwgO62WwQpsgb8j7eKhbJIJIGsm1Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c46828de90a5757b68523b8bddb16b5599e661f7311398a2855fe9cb3c527f49","last_reissued_at":"2026-07-05T11:43:30.636123Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:43:30.636123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Marginal-constrained entropy accumulation theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Amir Arqand, Ernest Y.-Z. Tan","submitted_at":"2025-02-04T18:37:34Z","abstract_excerpt":"We derive a novel chain rule for a family of channel conditional entropies, covering von Neumann and sandwiched R\\'{e}nyi entropies. In the process, we show that these channel conditional entropies are equal to their regularized version, and more generally, additive across tensor products of channels. For the purposes of cryptography, applying our chain rule to sequences of channels yields a new variant of R\\'{e}nyi entropy accumulation, in which we can impose some specific forms of marginal-state constraint on the input states to each individual channel. This generalizes a recently introduced"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.02563","kind":"arxiv","version":4},"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.02563/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.02563","created_at":"2026-07-05T11:43:30.636194+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.02563v4","created_at":"2026-07-05T11:43:30.636194+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.02563","created_at":"2026-07-05T11:43:30.636194+00:00"},{"alias_kind":"pith_short_12","alias_value":"YRUCRXUQUV2X","created_at":"2026-07-05T11:43:30.636194+00:00"},{"alias_kind":"pith_short_16","alias_value":"YRUCRXUQUV2XW2CS","created_at":"2026-07-05T11:43:30.636194+00:00"},{"alias_kind":"pith_short_8","alias_value":"YRUCRXUQ","created_at":"2026-07-05T11:43:30.636194+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20346","citing_title":"Effective discrete-modulated continuous variable QKD under general attacks","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2602.05057","citing_title":"Quantum Key Distribution with Imperfections: Recent Advances in Security Proofs","ref_index":186,"is_internal_anchor":false},{"citing_arxiv_id":"2602.05057","citing_title":"Quantum Key Distribution with Imperfections: Recent Advances in Security Proofs","ref_index":186,"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":10,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11767","citing_title":"Security of decoy-state quantum key distribution with correlated bit-and-basis encoders","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21791","citing_title":"Rigorous Security Proofs for Practical Quantum Key Distribution","ref_index":67,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YRUCRXUQUV2XW2CSHOF53MLLKW","json":"https://pith.science/pith/YRUCRXUQUV2XW2CSHOF53MLLKW.json","graph_json":"https://pith.science/api/pith-number/YRUCRXUQUV2XW2CSHOF53MLLKW/graph.json","events_json":"https://pith.science/api/pith-number/YRUCRXUQUV2XW2CSHOF53MLLKW/events.json","paper":"https://pith.science/paper/YRUCRXUQ"},"agent_actions":{"view_html":"https://pith.science/pith/YRUCRXUQUV2XW2CSHOF53MLLKW","download_json":"https://pith.science/pith/YRUCRXUQUV2XW2CSHOF53MLLKW.json","view_paper":"https://pith.science/paper/YRUCRXUQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.02563&json=true","fetch_graph":"https://pith.science/api/pith-number/YRUCRXUQUV2XW2CSHOF53MLLKW/graph.json","fetch_events":"https://pith.science/api/pith-number/YRUCRXUQUV2XW2CSHOF53MLLKW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YRUCRXUQUV2XW2CSHOF53MLLKW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YRUCRXUQUV2XW2CSHOF53MLLKW/action/storage_attestation","attest_author":"https://pith.science/pith/YRUCRXUQUV2XW2CSHOF53MLLKW/action/author_attestation","sign_citation":"https://pith.science/pith/YRUCRXUQUV2XW2CSHOF53MLLKW/action/citation_signature","submit_replication":"https://pith.science/pith/YRUCRXUQUV2XW2CSHOF53MLLKW/action/replication_record"}},"created_at":"2026-07-05T11:43:30.636194+00:00","updated_at":"2026-07-05T11:43:30.636194+00:00"}