{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:656VH43SB5TWQLX3ZMPKQUK52L","short_pith_number":"pith:656VH43S","schema_version":"1.0","canonical_sha256":"f77d53f3720f67682efbcb1ea8515dd2f2c63f78bf9050762241951ff54d3b66","source":{"kind":"arxiv","id":"0808.1532","version":3},"attestation_state":"computed","paper":{"title":"Graph States for Quantum Secret Sharing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Barry C. Sanders, Damian Markham","submitted_at":"2008-08-11T16:17:02Z","abstract_excerpt":"We consider three broad classes of quantum secret sharing with and without eavesdropping and show how a graph state formalism unifies otherwise disparate quantum secret sharing models. In addition to the elegant unification provided by graph states, our approach provides a generalization of threshold classical secret sharing via insecure quantum channels beyond the current requirement of 100% collaboration by players to just a simple majority in the case of five players. Another innovation here is the introduction of embedded protocols within a larger graph state that serves as a one-way quant"},"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":"0808.1532","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-08-11T16:17:02Z","cross_cats_sorted":[],"title_canon_sha256":"a5850bac50011651743b7452b6cd027d82dc20ef7137e8f3682fafc552cef8c0","abstract_canon_sha256":"f2e0e4a0144d8f4bce443e254bd87ba1eb017d9df90267a1c12baa20a12dd9a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:31.451775Z","signature_b64":"wLR3e59xMyZgjdYU9zmm0O4oWy8x756sVNJtKZl91Ln4hPga8N7Qt1PdKuqhv7b5t0sDTrGnaL7Av4HbbbPEAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f77d53f3720f67682efbcb1ea8515dd2f2c63f78bf9050762241951ff54d3b66","last_reissued_at":"2026-05-18T04:31:31.451135Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:31.451135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph States for Quantum Secret Sharing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Barry C. Sanders, Damian Markham","submitted_at":"2008-08-11T16:17:02Z","abstract_excerpt":"We consider three broad classes of quantum secret sharing with and without eavesdropping and show how a graph state formalism unifies otherwise disparate quantum secret sharing models. In addition to the elegant unification provided by graph states, our approach provides a generalization of threshold classical secret sharing via insecure quantum channels beyond the current requirement of 100% collaboration by players to just a simple majority in the case of five players. Another innovation here is the introduction of embedded protocols within a larger graph state that serves as a one-way quant"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0808.1532","kind":"arxiv","version":3},"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":"0808.1532","created_at":"2026-05-18T04:31:31.451236+00:00"},{"alias_kind":"arxiv_version","alias_value":"0808.1532v3","created_at":"2026-05-18T04:31:31.451236+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0808.1532","created_at":"2026-05-18T04:31:31.451236+00:00"},{"alias_kind":"pith_short_12","alias_value":"656VH43SB5TW","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"656VH43SB5TWQLX3","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"656VH43S","created_at":"2026-05-18T12:25:56.245647+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/656VH43SB5TWQLX3ZMPKQUK52L","json":"https://pith.science/pith/656VH43SB5TWQLX3ZMPKQUK52L.json","graph_json":"https://pith.science/api/pith-number/656VH43SB5TWQLX3ZMPKQUK52L/graph.json","events_json":"https://pith.science/api/pith-number/656VH43SB5TWQLX3ZMPKQUK52L/events.json","paper":"https://pith.science/paper/656VH43S"},"agent_actions":{"view_html":"https://pith.science/pith/656VH43SB5TWQLX3ZMPKQUK52L","download_json":"https://pith.science/pith/656VH43SB5TWQLX3ZMPKQUK52L.json","view_paper":"https://pith.science/paper/656VH43S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0808.1532&json=true","fetch_graph":"https://pith.science/api/pith-number/656VH43SB5TWQLX3ZMPKQUK52L/graph.json","fetch_events":"https://pith.science/api/pith-number/656VH43SB5TWQLX3ZMPKQUK52L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/656VH43SB5TWQLX3ZMPKQUK52L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/656VH43SB5TWQLX3ZMPKQUK52L/action/storage_attestation","attest_author":"https://pith.science/pith/656VH43SB5TWQLX3ZMPKQUK52L/action/author_attestation","sign_citation":"https://pith.science/pith/656VH43SB5TWQLX3ZMPKQUK52L/action/citation_signature","submit_replication":"https://pith.science/pith/656VH43SB5TWQLX3ZMPKQUK52L/action/replication_record"}},"created_at":"2026-05-18T04:31:31.451236+00:00","updated_at":"2026-05-18T04:31:31.451236+00:00"}