{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:VTLWFT6II2CUJ64WLVZIKDUW2E","short_pith_number":"pith:VTLWFT6I","canonical_record":{"source":{"id":"2504.00634","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-01T10:35:58Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"bca6f2311afd427ce92f252c21e6be1265f08869d5c37f5812dcbc2f97ffb4c6","abstract_canon_sha256":"d33c86a4f3ee820ef5c21ffbef7679785ed027e7fcaa3c906e22ca1ab93329dd"},"schema_version":"1.0"},"canonical_sha256":"acd762cfc8468544fb965d72850e96d11dfcbbc824644ce4221e2c4d9bc257ed","source":{"kind":"arxiv","id":"2504.00634","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.00634","created_at":"2026-07-05T10:42:47Z"},{"alias_kind":"arxiv_version","alias_value":"2504.00634v1","created_at":"2026-07-05T10:42:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.00634","created_at":"2026-07-05T10:42:47Z"},{"alias_kind":"pith_short_12","alias_value":"VTLWFT6II2CU","created_at":"2026-07-05T10:42:47Z"},{"alias_kind":"pith_short_16","alias_value":"VTLWFT6II2CUJ64W","created_at":"2026-07-05T10:42:47Z"},{"alias_kind":"pith_short_8","alias_value":"VTLWFT6I","created_at":"2026-07-05T10:42:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:VTLWFT6II2CUJ64WLVZIKDUW2E","target":"record","payload":{"canonical_record":{"source":{"id":"2504.00634","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-01T10:35:58Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"bca6f2311afd427ce92f252c21e6be1265f08869d5c37f5812dcbc2f97ffb4c6","abstract_canon_sha256":"d33c86a4f3ee820ef5c21ffbef7679785ed027e7fcaa3c906e22ca1ab93329dd"},"schema_version":"1.0"},"canonical_sha256":"acd762cfc8468544fb965d72850e96d11dfcbbc824644ce4221e2c4d9bc257ed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:42:47.871757Z","signature_b64":"Wz18uJeLmFkaB6Dnl54l5/PvE/xxRn2Tm6iGFn/nAUTpKms8UxW14V8UH4Yb9aC33gdNf5PxTjJCgmtBgM1NDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acd762cfc8468544fb965d72850e96d11dfcbbc824644ce4221e2c4d9bc257ed","last_reissued_at":"2026-07-05T10:42:47.871270Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:42:47.871270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.00634","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-07-05T10:42:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CcvasdYTpBv8ndrw76AEJIlK8TRS3CJxYWipMLySNzNkBUNHv5/rdECeOwxXB5f/gbJFNRt555ju7IMp2TbDCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T11:33:40.257825Z"},"content_sha256":"1abe3b8eba2b630d0718add59430c8d39300e94d0fe7a57a17fa5dbda1e1a252","schema_version":"1.0","event_id":"sha256:1abe3b8eba2b630d0718add59430c8d39300e94d0fe7a57a17fa5dbda1e1a252"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:VTLWFT6II2CUJ64WLVZIKDUW2E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"CNOT-Optimal Clifford Synthesis as SAT","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"quant-ph","authors_text":"Irfansha Shaik, Jaco van de Pol","submitted_at":"2025-04-01T10:35:58Z","abstract_excerpt":"Clifford circuit optimization is an important step in the quantum compilation pipeline. Major compilers employ heuristic approaches. While they are fast, their results are often suboptimal. Minimization of noisy gates, like 2-qubit CNOT gates, is crucial for practical computing. Exact approaches have been proposed to fill the gap left by heuristic approaches. Among these are SAT based approaches that optimize gate count or depth, but they suffer from scalability issues. Further, they do not guarantee optimality on more important metrics like CNOT count or CNOT depth. A recent work proposed an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.00634","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.00634/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-05T10:42:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bfq9nYIhGVNr5LJI7zRr5DypoFSjp+UI5HHhTI6qX2rmNEgp+6k9pX4PVyQhf/EaJLhtJedXAbzI1tMehTGeBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T11:33:40.258362Z"},"content_sha256":"ff101724a6759940de71db79d69eaca631dd265bf0f332fc7f3d934fd6000176","schema_version":"1.0","event_id":"sha256:ff101724a6759940de71db79d69eaca631dd265bf0f332fc7f3d934fd6000176"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VTLWFT6II2CUJ64WLVZIKDUW2E/bundle.json","state_url":"https://pith.science/pith/VTLWFT6II2CUJ64WLVZIKDUW2E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VTLWFT6II2CUJ64WLVZIKDUW2E/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-08-15T11:33:40Z","links":{"resolver":"https://pith.science/pith/VTLWFT6II2CUJ64WLVZIKDUW2E","bundle":"https://pith.science/pith/VTLWFT6II2CUJ64WLVZIKDUW2E/bundle.json","state":"https://pith.science/pith/VTLWFT6II2CUJ64WLVZIKDUW2E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VTLWFT6II2CUJ64WLVZIKDUW2E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:VTLWFT6II2CUJ64WLVZIKDUW2E","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":"d33c86a4f3ee820ef5c21ffbef7679785ed027e7fcaa3c906e22ca1ab93329dd","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-01T10:35:58Z","title_canon_sha256":"bca6f2311afd427ce92f252c21e6be1265f08869d5c37f5812dcbc2f97ffb4c6"},"schema_version":"1.0","source":{"id":"2504.00634","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.00634","created_at":"2026-07-05T10:42:47Z"},{"alias_kind":"arxiv_version","alias_value":"2504.00634v1","created_at":"2026-07-05T10:42:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.00634","created_at":"2026-07-05T10:42:47Z"},{"alias_kind":"pith_short_12","alias_value":"VTLWFT6II2CU","created_at":"2026-07-05T10:42:47Z"},{"alias_kind":"pith_short_16","alias_value":"VTLWFT6II2CUJ64W","created_at":"2026-07-05T10:42:47Z"},{"alias_kind":"pith_short_8","alias_value":"VTLWFT6I","created_at":"2026-07-05T10:42:47Z"}],"graph_snapshots":[{"event_id":"sha256:ff101724a6759940de71db79d69eaca631dd265bf0f332fc7f3d934fd6000176","target":"graph","created_at":"2026-07-05T10:42:47Z","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/2504.00634/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Clifford circuit optimization is an important step in the quantum compilation pipeline. Major compilers employ heuristic approaches. While they are fast, their results are often suboptimal. Minimization of noisy gates, like 2-qubit CNOT gates, is crucial for practical computing. Exact approaches have been proposed to fill the gap left by heuristic approaches. Among these are SAT based approaches that optimize gate count or depth, but they suffer from scalability issues. Further, they do not guarantee optimality on more important metrics like CNOT count or CNOT depth. A recent work proposed an ","authors_text":"Irfansha Shaik, Jaco van de Pol","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-01T10:35:58Z","title":"CNOT-Optimal Clifford Synthesis as SAT"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.00634","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:1abe3b8eba2b630d0718add59430c8d39300e94d0fe7a57a17fa5dbda1e1a252","target":"record","created_at":"2026-07-05T10:42:47Z","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":"d33c86a4f3ee820ef5c21ffbef7679785ed027e7fcaa3c906e22ca1ab93329dd","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-01T10:35:58Z","title_canon_sha256":"bca6f2311afd427ce92f252c21e6be1265f08869d5c37f5812dcbc2f97ffb4c6"},"schema_version":"1.0","source":{"id":"2504.00634","kind":"arxiv","version":1}},"canonical_sha256":"acd762cfc8468544fb965d72850e96d11dfcbbc824644ce4221e2c4d9bc257ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"acd762cfc8468544fb965d72850e96d11dfcbbc824644ce4221e2c4d9bc257ed","first_computed_at":"2026-07-05T10:42:47.871270Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:42:47.871270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Wz18uJeLmFkaB6Dnl54l5/PvE/xxRn2Tm6iGFn/nAUTpKms8UxW14V8UH4Yb9aC33gdNf5PxTjJCgmtBgM1NDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:42:47.871757Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.00634","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1abe3b8eba2b630d0718add59430c8d39300e94d0fe7a57a17fa5dbda1e1a252","sha256:ff101724a6759940de71db79d69eaca631dd265bf0f332fc7f3d934fd6000176"],"state_sha256":"04b18dd76bff02c6071e12f5036226e5224254ebe1c6a598bd531e6970a7ca73"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VI0dC4CZ07CAijf06nKEOJ+cFoJO0+hixFIHAY1zy8xpFbyXIKqOc3PjjEqik7z+b4KUc8HwP5jOaov/vavsBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T11:33:40.264073Z","bundle_sha256":"8114ce92bd1c579449c16788120edf298090ac05bfaa46eb2baf62360ec2a1e4"}}