{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ERAP3LFNVH6DAER47FGHO63RUE","short_pith_number":"pith:ERAP3LFN","canonical_record":{"source":{"id":"1906.06400","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-06-14T20:57:45Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"2a79b32151353c739d898bef40cd195e6b771443ed61c3bb80a82c4ebdcc4910","abstract_canon_sha256":"f90bf39e9a9b834c27d1b78e899ae726f7b03dc96a16cb6830bf9e4653fbee34"},"schema_version":"1.0"},"canonical_sha256":"2440fdacada9fc30123cf94c777b71a128aec168f54fa62646c4b45b2060c8ae","source":{"kind":"arxiv","id":"1906.06400","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.06400","created_at":"2026-05-17T23:43:13Z"},{"alias_kind":"arxiv_version","alias_value":"1906.06400v1","created_at":"2026-05-17T23:43:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.06400","created_at":"2026-05-17T23:43:13Z"},{"alias_kind":"pith_short_12","alias_value":"ERAP3LFNVH6D","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"ERAP3LFNVH6DAER4","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"ERAP3LFN","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ERAP3LFNVH6DAER47FGHO63RUE","target":"record","payload":{"canonical_record":{"source":{"id":"1906.06400","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-06-14T20:57:45Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"2a79b32151353c739d898bef40cd195e6b771443ed61c3bb80a82c4ebdcc4910","abstract_canon_sha256":"f90bf39e9a9b834c27d1b78e899ae726f7b03dc96a16cb6830bf9e4653fbee34"},"schema_version":"1.0"},"canonical_sha256":"2440fdacada9fc30123cf94c777b71a128aec168f54fa62646c4b45b2060c8ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:13.811923Z","signature_b64":"VdhCloLcTvmvJbTfaAjSxuDpKtRqbB+eSDuVPJNxqlrBmWnQ9mGWYzGSPw8LTBQ3MD6A/xZaFvXc3vOrepMrDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2440fdacada9fc30123cf94c777b71a128aec168f54fa62646c4b45b2060c8ae","last_reissued_at":"2026-05-17T23:43:13.811496Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:13.811496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.06400","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-05-17T23:43:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MRj/YKjZvNn7G/e/qxDuPiDVRYHcel+ukYIWYFCn1bWFTG9ol0ed+dahBtm9dOJTvyTEsPW+7gHVxb8HVKtFDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:37:16.486081Z"},"content_sha256":"59b6e17d3d9b3dd60a730f838344f81e1078953e8f097e0384983413e795940f","schema_version":"1.0","event_id":"sha256:59b6e17d3d9b3dd60a730f838344f81e1078953e8f097e0384983413e795940f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ERAP3LFNVH6DAER47FGHO63RUE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Clifford Gate Optimisation and T Gate Scheduling: Using Queueing Models for Topological Assemblies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Alexandru Paler, Robert Basmadjian","submitted_at":"2019-06-14T20:57:45Z","abstract_excerpt":"Clifford gates play a role in the optimisation of Clifford+T circuits. Reducing the count and the depth of Clifford gates, as well as the optimal scheduling of T gates, influence the hardware and the time costs of executing quantum circuits. This work focuses on circuits protected by the surface quantum error-correcting code. The result of compiling a quantum circuit for the surface code is called a topological assembly. We use queuing theory to model a part of the compiled assemblies, evaluate the models, and make the empiric observation that at least for certain Clifford+T circuits (e.g. add"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.06400","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":""},"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-17T23:43:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XX8vaQNM9wuOucR8EHy5ksd2/frfDKOPmlZjDylgCnuyakHTVUcR1L0MshG5Kd3nHlIBaWhoTQ1TxfKRUFFiCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:37:16.486444Z"},"content_sha256":"a55d6017691ae1607c9d768e4baed2a5be6b24e56e08b6bfbf9537a5cb4ecbbb","schema_version":"1.0","event_id":"sha256:a55d6017691ae1607c9d768e4baed2a5be6b24e56e08b6bfbf9537a5cb4ecbbb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ERAP3LFNVH6DAER47FGHO63RUE/bundle.json","state_url":"https://pith.science/pith/ERAP3LFNVH6DAER47FGHO63RUE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ERAP3LFNVH6DAER47FGHO63RUE/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-06-08T14:37:16Z","links":{"resolver":"https://pith.science/pith/ERAP3LFNVH6DAER47FGHO63RUE","bundle":"https://pith.science/pith/ERAP3LFNVH6DAER47FGHO63RUE/bundle.json","state":"https://pith.science/pith/ERAP3LFNVH6DAER47FGHO63RUE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ERAP3LFNVH6DAER47FGHO63RUE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ERAP3LFNVH6DAER47FGHO63RUE","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":"f90bf39e9a9b834c27d1b78e899ae726f7b03dc96a16cb6830bf9e4653fbee34","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-06-14T20:57:45Z","title_canon_sha256":"2a79b32151353c739d898bef40cd195e6b771443ed61c3bb80a82c4ebdcc4910"},"schema_version":"1.0","source":{"id":"1906.06400","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.06400","created_at":"2026-05-17T23:43:13Z"},{"alias_kind":"arxiv_version","alias_value":"1906.06400v1","created_at":"2026-05-17T23:43:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.06400","created_at":"2026-05-17T23:43:13Z"},{"alias_kind":"pith_short_12","alias_value":"ERAP3LFNVH6D","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"ERAP3LFNVH6DAER4","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"ERAP3LFN","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:a55d6017691ae1607c9d768e4baed2a5be6b24e56e08b6bfbf9537a5cb4ecbbb","target":"graph","created_at":"2026-05-17T23:43:13Z","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":"Clifford gates play a role in the optimisation of Clifford+T circuits. Reducing the count and the depth of Clifford gates, as well as the optimal scheduling of T gates, influence the hardware and the time costs of executing quantum circuits. This work focuses on circuits protected by the surface quantum error-correcting code. The result of compiling a quantum circuit for the surface code is called a topological assembly. We use queuing theory to model a part of the compiled assemblies, evaluate the models, and make the empiric observation that at least for certain Clifford+T circuits (e.g. add","authors_text":"Alexandru Paler, Robert Basmadjian","cross_cats":["cs.ET"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-06-14T20:57:45Z","title":"Clifford Gate Optimisation and T Gate Scheduling: Using Queueing Models for Topological Assemblies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.06400","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:59b6e17d3d9b3dd60a730f838344f81e1078953e8f097e0384983413e795940f","target":"record","created_at":"2026-05-17T23:43:13Z","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":"f90bf39e9a9b834c27d1b78e899ae726f7b03dc96a16cb6830bf9e4653fbee34","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-06-14T20:57:45Z","title_canon_sha256":"2a79b32151353c739d898bef40cd195e6b771443ed61c3bb80a82c4ebdcc4910"},"schema_version":"1.0","source":{"id":"1906.06400","kind":"arxiv","version":1}},"canonical_sha256":"2440fdacada9fc30123cf94c777b71a128aec168f54fa62646c4b45b2060c8ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2440fdacada9fc30123cf94c777b71a128aec168f54fa62646c4b45b2060c8ae","first_computed_at":"2026-05-17T23:43:13.811496Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:13.811496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VdhCloLcTvmvJbTfaAjSxuDpKtRqbB+eSDuVPJNxqlrBmWnQ9mGWYzGSPw8LTBQ3MD6A/xZaFvXc3vOrepMrDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:13.811923Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.06400","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59b6e17d3d9b3dd60a730f838344f81e1078953e8f097e0384983413e795940f","sha256:a55d6017691ae1607c9d768e4baed2a5be6b24e56e08b6bfbf9537a5cb4ecbbb"],"state_sha256":"0e656b9461dddc45fada773be6a105c669106ca9f64c8ae01a4175a50dbde9ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3wfSz39Nb/92og2KdFnsWSuT8tAyYAzlmlEWObdtS684LMrGI16XyHA8n8qKAHX3IH/Jm97pJAiKft+BvYWfCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T14:37:16.489172Z","bundle_sha256":"28d896bec46a3d8ccee33da1902563458ddfd04574ecd7563c64c75891fca362"}}