{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:LPSCTRPNJKVI2WPGFRYTTM6VAL","short_pith_number":"pith:LPSCTRPN","canonical_record":{"source":{"id":"1106.2742","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-06-14T15:32:19Z","cross_cats_sorted":[],"title_canon_sha256":"bb3c6b6a2db06f0d438acda236e1c695fb6e1295308285aa0f57c1b79fde7142","abstract_canon_sha256":"26dd93c2d343acf5ba5af5bd6da57e13568f2ba53ae57ab6e5130e72449c0ed3"},"schema_version":"1.0"},"canonical_sha256":"5be429c5ed4aaa8d59e62c7139b3d502e33e92229a49840f65074e741d7cb496","source":{"kind":"arxiv","id":"1106.2742","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.2742","created_at":"2026-05-18T03:45:43Z"},{"alias_kind":"arxiv_version","alias_value":"1106.2742v2","created_at":"2026-05-18T03:45:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2742","created_at":"2026-05-18T03:45:43Z"},{"alias_kind":"pith_short_12","alias_value":"LPSCTRPNJKVI","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LPSCTRPNJKVI2WPG","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LPSCTRPN","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:LPSCTRPNJKVI2WPGFRYTTM6VAL","target":"record","payload":{"canonical_record":{"source":{"id":"1106.2742","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-06-14T15:32:19Z","cross_cats_sorted":[],"title_canon_sha256":"bb3c6b6a2db06f0d438acda236e1c695fb6e1295308285aa0f57c1b79fde7142","abstract_canon_sha256":"26dd93c2d343acf5ba5af5bd6da57e13568f2ba53ae57ab6e5130e72449c0ed3"},"schema_version":"1.0"},"canonical_sha256":"5be429c5ed4aaa8d59e62c7139b3d502e33e92229a49840f65074e741d7cb496","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:43.786054Z","signature_b64":"WhICHfzglEjFd8n49WjEQus7hQCfoNbOWUTTlRaylDKb9qf4CHE4Mgo4opv/MhiNqF9dkJt4by09XQWGk5BVBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5be429c5ed4aaa8d59e62c7139b3d502e33e92229a49840f65074e741d7cb496","last_reissued_at":"2026-05-18T03:45:43.785385Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:43.785385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.2742","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:45:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HRNkomRzlssS9JZToK6/3S0AkzzmZ37TVgWhfpLH0fMvNG/1/z6vTTkjO3NHHhdQZB/8OwlH0X9bhFjtHaRcCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T16:26:52.116006Z"},"content_sha256":"e40ce52513f7b26ed8a318d2ee03d018e486ad1ed189331bb0417e9343a961d5","schema_version":"1.0","event_id":"sha256:e40ce52513f7b26ed8a318d2ee03d018e486ad1ed189331bb0417e9343a961d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:LPSCTRPNJKVI2WPGFRYTTM6VAL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum learning without quantum memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"E. Bagan, G. Sent\\'is, J. Calsamiglia, R. Munoz-Tapia","submitted_at":"2011-06-14T15:32:19Z","abstract_excerpt":"A quantum learning machine for binary classification of qubit states that does not require quantum memory is introduced and shown to perform with the very same error rate as the optimal (programmable) discrimination machine for any size of the training set. At variance with the latter, this machine can be used an arbitrary number of times without retraining. Its required (classical) memory grows only logarithmically with the number of training qubits, while (asymptotically) its excess risk decreases as the inverse of this number, and twice as fast as the excess risk of an \"estimate-and-discrim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2742","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:45:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PvrQWcYi/uq6HPpEDPAeYV0OmAAl113Iz6vltgXi6o5T7fIHf/5x45qA+Bm4RDyBkLgzXgoFdnxEMwB8PXKACA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T16:26:52.116367Z"},"content_sha256":"c733b875907eb75c1bd7395ac5f6555a049556554a416291a4bff40873c17bad","schema_version":"1.0","event_id":"sha256:c733b875907eb75c1bd7395ac5f6555a049556554a416291a4bff40873c17bad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LPSCTRPNJKVI2WPGFRYTTM6VAL/bundle.json","state_url":"https://pith.science/pith/LPSCTRPNJKVI2WPGFRYTTM6VAL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LPSCTRPNJKVI2WPGFRYTTM6VAL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-19T16:26:52Z","links":{"resolver":"https://pith.science/pith/LPSCTRPNJKVI2WPGFRYTTM6VAL","bundle":"https://pith.science/pith/LPSCTRPNJKVI2WPGFRYTTM6VAL/bundle.json","state":"https://pith.science/pith/LPSCTRPNJKVI2WPGFRYTTM6VAL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LPSCTRPNJKVI2WPGFRYTTM6VAL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:LPSCTRPNJKVI2WPGFRYTTM6VAL","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"26dd93c2d343acf5ba5af5bd6da57e13568f2ba53ae57ab6e5130e72449c0ed3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-06-14T15:32:19Z","title_canon_sha256":"bb3c6b6a2db06f0d438acda236e1c695fb6e1295308285aa0f57c1b79fde7142"},"schema_version":"1.0","source":{"id":"1106.2742","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.2742","created_at":"2026-05-18T03:45:43Z"},{"alias_kind":"arxiv_version","alias_value":"1106.2742v2","created_at":"2026-05-18T03:45:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2742","created_at":"2026-05-18T03:45:43Z"},{"alias_kind":"pith_short_12","alias_value":"LPSCTRPNJKVI","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LPSCTRPNJKVI2WPG","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LPSCTRPN","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:c733b875907eb75c1bd7395ac5f6555a049556554a416291a4bff40873c17bad","target":"graph","created_at":"2026-05-18T03:45:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"A quantum learning machine for binary classification of qubit states that does not require quantum memory is introduced and shown to perform with the very same error rate as the optimal (programmable) discrimination machine for any size of the training set. At variance with the latter, this machine can be used an arbitrary number of times without retraining. Its required (classical) memory grows only logarithmically with the number of training qubits, while (asymptotically) its excess risk decreases as the inverse of this number, and twice as fast as the excess risk of an \"estimate-and-discrim","authors_text":"E. Bagan, G. Sent\\'is, J. Calsamiglia, R. Munoz-Tapia","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-06-14T15:32:19Z","title":"Quantum learning without quantum memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2742","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e40ce52513f7b26ed8a318d2ee03d018e486ad1ed189331bb0417e9343a961d5","target":"record","created_at":"2026-05-18T03:45:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"26dd93c2d343acf5ba5af5bd6da57e13568f2ba53ae57ab6e5130e72449c0ed3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-06-14T15:32:19Z","title_canon_sha256":"bb3c6b6a2db06f0d438acda236e1c695fb6e1295308285aa0f57c1b79fde7142"},"schema_version":"1.0","source":{"id":"1106.2742","kind":"arxiv","version":2}},"canonical_sha256":"5be429c5ed4aaa8d59e62c7139b3d502e33e92229a49840f65074e741d7cb496","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5be429c5ed4aaa8d59e62c7139b3d502e33e92229a49840f65074e741d7cb496","first_computed_at":"2026-05-18T03:45:43.785385Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:45:43.785385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WhICHfzglEjFd8n49WjEQus7hQCfoNbOWUTTlRaylDKb9qf4CHE4Mgo4opv/MhiNqF9dkJt4by09XQWGk5BVBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:45:43.786054Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.2742","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e40ce52513f7b26ed8a318d2ee03d018e486ad1ed189331bb0417e9343a961d5","sha256:c733b875907eb75c1bd7395ac5f6555a049556554a416291a4bff40873c17bad"],"state_sha256":"3f4287411cb5b0df104ac64f158164ac5e280beaa53808297b788595d2d7f5b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aB0UIZ6NtboLVTNIoDNk/NGHvMa4M1Rk7yjb6P52tu8L+s6pDRpoi+B57b95GEVN2VgfnW9FG/bKb8tFRxMUBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T16:26:52.118386Z","bundle_sha256":"7b14d03e320bd556320dbc4bf1c8b9a664764eaf03a00d43de361eae509002ef"}}