{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:3G6KMO5FIEIVWYJ56AWZNIIKCP","short_pith_number":"pith:3G6KMO5F","schema_version":"1.0","canonical_sha256":"d9bca63ba541115b613df02d96a10a13d18c333cb407de4f2a48d412a9c43b44","source":{"kind":"arxiv","id":"0810.3608","version":1},"attestation_state":"computed","paper":{"title":"Phase boundaries in deterministic dense coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Michael R. Beran, Scott M. Cohen","submitted_at":"2008-10-20T17:05:29Z","abstract_excerpt":"We consider dense coding with partially entangled states on bipartite systems of dimension $d\\times d$, studying the conditions under which a given number of messages, $N$, can be deterministically transmitted. It is known that the largest Schmidt coefficient, $\\lambda_0$, must obey the bound $\\lambda_0\\le d/N$, and considerable empirical evidence points to the conclusion that there exist states satisfying $\\lambda_0=d/N$ for every $d$ and $N$ except the special cases $N=d+1$ and $N=d^2-1$. We provide additional conditions under which this bound cannot be reached -- that is, when it must be th"},"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":"0810.3608","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-10-20T17:05:29Z","cross_cats_sorted":[],"title_canon_sha256":"086ffa356ff755699909a14df7507c11ae8110b9ea99681e091142f9157d7b53","abstract_canon_sha256":"5603a313da622362abdfb843446a766bf8671ce34c54ce5d539fb6739f91b390"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:49.003535Z","signature_b64":"G7oAn+qi6gBb2FIkc5Q/xKhHPH8TumACt5uQ0I1eDLn+/cuCmuPh3VBCL9jYrkSRnKucfP6jYs/RyYnTTs6uCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9bca63ba541115b613df02d96a10a13d18c333cb407de4f2a48d412a9c43b44","last_reissued_at":"2026-05-18T02:45:49.003082Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:49.003082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Phase boundaries in deterministic dense coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Michael R. Beran, Scott M. Cohen","submitted_at":"2008-10-20T17:05:29Z","abstract_excerpt":"We consider dense coding with partially entangled states on bipartite systems of dimension $d\\times d$, studying the conditions under which a given number of messages, $N$, can be deterministically transmitted. It is known that the largest Schmidt coefficient, $\\lambda_0$, must obey the bound $\\lambda_0\\le d/N$, and considerable empirical evidence points to the conclusion that there exist states satisfying $\\lambda_0=d/N$ for every $d$ and $N$ except the special cases $N=d+1$ and $N=d^2-1$. We provide additional conditions under which this bound cannot be reached -- that is, when it must be th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0810.3608","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0810.3608","created_at":"2026-05-18T02:45:49.003147+00:00"},{"alias_kind":"arxiv_version","alias_value":"0810.3608v1","created_at":"2026-05-18T02:45:49.003147+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0810.3608","created_at":"2026-05-18T02:45:49.003147+00:00"},{"alias_kind":"pith_short_12","alias_value":"3G6KMO5FIEIV","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"3G6KMO5FIEIVWYJ5","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"3G6KMO5F","created_at":"2026-05-18T12:25:56.245647+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3G6KMO5FIEIVWYJ56AWZNIIKCP","json":"https://pith.science/pith/3G6KMO5FIEIVWYJ56AWZNIIKCP.json","graph_json":"https://pith.science/api/pith-number/3G6KMO5FIEIVWYJ56AWZNIIKCP/graph.json","events_json":"https://pith.science/api/pith-number/3G6KMO5FIEIVWYJ56AWZNIIKCP/events.json","paper":"https://pith.science/paper/3G6KMO5F"},"agent_actions":{"view_html":"https://pith.science/pith/3G6KMO5FIEIVWYJ56AWZNIIKCP","download_json":"https://pith.science/pith/3G6KMO5FIEIVWYJ56AWZNIIKCP.json","view_paper":"https://pith.science/paper/3G6KMO5F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0810.3608&json=true","fetch_graph":"https://pith.science/api/pith-number/3G6KMO5FIEIVWYJ56AWZNIIKCP/graph.json","fetch_events":"https://pith.science/api/pith-number/3G6KMO5FIEIVWYJ56AWZNIIKCP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3G6KMO5FIEIVWYJ56AWZNIIKCP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3G6KMO5FIEIVWYJ56AWZNIIKCP/action/storage_attestation","attest_author":"https://pith.science/pith/3G6KMO5FIEIVWYJ56AWZNIIKCP/action/author_attestation","sign_citation":"https://pith.science/pith/3G6KMO5FIEIVWYJ56AWZNIIKCP/action/citation_signature","submit_replication":"https://pith.science/pith/3G6KMO5FIEIVWYJ56AWZNIIKCP/action/replication_record"}},"created_at":"2026-05-18T02:45:49.003147+00:00","updated_at":"2026-05-18T02:45:49.003147+00:00"}