{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:6VBF22HKZFVN6BKSKWCS6Z6WMN","short_pith_number":"pith:6VBF22HK","schema_version":"1.0","canonical_sha256":"f5425d68eac96adf055255852f67d6637819b092146bdb0bc6e7d5ed8793382c","source":{"kind":"arxiv","id":"1410.3031","version":4},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1410.3031","created_at":"2026-05-18T00:34:20.952397+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.3031v4","created_at":"2026-05-18T00:34:20.952397+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3031","created_at":"2026-05-18T00:34:20.952397+00:00"},{"alias_kind":"pith_short_12","alias_value":"6VBF22HKZFVN","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"6VBF22HKZFVN6BKS","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"6VBF22HK","created_at":"2026-05-18T12:28:16.859392+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.12945","citing_title":"A resource theory of asynchronous quantum information processing","ref_index":45,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6VBF22HKZFVN6BKSKWCS6Z6WMN","json":"https://pith.science/pith/6VBF22HKZFVN6BKSKWCS6Z6WMN.json","graph_json":"https://pith.science/api/pith-number/6VBF22HKZFVN6BKSKWCS6Z6WMN/graph.json","events_json":"https://pith.science/api/pith-number/6VBF22HKZFVN6BKSKWCS6Z6WMN/events.json","paper":"https://pith.science/paper/6VBF22HK"},"agent_actions":{"view_html":"https://pith.science/pith/6VBF22HKZFVN6BKSKWCS6Z6WMN","download_json":"https://pith.science/pith/6VBF22HKZFVN6BKSKWCS6Z6WMN.json","view_paper":"https://pith.science/paper/6VBF22HK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.3031&json=true","fetch_graph":"https://pith.science/api/pith-number/6VBF22HKZFVN6BKSKWCS6Z6WMN/graph.json","fetch_events":"https://pith.science/api/pith-number/6VBF22HKZFVN6BKSKWCS6Z6WMN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6VBF22HKZFVN6BKSKWCS6Z6WMN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6VBF22HKZFVN6BKSKWCS6Z6WMN/action/storage_attestation","attest_author":"https://pith.science/pith/6VBF22HKZFVN6BKSKWCS6Z6WMN/action/author_attestation","sign_citation":"https://pith.science/pith/6VBF22HKZFVN6BKSKWCS6Z6WMN/action/citation_signature","submit_replication":"https://pith.science/pith/6VBF22HKZFVN6BKSKWCS6Z6WMN/action/replication_record"}},"created_at":"2026-05-18T00:34:20.952397+00:00","updated_at":"2026-05-18T00:34:20.952397+00:00"}