{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:MODZQOK7ACEIDQL57H7A7TYHUD","short_pith_number":"pith:MODZQOK7","schema_version":"1.0","canonical_sha256":"638798395f008881c17df9fe0fcf07a0d778d83df4fdf6421058d587e57ab46e","source":{"kind":"arxiv","id":"2004.01976","version":1},"attestation_state":"computed","paper":{"title":"Scalable Pseudorandom Quantum States","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Omri Shmueli, Zvika Brakerski","submitted_at":"2020-04-04T17:15:03Z","abstract_excerpt":"Efficiently sampling a quantum state that is hard to distinguish from a truly random quantum state is an elementary task in quantum information theory that has both computational and physical uses. This is often referred to as pseudorandom (quantum) state generator, or PRS generator for short.\n  In existing constructions of PRS generators, security scales with the number of qubits in the states, i.e.\\ the (statistical) security parameter for an $n$-qubit PRS is roughly $n$. Perhaps counter-intuitively, $n$-qubit PRS are not known to imply $k$-qubit PRS even for $k<n$. Therefore the question of"},"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":"2004.01976","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-04-04T17:15:03Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"66ef6fb3dd3b379ccb8a0d3c9bd3f5656f67e74cc7b568767d22dea5dc62b248","abstract_canon_sha256":"23d54d89086c190e227fdd6e18df0f82ecc6018a060a9240ef72069bb17b6a15"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:52:54.882121Z","signature_b64":"Tu6BHCyE1fYzl4RUyjYNUhxgbi464fB963mg3AbVZQSq8IewKqqNCMWSCU0jos8y/yaOpHYnxeqB0cHCtEhuDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"638798395f008881c17df9fe0fcf07a0d778d83df4fdf6421058d587e57ab46e","last_reissued_at":"2026-07-05T00:52:54.881719Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:52:54.881719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Pseudorandom Quantum States","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Omri Shmueli, Zvika Brakerski","submitted_at":"2020-04-04T17:15:03Z","abstract_excerpt":"Efficiently sampling a quantum state that is hard to distinguish from a truly random quantum state is an elementary task in quantum information theory that has both computational and physical uses. This is often referred to as pseudorandom (quantum) state generator, or PRS generator for short.\n  In existing constructions of PRS generators, security scales with the number of qubits in the states, i.e.\\ the (statistical) security parameter for an $n$-qubit PRS is roughly $n$. Perhaps counter-intuitively, $n$-qubit PRS are not known to imply $k$-qubit PRS even for $k<n$. Therefore the question of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.01976","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/2004.01976/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":"2004.01976","created_at":"2026-07-05T00:52:54.881779+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.01976v1","created_at":"2026-07-05T00:52:54.881779+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.01976","created_at":"2026-07-05T00:52:54.881779+00:00"},{"alias_kind":"pith_short_12","alias_value":"MODZQOK7ACEI","created_at":"2026-07-05T00:52:54.881779+00:00"},{"alias_kind":"pith_short_16","alias_value":"MODZQOK7ACEIDQL5","created_at":"2026-07-05T00:52:54.881779+00:00"},{"alias_kind":"pith_short_8","alias_value":"MODZQOK7","created_at":"2026-07-05T00:52:54.881779+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.15540","citing_title":"Accessible Quantum Correlations Under Complexity Constraints","ref_index":44,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MODZQOK7ACEIDQL57H7A7TYHUD","json":"https://pith.science/pith/MODZQOK7ACEIDQL57H7A7TYHUD.json","graph_json":"https://pith.science/api/pith-number/MODZQOK7ACEIDQL57H7A7TYHUD/graph.json","events_json":"https://pith.science/api/pith-number/MODZQOK7ACEIDQL57H7A7TYHUD/events.json","paper":"https://pith.science/paper/MODZQOK7"},"agent_actions":{"view_html":"https://pith.science/pith/MODZQOK7ACEIDQL57H7A7TYHUD","download_json":"https://pith.science/pith/MODZQOK7ACEIDQL57H7A7TYHUD.json","view_paper":"https://pith.science/paper/MODZQOK7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.01976&json=true","fetch_graph":"https://pith.science/api/pith-number/MODZQOK7ACEIDQL57H7A7TYHUD/graph.json","fetch_events":"https://pith.science/api/pith-number/MODZQOK7ACEIDQL57H7A7TYHUD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MODZQOK7ACEIDQL57H7A7TYHUD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MODZQOK7ACEIDQL57H7A7TYHUD/action/storage_attestation","attest_author":"https://pith.science/pith/MODZQOK7ACEIDQL57H7A7TYHUD/action/author_attestation","sign_citation":"https://pith.science/pith/MODZQOK7ACEIDQL57H7A7TYHUD/action/citation_signature","submit_replication":"https://pith.science/pith/MODZQOK7ACEIDQL57H7A7TYHUD/action/replication_record"}},"created_at":"2026-07-05T00:52:54.881779+00:00","updated_at":"2026-07-05T00:52:54.881779+00:00"}