{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:UIVYAG5TE3DJC5Z6H5LU755EJB","short_pith_number":"pith:UIVYAG5T","canonical_record":{"source":{"id":"1011.5464","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-11-24T19:32:12Z","cross_cats_sorted":[],"title_canon_sha256":"df254a81f274b6f101a9e8b32005fe57eece2390f4ee5afcaf89077b15e59561","abstract_canon_sha256":"7eecf3d418f3eccd5205731099fad596e591fdd6bf0eb674dbfce3283dd873b2"},"schema_version":"1.0"},"canonical_sha256":"a22b801bb326c691773e3f574ff7a4486919d046fec0ae30e6d5c00dce12121a","source":{"kind":"arxiv","id":"1011.5464","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.5464","created_at":"2026-05-18T04:24:06Z"},{"alias_kind":"arxiv_version","alias_value":"1011.5464v2","created_at":"2026-05-18T04:24:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5464","created_at":"2026-05-18T04:24:06Z"},{"alias_kind":"pith_short_12","alias_value":"UIVYAG5TE3DJ","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"UIVYAG5TE3DJC5Z6","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"UIVYAG5T","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:UIVYAG5TE3DJC5Z6H5LU755EJB","target":"record","payload":{"canonical_record":{"source":{"id":"1011.5464","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-11-24T19:32:12Z","cross_cats_sorted":[],"title_canon_sha256":"df254a81f274b6f101a9e8b32005fe57eece2390f4ee5afcaf89077b15e59561","abstract_canon_sha256":"7eecf3d418f3eccd5205731099fad596e591fdd6bf0eb674dbfce3283dd873b2"},"schema_version":"1.0"},"canonical_sha256":"a22b801bb326c691773e3f574ff7a4486919d046fec0ae30e6d5c00dce12121a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:06.055205Z","signature_b64":"Fo3Yw9Rl6odqlm1zKE1VyxHbMB7aYEf0kDMI7236UVC6ijldNHQ0cmNdoYPum/RyY0gCPvGfSigDsdG10B8sCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a22b801bb326c691773e3f574ff7a4486919d046fec0ae30e6d5c00dce12121a","last_reissued_at":"2026-05-18T04:24:06.054567Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:06.054567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.5464","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-18T04:24:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DOc/zr76sG7ITpE5s2us14Yb6BWQn04Htgpo9lHOBERFoi91/aEEPb1Y9cRxdlLKAzVBNCEbnObx0sR3nmCEDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:08:08.707262Z"},"content_sha256":"65ef3f958ea9578b398aaebe69a4853ff58fb61aefa95d7b466f4b93975f0553","schema_version":"1.0","event_id":"sha256:65ef3f958ea9578b398aaebe69a4853ff58fb61aefa95d7b466f4b93975f0553"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:UIVYAG5TE3DJC5Z6H5LU755EJB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal preparation of graph states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adan Cabello, Antonio J. Lopez-Tarrida, Jose R. Portillo, Lars Eirik Danielsen","submitted_at":"2010-11-24T19:32:12Z","abstract_excerpt":"We show how to prepare any graph state of up to 12 qubits with: (a) the minimum number of controlled-Z gates, and (b) the minimum preparation depth. We assume only one-qubit and controlled-Z gates. The method exploits the fact that any graph state belongs to an equivalence class under local Clifford operations. We extend up to 12 qubits the classification of graph states according to their entanglement properties, and identify each class using only a reduced set of invariants. For any state, we provide a circuit with both properties (a) and (b), if it does exist, or, if it does not, one circui"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5464","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-18T04:24:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7qk9FE+Zv08U3CUUe5vL4+C7BkWMmSHVrbxFvz5uTHW6QBP28PGIMXJnMjhNgVvVw9NZRooYEXd5oNDrbiCMBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:08:08.707641Z"},"content_sha256":"04d01dd7f012cbec055e98aef06d753f5674c99e761553efd656fba56b477a63","schema_version":"1.0","event_id":"sha256:04d01dd7f012cbec055e98aef06d753f5674c99e761553efd656fba56b477a63"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UIVYAG5TE3DJC5Z6H5LU755EJB/bundle.json","state_url":"https://pith.science/pith/UIVYAG5TE3DJC5Z6H5LU755EJB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UIVYAG5TE3DJC5Z6H5LU755EJB/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-30T12:08:08Z","links":{"resolver":"https://pith.science/pith/UIVYAG5TE3DJC5Z6H5LU755EJB","bundle":"https://pith.science/pith/UIVYAG5TE3DJC5Z6H5LU755EJB/bundle.json","state":"https://pith.science/pith/UIVYAG5TE3DJC5Z6H5LU755EJB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UIVYAG5TE3DJC5Z6H5LU755EJB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:UIVYAG5TE3DJC5Z6H5LU755EJB","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":"7eecf3d418f3eccd5205731099fad596e591fdd6bf0eb674dbfce3283dd873b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-11-24T19:32:12Z","title_canon_sha256":"df254a81f274b6f101a9e8b32005fe57eece2390f4ee5afcaf89077b15e59561"},"schema_version":"1.0","source":{"id":"1011.5464","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.5464","created_at":"2026-05-18T04:24:06Z"},{"alias_kind":"arxiv_version","alias_value":"1011.5464v2","created_at":"2026-05-18T04:24:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5464","created_at":"2026-05-18T04:24:06Z"},{"alias_kind":"pith_short_12","alias_value":"UIVYAG5TE3DJ","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"UIVYAG5TE3DJC5Z6","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"UIVYAG5T","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:04d01dd7f012cbec055e98aef06d753f5674c99e761553efd656fba56b477a63","target":"graph","created_at":"2026-05-18T04:24:06Z","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 show how to prepare any graph state of up to 12 qubits with: (a) the minimum number of controlled-Z gates, and (b) the minimum preparation depth. We assume only one-qubit and controlled-Z gates. The method exploits the fact that any graph state belongs to an equivalence class under local Clifford operations. We extend up to 12 qubits the classification of graph states according to their entanglement properties, and identify each class using only a reduced set of invariants. For any state, we provide a circuit with both properties (a) and (b), if it does exist, or, if it does not, one circui","authors_text":"Adan Cabello, Antonio J. Lopez-Tarrida, Jose R. Portillo, Lars Eirik Danielsen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-11-24T19:32:12Z","title":"Optimal preparation of graph states"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5464","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:65ef3f958ea9578b398aaebe69a4853ff58fb61aefa95d7b466f4b93975f0553","target":"record","created_at":"2026-05-18T04:24:06Z","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":"7eecf3d418f3eccd5205731099fad596e591fdd6bf0eb674dbfce3283dd873b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-11-24T19:32:12Z","title_canon_sha256":"df254a81f274b6f101a9e8b32005fe57eece2390f4ee5afcaf89077b15e59561"},"schema_version":"1.0","source":{"id":"1011.5464","kind":"arxiv","version":2}},"canonical_sha256":"a22b801bb326c691773e3f574ff7a4486919d046fec0ae30e6d5c00dce12121a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a22b801bb326c691773e3f574ff7a4486919d046fec0ae30e6d5c00dce12121a","first_computed_at":"2026-05-18T04:24:06.054567Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:24:06.054567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Fo3Yw9Rl6odqlm1zKE1VyxHbMB7aYEf0kDMI7236UVC6ijldNHQ0cmNdoYPum/RyY0gCPvGfSigDsdG10B8sCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:24:06.055205Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.5464","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65ef3f958ea9578b398aaebe69a4853ff58fb61aefa95d7b466f4b93975f0553","sha256:04d01dd7f012cbec055e98aef06d753f5674c99e761553efd656fba56b477a63"],"state_sha256":"76d1da084d13d99c0ed43ec488b1f1d1a33552498bce1fe844fe391124589729"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n1ZfX8YASkqEE4DZ79pQqp7FmfaQobvDcEfYoPMUVOTMUya5DdLladMvs3guHoXTkKmJGiFJ/a0zJhFAo1qbBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:08:08.709543Z","bundle_sha256":"0c12ff22a26423dceddc1dd4b36a85040a9514e2bb7988a61535b7d81e4c9501"}}