{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1996:ISKL3QBUQYVZVYFXR3PGLKLDZV","short_pith_number":"pith:ISKL3QBU","schema_version":"1.0","canonical_sha256":"4494bdc034862b9ae0b78ede65a963cd49bb74fe6accc0057cea79c58b50f4be","source":{"kind":"arxiv","id":"quant-ph/9609018","version":2},"attestation_state":"computed","paper":{"title":"A Hamiltonian for quantum copying","license":"","headline":"","cross_cats":["cond-mat.mtrl-sci"],"primary_cat":"quant-ph","authors_text":"Dima Mozyrsky, Mark Hillery, Vladimir Privman","submitted_at":"1996-09-24T22:00:00Z","abstract_excerpt":"We derive an explicit Hamiltonian for copying the basis up and down states of a quantum two-state system - a qubit - onto n \"copy\" qubits initially all prepared in the down state. In terms of spin components, for spin-1/2 particle spin states, the resulting Hamiltonian involves n- and (n+1)-spin interactions. The case n=1 also corresponds to a quantum-computing controlled-NOT gate."},"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/9609018","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1996-09-24T22:00:00Z","cross_cats_sorted":["cond-mat.mtrl-sci"],"title_canon_sha256":"c93e81cd8dfa82b0982a626980c3cec61c726ca55907a8533cdf79f5015927b3","abstract_canon_sha256":"0bfca6d506d83f2ee655834a25a1d6be3d554e8f73a30ad28ef4e4fc4cfeaac2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:35:06.713827Z","signature_b64":"qJ72vEyLhBwPfFR70fGm4bAGwP6oRUNt3+O20vG9ibw9jaGA8zUlNLINt14DlTtIQtOtR8w+omcQ2jGzA+gECg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4494bdc034862b9ae0b78ede65a963cd49bb74fe6accc0057cea79c58b50f4be","last_reissued_at":"2026-05-18T02:35:06.713391Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:35:06.713391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Hamiltonian for quantum copying","license":"","headline":"","cross_cats":["cond-mat.mtrl-sci"],"primary_cat":"quant-ph","authors_text":"Dima Mozyrsky, Mark Hillery, Vladimir Privman","submitted_at":"1996-09-24T22:00:00Z","abstract_excerpt":"We derive an explicit Hamiltonian for copying the basis up and down states of a quantum two-state system - a qubit - onto n \"copy\" qubits initially all prepared in the down state. In terms of spin components, for spin-1/2 particle spin states, the resulting Hamiltonian involves n- and (n+1)-spin interactions. The case n=1 also corresponds to a quantum-computing controlled-NOT gate."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9609018","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/9609018","created_at":"2026-05-18T02:35:06.713457+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9609018v2","created_at":"2026-05-18T02:35:06.713457+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9609018","created_at":"2026-05-18T02:35:06.713457+00:00"},{"alias_kind":"pith_short_12","alias_value":"ISKL3QBUQYVZ","created_at":"2026-05-18T12:25:47.700082+00:00"},{"alias_kind":"pith_short_16","alias_value":"ISKL3QBUQYVZVYFX","created_at":"2026-05-18T12:25:47.700082+00:00"},{"alias_kind":"pith_short_8","alias_value":"ISKL3QBU","created_at":"2026-05-18T12:25:47.700082+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ISKL3QBUQYVZVYFXR3PGLKLDZV","json":"https://pith.science/pith/ISKL3QBUQYVZVYFXR3PGLKLDZV.json","graph_json":"https://pith.science/api/pith-number/ISKL3QBUQYVZVYFXR3PGLKLDZV/graph.json","events_json":"https://pith.science/api/pith-number/ISKL3QBUQYVZVYFXR3PGLKLDZV/events.json","paper":"https://pith.science/paper/ISKL3QBU"},"agent_actions":{"view_html":"https://pith.science/pith/ISKL3QBUQYVZVYFXR3PGLKLDZV","download_json":"https://pith.science/pith/ISKL3QBUQYVZVYFXR3PGLKLDZV.json","view_paper":"https://pith.science/paper/ISKL3QBU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/9609018&json=true","fetch_graph":"https://pith.science/api/pith-number/ISKL3QBUQYVZVYFXR3PGLKLDZV/graph.json","fetch_events":"https://pith.science/api/pith-number/ISKL3QBUQYVZVYFXR3PGLKLDZV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ISKL3QBUQYVZVYFXR3PGLKLDZV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ISKL3QBUQYVZVYFXR3PGLKLDZV/action/storage_attestation","attest_author":"https://pith.science/pith/ISKL3QBUQYVZVYFXR3PGLKLDZV/action/author_attestation","sign_citation":"https://pith.science/pith/ISKL3QBUQYVZVYFXR3PGLKLDZV/action/citation_signature","submit_replication":"https://pith.science/pith/ISKL3QBUQYVZVYFXR3PGLKLDZV/action/replication_record"}},"created_at":"2026-05-18T02:35:06.713457+00:00","updated_at":"2026-05-18T02:35:06.713457+00:00"}