{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RNBAIZML3RNQSVZP4RJNGVGXXR","short_pith_number":"pith:RNBAIZML","canonical_record":{"source":{"id":"1805.03477","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-05-09T12:30:13Z","cross_cats_sorted":[],"title_canon_sha256":"18cbfadb5040577ad75224f42f81eebafbc39f725bfba68c269b7c3288dfa617","abstract_canon_sha256":"0f32ff6a626a061e36afa0353ff44a2e6a7df3c30867415bdfe51f2199b9b025"},"schema_version":"1.0"},"canonical_sha256":"8b4204658bdc5b09572fe452d354d7bc791e745dc32eb3328e2b5900db123193","source":{"kind":"arxiv","id":"1805.03477","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03477","created_at":"2026-05-17T23:41:56Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03477v3","created_at":"2026-05-17T23:41:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03477","created_at":"2026-05-17T23:41:56Z"},{"alias_kind":"pith_short_12","alias_value":"RNBAIZML3RNQ","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RNBAIZML3RNQSVZP","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RNBAIZML","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RNBAIZML3RNQSVZP4RJNGVGXXR","target":"record","payload":{"canonical_record":{"source":{"id":"1805.03477","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-05-09T12:30:13Z","cross_cats_sorted":[],"title_canon_sha256":"18cbfadb5040577ad75224f42f81eebafbc39f725bfba68c269b7c3288dfa617","abstract_canon_sha256":"0f32ff6a626a061e36afa0353ff44a2e6a7df3c30867415bdfe51f2199b9b025"},"schema_version":"1.0"},"canonical_sha256":"8b4204658bdc5b09572fe452d354d7bc791e745dc32eb3328e2b5900db123193","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:56.271516Z","signature_b64":"sN6NwjMBJZmtshC6zZs7d9VcVbntX4ajRE4SuIulilSJOMT07lwtaqy6YS7Cz5ZcFMjXNc0HufMmyzUD3cVyDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b4204658bdc5b09572fe452d354d7bc791e745dc32eb3328e2b5900db123193","last_reissued_at":"2026-05-17T23:41:56.270868Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:56.270868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.03477","source_version":3,"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-17T23:41:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JPHxnX46GYOwrXYgoUkbctJbfRSZ5XxqzkmRjLSVv4bOcpn3DxVOT/Wu47PNYV2oQnuVD/ITYxdptIB7iXAkBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:11:17.467401Z"},"content_sha256":"876b504e8ecb6a5246f4d5530149883e8265320e2e7b29919c0c949f203ed8ff","schema_version":"1.0","event_id":"sha256:876b504e8ecb6a5246f4d5530149883e8265320e2e7b29919c0c949f203ed8ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RNBAIZML3RNQSVZP4RJNGVGXXR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal universal learning machines for quantum state discrimination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrea Mari, Marco Fanizza, Vittorio Giovannetti","submitted_at":"2018-05-09T12:30:13Z","abstract_excerpt":"We consider the problem of correctly classifying a given quantum two-level system (qubit) which is known to be in one of two equally probable quantum states. We assume that this task should be performed by a quantum machine which does not have at its disposal a complete classical description of the two template states, but can only have partial prior information about their level of purity and mutual overlap. Moreover, similarly to the classical supervised learning paradigm, we assume that the machine can be trained by $n$ qubits prepared in the first template state and by $n$ more qubits prep"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03477","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"},"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-17T23:41:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Old9AA6j8nu3ZgB+EGX7KlhNuxiHxmF7ZjCf3KwlNZayxfSqMRO5V7DDk9k4QiiUrv1oc+bcJtmHe/00e8ZrBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:11:17.467865Z"},"content_sha256":"6c4dae8bd9f65ad58757ce1ecb66572ece3bd8d1447379a282576b268791ce24","schema_version":"1.0","event_id":"sha256:6c4dae8bd9f65ad58757ce1ecb66572ece3bd8d1447379a282576b268791ce24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RNBAIZML3RNQSVZP4RJNGVGXXR/bundle.json","state_url":"https://pith.science/pith/RNBAIZML3RNQSVZP4RJNGVGXXR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RNBAIZML3RNQSVZP4RJNGVGXXR/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-27T10:11:17Z","links":{"resolver":"https://pith.science/pith/RNBAIZML3RNQSVZP4RJNGVGXXR","bundle":"https://pith.science/pith/RNBAIZML3RNQSVZP4RJNGVGXXR/bundle.json","state":"https://pith.science/pith/RNBAIZML3RNQSVZP4RJNGVGXXR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RNBAIZML3RNQSVZP4RJNGVGXXR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RNBAIZML3RNQSVZP4RJNGVGXXR","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":"0f32ff6a626a061e36afa0353ff44a2e6a7df3c30867415bdfe51f2199b9b025","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-05-09T12:30:13Z","title_canon_sha256":"18cbfadb5040577ad75224f42f81eebafbc39f725bfba68c269b7c3288dfa617"},"schema_version":"1.0","source":{"id":"1805.03477","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03477","created_at":"2026-05-17T23:41:56Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03477v3","created_at":"2026-05-17T23:41:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03477","created_at":"2026-05-17T23:41:56Z"},{"alias_kind":"pith_short_12","alias_value":"RNBAIZML3RNQ","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RNBAIZML3RNQSVZP","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RNBAIZML","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:6c4dae8bd9f65ad58757ce1ecb66572ece3bd8d1447379a282576b268791ce24","target":"graph","created_at":"2026-05-17T23:41:56Z","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":"We consider the problem of correctly classifying a given quantum two-level system (qubit) which is known to be in one of two equally probable quantum states. We assume that this task should be performed by a quantum machine which does not have at its disposal a complete classical description of the two template states, but can only have partial prior information about their level of purity and mutual overlap. Moreover, similarly to the classical supervised learning paradigm, we assume that the machine can be trained by $n$ qubits prepared in the first template state and by $n$ more qubits prep","authors_text":"Andrea Mari, Marco Fanizza, Vittorio Giovannetti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-05-09T12:30:13Z","title":"Optimal universal learning machines for quantum state discrimination"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03477","kind":"arxiv","version":3},"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:876b504e8ecb6a5246f4d5530149883e8265320e2e7b29919c0c949f203ed8ff","target":"record","created_at":"2026-05-17T23:41:56Z","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":"0f32ff6a626a061e36afa0353ff44a2e6a7df3c30867415bdfe51f2199b9b025","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-05-09T12:30:13Z","title_canon_sha256":"18cbfadb5040577ad75224f42f81eebafbc39f725bfba68c269b7c3288dfa617"},"schema_version":"1.0","source":{"id":"1805.03477","kind":"arxiv","version":3}},"canonical_sha256":"8b4204658bdc5b09572fe452d354d7bc791e745dc32eb3328e2b5900db123193","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b4204658bdc5b09572fe452d354d7bc791e745dc32eb3328e2b5900db123193","first_computed_at":"2026-05-17T23:41:56.270868Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:56.270868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sN6NwjMBJZmtshC6zZs7d9VcVbntX4ajRE4SuIulilSJOMT07lwtaqy6YS7Cz5ZcFMjXNc0HufMmyzUD3cVyDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:56.271516Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.03477","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:876b504e8ecb6a5246f4d5530149883e8265320e2e7b29919c0c949f203ed8ff","sha256:6c4dae8bd9f65ad58757ce1ecb66572ece3bd8d1447379a282576b268791ce24"],"state_sha256":"7eda0fab0d010aa7441e0134374522e99da652a58163f86cd7797585064795a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tsjn6u+CDbtpHtYNeYPn91KGgUsxHLjTHPHZmkCdOJA0ymkNZ94hI/phX4nEeST/PjFYJCWSV8xR1YzqDdtDDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:11:17.470930Z","bundle_sha256":"702e97b7eefeceb8c209ece4f5e348e66974ec1e29156432a8cba7f4973edb3b"}}