{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:FEWZIWVJX7IKICPGGUP4AGPLKE","short_pith_number":"pith:FEWZIWVJ","canonical_record":{"source":{"id":"1308.4134","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-08-19T20:00:01Z","cross_cats_sorted":[],"title_canon_sha256":"e5b2f71f02e5763b7d2baac5fc878c277b7d3acce78f317fe194ed50d8b4dcb3","abstract_canon_sha256":"34b01ee3df3f3163564684df6dee914a41f94dc64371c749a6bd56cd08d5386e"},"schema_version":"1.0"},"canonical_sha256":"292d945aa9bfd0a409e6351fc019eb513efa0c292c5a410533676d5c8163857e","source":{"kind":"arxiv","id":"1308.4134","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.4134","created_at":"2026-05-18T03:15:33Z"},{"alias_kind":"arxiv_version","alias_value":"1308.4134v1","created_at":"2026-05-18T03:15:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4134","created_at":"2026-05-18T03:15:33Z"},{"alias_kind":"pith_short_12","alias_value":"FEWZIWVJX7IK","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FEWZIWVJX7IKICPG","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FEWZIWVJ","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:FEWZIWVJX7IKICPGGUP4AGPLKE","target":"record","payload":{"canonical_record":{"source":{"id":"1308.4134","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-08-19T20:00:01Z","cross_cats_sorted":[],"title_canon_sha256":"e5b2f71f02e5763b7d2baac5fc878c277b7d3acce78f317fe194ed50d8b4dcb3","abstract_canon_sha256":"34b01ee3df3f3163564684df6dee914a41f94dc64371c749a6bd56cd08d5386e"},"schema_version":"1.0"},"canonical_sha256":"292d945aa9bfd0a409e6351fc019eb513efa0c292c5a410533676d5c8163857e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:33.612893Z","signature_b64":"bjsgqfBgPxvjhkhgAT3pK2ZaP0OUb44xNf2xSbyw1b4sT0Z/qsV+E1YeF4XPPUCfUrhGV+uUg6Tce1JMM78JDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"292d945aa9bfd0a409e6351fc019eb513efa0c292c5a410533676d5c8163857e","last_reissued_at":"2026-05-18T03:15:33.612014Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:33.612014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.4134","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-18T03:15:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WXeExg8XaeweGUtNwYxShF9erm8tdHr236RC+WklBDZi65CYTSCKYxSN2cC2vln9vy59ZvGs4IA3Vh9Of/GCAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:34:03.520544Z"},"content_sha256":"bbf9e9e7adfeaffc26e51acff73951d841fa50902ddd66b93660367713b28443","schema_version":"1.0","event_id":"sha256:bbf9e9e7adfeaffc26e51acff73951d841fa50902ddd66b93660367713b28443"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:FEWZIWVJX7IKICPGGUP4AGPLKE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An algorithm for the T-count","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David Gosset, Michele Mosca, Vadym Kliuchnikov, Vincent Russo","submitted_at":"2013-08-19T20:00:01Z","abstract_excerpt":"We consider quantum circuits composed of Clifford and T gates. In this context the T gate has a special status since it confers universal computation when added to the (classically simulable) Clifford gates. However it can be very expensive to implement fault-tolerantly. We therefore view this gate as a resource which should be used only when necessary. Given an n-qubit unitary U we are interested in computing a circuit that implements it using the minimum possible number of T gates (called the T-count of U). A related task is to decide if the T-count of U is less than or equal to m; we consid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.4134","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-18T03:15:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7OyLLkJWz633o4/M8W3Q8JJQLxUI6ncbWYuZHDHSlXIv//qB/APrGv9wSS0p9kfOUmjK9od0CYPjlI4ZdNiWDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:34:03.521194Z"},"content_sha256":"f06ae3009f325317048acbc8e3702b5590b70cf5f35c8e6bb50eb0d11245b28b","schema_version":"1.0","event_id":"sha256:f06ae3009f325317048acbc8e3702b5590b70cf5f35c8e6bb50eb0d11245b28b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FEWZIWVJX7IKICPGGUP4AGPLKE/bundle.json","state_url":"https://pith.science/pith/FEWZIWVJX7IKICPGGUP4AGPLKE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FEWZIWVJX7IKICPGGUP4AGPLKE/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-07T18:34:03Z","links":{"resolver":"https://pith.science/pith/FEWZIWVJX7IKICPGGUP4AGPLKE","bundle":"https://pith.science/pith/FEWZIWVJX7IKICPGGUP4AGPLKE/bundle.json","state":"https://pith.science/pith/FEWZIWVJX7IKICPGGUP4AGPLKE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FEWZIWVJX7IKICPGGUP4AGPLKE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FEWZIWVJX7IKICPGGUP4AGPLKE","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":"34b01ee3df3f3163564684df6dee914a41f94dc64371c749a6bd56cd08d5386e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-08-19T20:00:01Z","title_canon_sha256":"e5b2f71f02e5763b7d2baac5fc878c277b7d3acce78f317fe194ed50d8b4dcb3"},"schema_version":"1.0","source":{"id":"1308.4134","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.4134","created_at":"2026-05-18T03:15:33Z"},{"alias_kind":"arxiv_version","alias_value":"1308.4134v1","created_at":"2026-05-18T03:15:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4134","created_at":"2026-05-18T03:15:33Z"},{"alias_kind":"pith_short_12","alias_value":"FEWZIWVJX7IK","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FEWZIWVJX7IKICPG","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FEWZIWVJ","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:f06ae3009f325317048acbc8e3702b5590b70cf5f35c8e6bb50eb0d11245b28b","target":"graph","created_at":"2026-05-18T03:15:33Z","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 consider quantum circuits composed of Clifford and T gates. In this context the T gate has a special status since it confers universal computation when added to the (classically simulable) Clifford gates. However it can be very expensive to implement fault-tolerantly. We therefore view this gate as a resource which should be used only when necessary. Given an n-qubit unitary U we are interested in computing a circuit that implements it using the minimum possible number of T gates (called the T-count of U). A related task is to decide if the T-count of U is less than or equal to m; we consid","authors_text":"David Gosset, Michele Mosca, Vadym Kliuchnikov, Vincent Russo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-08-19T20:00:01Z","title":"An algorithm for the T-count"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.4134","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:bbf9e9e7adfeaffc26e51acff73951d841fa50902ddd66b93660367713b28443","target":"record","created_at":"2026-05-18T03:15:33Z","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":"34b01ee3df3f3163564684df6dee914a41f94dc64371c749a6bd56cd08d5386e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-08-19T20:00:01Z","title_canon_sha256":"e5b2f71f02e5763b7d2baac5fc878c277b7d3acce78f317fe194ed50d8b4dcb3"},"schema_version":"1.0","source":{"id":"1308.4134","kind":"arxiv","version":1}},"canonical_sha256":"292d945aa9bfd0a409e6351fc019eb513efa0c292c5a410533676d5c8163857e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"292d945aa9bfd0a409e6351fc019eb513efa0c292c5a410533676d5c8163857e","first_computed_at":"2026-05-18T03:15:33.612014Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:33.612014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bjsgqfBgPxvjhkhgAT3pK2ZaP0OUb44xNf2xSbyw1b4sT0Z/qsV+E1YeF4XPPUCfUrhGV+uUg6Tce1JMM78JDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:33.612893Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.4134","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbf9e9e7adfeaffc26e51acff73951d841fa50902ddd66b93660367713b28443","sha256:f06ae3009f325317048acbc8e3702b5590b70cf5f35c8e6bb50eb0d11245b28b"],"state_sha256":"b5673dccfaa4511177bdf1ca48b4ee35f0291e7d72650409b082da63f49ddd34"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lLOBKmuZCcjmvcupQKe9i7oa1vyG4NIKawvcaiHbSnYkYSsbYHMg7Unoivo3F/WI/DQmMYlxn8XlsXxVPkJwAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T18:34:03.524926Z","bundle_sha256":"0540403b50dd232e8f8fd67a998311121d1eedcc4d42686a57b19450aba49134"}}