{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:IRTUAQGN673LNEJ6GAK6VDPEEE","short_pith_number":"pith:IRTUAQGN","canonical_record":{"source":{"id":"quant-ph/0504100","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-04-14T02:02:37Z","cross_cats_sorted":[],"title_canon_sha256":"e71d9eef105fe891e09d7313d1135269f1d94e278e08aa52f5ec3d2d25844202","abstract_canon_sha256":"c58b995c994b641f0d093fb74fd08ed5d03a766154abd36253e6487d62305629"},"schema_version":"1.0"},"canonical_sha256":"44674040cdf7f6b6913e3015ea8de4211ff92cd042f7df8085e17f9bd8485f2c","source":{"kind":"arxiv","id":"quant-ph/0504100","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0504100","created_at":"2026-07-04T14:59:58Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0504100v1","created_at":"2026-07-04T14:59:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0504100","created_at":"2026-07-04T14:59:58Z"},{"alias_kind":"pith_short_12","alias_value":"IRTUAQGN673L","created_at":"2026-07-04T14:59:58Z"},{"alias_kind":"pith_short_16","alias_value":"IRTUAQGN673LNEJ6","created_at":"2026-07-04T14:59:58Z"},{"alias_kind":"pith_short_8","alias_value":"IRTUAQGN","created_at":"2026-07-04T14:59:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:IRTUAQGN673LNEJ6GAK6VDPEEE","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0504100","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-04-14T02:02:37Z","cross_cats_sorted":[],"title_canon_sha256":"e71d9eef105fe891e09d7313d1135269f1d94e278e08aa52f5ec3d2d25844202","abstract_canon_sha256":"c58b995c994b641f0d093fb74fd08ed5d03a766154abd36253e6487d62305629"},"schema_version":"1.0"},"canonical_sha256":"44674040cdf7f6b6913e3015ea8de4211ff92cd042f7df8085e17f9bd8485f2c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:59:58.340749Z","signature_b64":"Whn++ix+zLubjbPMbxA08oHhlMYAJ9E+YpYuoMOjTUJPY3ShnyCDqSOQpcvP8c/6MDlTnzAWfNxuZi4EvDzzBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44674040cdf7f6b6913e3015ea8de4211ff92cd042f7df8085e17f9bd8485f2c","last_reissued_at":"2026-07-04T14:59:58.340367Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:59:58.340367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0504100","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-07-04T14:59:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XtCVudlHh3uwYw7eR7eqqVmBIVuLQaxl2z0DnPXrJ24sga8OQ81OZ+aqIWh7V/gOM65ivxzXL8BGNKs54HljDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T20:34:57.557453Z"},"content_sha256":"34c69f1881ce0222656106e5f7426113f7a35f67a8621846939ecab4e2628b42","schema_version":"1.0","event_id":"sha256:34c69f1881ce0222656106e5f7426113f7a35f67a8621846939ecab4e2628b42"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:IRTUAQGN673LNEJ6GAK6VDPEEE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decompositions of general quantum gates","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"J. J. Vartiainen, M. Mottonen","submitted_at":"2005-04-14T02:02:37Z","abstract_excerpt":"Quantum algorithms may be described by sequences of unitary transformations called quantum gates and measurements applied to the quantum register of n quantum bits, qubits. A collection of quantum gates is called universal if it can be used to construct any n-qubit gate. In 1995, the universality of the set of one-qubit gates and controlled NOT gate was shown by Barenco et al. using QR decomposition of unitary matrices. Almost ten years later the decomposition was improved to include essentially fewer elementary gates. In addition, the cosine-sine matrix decomposition was applied to efficientl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0504100","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/0504100/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:59:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S/Y49xxy9Unp57DfKnM2IDTD/aLO2SqTNlOl9HlceAOA0yp2c1+V7IHM6faLYxcDsaikQvNETHqiXhDpWSkUCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T20:34:57.557961Z"},"content_sha256":"6919fd18a15f262fd97959855e20ce687d492dcbad414129662d478c5dbcd0d7","schema_version":"1.0","event_id":"sha256:6919fd18a15f262fd97959855e20ce687d492dcbad414129662d478c5dbcd0d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IRTUAQGN673LNEJ6GAK6VDPEEE/bundle.json","state_url":"https://pith.science/pith/IRTUAQGN673LNEJ6GAK6VDPEEE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IRTUAQGN673LNEJ6GAK6VDPEEE/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-14T20:34:57Z","links":{"resolver":"https://pith.science/pith/IRTUAQGN673LNEJ6GAK6VDPEEE","bundle":"https://pith.science/pith/IRTUAQGN673LNEJ6GAK6VDPEEE/bundle.json","state":"https://pith.science/pith/IRTUAQGN673LNEJ6GAK6VDPEEE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IRTUAQGN673LNEJ6GAK6VDPEEE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:IRTUAQGN673LNEJ6GAK6VDPEEE","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":"c58b995c994b641f0d093fb74fd08ed5d03a766154abd36253e6487d62305629","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2005-04-14T02:02:37Z","title_canon_sha256":"e71d9eef105fe891e09d7313d1135269f1d94e278e08aa52f5ec3d2d25844202"},"schema_version":"1.0","source":{"id":"quant-ph/0504100","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0504100","created_at":"2026-07-04T14:59:58Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0504100v1","created_at":"2026-07-04T14:59:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0504100","created_at":"2026-07-04T14:59:58Z"},{"alias_kind":"pith_short_12","alias_value":"IRTUAQGN673L","created_at":"2026-07-04T14:59:58Z"},{"alias_kind":"pith_short_16","alias_value":"IRTUAQGN673LNEJ6","created_at":"2026-07-04T14:59:58Z"},{"alias_kind":"pith_short_8","alias_value":"IRTUAQGN","created_at":"2026-07-04T14:59:58Z"}],"graph_snapshots":[{"event_id":"sha256:6919fd18a15f262fd97959855e20ce687d492dcbad414129662d478c5dbcd0d7","target":"graph","created_at":"2026-07-04T14:59:58Z","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/0504100/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quantum algorithms may be described by sequences of unitary transformations called quantum gates and measurements applied to the quantum register of n quantum bits, qubits. A collection of quantum gates is called universal if it can be used to construct any n-qubit gate. In 1995, the universality of the set of one-qubit gates and controlled NOT gate was shown by Barenco et al. using QR decomposition of unitary matrices. Almost ten years later the decomposition was improved to include essentially fewer elementary gates. In addition, the cosine-sine matrix decomposition was applied to efficientl","authors_text":"J. J. Vartiainen, M. Mottonen","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2005-04-14T02:02:37Z","title":"Decompositions of general quantum gates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0504100","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:34c69f1881ce0222656106e5f7426113f7a35f67a8621846939ecab4e2628b42","target":"record","created_at":"2026-07-04T14:59:58Z","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":"c58b995c994b641f0d093fb74fd08ed5d03a766154abd36253e6487d62305629","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2005-04-14T02:02:37Z","title_canon_sha256":"e71d9eef105fe891e09d7313d1135269f1d94e278e08aa52f5ec3d2d25844202"},"schema_version":"1.0","source":{"id":"quant-ph/0504100","kind":"arxiv","version":1}},"canonical_sha256":"44674040cdf7f6b6913e3015ea8de4211ff92cd042f7df8085e17f9bd8485f2c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44674040cdf7f6b6913e3015ea8de4211ff92cd042f7df8085e17f9bd8485f2c","first_computed_at":"2026-07-04T14:59:58.340367Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:59:58.340367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Whn++ix+zLubjbPMbxA08oHhlMYAJ9E+YpYuoMOjTUJPY3ShnyCDqSOQpcvP8c/6MDlTnzAWfNxuZi4EvDzzBw==","signature_status":"signed_v1","signed_at":"2026-07-04T14:59:58.340749Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0504100","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34c69f1881ce0222656106e5f7426113f7a35f67a8621846939ecab4e2628b42","sha256:6919fd18a15f262fd97959855e20ce687d492dcbad414129662d478c5dbcd0d7"],"state_sha256":"f90173f91c47f1b16cee20fce5924bbb4af3f049adf0679b6b111115c9e24a01"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tAi/KddayNirX/840+s6oFiFAco8Qa7UVYJm65/Sm0ukvA5kyHBsQbfVT1GwgVyhycD0pqWH2l2SoJdRWc39Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T20:34:57.561711Z","bundle_sha256":"537de82bf2d1ccab5968456288a850df8c4eed65ef2724a559cd7e79d7eda4a3"}}