{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MTCILCB5R2APMAGKXYOIVLSWRN","short_pith_number":"pith:MTCILCB5","canonical_record":{"source":{"id":"1308.5884","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-08-27T14:47:28Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"f60f2c4e7162c27a890bb5acc14f3fa116c595636fb16341d0bf05627bbfc348","abstract_canon_sha256":"e5d6ff88207e69f229609ff63fba5892bfe263bbe300451c4156a0c8fcd0d09c"},"schema_version":"1.0"},"canonical_sha256":"64c485883d8e80f600cabe1c8aae568b793f906f401f2aaea98f3b0ef4ca8a18","source":{"kind":"arxiv","id":"1308.5884","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.5884","created_at":"2026-05-18T02:54:48Z"},{"alias_kind":"arxiv_version","alias_value":"1308.5884v1","created_at":"2026-05-18T02:54:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5884","created_at":"2026-05-18T02:54:48Z"},{"alias_kind":"pith_short_12","alias_value":"MTCILCB5R2AP","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MTCILCB5R2APMAGK","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MTCILCB5","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MTCILCB5R2APMAGKXYOIVLSWRN","target":"record","payload":{"canonical_record":{"source":{"id":"1308.5884","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-08-27T14:47:28Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"f60f2c4e7162c27a890bb5acc14f3fa116c595636fb16341d0bf05627bbfc348","abstract_canon_sha256":"e5d6ff88207e69f229609ff63fba5892bfe263bbe300451c4156a0c8fcd0d09c"},"schema_version":"1.0"},"canonical_sha256":"64c485883d8e80f600cabe1c8aae568b793f906f401f2aaea98f3b0ef4ca8a18","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:48.065085Z","signature_b64":"a76ewQpA2BfRZ8R033DgMrLXtijUyUuYO6rvFVmg20Ru/QeC1WArzRS6criKzNwkEMTSp+UQjebdBO7IW1aqBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64c485883d8e80f600cabe1c8aae568b793f906f401f2aaea98f3b0ef4ca8a18","last_reissued_at":"2026-05-18T02:54:48.064706Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:48.064706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.5884","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:54:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cb4OHvcrLL3WkoWUudXhxTQxJDMOqvUmm4UCwiXQvRKORwqOyDaJ7kSI7z//gYBcoXAlKiUUpNSIUNm77S/+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:44:18.232275Z"},"content_sha256":"e0851f8926e029413b7084f7f3b74f9da252a0203d371dc2955389524534355f","schema_version":"1.0","event_id":"sha256:e0851f8926e029413b7084f7f3b74f9da252a0203d371dc2955389524534355f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MTCILCB5R2APMAGKXYOIVLSWRN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Smooth Max-Information as One-Shot Generalization for Mutual Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Nikola Ciganovi\\'c, Normand J. Beaudry, Renato Renner","submitted_at":"2013-08-27T14:47:28Z","abstract_excerpt":"We study formal properties of smooth max-information, a generalization of von Neumann mutual information derived from the max-relative entropy. Recent work suggests that it is a useful quantity in one-shot channel coding, quantum rate distortion theory and the physics of quantum many-body systems.\n  Max-information can be defined in multiple ways. We demonstrate that different smoothed definitions are essentially equivalent (up to logarithmic terms in the smoothing parameters). These equivalence relations allow us to derive new chain rules for the max-information in terms of min- and max-entro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.5884","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:54:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MFp4/83XfGcHUSIEPV3UNtsi4Lh3xnC6ZaD8rG38WyYoPX7TAEbrK9WbMb6c0g78Dh6uze4Doy3ADH5QysjQDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:44:18.232644Z"},"content_sha256":"10a3520f8ca5386dba882b875544958dc9cb5856c864d7e0f490c929f2d6b02a","schema_version":"1.0","event_id":"sha256:10a3520f8ca5386dba882b875544958dc9cb5856c864d7e0f490c929f2d6b02a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MTCILCB5R2APMAGKXYOIVLSWRN/bundle.json","state_url":"https://pith.science/pith/MTCILCB5R2APMAGKXYOIVLSWRN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MTCILCB5R2APMAGKXYOIVLSWRN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T20:44:18Z","links":{"resolver":"https://pith.science/pith/MTCILCB5R2APMAGKXYOIVLSWRN","bundle":"https://pith.science/pith/MTCILCB5R2APMAGKXYOIVLSWRN/bundle.json","state":"https://pith.science/pith/MTCILCB5R2APMAGKXYOIVLSWRN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MTCILCB5R2APMAGKXYOIVLSWRN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MTCILCB5R2APMAGKXYOIVLSWRN","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":"e5d6ff88207e69f229609ff63fba5892bfe263bbe300451c4156a0c8fcd0d09c","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-08-27T14:47:28Z","title_canon_sha256":"f60f2c4e7162c27a890bb5acc14f3fa116c595636fb16341d0bf05627bbfc348"},"schema_version":"1.0","source":{"id":"1308.5884","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.5884","created_at":"2026-05-18T02:54:48Z"},{"alias_kind":"arxiv_version","alias_value":"1308.5884v1","created_at":"2026-05-18T02:54:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5884","created_at":"2026-05-18T02:54:48Z"},{"alias_kind":"pith_short_12","alias_value":"MTCILCB5R2AP","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MTCILCB5R2APMAGK","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MTCILCB5","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:10a3520f8ca5386dba882b875544958dc9cb5856c864d7e0f490c929f2d6b02a","target":"graph","created_at":"2026-05-18T02:54:48Z","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"},"paper":{"abstract_excerpt":"We study formal properties of smooth max-information, a generalization of von Neumann mutual information derived from the max-relative entropy. Recent work suggests that it is a useful quantity in one-shot channel coding, quantum rate distortion theory and the physics of quantum many-body systems.\n  Max-information can be defined in multiple ways. We demonstrate that different smoothed definitions are essentially equivalent (up to logarithmic terms in the smoothing parameters). These equivalence relations allow us to derive new chain rules for the max-information in terms of min- and max-entro","authors_text":"Nikola Ciganovi\\'c, Normand J. Beaudry, Renato Renner","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-08-27T14:47:28Z","title":"Smooth Max-Information as One-Shot Generalization for Mutual Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.5884","kind":"arxiv","version":1},"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:e0851f8926e029413b7084f7f3b74f9da252a0203d371dc2955389524534355f","target":"record","created_at":"2026-05-18T02:54:48Z","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":"e5d6ff88207e69f229609ff63fba5892bfe263bbe300451c4156a0c8fcd0d09c","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-08-27T14:47:28Z","title_canon_sha256":"f60f2c4e7162c27a890bb5acc14f3fa116c595636fb16341d0bf05627bbfc348"},"schema_version":"1.0","source":{"id":"1308.5884","kind":"arxiv","version":1}},"canonical_sha256":"64c485883d8e80f600cabe1c8aae568b793f906f401f2aaea98f3b0ef4ca8a18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64c485883d8e80f600cabe1c8aae568b793f906f401f2aaea98f3b0ef4ca8a18","first_computed_at":"2026-05-18T02:54:48.064706Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:48.064706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a76ewQpA2BfRZ8R033DgMrLXtijUyUuYO6rvFVmg20Ru/QeC1WArzRS6criKzNwkEMTSp+UQjebdBO7IW1aqBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:48.065085Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.5884","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0851f8926e029413b7084f7f3b74f9da252a0203d371dc2955389524534355f","sha256:10a3520f8ca5386dba882b875544958dc9cb5856c864d7e0f490c929f2d6b02a"],"state_sha256":"0a0114ea86cac0606690c51b9062db4d6f0ca6e8fbd100bcc56cd99ba0a6889e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3J5fTRkkavfUPNyyz2H8m77Wr5gAAE3hR1IIFi0V82r6OhR3h0simGU9QgoJYq+qpBqIdyAU9Qiiddgdsd9lBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:44:18.234614Z","bundle_sha256":"c20f2d51ddd85012d307248139aab2411c05e939c2e6726155e932f31db2ac3d"}}