{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:G7DCQRQWGPZ3UD5SWMVHUT2NSZ","short_pith_number":"pith:G7DCQRQW","schema_version":"1.0","canonical_sha256":"37c628461633f3ba0fb2b32a7a4f4d9650b89d32107f2b21f8d419e188dacdb2","source":{"kind":"arxiv","id":"1109.4731","version":1},"attestation_state":"computed","paper":{"title":"Classical versus Quantum Graph-based Secret Sharing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"J\\'er\\^ome Javelle, Mehdi Mhalla, Simon Perdrix","submitted_at":"2011-09-22T08:42:37Z","abstract_excerpt":"We study a simple graph-based classical secret sharing scheme: every player's share consists of a random key together with the encryption of the secret with the keys of his neighbours. A characterisation of the authorised and forbidden sets of players is given. Moreover, we show that this protocol is equivalent to the graph state quantum secret sharing (GS-QSS) schemes when the secret is classical. When the secret is an arbitrary quantum state, a set of players is authorised for a GS-QSS scheme if and only if, for the corresponding simple classical graph-based protocol, the set is authorised a"},"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":"1109.4731","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-09-22T08:42:37Z","cross_cats_sorted":[],"title_canon_sha256":"5ba3c3cbdfbc1af5422ab114c597bcd83e58649004dba5a687633d160f0204fe","abstract_canon_sha256":"61ae970b453f8ca80a51feed558975725fbc9d5d1b0f3a9cfce9d5ff4c204231"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:33.041159Z","signature_b64":"EH3SR2+srPK4gcwpTUlSXv36puxY7KraDYSagbAHNRbPLh5GyEaXumCxDQWw64JORpEd0dDyZ6WTpcUHCdU0CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37c628461633f3ba0fb2b32a7a4f4d9650b89d32107f2b21f8d419e188dacdb2","last_reissued_at":"2026-05-18T04:12:33.040533Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:33.040533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Classical versus Quantum Graph-based Secret Sharing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"J\\'er\\^ome Javelle, Mehdi Mhalla, Simon Perdrix","submitted_at":"2011-09-22T08:42:37Z","abstract_excerpt":"We study a simple graph-based classical secret sharing scheme: every player's share consists of a random key together with the encryption of the secret with the keys of his neighbours. A characterisation of the authorised and forbidden sets of players is given. Moreover, we show that this protocol is equivalent to the graph state quantum secret sharing (GS-QSS) schemes when the secret is classical. When the secret is an arbitrary quantum state, a set of players is authorised for a GS-QSS scheme if and only if, for the corresponding simple classical graph-based protocol, the set is authorised a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.4731","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1109.4731","created_at":"2026-05-18T04:12:33.040621+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.4731v1","created_at":"2026-05-18T04:12:33.040621+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4731","created_at":"2026-05-18T04:12:33.040621+00:00"},{"alias_kind":"pith_short_12","alias_value":"G7DCQRQWGPZ3","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"G7DCQRQWGPZ3UD5S","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"G7DCQRQW","created_at":"2026-05-18T12:26:28.662955+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/G7DCQRQWGPZ3UD5SWMVHUT2NSZ","json":"https://pith.science/pith/G7DCQRQWGPZ3UD5SWMVHUT2NSZ.json","graph_json":"https://pith.science/api/pith-number/G7DCQRQWGPZ3UD5SWMVHUT2NSZ/graph.json","events_json":"https://pith.science/api/pith-number/G7DCQRQWGPZ3UD5SWMVHUT2NSZ/events.json","paper":"https://pith.science/paper/G7DCQRQW"},"agent_actions":{"view_html":"https://pith.science/pith/G7DCQRQWGPZ3UD5SWMVHUT2NSZ","download_json":"https://pith.science/pith/G7DCQRQWGPZ3UD5SWMVHUT2NSZ.json","view_paper":"https://pith.science/paper/G7DCQRQW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.4731&json=true","fetch_graph":"https://pith.science/api/pith-number/G7DCQRQWGPZ3UD5SWMVHUT2NSZ/graph.json","fetch_events":"https://pith.science/api/pith-number/G7DCQRQWGPZ3UD5SWMVHUT2NSZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G7DCQRQWGPZ3UD5SWMVHUT2NSZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G7DCQRQWGPZ3UD5SWMVHUT2NSZ/action/storage_attestation","attest_author":"https://pith.science/pith/G7DCQRQWGPZ3UD5SWMVHUT2NSZ/action/author_attestation","sign_citation":"https://pith.science/pith/G7DCQRQWGPZ3UD5SWMVHUT2NSZ/action/citation_signature","submit_replication":"https://pith.science/pith/G7DCQRQWGPZ3UD5SWMVHUT2NSZ/action/replication_record"}},"created_at":"2026-05-18T04:12:33.040621+00:00","updated_at":"2026-05-18T04:12:33.040621+00:00"}