{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:FHILOSSFPFS3E6HUBSB2BB2P2U","short_pith_number":"pith:FHILOSSF","canonical_record":{"source":{"id":"2305.01674","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-05-02T18:00:00Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"0797b260951520aec989fd3e61333c5bbf8c9418fd8769fa7ebe63d430676a2f","abstract_canon_sha256":"6cf1a73fa47b916347d72b0cb049c2e76adbb7622a640081cf1a8f5520374d26"},"schema_version":"1.0"},"canonical_sha256":"29d0b74a457965b278f40c83a0874fd5059415254c0272ae72e794b6465739ec","source":{"kind":"arxiv","id":"2305.01674","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.01674","created_at":"2026-07-05T06:16:50Z"},{"alias_kind":"arxiv_version","alias_value":"2305.01674v2","created_at":"2026-07-05T06:16:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.01674","created_at":"2026-07-05T06:16:50Z"},{"alias_kind":"pith_short_12","alias_value":"FHILOSSFPFS3","created_at":"2026-07-05T06:16:50Z"},{"alias_kind":"pith_short_16","alias_value":"FHILOSSFPFS3E6HU","created_at":"2026-07-05T06:16:50Z"},{"alias_kind":"pith_short_8","alias_value":"FHILOSSF","created_at":"2026-07-05T06:16:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:FHILOSSFPFS3E6HUBSB2BB2P2U","target":"record","payload":{"canonical_record":{"source":{"id":"2305.01674","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-05-02T18:00:00Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"0797b260951520aec989fd3e61333c5bbf8c9418fd8769fa7ebe63d430676a2f","abstract_canon_sha256":"6cf1a73fa47b916347d72b0cb049c2e76adbb7622a640081cf1a8f5520374d26"},"schema_version":"1.0"},"canonical_sha256":"29d0b74a457965b278f40c83a0874fd5059415254c0272ae72e794b6465739ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:16:50.068857Z","signature_b64":"YzB99Pd3o1Dc7EAXzXGxL8U4LOMQoPOTzydoDCZduJ/WG8QPk+eZjOvuw9EQ7hQ3NZ3gG/DBqOO591PcIlAfAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29d0b74a457965b278f40c83a0874fd5059415254c0272ae72e794b6465739ec","last_reissued_at":"2026-07-05T06:16:50.068458Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:16:50.068458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2305.01674","source_version":2,"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-05T06:16:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A4vBQbF0Q6ALqVaECrnxZOnzUCVu87sDjSp6PfP+4qZLlldTaPDj7AwT84Za3tw7x0b9LJEgd97okMfjr+MdBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T03:52:34.026215Z"},"content_sha256":"e4585dabf26846918b36fc8ab2aa23ed7a37bad6127aefb89f7dd95a11ff3dc2","schema_version":"1.0","event_id":"sha256:e4585dabf26846918b36fc8ab2aa23ed7a37bad6127aefb89f7dd95a11ff3dc2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:FHILOSSFPFS3E6HUBSB2BB2P2U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Depth-Optimal Synthesis of Clifford Circuits with SAT Solvers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Lukas Burgholzer, Nina Brandl, Richard Kueng, Robert Wille, Tom Peham","submitted_at":"2023-05-02T18:00:00Z","abstract_excerpt":"Circuit synthesis is the task of decomposing a given logical functionality into a sequence of elementary gates. It is (depth-)optimal if it is impossible to achieve the desired functionality with even shorter circuits. Optimal synthesis is a central problem in both quantum and classical hardware design, but also plagued by complexity-theoretic obstacles. Motivated by fault-tolerant quantum computation, we consider the special case of synthesizing blocks of Clifford unitaries. Leveraging entangling input stimuli and the stabilizer formalism allows us to reduce the Clifford synthesis problem to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.01674","kind":"arxiv","version":2},"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/2305.01674/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-05T06:16:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WuydJQKM6KSEl+ZFJDXtJDzqWpS7zJ2RiUYnBOnw+V0dpF8rmCsd/tqRXyHDm7Wk7jDL58pia8eD1f439AM8CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T03:52:34.026602Z"},"content_sha256":"8361c35e3c311a5c0e4d37152871de8f5745c1c23689d039fea108becbbfd09c","schema_version":"1.0","event_id":"sha256:8361c35e3c311a5c0e4d37152871de8f5745c1c23689d039fea108becbbfd09c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FHILOSSFPFS3E6HUBSB2BB2P2U/bundle.json","state_url":"https://pith.science/pith/FHILOSSFPFS3E6HUBSB2BB2P2U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FHILOSSFPFS3E6HUBSB2BB2P2U/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-09T03:52:34Z","links":{"resolver":"https://pith.science/pith/FHILOSSFPFS3E6HUBSB2BB2P2U","bundle":"https://pith.science/pith/FHILOSSFPFS3E6HUBSB2BB2P2U/bundle.json","state":"https://pith.science/pith/FHILOSSFPFS3E6HUBSB2BB2P2U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FHILOSSFPFS3E6HUBSB2BB2P2U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:FHILOSSFPFS3E6HUBSB2BB2P2U","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":"6cf1a73fa47b916347d72b0cb049c2e76adbb7622a640081cf1a8f5520374d26","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-05-02T18:00:00Z","title_canon_sha256":"0797b260951520aec989fd3e61333c5bbf8c9418fd8769fa7ebe63d430676a2f"},"schema_version":"1.0","source":{"id":"2305.01674","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.01674","created_at":"2026-07-05T06:16:50Z"},{"alias_kind":"arxiv_version","alias_value":"2305.01674v2","created_at":"2026-07-05T06:16:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.01674","created_at":"2026-07-05T06:16:50Z"},{"alias_kind":"pith_short_12","alias_value":"FHILOSSFPFS3","created_at":"2026-07-05T06:16:50Z"},{"alias_kind":"pith_short_16","alias_value":"FHILOSSFPFS3E6HU","created_at":"2026-07-05T06:16:50Z"},{"alias_kind":"pith_short_8","alias_value":"FHILOSSF","created_at":"2026-07-05T06:16:50Z"}],"graph_snapshots":[{"event_id":"sha256:8361c35e3c311a5c0e4d37152871de8f5745c1c23689d039fea108becbbfd09c","target":"graph","created_at":"2026-07-05T06:16:50Z","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/2305.01674/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Circuit synthesis is the task of decomposing a given logical functionality into a sequence of elementary gates. It is (depth-)optimal if it is impossible to achieve the desired functionality with even shorter circuits. Optimal synthesis is a central problem in both quantum and classical hardware design, but also plagued by complexity-theoretic obstacles. Motivated by fault-tolerant quantum computation, we consider the special case of synthesizing blocks of Clifford unitaries. Leveraging entangling input stimuli and the stabilizer formalism allows us to reduce the Clifford synthesis problem to ","authors_text":"Lukas Burgholzer, Nina Brandl, Richard Kueng, Robert Wille, Tom Peham","cross_cats":["cs.ET"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-05-02T18:00:00Z","title":"Depth-Optimal Synthesis of Clifford Circuits with SAT Solvers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.01674","kind":"arxiv","version":2},"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:e4585dabf26846918b36fc8ab2aa23ed7a37bad6127aefb89f7dd95a11ff3dc2","target":"record","created_at":"2026-07-05T06:16:50Z","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":"6cf1a73fa47b916347d72b0cb049c2e76adbb7622a640081cf1a8f5520374d26","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-05-02T18:00:00Z","title_canon_sha256":"0797b260951520aec989fd3e61333c5bbf8c9418fd8769fa7ebe63d430676a2f"},"schema_version":"1.0","source":{"id":"2305.01674","kind":"arxiv","version":2}},"canonical_sha256":"29d0b74a457965b278f40c83a0874fd5059415254c0272ae72e794b6465739ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29d0b74a457965b278f40c83a0874fd5059415254c0272ae72e794b6465739ec","first_computed_at":"2026-07-05T06:16:50.068458Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:16:50.068458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YzB99Pd3o1Dc7EAXzXGxL8U4LOMQoPOTzydoDCZduJ/WG8QPk+eZjOvuw9EQ7hQ3NZ3gG/DBqOO591PcIlAfAg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:16:50.068857Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.01674","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4585dabf26846918b36fc8ab2aa23ed7a37bad6127aefb89f7dd95a11ff3dc2","sha256:8361c35e3c311a5c0e4d37152871de8f5745c1c23689d039fea108becbbfd09c"],"state_sha256":"7b6a90bb4a8ab47b5d2bcfe5f9632cb0506a2266f713d15b791192d7a44d1f41"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Azrp74fd6cafmY0W/5daXRutLwZKyc5OQuWTt8iAunXgKo110Zx2Xf85AyxJx/EPDf+FZAHZxYINhhcfAd9jCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T03:52:34.028751Z","bundle_sha256":"8b98482e1485a76326cf59228bfdca3dfaccb92b4bd0a5f25562e65b0f97b65c"}}