{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:FPM5BI2XSTO7X4P5Y5QLPUYBUG","short_pith_number":"pith:FPM5BI2X","schema_version":"1.0","canonical_sha256":"2bd9d0a35794ddfbf1fdc760b7d301a1a36c972f2d870c7877bb498dc8b7a791","source":{"kind":"arxiv","id":"quant-ph/0412039","version":2},"attestation_state":"computed","paper":{"title":"Probabilistic Super Dense Coding","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"A. K. Pati, P. Agrawal, P. Parashar","submitted_at":"2004-12-06T10:24:38Z","abstract_excerpt":"We explore the possibility of performing super dense coding with non-maximally entangled states as a resource. Using this we find that one can send two classical bits in a probabilistic manner by sending a qubit. We generalize our scheme to higher dimensions and show that one can communicate 2log_2 d classical bits by sending a d-dimensional quantum state with a certain probability of success. The success probability in super dense coding is related to the success probability of distinguishing non-orthogonal states. The optimal average success probabilities are explicitly calculated. We consid"},"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/0412039","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2004-12-06T10:24:38Z","cross_cats_sorted":[],"title_canon_sha256":"8318e00e188f17d976300174c31724dc7d707dd3ca5878656f1bef3b6a030271","abstract_canon_sha256":"743e10689f24a9dcd090e0e7dd0c632d1980389fdbbbedf6b884c567d8d222c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:39.152147Z","signature_b64":"3HKUX4+yjsdVVGhP75mPKLm8BS/f8lN4rpKbKrcPuwpqJlwWfiVWrRTehXMPgQTqRzaK6bbjkB6YIK8SuBSLCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bd9d0a35794ddfbf1fdc760b7d301a1a36c972f2d870c7877bb498dc8b7a791","last_reissued_at":"2026-05-18T03:57:39.151512Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:39.151512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Probabilistic Super Dense Coding","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"A. K. Pati, P. Agrawal, P. Parashar","submitted_at":"2004-12-06T10:24:38Z","abstract_excerpt":"We explore the possibility of performing super dense coding with non-maximally entangled states as a resource. Using this we find that one can send two classical bits in a probabilistic manner by sending a qubit. We generalize our scheme to higher dimensions and show that one can communicate 2log_2 d classical bits by sending a d-dimensional quantum state with a certain probability of success. The success probability in super dense coding is related to the success probability of distinguishing non-orthogonal states. The optimal average success probabilities are explicitly calculated. We consid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0412039","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":""},"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/0412039","created_at":"2026-05-18T03:57:39.151600+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0412039v2","created_at":"2026-05-18T03:57:39.151600+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0412039","created_at":"2026-05-18T03:57:39.151600+00:00"},{"alias_kind":"pith_short_12","alias_value":"FPM5BI2XSTO7","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_16","alias_value":"FPM5BI2XSTO7X4P5","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_8","alias_value":"FPM5BI2X","created_at":"2026-05-18T12:25:52.687210+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/FPM5BI2XSTO7X4P5Y5QLPUYBUG","json":"https://pith.science/pith/FPM5BI2XSTO7X4P5Y5QLPUYBUG.json","graph_json":"https://pith.science/api/pith-number/FPM5BI2XSTO7X4P5Y5QLPUYBUG/graph.json","events_json":"https://pith.science/api/pith-number/FPM5BI2XSTO7X4P5Y5QLPUYBUG/events.json","paper":"https://pith.science/paper/FPM5BI2X"},"agent_actions":{"view_html":"https://pith.science/pith/FPM5BI2XSTO7X4P5Y5QLPUYBUG","download_json":"https://pith.science/pith/FPM5BI2XSTO7X4P5Y5QLPUYBUG.json","view_paper":"https://pith.science/paper/FPM5BI2X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0412039&json=true","fetch_graph":"https://pith.science/api/pith-number/FPM5BI2XSTO7X4P5Y5QLPUYBUG/graph.json","fetch_events":"https://pith.science/api/pith-number/FPM5BI2XSTO7X4P5Y5QLPUYBUG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FPM5BI2XSTO7X4P5Y5QLPUYBUG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FPM5BI2XSTO7X4P5Y5QLPUYBUG/action/storage_attestation","attest_author":"https://pith.science/pith/FPM5BI2XSTO7X4P5Y5QLPUYBUG/action/author_attestation","sign_citation":"https://pith.science/pith/FPM5BI2XSTO7X4P5Y5QLPUYBUG/action/citation_signature","submit_replication":"https://pith.science/pith/FPM5BI2XSTO7X4P5Y5QLPUYBUG/action/replication_record"}},"created_at":"2026-05-18T03:57:39.151600+00:00","updated_at":"2026-05-18T03:57:39.151600+00:00"}