{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:ESQ74377ZMZDJC5RNP6AX6GU7X","short_pith_number":"pith:ESQ74377","schema_version":"1.0","canonical_sha256":"24a1fe6fffcb32348bb16bfc0bf8d4fdea836c3ecd845587f6f48c90162ec3e8","source":{"kind":"arxiv","id":"quant-ph/0610003","version":1},"attestation_state":"computed","paper":{"title":"Quantum Coding Theorems for Arbitrary Sources, Channels and Entanglement Resources","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Garry Bowen, Nilanjana Datta","submitted_at":"2006-09-30T12:26:14Z","abstract_excerpt":"The information spectrum approach gives general formulae for optimal rates of various information theoretic protocols, under minimal assumptions on the nature of the sources, channels and entanglement resources involved. This paper culminates in the derivation of the dense coding capacity for a noiseless quantum channel, assisted by arbitrary shared entanglement, using this approach. We also review the currently known coding theorems, and their converses, for protocols such as data compression for arbitrary quantum sources and transmission of classical information through arbitrary quantum cha"},"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":"quant-ph/0610003","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2006-09-30T12:26:14Z","cross_cats_sorted":[],"title_canon_sha256":"b2fdfe47d646dee5b02c36c5a3721b4c9854fca25f49dbc3332ba13d29610e7f","abstract_canon_sha256":"81f469d764341d5c6d68cb47295fdeedb2d511217def680fcd4e2f9676dd2489"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:57:16.419553Z","signature_b64":"/7v946YuWbOJNFdwH0tLOrleOQk7jXcPKP3rqz/9MLEMirK45rAbQi0JqFxWABvhoMgbRCFTgfuzrYKXdJ6cAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24a1fe6fffcb32348bb16bfc0bf8d4fdea836c3ecd845587f6f48c90162ec3e8","last_reissued_at":"2026-07-04T14:57:16.419173Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:57:16.419173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Coding Theorems for Arbitrary Sources, Channels and Entanglement Resources","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Garry Bowen, Nilanjana Datta","submitted_at":"2006-09-30T12:26:14Z","abstract_excerpt":"The information spectrum approach gives general formulae for optimal rates of various information theoretic protocols, under minimal assumptions on the nature of the sources, channels and entanglement resources involved. This paper culminates in the derivation of the dense coding capacity for a noiseless quantum channel, assisted by arbitrary shared entanglement, using this approach. We also review the currently known coding theorems, and their converses, for protocols such as data compression for arbitrary quantum sources and transmission of classical information through arbitrary quantum cha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0610003","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/0610003/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":"quant-ph/0610003","created_at":"2026-07-04T14:57:16.419237+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0610003v1","created_at":"2026-07-04T14:57:16.419237+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0610003","created_at":"2026-07-04T14:57:16.419237+00:00"},{"alias_kind":"pith_short_12","alias_value":"ESQ74377ZMZD","created_at":"2026-07-04T14:57:16.419237+00:00"},{"alias_kind":"pith_short_16","alias_value":"ESQ74377ZMZDJC5R","created_at":"2026-07-04T14:57:16.419237+00:00"},{"alias_kind":"pith_short_8","alias_value":"ESQ74377","created_at":"2026-07-04T14:57:16.419237+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2606.06392","citing_title":"Robustness of Entanglement Manipulation for almost i.i.d. sources","ref_index":6,"is_internal_anchor":true},{"citing_arxiv_id":"2605.20092","citing_title":"Entropy Concentration and Universal Typicality for Weakly Almost i.i.d. Quantum Sources","ref_index":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ESQ74377ZMZDJC5RNP6AX6GU7X","json":"https://pith.science/pith/ESQ74377ZMZDJC5RNP6AX6GU7X.json","graph_json":"https://pith.science/api/pith-number/ESQ74377ZMZDJC5RNP6AX6GU7X/graph.json","events_json":"https://pith.science/api/pith-number/ESQ74377ZMZDJC5RNP6AX6GU7X/events.json","paper":"https://pith.science/paper/ESQ74377"},"agent_actions":{"view_html":"https://pith.science/pith/ESQ74377ZMZDJC5RNP6AX6GU7X","download_json":"https://pith.science/pith/ESQ74377ZMZDJC5RNP6AX6GU7X.json","view_paper":"https://pith.science/paper/ESQ74377","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0610003&json=true","fetch_graph":"https://pith.science/api/pith-number/ESQ74377ZMZDJC5RNP6AX6GU7X/graph.json","fetch_events":"https://pith.science/api/pith-number/ESQ74377ZMZDJC5RNP6AX6GU7X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ESQ74377ZMZDJC5RNP6AX6GU7X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ESQ74377ZMZDJC5RNP6AX6GU7X/action/storage_attestation","attest_author":"https://pith.science/pith/ESQ74377ZMZDJC5RNP6AX6GU7X/action/author_attestation","sign_citation":"https://pith.science/pith/ESQ74377ZMZDJC5RNP6AX6GU7X/action/citation_signature","submit_replication":"https://pith.science/pith/ESQ74377ZMZDJC5RNP6AX6GU7X/action/replication_record"}},"created_at":"2026-07-04T14:57:16.419237+00:00","updated_at":"2026-07-04T14:57:16.419237+00:00"}