{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:7S32FLQUGOROCGP254LU6T3RUL","short_pith_number":"pith:7S32FLQU","canonical_record":{"source":{"id":"1202.3433","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-02-15T20:57:40Z","cross_cats_sorted":[],"title_canon_sha256":"4701c97846e327624db0a1ed9511767ea21146cdf4b33342ae3e65ec63c8e211","abstract_canon_sha256":"1cf458ea29d5a542df1461c5cdf8f5c065c7edd7fc44cb65fbeecbbf70e02db3"},"schema_version":"1.0"},"canonical_sha256":"fcb7a2ae1433a2e119faef174f4f71a2d6a67515a9683d7142b46296197be45b","source":{"kind":"arxiv","id":"1202.3433","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3433","created_at":"2026-05-18T03:42:11Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3433v1","created_at":"2026-05-18T03:42:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3433","created_at":"2026-05-18T03:42:11Z"},{"alias_kind":"pith_short_12","alias_value":"7S32FLQUGORO","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"7S32FLQUGOROCGP2","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"7S32FLQU","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:7S32FLQUGOROCGP254LU6T3RUL","target":"record","payload":{"canonical_record":{"source":{"id":"1202.3433","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-02-15T20:57:40Z","cross_cats_sorted":[],"title_canon_sha256":"4701c97846e327624db0a1ed9511767ea21146cdf4b33342ae3e65ec63c8e211","abstract_canon_sha256":"1cf458ea29d5a542df1461c5cdf8f5c065c7edd7fc44cb65fbeecbbf70e02db3"},"schema_version":"1.0"},"canonical_sha256":"fcb7a2ae1433a2e119faef174f4f71a2d6a67515a9683d7142b46296197be45b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:11.663735Z","signature_b64":"UDCiulHhmHHYeIifw9W6sSaiQqwc2LQsT9WeXJT/9SpSSDszX+p40uMQv2h5F4tD48oruAW8WAYT41TXdj7mBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcb7a2ae1433a2e119faef174f4f71a2d6a67515a9683d7142b46296197be45b","last_reissued_at":"2026-05-18T03:42:11.663035Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:11.663035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.3433","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:42:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nCSS6/iHEiBNjI+LzzCZg61qbE7BwMGuf15vHM/58bmvfCY46j9UtusZ4+JxBO80QdevRNFXx38EIhCk30FODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:20:34.726905Z"},"content_sha256":"9007ecd35e26da04147a9d1b48f871e1040edeca671585040b1720d783062a41","schema_version":"1.0","event_id":"sha256:9007ecd35e26da04147a9d1b48f871e1040edeca671585040b1720d783062a41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:7S32FLQUGOROCGP254LU6T3RUL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-Threshold Quantum Secret Sharing Schemes in the Graph State Formalism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Pradeep Sarvepalli","submitted_at":"2012-02-15T20:57:40Z","abstract_excerpt":"In a recent work, Markham and Sanders have proposed a framework to study quantum secret sharing (QSS) schemes using graph states. This framework unified three classes of QSS protocols, namely, sharing classical secrets over private and public channels, and sharing quantum secrets. However, most work on secret sharing based on graph states focused on threshold schemes. In this paper, we focus on general access structures. We show how to realize a large class of arbitrary access structures using the graph state formalism. We show an equivalence between $[[n,1]]$ binary quantum codes and graph st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3433","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:42:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ogwfuXwP2s2cqWSRQRn5brBvnWI+VUrKdX6Z600dlawbWDRZjAHskPSaZcdtunPQgUSHY3bEQcxibojqieABAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:20:34.727558Z"},"content_sha256":"6ccc83b5c5fcc8ca6e47f65f17c93532acbb962bb5d631ef58b2fcfbeca109da","schema_version":"1.0","event_id":"sha256:6ccc83b5c5fcc8ca6e47f65f17c93532acbb962bb5d631ef58b2fcfbeca109da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7S32FLQUGOROCGP254LU6T3RUL/bundle.json","state_url":"https://pith.science/pith/7S32FLQUGOROCGP254LU6T3RUL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7S32FLQUGOROCGP254LU6T3RUL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T14:20:34Z","links":{"resolver":"https://pith.science/pith/7S32FLQUGOROCGP254LU6T3RUL","bundle":"https://pith.science/pith/7S32FLQUGOROCGP254LU6T3RUL/bundle.json","state":"https://pith.science/pith/7S32FLQUGOROCGP254LU6T3RUL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7S32FLQUGOROCGP254LU6T3RUL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:7S32FLQUGOROCGP254LU6T3RUL","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1cf458ea29d5a542df1461c5cdf8f5c065c7edd7fc44cb65fbeecbbf70e02db3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-02-15T20:57:40Z","title_canon_sha256":"4701c97846e327624db0a1ed9511767ea21146cdf4b33342ae3e65ec63c8e211"},"schema_version":"1.0","source":{"id":"1202.3433","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3433","created_at":"2026-05-18T03:42:11Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3433v1","created_at":"2026-05-18T03:42:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3433","created_at":"2026-05-18T03:42:11Z"},{"alias_kind":"pith_short_12","alias_value":"7S32FLQUGORO","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"7S32FLQUGOROCGP2","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"7S32FLQU","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:6ccc83b5c5fcc8ca6e47f65f17c93532acbb962bb5d631ef58b2fcfbeca109da","target":"graph","created_at":"2026-05-18T03:42:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In a recent work, Markham and Sanders have proposed a framework to study quantum secret sharing (QSS) schemes using graph states. This framework unified three classes of QSS protocols, namely, sharing classical secrets over private and public channels, and sharing quantum secrets. However, most work on secret sharing based on graph states focused on threshold schemes. In this paper, we focus on general access structures. We show how to realize a large class of arbitrary access structures using the graph state formalism. We show an equivalence between $[[n,1]]$ binary quantum codes and graph st","authors_text":"Pradeep Sarvepalli","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-02-15T20:57:40Z","title":"Non-Threshold Quantum Secret Sharing Schemes in the Graph State Formalism"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3433","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9007ecd35e26da04147a9d1b48f871e1040edeca671585040b1720d783062a41","target":"record","created_at":"2026-05-18T03:42:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1cf458ea29d5a542df1461c5cdf8f5c065c7edd7fc44cb65fbeecbbf70e02db3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-02-15T20:57:40Z","title_canon_sha256":"4701c97846e327624db0a1ed9511767ea21146cdf4b33342ae3e65ec63c8e211"},"schema_version":"1.0","source":{"id":"1202.3433","kind":"arxiv","version":1}},"canonical_sha256":"fcb7a2ae1433a2e119faef174f4f71a2d6a67515a9683d7142b46296197be45b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fcb7a2ae1433a2e119faef174f4f71a2d6a67515a9683d7142b46296197be45b","first_computed_at":"2026-05-18T03:42:11.663035Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:11.663035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UDCiulHhmHHYeIifw9W6sSaiQqwc2LQsT9WeXJT/9SpSSDszX+p40uMQv2h5F4tD48oruAW8WAYT41TXdj7mBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:11.663735Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.3433","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9007ecd35e26da04147a9d1b48f871e1040edeca671585040b1720d783062a41","sha256:6ccc83b5c5fcc8ca6e47f65f17c93532acbb962bb5d631ef58b2fcfbeca109da"],"state_sha256":"d974ba3de67f63b16ecec51f7f2601320730a0bde321a9607a97303bae3fb074"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tqe7QnkcAsG/xD9NVyt6Zdww1bGuXpW8IvLHrUrnAVopffvlhVvrmLiUUGSAe8MWuEQbcwKmr7FiICqwPkspBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T14:20:34.731137Z","bundle_sha256":"9957fff8bc0b24f3fefc587b630d9c31f4ab6765c12b2f82120df63260d36822"}}