{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:TVY346NQ7KJMN5TRLR3QCUOIBR","short_pith_number":"pith:TVY346NQ","canonical_record":{"source":{"id":"1007.1232","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-07-07T19:54:52Z","cross_cats_sorted":[],"title_canon_sha256":"ef7e8e28975625ddeda116c0c8d67aa6834feb224860ff5c1475ada0637f64ec","abstract_canon_sha256":"78bf0f7844f0d6ed596f9b7ce6bcf3985b26140fcdd607695e4166973a33a80e"},"schema_version":"1.0"},"canonical_sha256":"9d71be79b0fa92c6f6715c770151c80c7e70e89013a7f9c48002d350d09a7ea4","source":{"kind":"arxiv","id":"1007.1232","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.1232","created_at":"2026-05-18T04:23:46Z"},{"alias_kind":"arxiv_version","alias_value":"1007.1232v1","created_at":"2026-05-18T04:23:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.1232","created_at":"2026-05-18T04:23:46Z"},{"alias_kind":"pith_short_12","alias_value":"TVY346NQ7KJM","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"TVY346NQ7KJMN5TR","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"TVY346NQ","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:TVY346NQ7KJMN5TRLR3QCUOIBR","target":"record","payload":{"canonical_record":{"source":{"id":"1007.1232","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-07-07T19:54:52Z","cross_cats_sorted":[],"title_canon_sha256":"ef7e8e28975625ddeda116c0c8d67aa6834feb224860ff5c1475ada0637f64ec","abstract_canon_sha256":"78bf0f7844f0d6ed596f9b7ce6bcf3985b26140fcdd607695e4166973a33a80e"},"schema_version":"1.0"},"canonical_sha256":"9d71be79b0fa92c6f6715c770151c80c7e70e89013a7f9c48002d350d09a7ea4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:46.334474Z","signature_b64":"sN1VowsPNBNHrIPMXoJ6d32GFAEZZ25SGpHKKgqhzdanmL50KypCJ98/wZMFQUY5paNXMgMIQEQmtVyHxUJpDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d71be79b0fa92c6f6715c770151c80c7e70e89013a7f9c48002d350d09a7ea4","last_reissued_at":"2026-05-18T04:23:46.333859Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:46.333859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1007.1232","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-18T04:23:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mzl0+gEoOVXWCAa9IcJPf5fhPmxk7TP5HGO1MAmywROha/rbL83KuYwyYcXChZXoVxDT+KyA1UwYQVo3G2S2DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:43:36.242592Z"},"content_sha256":"0e6c5f92252bd2dc0760ce5539996a9bdfbdda2cde5ad0bd29e77bca8c66f547","schema_version":"1.0","event_id":"sha256:0e6c5f92252bd2dc0760ce5539996a9bdfbdda2cde5ad0bd29e77bca8c66f547"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:TVY346NQ7KJMN5TRLR3QCUOIBR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounds on the Information Rate of Quantum Secret Sharing Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Pradeep Sarvepalli","submitted_at":"2010-07-07T19:54:52Z","abstract_excerpt":"An important metric of the performance of a quantum secret sharing scheme is its information rate. Beyond the fact that the information rate is upper bounded by one, very little is known in terms of bounds on the information rate of quantum secret sharing schemes. Further, not every scheme can be realized with rate one. In this paper we derive new upper bounds for the information rates of quantum secret sharing schemes. We show that there exist quantum access structures on $n$ players for which the information rate cannot be better than $O((\\log_2 n)/n)$. These results are the quantum analogue"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.1232","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-18T04:23:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CzHGYZ3kW+EBrVDTjwcV7q1tGVexPpVQe6FVIjoz6NMX0ONhla0mMJYtrptG2j1BbjYwwRv5nZKwIW2IEEwaAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:43:36.242957Z"},"content_sha256":"4a5a13c58167132d82a0919d6a6513cd40ee2a709b992b73053da344ce0ce4f8","schema_version":"1.0","event_id":"sha256:4a5a13c58167132d82a0919d6a6513cd40ee2a709b992b73053da344ce0ce4f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TVY346NQ7KJMN5TRLR3QCUOIBR/bundle.json","state_url":"https://pith.science/pith/TVY346NQ7KJMN5TRLR3QCUOIBR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TVY346NQ7KJMN5TRLR3QCUOIBR/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-03T02:43:36Z","links":{"resolver":"https://pith.science/pith/TVY346NQ7KJMN5TRLR3QCUOIBR","bundle":"https://pith.science/pith/TVY346NQ7KJMN5TRLR3QCUOIBR/bundle.json","state":"https://pith.science/pith/TVY346NQ7KJMN5TRLR3QCUOIBR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TVY346NQ7KJMN5TRLR3QCUOIBR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:TVY346NQ7KJMN5TRLR3QCUOIBR","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":"78bf0f7844f0d6ed596f9b7ce6bcf3985b26140fcdd607695e4166973a33a80e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-07-07T19:54:52Z","title_canon_sha256":"ef7e8e28975625ddeda116c0c8d67aa6834feb224860ff5c1475ada0637f64ec"},"schema_version":"1.0","source":{"id":"1007.1232","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.1232","created_at":"2026-05-18T04:23:46Z"},{"alias_kind":"arxiv_version","alias_value":"1007.1232v1","created_at":"2026-05-18T04:23:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.1232","created_at":"2026-05-18T04:23:46Z"},{"alias_kind":"pith_short_12","alias_value":"TVY346NQ7KJM","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"TVY346NQ7KJMN5TR","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"TVY346NQ","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:4a5a13c58167132d82a0919d6a6513cd40ee2a709b992b73053da344ce0ce4f8","target":"graph","created_at":"2026-05-18T04:23:46Z","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":"An important metric of the performance of a quantum secret sharing scheme is its information rate. Beyond the fact that the information rate is upper bounded by one, very little is known in terms of bounds on the information rate of quantum secret sharing schemes. Further, not every scheme can be realized with rate one. In this paper we derive new upper bounds for the information rates of quantum secret sharing schemes. We show that there exist quantum access structures on $n$ players for which the information rate cannot be better than $O((\\log_2 n)/n)$. These results are the quantum analogue","authors_text":"Pradeep Sarvepalli","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-07-07T19:54:52Z","title":"Bounds on the Information Rate of Quantum Secret Sharing Schemes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.1232","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:0e6c5f92252bd2dc0760ce5539996a9bdfbdda2cde5ad0bd29e77bca8c66f547","target":"record","created_at":"2026-05-18T04:23:46Z","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":"78bf0f7844f0d6ed596f9b7ce6bcf3985b26140fcdd607695e4166973a33a80e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-07-07T19:54:52Z","title_canon_sha256":"ef7e8e28975625ddeda116c0c8d67aa6834feb224860ff5c1475ada0637f64ec"},"schema_version":"1.0","source":{"id":"1007.1232","kind":"arxiv","version":1}},"canonical_sha256":"9d71be79b0fa92c6f6715c770151c80c7e70e89013a7f9c48002d350d09a7ea4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d71be79b0fa92c6f6715c770151c80c7e70e89013a7f9c48002d350d09a7ea4","first_computed_at":"2026-05-18T04:23:46.333859Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:23:46.333859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sN1VowsPNBNHrIPMXoJ6d32GFAEZZ25SGpHKKgqhzdanmL50KypCJ98/wZMFQUY5paNXMgMIQEQmtVyHxUJpDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:23:46.334474Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.1232","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e6c5f92252bd2dc0760ce5539996a9bdfbdda2cde5ad0bd29e77bca8c66f547","sha256:4a5a13c58167132d82a0919d6a6513cd40ee2a709b992b73053da344ce0ce4f8"],"state_sha256":"4eb3bfcce0b0aa3a69b15a6730aa4953fc38e9c0d9e9efd80efedb82426c6de1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eJ+mnK7ZVuJnSiCB0I/e+PLyTHP7pg2NjZiihXKBpbhmgAVfIOGmIqZ7rreKZqnMZlTr5JxvuONVRffUlWA4DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:43:36.244942Z","bundle_sha256":"e627a9aaf3d67e78e3866b5656f56e409f25e30ff1be4baaa66f9e90eb06308e"}}