{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OJDF2VIGC4GJ5JGOU6FFEZGJB5","short_pith_number":"pith:OJDF2VIG","canonical_record":{"source":{"id":"1708.08909","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-08-29T17:51:14Z","cross_cats_sorted":[],"title_canon_sha256":"9a7a7cb1c5ac1fa8fdb113380e0d82b4ff96aebfeda01ad86850e207867bc675","abstract_canon_sha256":"8c35f7b9ed182cc0a2b107c20afc2cbad9a17c92a4c45e672f1a356697eeb083"},"schema_version":"1.0"},"canonical_sha256":"72465d5506170c9ea4cea78a5264c90f7ac46e79b55f7c1b64be8f02da2371dc","source":{"kind":"arxiv","id":"1708.08909","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.08909","created_at":"2026-05-18T00:09:52Z"},{"alias_kind":"arxiv_version","alias_value":"1708.08909v3","created_at":"2026-05-18T00:09:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.08909","created_at":"2026-05-18T00:09:52Z"},{"alias_kind":"pith_short_12","alias_value":"OJDF2VIGC4GJ","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OJDF2VIGC4GJ5JGO","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OJDF2VIG","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OJDF2VIGC4GJ5JGOU6FFEZGJB5","target":"record","payload":{"canonical_record":{"source":{"id":"1708.08909","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-08-29T17:51:14Z","cross_cats_sorted":[],"title_canon_sha256":"9a7a7cb1c5ac1fa8fdb113380e0d82b4ff96aebfeda01ad86850e207867bc675","abstract_canon_sha256":"8c35f7b9ed182cc0a2b107c20afc2cbad9a17c92a4c45e672f1a356697eeb083"},"schema_version":"1.0"},"canonical_sha256":"72465d5506170c9ea4cea78a5264c90f7ac46e79b55f7c1b64be8f02da2371dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:52.990257Z","signature_b64":"w9Pol++SaLuSasjkNLgx82heFu+I/1Xyaw5VWJqgpOMjNLP9VVDVVTeebHCd/1mhncXXi1N05Zipou3IAER9CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72465d5506170c9ea4cea78a5264c90f7ac46e79b55f7c1b64be8f02da2371dc","last_reissued_at":"2026-05-18T00:09:52.989708Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:52.989708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.08909","source_version":3,"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-18T00:09:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qByjSovxneaUbR5pyXAtewI2atvronuIIe9BLQl7bkHfUgvfjzbBXhMOTEwdVK42E+S+tH3/4xgOhgO42laTCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T06:28:45.290895Z"},"content_sha256":"3bd4f0ca6ec9fd666f7c13fd3fd5414bf643e8189a763ecafdb73ad4ac1079cc","schema_version":"1.0","event_id":"sha256:3bd4f0ca6ec9fd666f7c13fd3fd5414bf643e8189a763ecafdb73ad4ac1079cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OJDF2VIGC4GJ5JGOU6FFEZGJB5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum compiling with diffusive sets of gates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"A. Mandilara, V. M. Akulin, Y. Zhiyenbayev","submitted_at":"2017-08-29T17:51:14Z","abstract_excerpt":"Given a set of quantum gates and a target unitary operation, the most elementary task of quantum compiling is the identification of a sequence of the gates that approximates the target unitary to a determined precision $\\varepsilon$. Solovay-Kitaev theorem provides an elegant solution which is based on the construction of successively tighter `nets' around the unity comprised by successively longer sequences of gates. The procedure for the construction of the nets, according to this theorem, requires accessibility to the inverse of the gates as well. In this work, we propose a method for const"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.08909","kind":"arxiv","version":3},"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-18T00:09:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iOcLwkgxvwKR/XzuH/R711QT8zDFEvL17FPmnMhGNBxURBiVVOmTYPBIPivrbD9MMIYY2Ou/WTi72GzzKKXXAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T06:28:45.291239Z"},"content_sha256":"3080c203d22218350f308b54e49f6151ad641a7d865eb2c802cc930030bd3572","schema_version":"1.0","event_id":"sha256:3080c203d22218350f308b54e49f6151ad641a7d865eb2c802cc930030bd3572"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OJDF2VIGC4GJ5JGOU6FFEZGJB5/bundle.json","state_url":"https://pith.science/pith/OJDF2VIGC4GJ5JGOU6FFEZGJB5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OJDF2VIGC4GJ5JGOU6FFEZGJB5/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-07-03T06:28:45Z","links":{"resolver":"https://pith.science/pith/OJDF2VIGC4GJ5JGOU6FFEZGJB5","bundle":"https://pith.science/pith/OJDF2VIGC4GJ5JGOU6FFEZGJB5/bundle.json","state":"https://pith.science/pith/OJDF2VIGC4GJ5JGOU6FFEZGJB5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OJDF2VIGC4GJ5JGOU6FFEZGJB5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OJDF2VIGC4GJ5JGOU6FFEZGJB5","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":"8c35f7b9ed182cc0a2b107c20afc2cbad9a17c92a4c45e672f1a356697eeb083","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-08-29T17:51:14Z","title_canon_sha256":"9a7a7cb1c5ac1fa8fdb113380e0d82b4ff96aebfeda01ad86850e207867bc675"},"schema_version":"1.0","source":{"id":"1708.08909","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.08909","created_at":"2026-05-18T00:09:52Z"},{"alias_kind":"arxiv_version","alias_value":"1708.08909v3","created_at":"2026-05-18T00:09:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.08909","created_at":"2026-05-18T00:09:52Z"},{"alias_kind":"pith_short_12","alias_value":"OJDF2VIGC4GJ","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OJDF2VIGC4GJ5JGO","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OJDF2VIG","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:3080c203d22218350f308b54e49f6151ad641a7d865eb2c802cc930030bd3572","target":"graph","created_at":"2026-05-18T00:09:52Z","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":"Given a set of quantum gates and a target unitary operation, the most elementary task of quantum compiling is the identification of a sequence of the gates that approximates the target unitary to a determined precision $\\varepsilon$. Solovay-Kitaev theorem provides an elegant solution which is based on the construction of successively tighter `nets' around the unity comprised by successively longer sequences of gates. The procedure for the construction of the nets, according to this theorem, requires accessibility to the inverse of the gates as well. In this work, we propose a method for const","authors_text":"A. Mandilara, V. M. Akulin, Y. Zhiyenbayev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-08-29T17:51:14Z","title":"Quantum compiling with diffusive sets of gates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.08909","kind":"arxiv","version":3},"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:3bd4f0ca6ec9fd666f7c13fd3fd5414bf643e8189a763ecafdb73ad4ac1079cc","target":"record","created_at":"2026-05-18T00:09:52Z","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":"8c35f7b9ed182cc0a2b107c20afc2cbad9a17c92a4c45e672f1a356697eeb083","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-08-29T17:51:14Z","title_canon_sha256":"9a7a7cb1c5ac1fa8fdb113380e0d82b4ff96aebfeda01ad86850e207867bc675"},"schema_version":"1.0","source":{"id":"1708.08909","kind":"arxiv","version":3}},"canonical_sha256":"72465d5506170c9ea4cea78a5264c90f7ac46e79b55f7c1b64be8f02da2371dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"72465d5506170c9ea4cea78a5264c90f7ac46e79b55f7c1b64be8f02da2371dc","first_computed_at":"2026-05-18T00:09:52.989708Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:52.989708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w9Pol++SaLuSasjkNLgx82heFu+I/1Xyaw5VWJqgpOMjNLP9VVDVVTeebHCd/1mhncXXi1N05Zipou3IAER9CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:52.990257Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.08909","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3bd4f0ca6ec9fd666f7c13fd3fd5414bf643e8189a763ecafdb73ad4ac1079cc","sha256:3080c203d22218350f308b54e49f6151ad641a7d865eb2c802cc930030bd3572"],"state_sha256":"d144b4d824610532b6c39289b31521065d3be2b7f9959411f05ba96a6e9593c6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fYlJlZm5IUMLnPZTMTvzFa1mCb9EugaUALJ0mjfLxKMPWe8Fmaw0Pm3od4svHg/Hx2nmizIo9Y22GZrg+pVaCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T06:28:45.293218Z","bundle_sha256":"b7ba3fa02647a3d7ce6b30f077be6d0cba0de1c97f6b0edc233fc6a0581f15d4"}}