{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:QWPTSSZJRHVHGIHJWRYXN3SN24","short_pith_number":"pith:QWPTSSZJ","schema_version":"1.0","canonical_sha256":"859f394b2989ea7320e9b47176ee4dd71eaf809f4171eab96dfb5f2f5165cece","source":{"kind":"arxiv","id":"1004.4619","version":3},"attestation_state":"computed","paper":{"title":"Quantum secret sharing with qudit graph states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adrian Keet, Barry C. Sanders, Ben Fortescue, Damian Markham","submitted_at":"2010-04-26T19:46:37Z","abstract_excerpt":"We present a unified formalism for threshold quantum secret sharing using graph states of systems with prime dimension. We construct protocols for three varieties of secret sharing: with classical and quantum secrets shared between parties over both classical and quantum channels."},"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":"1004.4619","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-04-26T19:46:37Z","cross_cats_sorted":[],"title_canon_sha256":"a41e2cb84b69f2f01d316c062a7ca147851d5592cb1f592979d529b24460a7af","abstract_canon_sha256":"280233a0afb6afe94b6677ff503e9a248a1aa5e50c08f0f3e09e2fa1d6ada637"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:54.547816Z","signature_b64":"UgW7KuQXkx8cKe1sXtdlSr2RN8krnzc/O6EuhzF9Ni67PTlggTkJPhkI0wLxtI4Gt3UxwoyBoV+alHCg3lj0Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"859f394b2989ea7320e9b47176ee4dd71eaf809f4171eab96dfb5f2f5165cece","last_reissued_at":"2026-05-18T04:32:54.547395Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:54.547395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum secret sharing with qudit graph states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adrian Keet, Barry C. Sanders, Ben Fortescue, Damian Markham","submitted_at":"2010-04-26T19:46:37Z","abstract_excerpt":"We present a unified formalism for threshold quantum secret sharing using graph states of systems with prime dimension. We construct protocols for three varieties of secret sharing: with classical and quantum secrets shared between parties over both classical and quantum channels."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.4619","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":"1004.4619","created_at":"2026-05-18T04:32:54.547455+00:00"},{"alias_kind":"arxiv_version","alias_value":"1004.4619v3","created_at":"2026-05-18T04:32:54.547455+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.4619","created_at":"2026-05-18T04:32:54.547455+00:00"},{"alias_kind":"pith_short_12","alias_value":"QWPTSSZJRHVH","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"QWPTSSZJRHVHGIHJ","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"QWPTSSZJ","created_at":"2026-05-18T12:26:13.927090+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/QWPTSSZJRHVHGIHJWRYXN3SN24","json":"https://pith.science/pith/QWPTSSZJRHVHGIHJWRYXN3SN24.json","graph_json":"https://pith.science/api/pith-number/QWPTSSZJRHVHGIHJWRYXN3SN24/graph.json","events_json":"https://pith.science/api/pith-number/QWPTSSZJRHVHGIHJWRYXN3SN24/events.json","paper":"https://pith.science/paper/QWPTSSZJ"},"agent_actions":{"view_html":"https://pith.science/pith/QWPTSSZJRHVHGIHJWRYXN3SN24","download_json":"https://pith.science/pith/QWPTSSZJRHVHGIHJWRYXN3SN24.json","view_paper":"https://pith.science/paper/QWPTSSZJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1004.4619&json=true","fetch_graph":"https://pith.science/api/pith-number/QWPTSSZJRHVHGIHJWRYXN3SN24/graph.json","fetch_events":"https://pith.science/api/pith-number/QWPTSSZJRHVHGIHJWRYXN3SN24/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QWPTSSZJRHVHGIHJWRYXN3SN24/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QWPTSSZJRHVHGIHJWRYXN3SN24/action/storage_attestation","attest_author":"https://pith.science/pith/QWPTSSZJRHVHGIHJWRYXN3SN24/action/author_attestation","sign_citation":"https://pith.science/pith/QWPTSSZJRHVHGIHJWRYXN3SN24/action/citation_signature","submit_replication":"https://pith.science/pith/QWPTSSZJRHVHGIHJWRYXN3SN24/action/replication_record"}},"created_at":"2026-05-18T04:32:54.547455+00:00","updated_at":"2026-05-18T04:32:54.547455+00:00"}