{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:TFBK4T4SDDLSFUJ7LHKTRAK7IS","short_pith_number":"pith:TFBK4T4S","canonical_record":{"source":{"id":"2502.06526","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-02-10T14:49:48Z","cross_cats_sorted":["cs.IT","math-ph","math.IT","math.MP"],"title_canon_sha256":"8d18c25a106f9f2052f3e51a9fad79fc1ae64f84298df6f3b3250a76a631d254","abstract_canon_sha256":"16877c2ca888416bc94fffa11e07acedeb9e71040a22be93ef3a70f82ad4dc0c"},"schema_version":"1.0"},"canonical_sha256":"9942ae4f9218d722d13f59d538815f4486fe63d6ac240ac95f46fd6db4b671af","source":{"kind":"arxiv","id":"2502.06526","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.06526","created_at":"2026-07-05T10:14:50Z"},{"alias_kind":"arxiv_version","alias_value":"2502.06526v2","created_at":"2026-07-05T10:14:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.06526","created_at":"2026-07-05T10:14:50Z"},{"alias_kind":"pith_short_12","alias_value":"TFBK4T4SDDLS","created_at":"2026-07-05T10:14:50Z"},{"alias_kind":"pith_short_16","alias_value":"TFBK4T4SDDLSFUJ7","created_at":"2026-07-05T10:14:50Z"},{"alias_kind":"pith_short_8","alias_value":"TFBK4T4S","created_at":"2026-07-05T10:14:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:TFBK4T4SDDLSFUJ7LHKTRAK7IS","target":"record","payload":{"canonical_record":{"source":{"id":"2502.06526","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-02-10T14:49:48Z","cross_cats_sorted":["cs.IT","math-ph","math.IT","math.MP"],"title_canon_sha256":"8d18c25a106f9f2052f3e51a9fad79fc1ae64f84298df6f3b3250a76a631d254","abstract_canon_sha256":"16877c2ca888416bc94fffa11e07acedeb9e71040a22be93ef3a70f82ad4dc0c"},"schema_version":"1.0"},"canonical_sha256":"9942ae4f9218d722d13f59d538815f4486fe63d6ac240ac95f46fd6db4b671af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:14:50.895202Z","signature_b64":"6TaAc12R77VZidrD5CnusfW2GAfk2Z2KogU9VRV+NLzcGY+U9Kj/I0CfyuSzxyoYZYENtVQvg9eOJrPTDroGDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9942ae4f9218d722d13f59d538815f4486fe63d6ac240ac95f46fd6db4b671af","last_reissued_at":"2026-07-05T10:14:50.894684Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:14:50.894684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.06526","source_version":2,"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-07-05T10:14:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CTM5+C06fMZbHIVSCXYBV1e0tNrywPygFEXpgKqZHFJgZVo+hMVu81O/e46Np3jksmJ8lDaigrZ1vra/XZIxCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T08:50:51.100112Z"},"content_sha256":"eeefffd6eda4dc4a90f98ebea2a6e200fe13c5ba8baf13edb6275b8974db5551","schema_version":"1.0","event_id":"sha256:eeefffd6eda4dc4a90f98ebea2a6e200fe13c5ba8baf13edb6275b8974db5551"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:TFBK4T4SDDLSFUJ7LHKTRAK7IS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convex Split Lemma without Inequalities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math-ph","math.IT","math.MP"],"primary_cat":"quant-ph","authors_text":"Gilad Gour","submitted_at":"2025-02-10T14:49:48Z","abstract_excerpt":"We introduce a refinement to the convex split lemma by replacing the max mutual information with the collision mutual information, transforming the inequality into an equality. This refinement yields tighter achievability bounds for quantum source coding tasks, including state merging and state splitting. Furthermore, we derive a universal upper bound on the smoothed max mutual information, where \"universal\" signifies that the bound depends exclusively on R\\'enyi entropies and is independent of the system's dimensions. This result has significant implications for quantum information processing"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.06526","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/2502.06526/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"},"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-07-05T10:14:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OJFhMkCC4S+3wP8d2qxrVAsgPD/WEFf6k/IsQ1cSQ70V+tENR3YtC1eBOUhbBX6dWxSCjWiFoi2LWYduCc2gAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T08:50:51.100432Z"},"content_sha256":"b441c933b0be7a286de7f853a5e86d497f48ba30bd20218ea01c8ce583cdbe07","schema_version":"1.0","event_id":"sha256:b441c933b0be7a286de7f853a5e86d497f48ba30bd20218ea01c8ce583cdbe07"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TFBK4T4SDDLSFUJ7LHKTRAK7IS/bundle.json","state_url":"https://pith.science/pith/TFBK4T4SDDLSFUJ7LHKTRAK7IS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TFBK4T4SDDLSFUJ7LHKTRAK7IS/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-08-11T08:50:51Z","links":{"resolver":"https://pith.science/pith/TFBK4T4SDDLSFUJ7LHKTRAK7IS","bundle":"https://pith.science/pith/TFBK4T4SDDLSFUJ7LHKTRAK7IS/bundle.json","state":"https://pith.science/pith/TFBK4T4SDDLSFUJ7LHKTRAK7IS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TFBK4T4SDDLSFUJ7LHKTRAK7IS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:TFBK4T4SDDLSFUJ7LHKTRAK7IS","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":"16877c2ca888416bc94fffa11e07acedeb9e71040a22be93ef3a70f82ad4dc0c","cross_cats_sorted":["cs.IT","math-ph","math.IT","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-02-10T14:49:48Z","title_canon_sha256":"8d18c25a106f9f2052f3e51a9fad79fc1ae64f84298df6f3b3250a76a631d254"},"schema_version":"1.0","source":{"id":"2502.06526","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.06526","created_at":"2026-07-05T10:14:50Z"},{"alias_kind":"arxiv_version","alias_value":"2502.06526v2","created_at":"2026-07-05T10:14:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.06526","created_at":"2026-07-05T10:14:50Z"},{"alias_kind":"pith_short_12","alias_value":"TFBK4T4SDDLS","created_at":"2026-07-05T10:14:50Z"},{"alias_kind":"pith_short_16","alias_value":"TFBK4T4SDDLSFUJ7","created_at":"2026-07-05T10:14:50Z"},{"alias_kind":"pith_short_8","alias_value":"TFBK4T4S","created_at":"2026-07-05T10:14:50Z"}],"graph_snapshots":[{"event_id":"sha256:b441c933b0be7a286de7f853a5e86d497f48ba30bd20218ea01c8ce583cdbe07","target":"graph","created_at":"2026-07-05T10:14:50Z","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/2502.06526/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce a refinement to the convex split lemma by replacing the max mutual information with the collision mutual information, transforming the inequality into an equality. This refinement yields tighter achievability bounds for quantum source coding tasks, including state merging and state splitting. Furthermore, we derive a universal upper bound on the smoothed max mutual information, where \"universal\" signifies that the bound depends exclusively on R\\'enyi entropies and is independent of the system's dimensions. This result has significant implications for quantum information processing","authors_text":"Gilad Gour","cross_cats":["cs.IT","math-ph","math.IT","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-02-10T14:49:48Z","title":"Convex Split Lemma without Inequalities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.06526","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:eeefffd6eda4dc4a90f98ebea2a6e200fe13c5ba8baf13edb6275b8974db5551","target":"record","created_at":"2026-07-05T10:14:50Z","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":"16877c2ca888416bc94fffa11e07acedeb9e71040a22be93ef3a70f82ad4dc0c","cross_cats_sorted":["cs.IT","math-ph","math.IT","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-02-10T14:49:48Z","title_canon_sha256":"8d18c25a106f9f2052f3e51a9fad79fc1ae64f84298df6f3b3250a76a631d254"},"schema_version":"1.0","source":{"id":"2502.06526","kind":"arxiv","version":2}},"canonical_sha256":"9942ae4f9218d722d13f59d538815f4486fe63d6ac240ac95f46fd6db4b671af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9942ae4f9218d722d13f59d538815f4486fe63d6ac240ac95f46fd6db4b671af","first_computed_at":"2026-07-05T10:14:50.894684Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:14:50.894684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6TaAc12R77VZidrD5CnusfW2GAfk2Z2KogU9VRV+NLzcGY+U9Kj/I0CfyuSzxyoYZYENtVQvg9eOJrPTDroGDA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:14:50.895202Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.06526","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eeefffd6eda4dc4a90f98ebea2a6e200fe13c5ba8baf13edb6275b8974db5551","sha256:b441c933b0be7a286de7f853a5e86d497f48ba30bd20218ea01c8ce583cdbe07"],"state_sha256":"2b77aca23f62e02bc568006a742a35551cf4e8798d1d1a16451c9f44cd54274c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2H0C/mlVZCiYKkL/7Ea/Y+zP+443QpRJ5LYgzyT6PWh1KqbJLdmYjrFlbeEqyfamiRBRsoj9mdioBTMRUwsACg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T08:50:51.102703Z","bundle_sha256":"757061c90e4f3116050efab6f2b04356c5b6225eca74188d581a5b6c32a9318b"}}