{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ULNSD26IYBMPAM74S2KKMZC35M","short_pith_number":"pith:ULNSD26I","schema_version":"1.0","canonical_sha256":"a2db21ebc8c058f033fc9694a6645beb098fb180a3d12400598870ba46522e10","source":{"kind":"arxiv","id":"1904.06303","version":1},"attestation_state":"computed","paper":{"title":"QFactory: classically-instructed remote secret qubits preparation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Alexandru Cojocaru, Elham Kashefi, L\\'eo Colisson, Petros Wallden","submitted_at":"2019-04-12T16:13:12Z","abstract_excerpt":"The functionality of classically-instructed remotely prepared random secret qubits was introduced in (Cojocaru et al 2018) as a way to enable classical parties to participate in secure quantum computation and communications protocols. The idea is that a classical party (client) instructs a quantum party (server) to generate a qubit to the server's side that is random, unknown to the server but known to the client. Such task is only possible under computational assumptions. In this contribution we define a simpler (basic) primitive consisting of only BB84 states, and give a protocol that realiz"},"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":"1904.06303","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-04-12T16:13:12Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"de063215e1895a5aaeb61d43f66a3dd7dd7047873666c5d8c7c52ce3bd3a605b","abstract_canon_sha256":"60eb7281f20e89ba347e800a0f0ece7e77f37ab5ae4ad7ab25a4940ff5b3e331"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:27:31.035013Z","signature_b64":"IgdvhcwmuUcEl/t4ltgM62Jh1und37JmW6doH6TquLxLlqfd8+/3dt3NFGaW5KgI+jf94eaBLoXV+BcI30wWBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2db21ebc8c058f033fc9694a6645beb098fb180a3d12400598870ba46522e10","last_reissued_at":"2026-07-05T00:27:31.034458Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:27:31.034458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"QFactory: classically-instructed remote secret qubits preparation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Alexandru Cojocaru, Elham Kashefi, L\\'eo Colisson, Petros Wallden","submitted_at":"2019-04-12T16:13:12Z","abstract_excerpt":"The functionality of classically-instructed remotely prepared random secret qubits was introduced in (Cojocaru et al 2018) as a way to enable classical parties to participate in secure quantum computation and communications protocols. The idea is that a classical party (client) instructs a quantum party (server) to generate a qubit to the server's side that is random, unknown to the server but known to the client. Such task is only possible under computational assumptions. In this contribution we define a simpler (basic) primitive consisting of only BB84 states, and give a protocol that realiz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.06303","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1904.06303/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1904.06303","created_at":"2026-07-05T00:27:31.034515+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.06303v1","created_at":"2026-07-05T00:27:31.034515+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.06303","created_at":"2026-07-05T00:27:31.034515+00:00"},{"alias_kind":"pith_short_12","alias_value":"ULNSD26IYBMP","created_at":"2026-07-05T00:27:31.034515+00:00"},{"alias_kind":"pith_short_16","alias_value":"ULNSD26IYBMPAM74","created_at":"2026-07-05T00:27:31.034515+00:00"},{"alias_kind":"pith_short_8","alias_value":"ULNSD26I","created_at":"2026-07-05T00:27:31.034515+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.21621","citing_title":"Designing Fault-Tolerant Blind Quantum Computation","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ULNSD26IYBMPAM74S2KKMZC35M","json":"https://pith.science/pith/ULNSD26IYBMPAM74S2KKMZC35M.json","graph_json":"https://pith.science/api/pith-number/ULNSD26IYBMPAM74S2KKMZC35M/graph.json","events_json":"https://pith.science/api/pith-number/ULNSD26IYBMPAM74S2KKMZC35M/events.json","paper":"https://pith.science/paper/ULNSD26I"},"agent_actions":{"view_html":"https://pith.science/pith/ULNSD26IYBMPAM74S2KKMZC35M","download_json":"https://pith.science/pith/ULNSD26IYBMPAM74S2KKMZC35M.json","view_paper":"https://pith.science/paper/ULNSD26I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.06303&json=true","fetch_graph":"https://pith.science/api/pith-number/ULNSD26IYBMPAM74S2KKMZC35M/graph.json","fetch_events":"https://pith.science/api/pith-number/ULNSD26IYBMPAM74S2KKMZC35M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ULNSD26IYBMPAM74S2KKMZC35M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ULNSD26IYBMPAM74S2KKMZC35M/action/storage_attestation","attest_author":"https://pith.science/pith/ULNSD26IYBMPAM74S2KKMZC35M/action/author_attestation","sign_citation":"https://pith.science/pith/ULNSD26IYBMPAM74S2KKMZC35M/action/citation_signature","submit_replication":"https://pith.science/pith/ULNSD26IYBMPAM74S2KKMZC35M/action/replication_record"}},"created_at":"2026-07-05T00:27:31.034515+00:00","updated_at":"2026-07-05T00:27:31.034515+00:00"}