{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:5DAKP4I4U5XZDMWVSRSEHWLDDF","short_pith_number":"pith:5DAKP4I4","canonical_record":{"source":{"id":"1411.3035","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-11-12T01:15:57Z","cross_cats_sorted":["cs.IT","cs.LO","math-ph","math.CT","math.IT","math.MP"],"title_canon_sha256":"e02aba35426a6028845b1391b312b5df312c85ed09f78515e7961e7987cc316a","abstract_canon_sha256":"8e0cb4d112fb9e1a9cd1583de66191804aa1935252124fd240161ba2dea50bf7"},"schema_version":"1.0"},"canonical_sha256":"e8c0a7f11ca76f91b2d5946443d9631948e3c52b2d6fdc8dfbaded796015b960","source":{"kind":"arxiv","id":"1411.3035","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.3035","created_at":"2026-05-18T02:17:24Z"},{"alias_kind":"arxiv_version","alias_value":"1411.3035v2","created_at":"2026-05-18T02:17:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3035","created_at":"2026-05-18T02:17:24Z"},{"alias_kind":"pith_short_12","alias_value":"5DAKP4I4U5XZ","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5DAKP4I4U5XZDMWV","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5DAKP4I4","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:5DAKP4I4U5XZDMWVSRSEHWLDDF","target":"record","payload":{"canonical_record":{"source":{"id":"1411.3035","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-11-12T01:15:57Z","cross_cats_sorted":["cs.IT","cs.LO","math-ph","math.CT","math.IT","math.MP"],"title_canon_sha256":"e02aba35426a6028845b1391b312b5df312c85ed09f78515e7961e7987cc316a","abstract_canon_sha256":"8e0cb4d112fb9e1a9cd1583de66191804aa1935252124fd240161ba2dea50bf7"},"schema_version":"1.0"},"canonical_sha256":"e8c0a7f11ca76f91b2d5946443d9631948e3c52b2d6fdc8dfbaded796015b960","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:24.354605Z","signature_b64":"waoQgMWTpNjgGpn2Dtg6OW2L10cdANLBIFrsKoN7ZTspI4jHZVdKsZj8a9heeO99l7i22QAvNyPc56/6n96uBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8c0a7f11ca76f91b2d5946443d9631948e3c52b2d6fdc8dfbaded796015b960","last_reissued_at":"2026-05-18T02:17:24.353972Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:24.353972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.3035","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-18T02:17:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"citUSiXjXj9NULpoHY1CS5bvFi4LPa/ACCdg3pHzaGoUEXBt3cqrPQtaUNYv4yxMB4vc5KcyBwEtKUcfwXfkBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:39:14.849394Z"},"content_sha256":"f90e9ba0724f21a9941df72215e59f70c9e515b79fc8d69d36b1cdfdc79363e2","schema_version":"1.0","event_id":"sha256:f90e9ba0724f21a9941df72215e59f70c9e515b79fc8d69d36b1cdfdc79363e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:5DAKP4I4U5XZDMWVSRSEHWLDDF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distinguishability and copiability of programs in general process theories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LO","math-ph","math.CT","math.IT","math.MP"],"primary_cat":"quant-ph","authors_text":"Giulio Chiribella","submitted_at":"2014-11-12T01:15:57Z","abstract_excerpt":"We propose a notion of state distinguishability that does not refer to probabilities, but rather to the ability of a set of states to serve as programs for a desired set of gates. Using this notion, we reconstruct the structural features of the task of state discrimination, such as the equivalence with cloning and the impossibility to extract information from two non-distinguishable pure states without causing a disturbance. All these features express intrinsic links among operational tasks, which are valid independently of the particular theory under consideration."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3035","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-18T02:17:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7WC9cDYLYqUxDwIS6pcNZfdJOPn+G7aMHpBL4FCl7vFpuZtUCtS+m1qOxe5aJCCP8lOch3iGIi23Vp4QsZv9DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:39:14.850002Z"},"content_sha256":"3afcdfab7094887c17285cffec1d1d9a295274159466bb348ded826d11a0df46","schema_version":"1.0","event_id":"sha256:3afcdfab7094887c17285cffec1d1d9a295274159466bb348ded826d11a0df46"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5DAKP4I4U5XZDMWVSRSEHWLDDF/bundle.json","state_url":"https://pith.science/pith/5DAKP4I4U5XZDMWVSRSEHWLDDF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5DAKP4I4U5XZDMWVSRSEHWLDDF/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-25T17:39:14Z","links":{"resolver":"https://pith.science/pith/5DAKP4I4U5XZDMWVSRSEHWLDDF","bundle":"https://pith.science/pith/5DAKP4I4U5XZDMWVSRSEHWLDDF/bundle.json","state":"https://pith.science/pith/5DAKP4I4U5XZDMWVSRSEHWLDDF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5DAKP4I4U5XZDMWVSRSEHWLDDF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5DAKP4I4U5XZDMWVSRSEHWLDDF","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":"8e0cb4d112fb9e1a9cd1583de66191804aa1935252124fd240161ba2dea50bf7","cross_cats_sorted":["cs.IT","cs.LO","math-ph","math.CT","math.IT","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-11-12T01:15:57Z","title_canon_sha256":"e02aba35426a6028845b1391b312b5df312c85ed09f78515e7961e7987cc316a"},"schema_version":"1.0","source":{"id":"1411.3035","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.3035","created_at":"2026-05-18T02:17:24Z"},{"alias_kind":"arxiv_version","alias_value":"1411.3035v2","created_at":"2026-05-18T02:17:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3035","created_at":"2026-05-18T02:17:24Z"},{"alias_kind":"pith_short_12","alias_value":"5DAKP4I4U5XZ","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5DAKP4I4U5XZDMWV","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5DAKP4I4","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:3afcdfab7094887c17285cffec1d1d9a295274159466bb348ded826d11a0df46","target":"graph","created_at":"2026-05-18T02:17:24Z","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 propose a notion of state distinguishability that does not refer to probabilities, but rather to the ability of a set of states to serve as programs for a desired set of gates. Using this notion, we reconstruct the structural features of the task of state discrimination, such as the equivalence with cloning and the impossibility to extract information from two non-distinguishable pure states without causing a disturbance. All these features express intrinsic links among operational tasks, which are valid independently of the particular theory under consideration.","authors_text":"Giulio Chiribella","cross_cats":["cs.IT","cs.LO","math-ph","math.CT","math.IT","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-11-12T01:15:57Z","title":"Distinguishability and copiability of programs in general process theories"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3035","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:f90e9ba0724f21a9941df72215e59f70c9e515b79fc8d69d36b1cdfdc79363e2","target":"record","created_at":"2026-05-18T02:17:24Z","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":"8e0cb4d112fb9e1a9cd1583de66191804aa1935252124fd240161ba2dea50bf7","cross_cats_sorted":["cs.IT","cs.LO","math-ph","math.CT","math.IT","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-11-12T01:15:57Z","title_canon_sha256":"e02aba35426a6028845b1391b312b5df312c85ed09f78515e7961e7987cc316a"},"schema_version":"1.0","source":{"id":"1411.3035","kind":"arxiv","version":2}},"canonical_sha256":"e8c0a7f11ca76f91b2d5946443d9631948e3c52b2d6fdc8dfbaded796015b960","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8c0a7f11ca76f91b2d5946443d9631948e3c52b2d6fdc8dfbaded796015b960","first_computed_at":"2026-05-18T02:17:24.353972Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:24.353972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"waoQgMWTpNjgGpn2Dtg6OW2L10cdANLBIFrsKoN7ZTspI4jHZVdKsZj8a9heeO99l7i22QAvNyPc56/6n96uBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:24.354605Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.3035","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f90e9ba0724f21a9941df72215e59f70c9e515b79fc8d69d36b1cdfdc79363e2","sha256:3afcdfab7094887c17285cffec1d1d9a295274159466bb348ded826d11a0df46"],"state_sha256":"466fcdbd69be78bc7d6ea7164437d2c56bb37fc4283f2d92b7023f267cd055e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B7dmwV97nlW1lOVismWrQCiUcIW5x7MescoeKBqYjo+aYck3RmQe1o9w0actendw6vQfS5RoBNu5K46hlBj3CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:39:14.853797Z","bundle_sha256":"fd376f6086bd8afe8b17eb5d958b141bae9a8a3cdb3624e71e9f3c3cebd67a44"}}