{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:K3F4L5UWS5KEMOFUAW53CS3KIV","short_pith_number":"pith:K3F4L5UW","schema_version":"1.0","canonical_sha256":"56cbc5f69697544638b405bbb14b6a4573569d8c6b37ef0bab58f0d8c39837ea","source":{"kind":"arxiv","id":"0810.0259","version":1},"attestation_state":"computed","paper":{"title":"The GHZ state in secret sharing and entanglement simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alain Tapp, Anne Broadbent, Paul Robert Chouha","submitted_at":"2008-10-01T19:44:07Z","abstract_excerpt":"In this note, we study some properties of the GHZ state. First, we present a quantum secret sharing scheme in which the participants require only classical channels in order to reconstruct the secret; our protocol is significantly more efficient than the trivial usage of teleportation. Second, we show that the classical simulation of an n-party GHZ state requires at least n log n - 2n bits of communication. Finally, we present a problem simpler than the complete simulation of the multi-party GHZ state, that could lead to a no-go theorem for GHZ state simulation."},"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":"0810.0259","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-10-01T19:44:07Z","cross_cats_sorted":[],"title_canon_sha256":"a61ea6b3a822dfbda4017ae3c60064df76e2b419f321982a307780ac962dde28","abstract_canon_sha256":"547cc51a42242a6e5e3577ba2db19f06348f32f929079c0f9bfef38659dec082"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:51.430586Z","signature_b64":"l5W30PSb0jjOcTvLE1haDxgqwrl3ZWcyilHmP6j1keIVBP7fKXqAD3YnlVbsqeMRmiAWn9M54D5Du/b3rk8xAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56cbc5f69697544638b405bbb14b6a4573569d8c6b37ef0bab58f0d8c39837ea","last_reissued_at":"2026-05-18T04:01:51.430061Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:51.430061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The GHZ state in secret sharing and entanglement simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alain Tapp, Anne Broadbent, Paul Robert Chouha","submitted_at":"2008-10-01T19:44:07Z","abstract_excerpt":"In this note, we study some properties of the GHZ state. First, we present a quantum secret sharing scheme in which the participants require only classical channels in order to reconstruct the secret; our protocol is significantly more efficient than the trivial usage of teleportation. Second, we show that the classical simulation of an n-party GHZ state requires at least n log n - 2n bits of communication. Finally, we present a problem simpler than the complete simulation of the multi-party GHZ state, that could lead to a no-go theorem for GHZ state simulation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0810.0259","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":"0810.0259","created_at":"2026-05-18T04:01:51.430129+00:00"},{"alias_kind":"arxiv_version","alias_value":"0810.0259v1","created_at":"2026-05-18T04:01:51.430129+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0810.0259","created_at":"2026-05-18T04:01:51.430129+00:00"},{"alias_kind":"pith_short_12","alias_value":"K3F4L5UWS5KE","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"K3F4L5UWS5KEMOFU","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"K3F4L5UW","created_at":"2026-05-18T12:25:57.157939+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/K3F4L5UWS5KEMOFUAW53CS3KIV","json":"https://pith.science/pith/K3F4L5UWS5KEMOFUAW53CS3KIV.json","graph_json":"https://pith.science/api/pith-number/K3F4L5UWS5KEMOFUAW53CS3KIV/graph.json","events_json":"https://pith.science/api/pith-number/K3F4L5UWS5KEMOFUAW53CS3KIV/events.json","paper":"https://pith.science/paper/K3F4L5UW"},"agent_actions":{"view_html":"https://pith.science/pith/K3F4L5UWS5KEMOFUAW53CS3KIV","download_json":"https://pith.science/pith/K3F4L5UWS5KEMOFUAW53CS3KIV.json","view_paper":"https://pith.science/paper/K3F4L5UW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0810.0259&json=true","fetch_graph":"https://pith.science/api/pith-number/K3F4L5UWS5KEMOFUAW53CS3KIV/graph.json","fetch_events":"https://pith.science/api/pith-number/K3F4L5UWS5KEMOFUAW53CS3KIV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K3F4L5UWS5KEMOFUAW53CS3KIV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K3F4L5UWS5KEMOFUAW53CS3KIV/action/storage_attestation","attest_author":"https://pith.science/pith/K3F4L5UWS5KEMOFUAW53CS3KIV/action/author_attestation","sign_citation":"https://pith.science/pith/K3F4L5UWS5KEMOFUAW53CS3KIV/action/citation_signature","submit_replication":"https://pith.science/pith/K3F4L5UWS5KEMOFUAW53CS3KIV/action/replication_record"}},"created_at":"2026-05-18T04:01:51.430129+00:00","updated_at":"2026-05-18T04:01:51.430129+00:00"}