{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:BZWTEKTPWM4NVQCARKEWATNFCE","short_pith_number":"pith:BZWTEKTP","schema_version":"1.0","canonical_sha256":"0e6d322a6fb338dac0408a89604da511320a5badc74853ebaa174a8397e7c8b6","source":{"kind":"arxiv","id":"quant-ph/0606189","version":1},"attestation_state":"computed","paper":{"title":"Universal programmable devices for unambiguous discrimination","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Chi Zhang, Mingsheng Ying","submitted_at":"2006-06-22T18:41:23Z","abstract_excerpt":"We discuss the problem of designing unambiguous programmable discriminators for any $n$ unknown quantum states in an $m$-dimensional Hilbert space. The discriminator is a fixed measurement which has two kinds of input registers: the program registers and the data register. The program registers consist of the $n$ states, while the data register is prepared among them. The task of the discriminator is to tell us which state stored in the program registers is equivalent to that in the data register. First, we give a necessary and sufficient condition for judging an unambiguous programmable discr"},"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":"quant-ph/0606189","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2006-06-22T18:41:23Z","cross_cats_sorted":[],"title_canon_sha256":"4cedb93aa49cdb307919fe5beeda573d6401792435b518283b278a12ecf2c294","abstract_canon_sha256":"948b9fd3112e6edb03ed349a83b2fce9e0197f828e6c59c42f4a0873093149df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:55:42.396625Z","signature_b64":"8OH7aij08+cFOmJhUZWQQsVHtDGGiAF1rq03Rt7wIAARh3cwlSer0/ZzVMWJo2JF1ALZFJc5cnzEz7tQCNdiBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e6d322a6fb338dac0408a89604da511320a5badc74853ebaa174a8397e7c8b6","last_reissued_at":"2026-07-04T14:55:42.396174Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:55:42.396174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal programmable devices for unambiguous discrimination","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Chi Zhang, Mingsheng Ying","submitted_at":"2006-06-22T18:41:23Z","abstract_excerpt":"We discuss the problem of designing unambiguous programmable discriminators for any $n$ unknown quantum states in an $m$-dimensional Hilbert space. The discriminator is a fixed measurement which has two kinds of input registers: the program registers and the data register. The program registers consist of the $n$ states, while the data register is prepared among them. The task of the discriminator is to tell us which state stored in the program registers is equivalent to that in the data register. First, we give a necessary and sufficient condition for judging an unambiguous programmable discr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0606189","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/quant-ph/0606189/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":"quant-ph/0606189","created_at":"2026-07-04T14:55:42.396247+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0606189v1","created_at":"2026-07-04T14:55:42.396247+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0606189","created_at":"2026-07-04T14:55:42.396247+00:00"},{"alias_kind":"pith_short_12","alias_value":"BZWTEKTPWM4N","created_at":"2026-07-04T14:55:42.396247+00:00"},{"alias_kind":"pith_short_16","alias_value":"BZWTEKTPWM4NVQCA","created_at":"2026-07-04T14:55:42.396247+00:00"},{"alias_kind":"pith_short_8","alias_value":"BZWTEKTP","created_at":"2026-07-04T14:55:42.396247+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.10784","citing_title":"Quantum Advantage in Storage and Retrieval of Isometry Channels","ref_index":45,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BZWTEKTPWM4NVQCARKEWATNFCE","json":"https://pith.science/pith/BZWTEKTPWM4NVQCARKEWATNFCE.json","graph_json":"https://pith.science/api/pith-number/BZWTEKTPWM4NVQCARKEWATNFCE/graph.json","events_json":"https://pith.science/api/pith-number/BZWTEKTPWM4NVQCARKEWATNFCE/events.json","paper":"https://pith.science/paper/BZWTEKTP"},"agent_actions":{"view_html":"https://pith.science/pith/BZWTEKTPWM4NVQCARKEWATNFCE","download_json":"https://pith.science/pith/BZWTEKTPWM4NVQCARKEWATNFCE.json","view_paper":"https://pith.science/paper/BZWTEKTP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0606189&json=true","fetch_graph":"https://pith.science/api/pith-number/BZWTEKTPWM4NVQCARKEWATNFCE/graph.json","fetch_events":"https://pith.science/api/pith-number/BZWTEKTPWM4NVQCARKEWATNFCE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BZWTEKTPWM4NVQCARKEWATNFCE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BZWTEKTPWM4NVQCARKEWATNFCE/action/storage_attestation","attest_author":"https://pith.science/pith/BZWTEKTPWM4NVQCARKEWATNFCE/action/author_attestation","sign_citation":"https://pith.science/pith/BZWTEKTPWM4NVQCARKEWATNFCE/action/citation_signature","submit_replication":"https://pith.science/pith/BZWTEKTPWM4NVQCARKEWATNFCE/action/replication_record"}},"created_at":"2026-07-04T14:55:42.396247+00:00","updated_at":"2026-07-04T14:55:42.396247+00:00"}