{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1999:SU32CG6XLW7XMKKMSXGM5UNJA3","short_pith_number":"pith:SU32CG6X","schema_version":"1.0","canonical_sha256":"9537a11bd75dbf76294c95ccced1a906f0bd1319a2d84e2fc5ec69ef398762e2","source":{"kind":"arxiv","id":"quant-ph/9901025","version":1},"attestation_state":"computed","paper":{"title":"How to share a quantum secret","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Gottesman, Hoi-Kwong Lo, Richard Cleve","submitted_at":"1999-01-12T00:49:09Z","abstract_excerpt":"We investigate the concept of quantum secret sharing. In a ((k,n)) threshold scheme, a secret quantum state is divided into n shares such that any k of those shares can be used to reconstruct the secret, but any set of k-1 or fewer shares contains absolutely no information about the secret. We show that the only constraint on the existence of threshold schemes comes from the quantum \"no-cloning theorem\", which requires that n < 2k, and, in all such cases, we give an efficient construction of a ((k,n)) threshold scheme. We also explore similarities and differences between quantum secret sharing"},"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/9901025","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1999-01-12T00:49:09Z","cross_cats_sorted":[],"title_canon_sha256":"4c7296aa94332ebd250e79c79f613a2d6b802ebbe415c470bb61ea23d6d4c5d0","abstract_canon_sha256":"7ec736e4e5b6ff0ac1c752bab35bb3dceeb5e436f288844b3d9985bc41330eb9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T16:15:39.252746Z","signature_b64":"GXmwSQKv1DAHWNjDUbiXT1vE6ufGmm4VkvdpZI500LccNSL45+LQnVa/MEzMLgy+8iAYC8mwzSJVMZdcqZf1Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9537a11bd75dbf76294c95ccced1a906f0bd1319a2d84e2fc5ec69ef398762e2","last_reissued_at":"2026-07-04T16:15:39.252322Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T16:15:39.252322Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How to share a quantum secret","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Gottesman, Hoi-Kwong Lo, Richard Cleve","submitted_at":"1999-01-12T00:49:09Z","abstract_excerpt":"We investigate the concept of quantum secret sharing. In a ((k,n)) threshold scheme, a secret quantum state is divided into n shares such that any k of those shares can be used to reconstruct the secret, but any set of k-1 or fewer shares contains absolutely no information about the secret. We show that the only constraint on the existence of threshold schemes comes from the quantum \"no-cloning theorem\", which requires that n < 2k, and, in all such cases, we give an efficient construction of a ((k,n)) threshold scheme. We also explore similarities and differences between quantum secret sharing"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9901025","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/9901025/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/9901025","created_at":"2026-07-04T16:15:39.252375+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9901025v1","created_at":"2026-07-04T16:15:39.252375+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9901025","created_at":"2026-07-04T16:15:39.252375+00:00"},{"alias_kind":"pith_short_12","alias_value":"SU32CG6XLW7X","created_at":"2026-07-04T16:15:39.252375+00:00"},{"alias_kind":"pith_short_16","alias_value":"SU32CG6XLW7XMKKM","created_at":"2026-07-04T16:15:39.252375+00:00"},{"alias_kind":"pith_short_8","alias_value":"SU32CG6X","created_at":"2026-07-04T16:15:39.252375+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/SU32CG6XLW7XMKKMSXGM5UNJA3","json":"https://pith.science/pith/SU32CG6XLW7XMKKMSXGM5UNJA3.json","graph_json":"https://pith.science/api/pith-number/SU32CG6XLW7XMKKMSXGM5UNJA3/graph.json","events_json":"https://pith.science/api/pith-number/SU32CG6XLW7XMKKMSXGM5UNJA3/events.json","paper":"https://pith.science/paper/SU32CG6X"},"agent_actions":{"view_html":"https://pith.science/pith/SU32CG6XLW7XMKKMSXGM5UNJA3","download_json":"https://pith.science/pith/SU32CG6XLW7XMKKMSXGM5UNJA3.json","view_paper":"https://pith.science/paper/SU32CG6X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/9901025&json=true","fetch_graph":"https://pith.science/api/pith-number/SU32CG6XLW7XMKKMSXGM5UNJA3/graph.json","fetch_events":"https://pith.science/api/pith-number/SU32CG6XLW7XMKKMSXGM5UNJA3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SU32CG6XLW7XMKKMSXGM5UNJA3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SU32CG6XLW7XMKKMSXGM5UNJA3/action/storage_attestation","attest_author":"https://pith.science/pith/SU32CG6XLW7XMKKMSXGM5UNJA3/action/author_attestation","sign_citation":"https://pith.science/pith/SU32CG6XLW7XMKKMSXGM5UNJA3/action/citation_signature","submit_replication":"https://pith.science/pith/SU32CG6XLW7XMKKMSXGM5UNJA3/action/replication_record"}},"created_at":"2026-07-04T16:15:39.252375+00:00","updated_at":"2026-07-04T16:15:39.252375+00:00"}