{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:NJBQU5OA6QYYWSDB3ZUVJDOCCS","short_pith_number":"pith:NJBQU5OA","canonical_record":{"source":{"id":"quant-ph/0602174","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2006-02-21T19:41:05Z","cross_cats_sorted":[],"title_canon_sha256":"f1364fa348827173203f4f808be24b6a9511cceedcc09717bbb505e2e873dcd3","abstract_canon_sha256":"b5417ef3fdb28bfd7630c05893805c2310a7d136e73dc22eba168b81e4329ce9"},"schema_version":"1.0"},"canonical_sha256":"6a430a75c0f4318b4861de69548dc214b6d3d382e4ad17d49221ac9b7531be76","source":{"kind":"arxiv","id":"quant-ph/0602174","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0602174","created_at":"2026-07-04T14:53:31Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0602174v2","created_at":"2026-07-04T14:53:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0602174","created_at":"2026-07-04T14:53:31Z"},{"alias_kind":"pith_short_12","alias_value":"NJBQU5OA6QYY","created_at":"2026-07-04T14:53:31Z"},{"alias_kind":"pith_short_16","alias_value":"NJBQU5OA6QYYWSDB","created_at":"2026-07-04T14:53:31Z"},{"alias_kind":"pith_short_8","alias_value":"NJBQU5OA","created_at":"2026-07-04T14:53:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:NJBQU5OA6QYYWSDB3ZUVJDOCCS","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0602174","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2006-02-21T19:41:05Z","cross_cats_sorted":[],"title_canon_sha256":"f1364fa348827173203f4f808be24b6a9511cceedcc09717bbb505e2e873dcd3","abstract_canon_sha256":"b5417ef3fdb28bfd7630c05893805c2310a7d136e73dc22eba168b81e4329ce9"},"schema_version":"1.0"},"canonical_sha256":"6a430a75c0f4318b4861de69548dc214b6d3d382e4ad17d49221ac9b7531be76","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:53:31.060489Z","signature_b64":"8RGg4DblyoTFZOEe4xVbr5MXTF4KPRjbheSGTPIaVHgiwbcAYYRUAgv2NGPA/d6GlAsmM1Dj7Rn6dG2cYOL1Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a430a75c0f4318b4861de69548dc214b6d3d382e4ad17d49221ac9b7531be76","last_reissued_at":"2026-07-04T14:53:31.060054Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:53:31.060054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0602174","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-07-04T14:53:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QS9JHxkxYQZnn7PGyj7mFGA8yF4+Zi7WvzuZh7wWaJoGCzXDbOe1Ns/3uvxkZ4YjJgWN9lE6k9lO7wAr/zTCAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T19:53:57.125484Z"},"content_sha256":"f165168e452069cfa7f839f2ed1e8a98e30d9324fc6f693bfb3ca4bc5ef28529","schema_version":"1.0","event_id":"sha256:f165168e452069cfa7f839f2ed1e8a98e30d9324fc6f693bfb3ca4bc5ef28529"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:NJBQU5OA6QYYWSDB3ZUVJDOCCS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Universal quantum circuit for n-qubit quantum gate: A programmable quantum gate","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"P. B. M. Sousa, R. V. Ramos","submitted_at":"2006-02-21T19:41:05Z","abstract_excerpt":"Quantum computation has attracted much attention, among other things, due to its potentialities to solve classical NP problems in polynomial time. For this reason, there has been a growing interest to build a quantum computer. One of the basic steps is to implement the quantum circuit able to realize a given unitary operation. This task has been solved using decomposition of unitary matrices in simpler ones till reach quantum circuits having only single-qubits and CNOTs gates. Usually the goal is to find the minimal quantum circuit able to solve a given problem. In this paper we go in a differ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0602174","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/0602174/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"},"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-07-04T14:53:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v1k61hhwuXGuOMLysPBFsCEZfBw4FzN1SjFDst3Apl+z8ej1wnqn2wUEF95bsyRWyTqaBBcT6eC5aa41qonXDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T19:53:57.125999Z"},"content_sha256":"9213990745bbe705168e40c46b5b0fa1794c701e9726beace87353d6a0f44454","schema_version":"1.0","event_id":"sha256:9213990745bbe705168e40c46b5b0fa1794c701e9726beace87353d6a0f44454"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NJBQU5OA6QYYWSDB3ZUVJDOCCS/bundle.json","state_url":"https://pith.science/pith/NJBQU5OA6QYYWSDB3ZUVJDOCCS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NJBQU5OA6QYYWSDB3ZUVJDOCCS/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-08-09T19:53:57Z","links":{"resolver":"https://pith.science/pith/NJBQU5OA6QYYWSDB3ZUVJDOCCS","bundle":"https://pith.science/pith/NJBQU5OA6QYYWSDB3ZUVJDOCCS/bundle.json","state":"https://pith.science/pith/NJBQU5OA6QYYWSDB3ZUVJDOCCS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NJBQU5OA6QYYWSDB3ZUVJDOCCS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:NJBQU5OA6QYYWSDB3ZUVJDOCCS","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":"b5417ef3fdb28bfd7630c05893805c2310a7d136e73dc22eba168b81e4329ce9","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2006-02-21T19:41:05Z","title_canon_sha256":"f1364fa348827173203f4f808be24b6a9511cceedcc09717bbb505e2e873dcd3"},"schema_version":"1.0","source":{"id":"quant-ph/0602174","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0602174","created_at":"2026-07-04T14:53:31Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0602174v2","created_at":"2026-07-04T14:53:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0602174","created_at":"2026-07-04T14:53:31Z"},{"alias_kind":"pith_short_12","alias_value":"NJBQU5OA6QYY","created_at":"2026-07-04T14:53:31Z"},{"alias_kind":"pith_short_16","alias_value":"NJBQU5OA6QYYWSDB","created_at":"2026-07-04T14:53:31Z"},{"alias_kind":"pith_short_8","alias_value":"NJBQU5OA","created_at":"2026-07-04T14:53:31Z"}],"graph_snapshots":[{"event_id":"sha256:9213990745bbe705168e40c46b5b0fa1794c701e9726beace87353d6a0f44454","target":"graph","created_at":"2026-07-04T14:53:31Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/quant-ph/0602174/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quantum computation has attracted much attention, among other things, due to its potentialities to solve classical NP problems in polynomial time. For this reason, there has been a growing interest to build a quantum computer. One of the basic steps is to implement the quantum circuit able to realize a given unitary operation. This task has been solved using decomposition of unitary matrices in simpler ones till reach quantum circuits having only single-qubits and CNOTs gates. Usually the goal is to find the minimal quantum circuit able to solve a given problem. In this paper we go in a differ","authors_text":"P. B. M. Sousa, R. V. Ramos","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2006-02-21T19:41:05Z","title":"Universal quantum circuit for n-qubit quantum gate: A programmable quantum gate"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0602174","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:f165168e452069cfa7f839f2ed1e8a98e30d9324fc6f693bfb3ca4bc5ef28529","target":"record","created_at":"2026-07-04T14:53:31Z","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":"b5417ef3fdb28bfd7630c05893805c2310a7d136e73dc22eba168b81e4329ce9","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2006-02-21T19:41:05Z","title_canon_sha256":"f1364fa348827173203f4f808be24b6a9511cceedcc09717bbb505e2e873dcd3"},"schema_version":"1.0","source":{"id":"quant-ph/0602174","kind":"arxiv","version":2}},"canonical_sha256":"6a430a75c0f4318b4861de69548dc214b6d3d382e4ad17d49221ac9b7531be76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a430a75c0f4318b4861de69548dc214b6d3d382e4ad17d49221ac9b7531be76","first_computed_at":"2026-07-04T14:53:31.060054Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:53:31.060054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8RGg4DblyoTFZOEe4xVbr5MXTF4KPRjbheSGTPIaVHgiwbcAYYRUAgv2NGPA/d6GlAsmM1Dj7Rn6dG2cYOL1Dg==","signature_status":"signed_v1","signed_at":"2026-07-04T14:53:31.060489Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0602174","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f165168e452069cfa7f839f2ed1e8a98e30d9324fc6f693bfb3ca4bc5ef28529","sha256:9213990745bbe705168e40c46b5b0fa1794c701e9726beace87353d6a0f44454"],"state_sha256":"600b0ae6fedf9b9a6314a66503dee38b7dabbe8181c5efad603611310f5e5d49"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1ThKAKSOrO5vgAG2gVdMdrMT3ywvk0DV4d/RCfCDyRbCWw3Pk8YIQna4GpnEhVmqAFP/kJGS12VjktgHGccBDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T19:53:57.131619Z","bundle_sha256":"10cacbdeb7cf76be72d29e191b4f4881eaa89c0c5b9a8168d9137276737194df"}}