{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:67F2QYKY3OO5KPAEAORI5ZGL55","short_pith_number":"pith:67F2QYKY","schema_version":"1.0","canonical_sha256":"f7cba86158db9dd53c0403a28ee4cbef7d94497d0d5af439df453ac2288df6ac","source":{"kind":"arxiv","id":"1805.00756","version":3},"attestation_state":"computed","paper":{"title":"Resource Quantification for the No-Programming Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Aleksander M. Kubicki, Carlos Palazuelos, David P\\'erez-Garc\\'ia","submitted_at":"2018-05-02T12:05:45Z","abstract_excerpt":"The no-programming theorem prohibits the existence of a Universal Programmable Quantum Processor. This statement has several implications in relation to quantum computation, but also to other tasks of quantum information processing, making this construction a central notion in this context. Nonetheless, it is well known that even when the strict model is not implementable, it is possible to conceive of it in an approximate sense. Unfortunately, the minimal resources necessary for this aim are still not completely understood. Here, we investigate quantitative statements of the theorem, improvin"},"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":"1805.00756","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-05-02T12:05:45Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"f517902e864e952040136b8bed2f61a85a9d409f030470bcc8aed3ea3c8bebf2","abstract_canon_sha256":"bf0ab15e704f6dc5873ad0c30831e5121d5b8aa801d954a3ed276390303cc246"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:52.917897Z","signature_b64":"zmvmLdJkn+6yVQB0Lz7gR0GAqzRV1SHTxdMOmBpKJLb2MinmFIOyRa41PHeGFUSyXzaLuBhM1Qlylj3d6OcsDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7cba86158db9dd53c0403a28ee4cbef7d94497d0d5af439df453ac2288df6ac","last_reissued_at":"2026-05-17T23:49:52.917549Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:52.917549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Resource Quantification for the No-Programming Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Aleksander M. Kubicki, Carlos Palazuelos, David P\\'erez-Garc\\'ia","submitted_at":"2018-05-02T12:05:45Z","abstract_excerpt":"The no-programming theorem prohibits the existence of a Universal Programmable Quantum Processor. This statement has several implications in relation to quantum computation, but also to other tasks of quantum information processing, making this construction a central notion in this context. Nonetheless, it is well known that even when the strict model is not implementable, it is possible to conceive of it in an approximate sense. Unfortunately, the minimal resources necessary for this aim are still not completely understood. Here, we investigate quantitative statements of the theorem, improvin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.00756","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":"1805.00756","created_at":"2026-05-17T23:49:52.917605+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.00756v3","created_at":"2026-05-17T23:49:52.917605+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.00756","created_at":"2026-05-17T23:49:52.917605+00:00"},{"alias_kind":"pith_short_12","alias_value":"67F2QYKY3OO5","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"67F2QYKY3OO5KPAE","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"67F2QYKY","created_at":"2026-05-18T12:32:08.215937+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2504.12945","citing_title":"A resource theory of asynchronous quantum information processing","ref_index":29,"is_internal_anchor":true},{"citing_arxiv_id":"2507.10784","citing_title":"Quantum Advantage in Storage and Retrieval of Isometry Channels","ref_index":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/67F2QYKY3OO5KPAEAORI5ZGL55","json":"https://pith.science/pith/67F2QYKY3OO5KPAEAORI5ZGL55.json","graph_json":"https://pith.science/api/pith-number/67F2QYKY3OO5KPAEAORI5ZGL55/graph.json","events_json":"https://pith.science/api/pith-number/67F2QYKY3OO5KPAEAORI5ZGL55/events.json","paper":"https://pith.science/paper/67F2QYKY"},"agent_actions":{"view_html":"https://pith.science/pith/67F2QYKY3OO5KPAEAORI5ZGL55","download_json":"https://pith.science/pith/67F2QYKY3OO5KPAEAORI5ZGL55.json","view_paper":"https://pith.science/paper/67F2QYKY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.00756&json=true","fetch_graph":"https://pith.science/api/pith-number/67F2QYKY3OO5KPAEAORI5ZGL55/graph.json","fetch_events":"https://pith.science/api/pith-number/67F2QYKY3OO5KPAEAORI5ZGL55/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/67F2QYKY3OO5KPAEAORI5ZGL55/action/timestamp_anchor","attest_storage":"https://pith.science/pith/67F2QYKY3OO5KPAEAORI5ZGL55/action/storage_attestation","attest_author":"https://pith.science/pith/67F2QYKY3OO5KPAEAORI5ZGL55/action/author_attestation","sign_citation":"https://pith.science/pith/67F2QYKY3OO5KPAEAORI5ZGL55/action/citation_signature","submit_replication":"https://pith.science/pith/67F2QYKY3OO5KPAEAORI5ZGL55/action/replication_record"}},"created_at":"2026-05-17T23:49:52.917605+00:00","updated_at":"2026-05-17T23:49:52.917605+00:00"}