{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:44OZFHJWWVVOJJJ6PCM2BANSGV","short_pith_number":"pith:44OZFHJW","canonical_record":{"source":{"id":"quant-ph/0604149","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2006-04-20T11:45:43Z","cross_cats_sorted":[],"title_canon_sha256":"b0892709d85b5e503e76a26d2b88f6dc0f0085bdf8b046e866acfc38fc8d1ddc","abstract_canon_sha256":"a0a237805cc7c80c4b41de2f0d7d18c24eb24f6fec38b5d4d47d10c6fb59fa92"},"schema_version":"1.0"},"canonical_sha256":"e71d929d36b56ae4a53e7899a081b2356662ed8ae960414f24a8001f4101337e","source":{"kind":"arxiv","id":"quant-ph/0604149","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0604149","created_at":"2026-07-04T17:02:59Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0604149v2","created_at":"2026-07-04T17:02:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0604149","created_at":"2026-07-04T17:02:59Z"},{"alias_kind":"pith_short_12","alias_value":"44OZFHJWWVVO","created_at":"2026-07-04T17:02:59Z"},{"alias_kind":"pith_short_16","alias_value":"44OZFHJWWVVOJJJ6","created_at":"2026-07-04T17:02:59Z"},{"alias_kind":"pith_short_8","alias_value":"44OZFHJW","created_at":"2026-07-04T17:02:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:44OZFHJWWVVOJJJ6PCM2BANSGV","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0604149","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2006-04-20T11:45:43Z","cross_cats_sorted":[],"title_canon_sha256":"b0892709d85b5e503e76a26d2b88f6dc0f0085bdf8b046e866acfc38fc8d1ddc","abstract_canon_sha256":"a0a237805cc7c80c4b41de2f0d7d18c24eb24f6fec38b5d4d47d10c6fb59fa92"},"schema_version":"1.0"},"canonical_sha256":"e71d929d36b56ae4a53e7899a081b2356662ed8ae960414f24a8001f4101337e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T17:02:59.716116Z","signature_b64":"QXp3FghShGz7j6pmHomwsTL12vaWT82tshdT2bBW53OU+7X0u8vbQeEH38TuB8+mnOx1WWtA8wYT4uItMySsAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e71d929d36b56ae4a53e7899a081b2356662ed8ae960414f24a8001f4101337e","last_reissued_at":"2026-07-04T17:02:59.715745Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T17:02:59.715745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0604149","source_version":2,"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-07-04T17:02:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZaKvjVYMxPVxx3+dJ/1qqV/6DsJVBymWjEo3q8SzSfkYTzlAWqIdzBXbuZ+zfx1qUod+DqXsTwXRa4LAfVY6Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T22:51:14.673733Z"},"content_sha256":"64a53e2b1c4fb4d76c5998c5e77b96525b74c0c87029b2bbcbef44712ff4a2b2","schema_version":"1.0","event_id":"sha256:64a53e2b1c4fb4d76c5998c5e77b96525b74c0c87029b2bbcbef44712ff4a2b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:44OZFHJWWVVOJJJ6PCM2BANSGV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal dense coding with arbitrary pure entangled states","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Runyao Duan, Yuan Feng, Zhengfeng Ji","submitted_at":"2006-04-20T11:45:43Z","abstract_excerpt":"We examine dense coding with an arbitrary pure entangled state sharing between the sender and the receiver. Upper bounds on the average success probability in approximate dense coding and on the probability of conclusive results in unambiguous dense coding are derived. We also construct the optimal protocol which saturates the upper bound in each case."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0604149","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/0604149/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"},"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-07-04T17:02:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LOKfDRTLswYT6q2ZPvvu9E04wUF9iseuqdaA3fzSwaVngNgGan/AG2aONMejUFa5r+UaCur8MhgGDOVzh8EUBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T22:51:14.674236Z"},"content_sha256":"fe112dd5d79a536ac942921ebf46959d2dd50dced7570ddd1fc06cdd78edc068","schema_version":"1.0","event_id":"sha256:fe112dd5d79a536ac942921ebf46959d2dd50dced7570ddd1fc06cdd78edc068"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/44OZFHJWWVVOJJJ6PCM2BANSGV/bundle.json","state_url":"https://pith.science/pith/44OZFHJWWVVOJJJ6PCM2BANSGV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/44OZFHJWWVVOJJJ6PCM2BANSGV/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-08-06T22:51:14Z","links":{"resolver":"https://pith.science/pith/44OZFHJWWVVOJJJ6PCM2BANSGV","bundle":"https://pith.science/pith/44OZFHJWWVVOJJJ6PCM2BANSGV/bundle.json","state":"https://pith.science/pith/44OZFHJWWVVOJJJ6PCM2BANSGV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/44OZFHJWWVVOJJJ6PCM2BANSGV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:44OZFHJWWVVOJJJ6PCM2BANSGV","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":"a0a237805cc7c80c4b41de2f0d7d18c24eb24f6fec38b5d4d47d10c6fb59fa92","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2006-04-20T11:45:43Z","title_canon_sha256":"b0892709d85b5e503e76a26d2b88f6dc0f0085bdf8b046e866acfc38fc8d1ddc"},"schema_version":"1.0","source":{"id":"quant-ph/0604149","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0604149","created_at":"2026-07-04T17:02:59Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0604149v2","created_at":"2026-07-04T17:02:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0604149","created_at":"2026-07-04T17:02:59Z"},{"alias_kind":"pith_short_12","alias_value":"44OZFHJWWVVO","created_at":"2026-07-04T17:02:59Z"},{"alias_kind":"pith_short_16","alias_value":"44OZFHJWWVVOJJJ6","created_at":"2026-07-04T17:02:59Z"},{"alias_kind":"pith_short_8","alias_value":"44OZFHJW","created_at":"2026-07-04T17:02:59Z"}],"graph_snapshots":[{"event_id":"sha256:fe112dd5d79a536ac942921ebf46959d2dd50dced7570ddd1fc06cdd78edc068","target":"graph","created_at":"2026-07-04T17:02:59Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/quant-ph/0604149/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We examine dense coding with an arbitrary pure entangled state sharing between the sender and the receiver. Upper bounds on the average success probability in approximate dense coding and on the probability of conclusive results in unambiguous dense coding are derived. We also construct the optimal protocol which saturates the upper bound in each case.","authors_text":"Runyao Duan, Yuan Feng, Zhengfeng Ji","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2006-04-20T11:45:43Z","title":"Optimal dense coding with arbitrary pure entangled states"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0604149","kind":"arxiv","version":2},"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:64a53e2b1c4fb4d76c5998c5e77b96525b74c0c87029b2bbcbef44712ff4a2b2","target":"record","created_at":"2026-07-04T17:02:59Z","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":"a0a237805cc7c80c4b41de2f0d7d18c24eb24f6fec38b5d4d47d10c6fb59fa92","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2006-04-20T11:45:43Z","title_canon_sha256":"b0892709d85b5e503e76a26d2b88f6dc0f0085bdf8b046e866acfc38fc8d1ddc"},"schema_version":"1.0","source":{"id":"quant-ph/0604149","kind":"arxiv","version":2}},"canonical_sha256":"e71d929d36b56ae4a53e7899a081b2356662ed8ae960414f24a8001f4101337e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e71d929d36b56ae4a53e7899a081b2356662ed8ae960414f24a8001f4101337e","first_computed_at":"2026-07-04T17:02:59.715745Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T17:02:59.715745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QXp3FghShGz7j6pmHomwsTL12vaWT82tshdT2bBW53OU+7X0u8vbQeEH38TuB8+mnOx1WWtA8wYT4uItMySsAQ==","signature_status":"signed_v1","signed_at":"2026-07-04T17:02:59.716116Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0604149","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64a53e2b1c4fb4d76c5998c5e77b96525b74c0c87029b2bbcbef44712ff4a2b2","sha256:fe112dd5d79a536ac942921ebf46959d2dd50dced7570ddd1fc06cdd78edc068"],"state_sha256":"72f91c5a4db17c89fad3269b084c089c7094bc109bd674c39c55cb75c71a2115"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8givr5gMowem7YanXFbhXU3USkm8eHhyI/+l6yzwyMWeIqosq17xU6nGqm3yCrpMy/tHCJ0gQ853OD0Ax/oqAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T22:51:14.678771Z","bundle_sha256":"2964a949a25abeb0ffd8433d2a7ad45ed11b0f0f0e86f56416ea1cf17ad4f84d"}}