{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:4R5N52N6ZOUKUFIRIJ6LRTTPYK","short_pith_number":"pith:4R5N52N6","canonical_record":{"source":{"id":"2607.03275","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-03T12:42:16Z","cross_cats_sorted":[],"title_canon_sha256":"a456fd56917b74355d29d98e830fe4fa5f0d70a673abec9e47c474c33f71fd86","abstract_canon_sha256":"68a75f54cf990482f14cccc7dce16b8b64a42d0e1acbd744d0cdb5613b4544f2"},"schema_version":"1.0"},"canonical_sha256":"e47adee9becba8aa1511427cb8ce6fc29e5f5bc181c2a3bb220e5237ce5720d5","source":{"kind":"arxiv","id":"2607.03275","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.03275","created_at":"2026-07-07T01:16:49Z"},{"alias_kind":"arxiv_version","alias_value":"2607.03275v1","created_at":"2026-07-07T01:16:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.03275","created_at":"2026-07-07T01:16:49Z"},{"alias_kind":"pith_short_12","alias_value":"4R5N52N6ZOUK","created_at":"2026-07-07T01:16:49Z"},{"alias_kind":"pith_short_16","alias_value":"4R5N52N6ZOUKUFIR","created_at":"2026-07-07T01:16:49Z"},{"alias_kind":"pith_short_8","alias_value":"4R5N52N6","created_at":"2026-07-07T01:16:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:4R5N52N6ZOUKUFIRIJ6LRTTPYK","target":"record","payload":{"canonical_record":{"source":{"id":"2607.03275","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-03T12:42:16Z","cross_cats_sorted":[],"title_canon_sha256":"a456fd56917b74355d29d98e830fe4fa5f0d70a673abec9e47c474c33f71fd86","abstract_canon_sha256":"68a75f54cf990482f14cccc7dce16b8b64a42d0e1acbd744d0cdb5613b4544f2"},"schema_version":"1.0"},"canonical_sha256":"e47adee9becba8aa1511427cb8ce6fc29e5f5bc181c2a3bb220e5237ce5720d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T01:16:49.596590Z","signature_b64":"PgpmlLXEDSnRmTnrN7oBZ/1lJHzNDrKRT5FKrGWkauJc9HkIa2mbGjN7zNn04b6a+F8D/rDQ/RIUu2kTbTjLDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e47adee9becba8aa1511427cb8ce6fc29e5f5bc181c2a3bb220e5237ce5720d5","last_reissued_at":"2026-07-07T01:16:49.595965Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T01:16:49.595965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.03275","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-07T01:16:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RUAkanGI3W1S6RFkhKImY+200rJbyYxYBunj/Nq2Ce35lS176Tnm3Cmw9z6UcRd778qFvGZxUI8vbFFaPZtHCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T12:24:01.280270Z"},"content_sha256":"c2b44b587bc3326d10eb8abd02d03e83c1be0986cb64c114815ce907a8d99519","schema_version":"1.0","event_id":"sha256:c2b44b587bc3326d10eb8abd02d03e83c1be0986cb64c114815ce907a8d99519"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:4R5N52N6ZOUKUFIRIJ6LRTTPYK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Comparing and learning figures of merit for quantum circuit compilation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Anton Frisk Kockum, Harshdeep Singh, Marvin Richter, Mats Granath","submitted_at":"2026-07-03T12:42:16Z","abstract_excerpt":"To make quantum algorithms executable on a particular quantum device, they need to be compiled into circuits that respect constraints of the quantum hardware. This compilation usually involves multiple steps, where many hardware-compatible circuits are generated, and the best circuit is selected. To say which circuit is best, the quality of a circuit is generally quantified by a $\\textit{figure of merit}$ (FoM). For FoMs, there is a trade-off between ease of calculation and accuracy in predicted execution quality. Commonly used FoMs, e.g., the number of gates, circuit depth, etc., are easy to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.03275","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/2607.03275/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-07T01:16:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j9MeRM3BbHMWQ/OFJO+B5H41kXPzrN++DorArQYvCe+xM3jn/11QB8tGR+zf0mYvyEULtH+k1UobjBWU4JY4CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T12:24:01.280810Z"},"content_sha256":"870829b7932d499b54ec681d0ac76ce0d82e1ae748348e92a2ad637cd843cbab","schema_version":"1.0","event_id":"sha256:870829b7932d499b54ec681d0ac76ce0d82e1ae748348e92a2ad637cd843cbab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4R5N52N6ZOUKUFIRIJ6LRTTPYK/bundle.json","state_url":"https://pith.science/pith/4R5N52N6ZOUKUFIRIJ6LRTTPYK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4R5N52N6ZOUKUFIRIJ6LRTTPYK/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-04T12:24:01Z","links":{"resolver":"https://pith.science/pith/4R5N52N6ZOUKUFIRIJ6LRTTPYK","bundle":"https://pith.science/pith/4R5N52N6ZOUKUFIRIJ6LRTTPYK/bundle.json","state":"https://pith.science/pith/4R5N52N6ZOUKUFIRIJ6LRTTPYK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4R5N52N6ZOUKUFIRIJ6LRTTPYK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:4R5N52N6ZOUKUFIRIJ6LRTTPYK","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":"68a75f54cf990482f14cccc7dce16b8b64a42d0e1acbd744d0cdb5613b4544f2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-03T12:42:16Z","title_canon_sha256":"a456fd56917b74355d29d98e830fe4fa5f0d70a673abec9e47c474c33f71fd86"},"schema_version":"1.0","source":{"id":"2607.03275","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.03275","created_at":"2026-07-07T01:16:49Z"},{"alias_kind":"arxiv_version","alias_value":"2607.03275v1","created_at":"2026-07-07T01:16:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.03275","created_at":"2026-07-07T01:16:49Z"},{"alias_kind":"pith_short_12","alias_value":"4R5N52N6ZOUK","created_at":"2026-07-07T01:16:49Z"},{"alias_kind":"pith_short_16","alias_value":"4R5N52N6ZOUKUFIR","created_at":"2026-07-07T01:16:49Z"},{"alias_kind":"pith_short_8","alias_value":"4R5N52N6","created_at":"2026-07-07T01:16:49Z"}],"graph_snapshots":[{"event_id":"sha256:870829b7932d499b54ec681d0ac76ce0d82e1ae748348e92a2ad637cd843cbab","target":"graph","created_at":"2026-07-07T01:16:49Z","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/2607.03275/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"To make quantum algorithms executable on a particular quantum device, they need to be compiled into circuits that respect constraints of the quantum hardware. This compilation usually involves multiple steps, where many hardware-compatible circuits are generated, and the best circuit is selected. To say which circuit is best, the quality of a circuit is generally quantified by a $\\textit{figure of merit}$ (FoM). For FoMs, there is a trade-off between ease of calculation and accuracy in predicted execution quality. Commonly used FoMs, e.g., the number of gates, circuit depth, etc., are easy to ","authors_text":"Anton Frisk Kockum, Harshdeep Singh, Marvin Richter, Mats Granath","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-03T12:42:16Z","title":"Comparing and learning figures of merit for quantum circuit compilation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.03275","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:c2b44b587bc3326d10eb8abd02d03e83c1be0986cb64c114815ce907a8d99519","target":"record","created_at":"2026-07-07T01:16:49Z","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":"68a75f54cf990482f14cccc7dce16b8b64a42d0e1acbd744d0cdb5613b4544f2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-03T12:42:16Z","title_canon_sha256":"a456fd56917b74355d29d98e830fe4fa5f0d70a673abec9e47c474c33f71fd86"},"schema_version":"1.0","source":{"id":"2607.03275","kind":"arxiv","version":1}},"canonical_sha256":"e47adee9becba8aa1511427cb8ce6fc29e5f5bc181c2a3bb220e5237ce5720d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e47adee9becba8aa1511427cb8ce6fc29e5f5bc181c2a3bb220e5237ce5720d5","first_computed_at":"2026-07-07T01:16:49.595965Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-07T01:16:49.595965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PgpmlLXEDSnRmTnrN7oBZ/1lJHzNDrKRT5FKrGWkauJc9HkIa2mbGjN7zNn04b6a+F8D/rDQ/RIUu2kTbTjLDQ==","signature_status":"signed_v1","signed_at":"2026-07-07T01:16:49.596590Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.03275","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2b44b587bc3326d10eb8abd02d03e83c1be0986cb64c114815ce907a8d99519","sha256:870829b7932d499b54ec681d0ac76ce0d82e1ae748348e92a2ad637cd843cbab"],"state_sha256":"eb2d5c7f8d40dcdd835cdc2b137ad01f024e899cc146c557c0c70986587907f9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"di66/Qz29t5uk9T0Rkc17iRBIyZ4AB/lUQEhDGsoNiNWQyyxfhuOMyEwgthG90d/8Av7kO01q+yD8Xzj/eHeCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T12:24:01.285405Z","bundle_sha256":"deabd7ff6735a9265295a6b0f9dab5cf851fee66ec7eca16f347cc50ae470814"}}