{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:XE5URABMUKNO6N7475FRF7N746","short_pith_number":"pith:XE5URABM","schema_version":"1.0","canonical_sha256":"b93b48802ca29aef37fcff4b12fdbfe78ede758b227f0c862c840925aa20d7f6","source":{"kind":"arxiv","id":"2004.09674","version":7},"attestation_state":"computed","paper":{"title":"New Approaches for Quantum Copy-Protection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CR","authors_text":"Jiahui Liu, Mark Zhandry, Qipeng Liu, Ruizhe Zhang, Scott Aaronson","submitted_at":"2020-04-20T23:30:17Z","abstract_excerpt":"Quantum copy protection uses the unclonability of quantum states to construct quantum software that provably cannot be pirated. Copy protection would be immensely useful, but unfortunately little is known about how to achieve it in general. In this work, we make progress on this goal, by giving the following results:\n  - We show how to copy protect any program that cannot be learned from its input/output behavior, relative to a classical oracle. This improves on Aaronson [CCC'09], which achieves the same relative to a quantum oracle. By instantiating the oracle with post-quantum candidate obfu"},"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.09674","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2020-04-20T23:30:17Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"d3dc955268b0a8ca17180938ea7392346f0743e14473012f0f9f49e415bc1a79","abstract_canon_sha256":"6d46d9cc4b3167f37565a5c2509ed89de5d2533544b3af975b510e2dc2ce7773"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:43:25.225543Z","signature_b64":"vlHaUxfzdejY2f/RJuO5+mR0bAhfAdgAqjeQ0Y6OI6mvzyqlXfm+wo/g+muVI7qjee61YnsKEY10wGptA/iIAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b93b48802ca29aef37fcff4b12fdbfe78ede758b227f0c862c840925aa20d7f6","last_reissued_at":"2026-07-05T01:43:25.225055Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:43:25.225055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Approaches for Quantum Copy-Protection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CR","authors_text":"Jiahui Liu, Mark Zhandry, Qipeng Liu, Ruizhe Zhang, Scott Aaronson","submitted_at":"2020-04-20T23:30:17Z","abstract_excerpt":"Quantum copy protection uses the unclonability of quantum states to construct quantum software that provably cannot be pirated. Copy protection would be immensely useful, but unfortunately little is known about how to achieve it in general. In this work, we make progress on this goal, by giving the following results:\n  - We show how to copy protect any program that cannot be learned from its input/output behavior, relative to a classical oracle. This improves on Aaronson [CCC'09], which achieves the same relative to a quantum oracle. By instantiating the oracle with post-quantum candidate obfu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.09674","kind":"arxiv","version":7},"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.09674/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.09674","created_at":"2026-07-05T01:43:25.225113+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.09674v7","created_at":"2026-07-05T01:43:25.225113+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.09674","created_at":"2026-07-05T01:43:25.225113+00:00"},{"alias_kind":"pith_short_12","alias_value":"XE5URABMUKNO","created_at":"2026-07-05T01:43:25.225113+00:00"},{"alias_kind":"pith_short_16","alias_value":"XE5URABMUKNO6N74","created_at":"2026-07-05T01:43:25.225113+00:00"},{"alias_kind":"pith_short_8","alias_value":"XE5URABM","created_at":"2026-07-05T01:43:25.225113+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/XE5URABMUKNO6N7475FRF7N746","json":"https://pith.science/pith/XE5URABMUKNO6N7475FRF7N746.json","graph_json":"https://pith.science/api/pith-number/XE5URABMUKNO6N7475FRF7N746/graph.json","events_json":"https://pith.science/api/pith-number/XE5URABMUKNO6N7475FRF7N746/events.json","paper":"https://pith.science/paper/XE5URABM"},"agent_actions":{"view_html":"https://pith.science/pith/XE5URABMUKNO6N7475FRF7N746","download_json":"https://pith.science/pith/XE5URABMUKNO6N7475FRF7N746.json","view_paper":"https://pith.science/paper/XE5URABM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.09674&json=true","fetch_graph":"https://pith.science/api/pith-number/XE5URABMUKNO6N7475FRF7N746/graph.json","fetch_events":"https://pith.science/api/pith-number/XE5URABMUKNO6N7475FRF7N746/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XE5URABMUKNO6N7475FRF7N746/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XE5URABMUKNO6N7475FRF7N746/action/storage_attestation","attest_author":"https://pith.science/pith/XE5URABMUKNO6N7475FRF7N746/action/author_attestation","sign_citation":"https://pith.science/pith/XE5URABMUKNO6N7475FRF7N746/action/citation_signature","submit_replication":"https://pith.science/pith/XE5URABMUKNO6N7475FRF7N746/action/replication_record"}},"created_at":"2026-07-05T01:43:25.225113+00:00","updated_at":"2026-07-05T01:43:25.225113+00:00"}