{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:4S7YD7G4DIRPNUFYKAMOTPXNVR","short_pith_number":"pith:4S7YD7G4","schema_version":"1.0","canonical_sha256":"e4bf81fcdc1a22f6d0b85018e9beedac4cb490bb6bf6549ab21184d213873819","source":{"kind":"arxiv","id":"1102.1737","version":2},"attestation_state":"computed","paper":{"title":"Optimal teleportation with a noisy source","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bruno G. Taketani, Fernando de Melo, Ruynet L. de Matos Filho","submitted_at":"2011-02-08T21:31:37Z","abstract_excerpt":"We establish the optimal quantum teleportation protocol for the realistic scenario when both input state and quantum channel are afflicted by noise. In taking these effects into account higher fidelities are achieved. The optimality of the proposed protocol prevails even when restricted to a reduced set of generically available operations."},"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":"1102.1737","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-02-08T21:31:37Z","cross_cats_sorted":[],"title_canon_sha256":"bc1bb492bf5cf14289fa040118ead43ef2a68ca1e71b38aaac665d95e99833ed","abstract_canon_sha256":"656a64d4923737fa3b77d5c51524effc501ef832eec7bfb7b6ac1e25189d0c27"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:19.455981Z","signature_b64":"ThX14Kit1G56FyrllY8H5n6RAb/5tJgiPmHTFmhbDfTBxQtntHjJ2y0CSUKJAhb3LpogQYs//KbnMQ9PmvgCCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4bf81fcdc1a22f6d0b85018e9beedac4cb490bb6bf6549ab21184d213873819","last_reissued_at":"2026-05-18T04:03:19.455531Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:19.455531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal teleportation with a noisy source","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bruno G. Taketani, Fernando de Melo, Ruynet L. de Matos Filho","submitted_at":"2011-02-08T21:31:37Z","abstract_excerpt":"We establish the optimal quantum teleportation protocol for the realistic scenario when both input state and quantum channel are afflicted by noise. In taking these effects into account higher fidelities are achieved. The optimality of the proposed protocol prevails even when restricted to a reduced set of generically available operations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1737","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":"1102.1737","created_at":"2026-05-18T04:03:19.455600+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.1737v2","created_at":"2026-05-18T04:03:19.455600+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1737","created_at":"2026-05-18T04:03:19.455600+00:00"},{"alias_kind":"pith_short_12","alias_value":"4S7YD7G4DIRP","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"4S7YD7G4DIRPNUFY","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"4S7YD7G4","created_at":"2026-05-18T12:26:20.644004+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/4S7YD7G4DIRPNUFYKAMOTPXNVR","json":"https://pith.science/pith/4S7YD7G4DIRPNUFYKAMOTPXNVR.json","graph_json":"https://pith.science/api/pith-number/4S7YD7G4DIRPNUFYKAMOTPXNVR/graph.json","events_json":"https://pith.science/api/pith-number/4S7YD7G4DIRPNUFYKAMOTPXNVR/events.json","paper":"https://pith.science/paper/4S7YD7G4"},"agent_actions":{"view_html":"https://pith.science/pith/4S7YD7G4DIRPNUFYKAMOTPXNVR","download_json":"https://pith.science/pith/4S7YD7G4DIRPNUFYKAMOTPXNVR.json","view_paper":"https://pith.science/paper/4S7YD7G4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.1737&json=true","fetch_graph":"https://pith.science/api/pith-number/4S7YD7G4DIRPNUFYKAMOTPXNVR/graph.json","fetch_events":"https://pith.science/api/pith-number/4S7YD7G4DIRPNUFYKAMOTPXNVR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4S7YD7G4DIRPNUFYKAMOTPXNVR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4S7YD7G4DIRPNUFYKAMOTPXNVR/action/storage_attestation","attest_author":"https://pith.science/pith/4S7YD7G4DIRPNUFYKAMOTPXNVR/action/author_attestation","sign_citation":"https://pith.science/pith/4S7YD7G4DIRPNUFYKAMOTPXNVR/action/citation_signature","submit_replication":"https://pith.science/pith/4S7YD7G4DIRPNUFYKAMOTPXNVR/action/replication_record"}},"created_at":"2026-05-18T04:03:19.455600+00:00","updated_at":"2026-05-18T04:03:19.455600+00:00"}