{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:6VBF22HKZFVN6BKSKWCS6Z6WMN","short_pith_number":"pith:6VBF22HK","canonical_record":{"source":{"id":"1410.3031","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-10-11T23:04:53Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"dfb1bf55444147de950b0a67db35e1059c8d0b0f6ba42c436deeca796ceb6619","abstract_canon_sha256":"1359590dac25811d147dd2793b5fda70bdeb04c16883a151dd1165d5da46bd60"},"schema_version":"1.0"},"canonical_sha256":"f5425d68eac96adf055255852f67d6637819b092146bdb0bc6e7d5ed8793382c","source":{"kind":"arxiv","id":"1410.3031","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.3031","created_at":"2026-05-18T00:34:20Z"},{"alias_kind":"arxiv_version","alias_value":"1410.3031v4","created_at":"2026-05-18T00:34:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3031","created_at":"2026-05-18T00:34:20Z"},{"alias_kind":"pith_short_12","alias_value":"6VBF22HKZFVN","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6VBF22HKZFVN6BKS","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6VBF22HK","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:6VBF22HKZFVN6BKSKWCS6Z6WMN","target":"record","payload":{"canonical_record":{"source":{"id":"1410.3031","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-10-11T23:04:53Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"dfb1bf55444147de950b0a67db35e1059c8d0b0f6ba42c436deeca796ceb6619","abstract_canon_sha256":"1359590dac25811d147dd2793b5fda70bdeb04c16883a151dd1165d5da46bd60"},"schema_version":"1.0"},"canonical_sha256":"f5425d68eac96adf055255852f67d6637819b092146bdb0bc6e7d5ed8793382c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:20.952838Z","signature_b64":"dgHZaIuHuNe/Z8YxmWBu/Njgr+NjmHw9X/auH760wyzle5/6amIPVjQQtSi94t0BuIIXss15E/l/vTpCGpyxBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5425d68eac96adf055255852f67d6637819b092146bdb0bc6e7d5ed8793382c","last_reissued_at":"2026-05-18T00:34:20.952293Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:20.952293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.3031","source_version":4,"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-18T00:34:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RJC/RkUNJovIzvsIg1e1Eo3H/lP5s1Myq10D2XvMCkzPkb+YtZKflRpF7FRwV+aeL9g1U4P1fk4xlrlc/l/qCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T08:29:28.095995Z"},"content_sha256":"a0407c00c0d53782a37b3e80f1b01215326af7478b110bcca929ada239afc273","schema_version":"1.0","event_id":"sha256:a0407c00c0d53782a37b3e80f1b01215326af7478b110bcca929ada239afc273"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:6VBF22HKZFVN6BKSKWCS6Z6WMN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum message compression with applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Anurag Anshu, Rahul Jain, Vamsi Krishna Devabathini","submitted_at":"2014-10-11T23:04:53Z","abstract_excerpt":"We present a new scheme for the compression of one-way quantum messages, in the setting of coherent entanglement assisted quantum communication. For this, we present a new technical tool that we call the convex split lemma, which is inspired by the classical compression schemes that use rejection sampling procedure. As a consequence, we show new bounds on the quantum communication cost of single-shot entanglement-assisted one-way quantum state redistribution task and for the sub-tasks quantum state splitting and quantum state merging. Our upper and lower bounds are tight up to a constant and h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3031","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":""},"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-18T00:34:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qj5SZIVkfQg5qTRQRZ0KZOcs3/kVBK/5lbtP2pF00iHN21Vy+LaJU5LP/Fs8PB9gFe6SuqMU2RLlqCPMTc9vDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T08:29:28.096661Z"},"content_sha256":"b8536a58b21c0fa8c2d749f76e972bf789ef80d5fe804ef70623a1ced2886a4f","schema_version":"1.0","event_id":"sha256:b8536a58b21c0fa8c2d749f76e972bf789ef80d5fe804ef70623a1ced2886a4f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6VBF22HKZFVN6BKSKWCS6Z6WMN/bundle.json","state_url":"https://pith.science/pith/6VBF22HKZFVN6BKSKWCS6Z6WMN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6VBF22HKZFVN6BKSKWCS6Z6WMN/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-05-23T08:29:28Z","links":{"resolver":"https://pith.science/pith/6VBF22HKZFVN6BKSKWCS6Z6WMN","bundle":"https://pith.science/pith/6VBF22HKZFVN6BKSKWCS6Z6WMN/bundle.json","state":"https://pith.science/pith/6VBF22HKZFVN6BKSKWCS6Z6WMN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6VBF22HKZFVN6BKSKWCS6Z6WMN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:6VBF22HKZFVN6BKSKWCS6Z6WMN","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":"1359590dac25811d147dd2793b5fda70bdeb04c16883a151dd1165d5da46bd60","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-10-11T23:04:53Z","title_canon_sha256":"dfb1bf55444147de950b0a67db35e1059c8d0b0f6ba42c436deeca796ceb6619"},"schema_version":"1.0","source":{"id":"1410.3031","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.3031","created_at":"2026-05-18T00:34:20Z"},{"alias_kind":"arxiv_version","alias_value":"1410.3031v4","created_at":"2026-05-18T00:34:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3031","created_at":"2026-05-18T00:34:20Z"},{"alias_kind":"pith_short_12","alias_value":"6VBF22HKZFVN","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6VBF22HKZFVN6BKS","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6VBF22HK","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:b8536a58b21c0fa8c2d749f76e972bf789ef80d5fe804ef70623a1ced2886a4f","target":"graph","created_at":"2026-05-18T00:34:20Z","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 present a new scheme for the compression of one-way quantum messages, in the setting of coherent entanglement assisted quantum communication. For this, we present a new technical tool that we call the convex split lemma, which is inspired by the classical compression schemes that use rejection sampling procedure. As a consequence, we show new bounds on the quantum communication cost of single-shot entanglement-assisted one-way quantum state redistribution task and for the sub-tasks quantum state splitting and quantum state merging. Our upper and lower bounds are tight up to a constant and h","authors_text":"Anurag Anshu, Rahul Jain, Vamsi Krishna Devabathini","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-10-11T23:04:53Z","title":"Quantum message compression with applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3031","kind":"arxiv","version":4},"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:a0407c00c0d53782a37b3e80f1b01215326af7478b110bcca929ada239afc273","target":"record","created_at":"2026-05-18T00:34:20Z","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":"1359590dac25811d147dd2793b5fda70bdeb04c16883a151dd1165d5da46bd60","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-10-11T23:04:53Z","title_canon_sha256":"dfb1bf55444147de950b0a67db35e1059c8d0b0f6ba42c436deeca796ceb6619"},"schema_version":"1.0","source":{"id":"1410.3031","kind":"arxiv","version":4}},"canonical_sha256":"f5425d68eac96adf055255852f67d6637819b092146bdb0bc6e7d5ed8793382c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f5425d68eac96adf055255852f67d6637819b092146bdb0bc6e7d5ed8793382c","first_computed_at":"2026-05-18T00:34:20.952293Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:20.952293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dgHZaIuHuNe/Z8YxmWBu/Njgr+NjmHw9X/auH760wyzle5/6amIPVjQQtSi94t0BuIIXss15E/l/vTpCGpyxBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:20.952838Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.3031","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a0407c00c0d53782a37b3e80f1b01215326af7478b110bcca929ada239afc273","sha256:b8536a58b21c0fa8c2d749f76e972bf789ef80d5fe804ef70623a1ced2886a4f"],"state_sha256":"7b70e67e5c902c45d8ee75b645e07215548158ca532d633934ab6879ed452be8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f8/L5Mxp6Qe8y9lGp+NfCEUyHFPIqh9WxrJy8XnrpJZkGRBhtZHLfbAOn9lA3Pz1mEgGfJvdBcDKCNdZgkbVAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T08:29:28.100271Z","bundle_sha256":"751986f8c1997ca37c49977aa45d5a4e256afdbe8c012cf717782dcd6ffd5fd1"}}