{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4PICGFKSENETLPUHHU546E5BWF","short_pith_number":"pith:4PICGFKS","canonical_record":{"source":{"id":"1712.01557","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-12-05T10:19:30Z","cross_cats_sorted":[],"title_canon_sha256":"4d9bfe3e41a5ae27bbcefd116cc2f8fd1376a0496a083fd03049cc8e687fc7c7","abstract_canon_sha256":"5d88d7b6d59d2eb373b7876f991da8eb56065afd3ad323d0e985f26f5e25624e"},"schema_version":"1.0"},"canonical_sha256":"e3d0231552234935be873d3bcf13a1b16c193e789698abde762a6ccecfeac2c3","source":{"kind":"arxiv","id":"1712.01557","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.01557","created_at":"2026-05-18T00:14:00Z"},{"alias_kind":"arxiv_version","alias_value":"1712.01557v3","created_at":"2026-05-18T00:14:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01557","created_at":"2026-05-18T00:14:00Z"},{"alias_kind":"pith_short_12","alias_value":"4PICGFKSENET","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4PICGFKSENETLPUH","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4PICGFKS","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4PICGFKSENETLPUHHU546E5BWF","target":"record","payload":{"canonical_record":{"source":{"id":"1712.01557","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-12-05T10:19:30Z","cross_cats_sorted":[],"title_canon_sha256":"4d9bfe3e41a5ae27bbcefd116cc2f8fd1376a0496a083fd03049cc8e687fc7c7","abstract_canon_sha256":"5d88d7b6d59d2eb373b7876f991da8eb56065afd3ad323d0e985f26f5e25624e"},"schema_version":"1.0"},"canonical_sha256":"e3d0231552234935be873d3bcf13a1b16c193e789698abde762a6ccecfeac2c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:00.563199Z","signature_b64":"siX5o/kdxNG/TIpYd6RsIFV0qd12aseeC3v+Gr91a04TYhwwOapyZhF1AfGL6MNeGRAEdL8TmeaiUNlTV8T3Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3d0231552234935be873d3bcf13a1b16c193e789698abde762a6ccecfeac2c3","last_reissued_at":"2026-05-18T00:14:00.562360Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:00.562360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.01557","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:14:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fMIsNwsGmcg6YdLwilM4mAd1p/G0U2WGqW0JtGc7IbA0myhPUAVc3s5NEkHo9u6VVZ202ENNApUhf4H31DnUAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:15:14.223853Z"},"content_sha256":"c8000c2f179391e9ddee955f358a34749dd76ca200667eaffcd5d96cfcf232ff","schema_version":"1.0","event_id":"sha256:c8000c2f179391e9ddee955f358a34749dd76ca200667eaffcd5d96cfcf232ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4PICGFKSENETLPUHHU546E5BWF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Quantum Compiler that reduces $T$ count","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Earl T. Campbell, Luke Heyfron","submitted_at":"2017-12-05T10:19:30Z","abstract_excerpt":"Before executing a quantum algorithm, one must first decompose the algorithm into machine-level instructions compatible with the architecture of the quantum computer, a process known as quantum compiling. There are many different quantum circuit decompositions for the same algorithm but it is desirable to compile leaner circuits. A fundamentally important cost metric is the $T$ count -- the number of $T$ gates in a circuit. For the single qubit case, optimal compiling is essentially a solved problem. However, multi-qubit compiling is a harder problem with optimal algorithms requiring classical"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01557","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:14:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6S4Tt57bHOxmIUNRbC/cBwWFn/F48X7dyQsI748vZdQh3cDnmB2k/hP2vqeztD0lhUoRO51JwxplOWNX4ZTgAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:15:14.224521Z"},"content_sha256":"1f9e18a8fcbff867c583e8a83b87f745e09f629d348a13194f6960e245319ce2","schema_version":"1.0","event_id":"sha256:1f9e18a8fcbff867c583e8a83b87f745e09f629d348a13194f6960e245319ce2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4PICGFKSENETLPUHHU546E5BWF/bundle.json","state_url":"https://pith.science/pith/4PICGFKSENETLPUHHU546E5BWF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4PICGFKSENETLPUHHU546E5BWF/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-05-28T19:15:14Z","links":{"resolver":"https://pith.science/pith/4PICGFKSENETLPUHHU546E5BWF","bundle":"https://pith.science/pith/4PICGFKSENETLPUHHU546E5BWF/bundle.json","state":"https://pith.science/pith/4PICGFKSENETLPUHHU546E5BWF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4PICGFKSENETLPUHHU546E5BWF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4PICGFKSENETLPUHHU546E5BWF","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":"5d88d7b6d59d2eb373b7876f991da8eb56065afd3ad323d0e985f26f5e25624e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-12-05T10:19:30Z","title_canon_sha256":"4d9bfe3e41a5ae27bbcefd116cc2f8fd1376a0496a083fd03049cc8e687fc7c7"},"schema_version":"1.0","source":{"id":"1712.01557","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.01557","created_at":"2026-05-18T00:14:00Z"},{"alias_kind":"arxiv_version","alias_value":"1712.01557v3","created_at":"2026-05-18T00:14:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01557","created_at":"2026-05-18T00:14:00Z"},{"alias_kind":"pith_short_12","alias_value":"4PICGFKSENET","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4PICGFKSENETLPUH","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4PICGFKS","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:1f9e18a8fcbff867c583e8a83b87f745e09f629d348a13194f6960e245319ce2","target":"graph","created_at":"2026-05-18T00:14:00Z","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":"Before executing a quantum algorithm, one must first decompose the algorithm into machine-level instructions compatible with the architecture of the quantum computer, a process known as quantum compiling. There are many different quantum circuit decompositions for the same algorithm but it is desirable to compile leaner circuits. A fundamentally important cost metric is the $T$ count -- the number of $T$ gates in a circuit. For the single qubit case, optimal compiling is essentially a solved problem. However, multi-qubit compiling is a harder problem with optimal algorithms requiring classical","authors_text":"Earl T. Campbell, Luke Heyfron","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-12-05T10:19:30Z","title":"An Efficient Quantum Compiler that reduces $T$ count"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01557","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:c8000c2f179391e9ddee955f358a34749dd76ca200667eaffcd5d96cfcf232ff","target":"record","created_at":"2026-05-18T00:14:00Z","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":"5d88d7b6d59d2eb373b7876f991da8eb56065afd3ad323d0e985f26f5e25624e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-12-05T10:19:30Z","title_canon_sha256":"4d9bfe3e41a5ae27bbcefd116cc2f8fd1376a0496a083fd03049cc8e687fc7c7"},"schema_version":"1.0","source":{"id":"1712.01557","kind":"arxiv","version":3}},"canonical_sha256":"e3d0231552234935be873d3bcf13a1b16c193e789698abde762a6ccecfeac2c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3d0231552234935be873d3bcf13a1b16c193e789698abde762a6ccecfeac2c3","first_computed_at":"2026-05-18T00:14:00.562360Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:00.562360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"siX5o/kdxNG/TIpYd6RsIFV0qd12aseeC3v+Gr91a04TYhwwOapyZhF1AfGL6MNeGRAEdL8TmeaiUNlTV8T3Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:00.563199Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.01557","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c8000c2f179391e9ddee955f358a34749dd76ca200667eaffcd5d96cfcf232ff","sha256:1f9e18a8fcbff867c583e8a83b87f745e09f629d348a13194f6960e245319ce2"],"state_sha256":"14d2ac311ad9483ff8970556abd1866f99bc3dd21c4953a164596273651e3b06"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N76z4DxLaC7oBXkGszM180zDUN7Gh2gD7Hi1ptCDMe7DmgnQpFSs3fec8OvZ+SAeATdnZXAa5stxL1G5Kb/TCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T19:15:14.228054Z","bundle_sha256":"37afccca72ae5c08024ea8630fe0d582ec89b96ece9286ec776f1f21e89488da"}}