{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:RD7TYXYOBKMB3FZVVXKE2H7XI2","short_pith_number":"pith:RD7TYXYO","schema_version":"1.0","canonical_sha256":"88ff3c5f0e0a981d9735add44d1ff746b507512d5dd374a06eb630e6b8024be1","source":{"kind":"arxiv","id":"quant-ph/0407152","version":1},"attestation_state":"computed","paper":{"title":"Multiparty data hiding of quantum information","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Debbie Leung, Graeme Smith, Patrick Hayden","submitted_at":"2004-07-20T16:30:41Z","abstract_excerpt":"We present protocols for multiparty data hiding of quantum information that implement all possible threshold access structures. Closely related to secret sharing, data hiding has a more demanding security requirement: that the data remain secure against unrestricted LOCC attacks. In the limit of hiding a large amount of data, our protocols achieve an asymptotic rate of one hidden qubit per local physical qubit. That is, each party holds a share that is the same size as the hidden state to leading order, with accuracy and security parameters incurring an overhead that is asymptotically negligib"},"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/0407152","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2004-07-20T16:30:41Z","cross_cats_sorted":[],"title_canon_sha256":"13759e1e31a93fb89d49509717972a9e32f8e66121f8debcfd67bea0d471cf53","abstract_canon_sha256":"486583a0744c13a9a95e474a75d32830b2e5fcc991531341f703be94d59f16a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:46:38.585378Z","signature_b64":"5XarX9LMB7aQJvsyQ3AJ5UJrrTta81QLdxSVWeWEvgSfTjoORrAlDPZD+yl63RAWsUGRhGhKOnMyWhg0eEvcCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88ff3c5f0e0a981d9735add44d1ff746b507512d5dd374a06eb630e6b8024be1","last_reissued_at":"2026-07-04T14:46:38.584987Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:46:38.584987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiparty data hiding of quantum information","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Debbie Leung, Graeme Smith, Patrick Hayden","submitted_at":"2004-07-20T16:30:41Z","abstract_excerpt":"We present protocols for multiparty data hiding of quantum information that implement all possible threshold access structures. Closely related to secret sharing, data hiding has a more demanding security requirement: that the data remain secure against unrestricted LOCC attacks. In the limit of hiding a large amount of data, our protocols achieve an asymptotic rate of one hidden qubit per local physical qubit. That is, each party holds a share that is the same size as the hidden state to leading order, with accuracy and security parameters incurring an overhead that is asymptotically negligib"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0407152","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/0407152/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/0407152","created_at":"2026-07-04T14:46:38.585048+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0407152v1","created_at":"2026-07-04T14:46:38.585048+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0407152","created_at":"2026-07-04T14:46:38.585048+00:00"},{"alias_kind":"pith_short_12","alias_value":"RD7TYXYOBKMB","created_at":"2026-07-04T14:46:38.585048+00:00"},{"alias_kind":"pith_short_16","alias_value":"RD7TYXYOBKMB3FZV","created_at":"2026-07-04T14:46:38.585048+00:00"},{"alias_kind":"pith_short_8","alias_value":"RD7TYXYO","created_at":"2026-07-04T14:46:38.585048+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/RD7TYXYOBKMB3FZVVXKE2H7XI2","json":"https://pith.science/pith/RD7TYXYOBKMB3FZVVXKE2H7XI2.json","graph_json":"https://pith.science/api/pith-number/RD7TYXYOBKMB3FZVVXKE2H7XI2/graph.json","events_json":"https://pith.science/api/pith-number/RD7TYXYOBKMB3FZVVXKE2H7XI2/events.json","paper":"https://pith.science/paper/RD7TYXYO"},"agent_actions":{"view_html":"https://pith.science/pith/RD7TYXYOBKMB3FZVVXKE2H7XI2","download_json":"https://pith.science/pith/RD7TYXYOBKMB3FZVVXKE2H7XI2.json","view_paper":"https://pith.science/paper/RD7TYXYO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0407152&json=true","fetch_graph":"https://pith.science/api/pith-number/RD7TYXYOBKMB3FZVVXKE2H7XI2/graph.json","fetch_events":"https://pith.science/api/pith-number/RD7TYXYOBKMB3FZVVXKE2H7XI2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RD7TYXYOBKMB3FZVVXKE2H7XI2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RD7TYXYOBKMB3FZVVXKE2H7XI2/action/storage_attestation","attest_author":"https://pith.science/pith/RD7TYXYOBKMB3FZVVXKE2H7XI2/action/author_attestation","sign_citation":"https://pith.science/pith/RD7TYXYOBKMB3FZVVXKE2H7XI2/action/citation_signature","submit_replication":"https://pith.science/pith/RD7TYXYOBKMB3FZVVXKE2H7XI2/action/replication_record"}},"created_at":"2026-07-04T14:46:38.585048+00:00","updated_at":"2026-07-04T14:46:38.585048+00:00"}