{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:AHKWKX6YAJ3YQO4CHPX5SUQFC2","short_pith_number":"pith:AHKWKX6Y","canonical_record":{"source":{"id":"1112.0931","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-12-05T14:16:39Z","cross_cats_sorted":[],"title_canon_sha256":"f3b3dd2c15572caee36933f2eab5810fa649f4614b2c3c64dcaa418e9cc82ff3","abstract_canon_sha256":"0fe14bdfc156623b0cca246f40af525c3b0e57971a161e1857126677e37e7bfc"},"schema_version":"1.0"},"canonical_sha256":"01d5655fd80277883b823befd952051690670146f579024ad578639f1e0e4834","source":{"kind":"arxiv","id":"1112.0931","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.0931","created_at":"2026-05-18T01:34:13Z"},{"alias_kind":"arxiv_version","alias_value":"1112.0931v1","created_at":"2026-05-18T01:34:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0931","created_at":"2026-05-18T01:34:13Z"},{"alias_kind":"pith_short_12","alias_value":"AHKWKX6YAJ3Y","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AHKWKX6YAJ3YQO4C","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AHKWKX6Y","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:AHKWKX6YAJ3YQO4CHPX5SUQFC2","target":"record","payload":{"canonical_record":{"source":{"id":"1112.0931","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-12-05T14:16:39Z","cross_cats_sorted":[],"title_canon_sha256":"f3b3dd2c15572caee36933f2eab5810fa649f4614b2c3c64dcaa418e9cc82ff3","abstract_canon_sha256":"0fe14bdfc156623b0cca246f40af525c3b0e57971a161e1857126677e37e7bfc"},"schema_version":"1.0"},"canonical_sha256":"01d5655fd80277883b823befd952051690670146f579024ad578639f1e0e4834","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:13.855513Z","signature_b64":"Ub26tboUNz2qMDuDvCoxu+8ctPVWHx8kkz3Cpr+RZEPUu3L/CapUv/8cq8IMH/X1y3+uiI35MYzLf60og6yvAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01d5655fd80277883b823befd952051690670146f579024ad578639f1e0e4834","last_reissued_at":"2026-05-18T01:34:13.854743Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:13.854743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.0931","source_version":1,"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-18T01:34:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JZTkLwIYx4+G6wynkhteNO6+Hr8PVVNjjJNko8FdLQBAyTKMdsiLOnoLcIgORmHEgjn5ozYXBy0a+8pGAlMlCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:21:26.541116Z"},"content_sha256":"2b2752970514b47747e9d743e54eed1be26d70ddbeb914b0a63690fa90be17bc","schema_version":"1.0","event_id":"sha256:2b2752970514b47747e9d743e54eed1be26d70ddbeb914b0a63690fa90be17bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:AHKWKX6YAJ3YQO4CHPX5SUQFC2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Group-theoretic approach for multi-copy programmable discriminators between two unknown qudit states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Gui Lu Long, Tao Zhou, Xiaohua Wu","submitted_at":"2011-12-05T14:16:39Z","abstract_excerpt":"The discrimination between two unknown states can be performed by a universal programmable discriminator, where the copies of the two possible states are stored in two program systems respectively and the copies of data, which we want to confirm, are provided in the data system. In the present paper, we propose a group-theretic approach to the multi-copy programmable state discrimination problem. By equivalence of unknown pure states to known mixed states and with the representation theory of U(n) group, we construct the Jordan basis to derive the analytical results for both the optimal unambi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0931","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":""},"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-18T01:34:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1OPrdAExSA7EUOeSE67ARECdTrixWC7/iY1cgST5651pOJcI60T8bSF2hEJX7mLpWsA36zRgALk+IKZsO/itDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:21:26.541791Z"},"content_sha256":"a358db7465b7df1859b8a324eee3817232c82cf11d22862f3d11567119ecd629","schema_version":"1.0","event_id":"sha256:a358db7465b7df1859b8a324eee3817232c82cf11d22862f3d11567119ecd629"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AHKWKX6YAJ3YQO4CHPX5SUQFC2/bundle.json","state_url":"https://pith.science/pith/AHKWKX6YAJ3YQO4CHPX5SUQFC2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AHKWKX6YAJ3YQO4CHPX5SUQFC2/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-06-07T17:21:26Z","links":{"resolver":"https://pith.science/pith/AHKWKX6YAJ3YQO4CHPX5SUQFC2","bundle":"https://pith.science/pith/AHKWKX6YAJ3YQO4CHPX5SUQFC2/bundle.json","state":"https://pith.science/pith/AHKWKX6YAJ3YQO4CHPX5SUQFC2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AHKWKX6YAJ3YQO4CHPX5SUQFC2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:AHKWKX6YAJ3YQO4CHPX5SUQFC2","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":"0fe14bdfc156623b0cca246f40af525c3b0e57971a161e1857126677e37e7bfc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-12-05T14:16:39Z","title_canon_sha256":"f3b3dd2c15572caee36933f2eab5810fa649f4614b2c3c64dcaa418e9cc82ff3"},"schema_version":"1.0","source":{"id":"1112.0931","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.0931","created_at":"2026-05-18T01:34:13Z"},{"alias_kind":"arxiv_version","alias_value":"1112.0931v1","created_at":"2026-05-18T01:34:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0931","created_at":"2026-05-18T01:34:13Z"},{"alias_kind":"pith_short_12","alias_value":"AHKWKX6YAJ3Y","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AHKWKX6YAJ3YQO4C","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AHKWKX6Y","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:a358db7465b7df1859b8a324eee3817232c82cf11d22862f3d11567119ecd629","target":"graph","created_at":"2026-05-18T01:34:13Z","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":"The discrimination between two unknown states can be performed by a universal programmable discriminator, where the copies of the two possible states are stored in two program systems respectively and the copies of data, which we want to confirm, are provided in the data system. In the present paper, we propose a group-theretic approach to the multi-copy programmable state discrimination problem. By equivalence of unknown pure states to known mixed states and with the representation theory of U(n) group, we construct the Jordan basis to derive the analytical results for both the optimal unambi","authors_text":"Gui Lu Long, Tao Zhou, Xiaohua Wu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-12-05T14:16:39Z","title":"Group-theoretic approach for multi-copy programmable discriminators between two unknown qudit states"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0931","kind":"arxiv","version":1},"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:2b2752970514b47747e9d743e54eed1be26d70ddbeb914b0a63690fa90be17bc","target":"record","created_at":"2026-05-18T01:34:13Z","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":"0fe14bdfc156623b0cca246f40af525c3b0e57971a161e1857126677e37e7bfc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-12-05T14:16:39Z","title_canon_sha256":"f3b3dd2c15572caee36933f2eab5810fa649f4614b2c3c64dcaa418e9cc82ff3"},"schema_version":"1.0","source":{"id":"1112.0931","kind":"arxiv","version":1}},"canonical_sha256":"01d5655fd80277883b823befd952051690670146f579024ad578639f1e0e4834","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01d5655fd80277883b823befd952051690670146f579024ad578639f1e0e4834","first_computed_at":"2026-05-18T01:34:13.854743Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:13.854743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ub26tboUNz2qMDuDvCoxu+8ctPVWHx8kkz3Cpr+RZEPUu3L/CapUv/8cq8IMH/X1y3+uiI35MYzLf60og6yvAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:13.855513Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.0931","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b2752970514b47747e9d743e54eed1be26d70ddbeb914b0a63690fa90be17bc","sha256:a358db7465b7df1859b8a324eee3817232c82cf11d22862f3d11567119ecd629"],"state_sha256":"05afd23b358480d7ef7b87fa9c0a7f2973c355e01c6c567161fd1ebc04fa8614"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XtK5KAPcBoXr8XteHT7/PgD/JkU4i68hEabQXmFKiJ1eEDFpGU6+69GChlUAi3+Sp7zH19giAK2XFLhYJMJzAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T17:21:26.545624Z","bundle_sha256":"148a4839c0c0987bc606276dd793a42bf5440f96b833f473d59cbd50632c18e4"}}