{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:BXGWAALPRHLUAXIALLWH4QLNCD","short_pith_number":"pith:BXGWAALP","schema_version":"1.0","canonical_sha256":"0dcd60016f89d7405d005aec7e416d10d85eac519237e4de0e3028f776e9f0a7","source":{"kind":"arxiv","id":"1305.0805","version":2},"attestation_state":"computed","paper":{"title":"Accessing quantum secrets via local operations and classical communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Barry C. Sanders, Vlad Gheorghiu","submitted_at":"2013-05-03T19:03:01Z","abstract_excerpt":"Quantum secret-sharing and quantum error-correction schemes rely on multipartite decoding protocols, yet the non-local operations involved are challenging and sometimes infeasible. Here we construct a quantum secret-sharing protocol with a reduced number of quantum communication channels between the players. Our scheme is based on embedding a classical linear code into a quantum error-correcting code. Our work paves the way towards the more general problem of simplifying the decoding of quantum error-correcting codes."},"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":"1305.0805","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-05-03T19:03:01Z","cross_cats_sorted":[],"title_canon_sha256":"85856e7ae46eab66990f40788bc5391c868481ed5d6353dd3d69c8736c0840ee","abstract_canon_sha256":"ad1f16e6de4942541cf753ced5a06b3ca52b522f9758be2bc542f82110d0dc6c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:39.059375Z","signature_b64":"R4aThm+LrxjDYW+ab7rg6X3vDbiMHOa9rm80hNSMmftLlL+7X8Bsn2AjY7ZhZedIEI/0BBNC9Q1VArKOAa7PAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0dcd60016f89d7405d005aec7e416d10d85eac519237e4de0e3028f776e9f0a7","last_reissued_at":"2026-05-18T03:14:39.058889Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:39.058889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accessing quantum secrets via local operations and classical communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Barry C. Sanders, Vlad Gheorghiu","submitted_at":"2013-05-03T19:03:01Z","abstract_excerpt":"Quantum secret-sharing and quantum error-correction schemes rely on multipartite decoding protocols, yet the non-local operations involved are challenging and sometimes infeasible. Here we construct a quantum secret-sharing protocol with a reduced number of quantum communication channels between the players. Our scheme is based on embedding a classical linear code into a quantum error-correcting code. Our work paves the way towards the more general problem of simplifying the decoding of quantum error-correcting codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0805","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":"1305.0805","created_at":"2026-05-18T03:14:39.058961+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.0805v2","created_at":"2026-05-18T03:14:39.058961+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0805","created_at":"2026-05-18T03:14:39.058961+00:00"},{"alias_kind":"pith_short_12","alias_value":"BXGWAALPRHLU","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"BXGWAALPRHLUAXIA","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"BXGWAALP","created_at":"2026-05-18T12:27:40.988391+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/BXGWAALPRHLUAXIALLWH4QLNCD","json":"https://pith.science/pith/BXGWAALPRHLUAXIALLWH4QLNCD.json","graph_json":"https://pith.science/api/pith-number/BXGWAALPRHLUAXIALLWH4QLNCD/graph.json","events_json":"https://pith.science/api/pith-number/BXGWAALPRHLUAXIALLWH4QLNCD/events.json","paper":"https://pith.science/paper/BXGWAALP"},"agent_actions":{"view_html":"https://pith.science/pith/BXGWAALPRHLUAXIALLWH4QLNCD","download_json":"https://pith.science/pith/BXGWAALPRHLUAXIALLWH4QLNCD.json","view_paper":"https://pith.science/paper/BXGWAALP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.0805&json=true","fetch_graph":"https://pith.science/api/pith-number/BXGWAALPRHLUAXIALLWH4QLNCD/graph.json","fetch_events":"https://pith.science/api/pith-number/BXGWAALPRHLUAXIALLWH4QLNCD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BXGWAALPRHLUAXIALLWH4QLNCD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BXGWAALPRHLUAXIALLWH4QLNCD/action/storage_attestation","attest_author":"https://pith.science/pith/BXGWAALPRHLUAXIALLWH4QLNCD/action/author_attestation","sign_citation":"https://pith.science/pith/BXGWAALPRHLUAXIALLWH4QLNCD/action/citation_signature","submit_replication":"https://pith.science/pith/BXGWAALPRHLUAXIALLWH4QLNCD/action/replication_record"}},"created_at":"2026-05-18T03:14:39.058961+00:00","updated_at":"2026-05-18T03:14:39.058961+00:00"}