{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:AG77YGM4RAYACSQDMVKADLU7IS","short_pith_number":"pith:AG77YGM4","schema_version":"1.0","canonical_sha256":"01bffc199c8830014a03655401ae9f44b5e88802c556624735a841fce391cde7","source":{"kind":"arxiv","id":"2407.20396","version":3},"attestation_state":"computed","paper":{"title":"Mutual information chain rules for security proofs robust against device imperfections","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Amir Arqand, Ernest Y.-Z. Tan, Tony Metger","submitted_at":"2024-07-29T19:47:47Z","abstract_excerpt":"In this work we derive a number of chain rules for mutual information quantities, suitable for analyzing quantum cryptography with imperfect devices that leak additional information to an adversary. First, we derive a chain rule between smooth min-entropy and smooth max-information, which improves over previous chain rules for characterizing one-shot information leakage caused by an additional conditioning register. Second, we derive an ''information bounding theorem'' that bounds the R\\'enyi mutual information of a state produced by a sequence of channels, in terms of the R\\'enyi mutual infor"},"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":"2407.20396","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-07-29T19:47:47Z","cross_cats_sorted":[],"title_canon_sha256":"9ff996950877e2029685b2eff691d95f575a045b4ed5929d1e6f51b586ba864d","abstract_canon_sha256":"b08c0f206af92a7cab7e2710be43b188ece73dad2b51f83eb901a60222bb48d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:45:52.220614Z","signature_b64":"0tLOfN+/yM3CFS+mLKAuEOZVA8si7slHL95opPntpQp38Z+r7Ht9Kt3khI1JmGwcAb1kcIwR2MRLcOyr9gO6DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01bffc199c8830014a03655401ae9f44b5e88802c556624735a841fce391cde7","last_reissued_at":"2026-07-05T09:45:52.220032Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:45:52.220032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mutual information chain rules for security proofs robust against device imperfections","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Amir Arqand, Ernest Y.-Z. Tan, Tony Metger","submitted_at":"2024-07-29T19:47:47Z","abstract_excerpt":"In this work we derive a number of chain rules for mutual information quantities, suitable for analyzing quantum cryptography with imperfect devices that leak additional information to an adversary. First, we derive a chain rule between smooth min-entropy and smooth max-information, which improves over previous chain rules for characterizing one-shot information leakage caused by an additional conditioning register. Second, we derive an ''information bounding theorem'' that bounds the R\\'enyi mutual information of a state produced by a sequence of channels, in terms of the R\\'enyi mutual infor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.20396","kind":"arxiv","version":3},"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/2407.20396/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":"2407.20396","created_at":"2026-07-05T09:45:52.220089+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.20396v3","created_at":"2026-07-05T09:45:52.220089+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.20396","created_at":"2026-07-05T09:45:52.220089+00:00"},{"alias_kind":"pith_short_12","alias_value":"AG77YGM4RAYA","created_at":"2026-07-05T09:45:52.220089+00:00"},{"alias_kind":"pith_short_16","alias_value":"AG77YGM4RAYACSQD","created_at":"2026-07-05T09:45:52.220089+00:00"},{"alias_kind":"pith_short_8","alias_value":"AG77YGM4","created_at":"2026-07-05T09:45:52.220089+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.21293","citing_title":"Quantum Nonlocality and Device-Independent Randomness are Robust to Noisy Signaling Channels","ref_index":49,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AG77YGM4RAYACSQDMVKADLU7IS","json":"https://pith.science/pith/AG77YGM4RAYACSQDMVKADLU7IS.json","graph_json":"https://pith.science/api/pith-number/AG77YGM4RAYACSQDMVKADLU7IS/graph.json","events_json":"https://pith.science/api/pith-number/AG77YGM4RAYACSQDMVKADLU7IS/events.json","paper":"https://pith.science/paper/AG77YGM4"},"agent_actions":{"view_html":"https://pith.science/pith/AG77YGM4RAYACSQDMVKADLU7IS","download_json":"https://pith.science/pith/AG77YGM4RAYACSQDMVKADLU7IS.json","view_paper":"https://pith.science/paper/AG77YGM4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.20396&json=true","fetch_graph":"https://pith.science/api/pith-number/AG77YGM4RAYACSQDMVKADLU7IS/graph.json","fetch_events":"https://pith.science/api/pith-number/AG77YGM4RAYACSQDMVKADLU7IS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AG77YGM4RAYACSQDMVKADLU7IS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AG77YGM4RAYACSQDMVKADLU7IS/action/storage_attestation","attest_author":"https://pith.science/pith/AG77YGM4RAYACSQDMVKADLU7IS/action/author_attestation","sign_citation":"https://pith.science/pith/AG77YGM4RAYACSQDMVKADLU7IS/action/citation_signature","submit_replication":"https://pith.science/pith/AG77YGM4RAYACSQDMVKADLU7IS/action/replication_record"}},"created_at":"2026-07-05T09:45:52.220089+00:00","updated_at":"2026-07-05T09:45:52.220089+00:00"}