{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:VSSV5KS5MG62SZERI52INKDWKL","short_pith_number":"pith:VSSV5KS5","canonical_record":{"source":{"id":"2306.08152","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-06-13T21:51:20Z","cross_cats_sorted":[],"title_canon_sha256":"b249db3c72c15d70057952c98eaec85d68063126d7f896791703e9b42160f9a3","abstract_canon_sha256":"8885fed1051db21cf73fbdcd9598c80d8382c6eec3a9a43f6df940b65d543e3e"},"schema_version":"1.0"},"canonical_sha256":"aca55eaa5d61bda96491477486a87652faa40185002e0ca67abb040113969689","source":{"kind":"arxiv","id":"2306.08152","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.08152","created_at":"2026-07-05T07:31:52Z"},{"alias_kind":"arxiv_version","alias_value":"2306.08152v2","created_at":"2026-07-05T07:31:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.08152","created_at":"2026-07-05T07:31:52Z"},{"alias_kind":"pith_short_12","alias_value":"VSSV5KS5MG62","created_at":"2026-07-05T07:31:52Z"},{"alias_kind":"pith_short_16","alias_value":"VSSV5KS5MG62SZER","created_at":"2026-07-05T07:31:52Z"},{"alias_kind":"pith_short_8","alias_value":"VSSV5KS5","created_at":"2026-07-05T07:31:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:VSSV5KS5MG62SZERI52INKDWKL","target":"record","payload":{"canonical_record":{"source":{"id":"2306.08152","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-06-13T21:51:20Z","cross_cats_sorted":[],"title_canon_sha256":"b249db3c72c15d70057952c98eaec85d68063126d7f896791703e9b42160f9a3","abstract_canon_sha256":"8885fed1051db21cf73fbdcd9598c80d8382c6eec3a9a43f6df940b65d543e3e"},"schema_version":"1.0"},"canonical_sha256":"aca55eaa5d61bda96491477486a87652faa40185002e0ca67abb040113969689","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:31:52.826532Z","signature_b64":"dugH87LwJdFH2sF3EbA088Hdy/s8hqiUdy/uGSjPegJb9O8+IHTu8V94mKpY3gk+9fIkOHGyY83WgnLfMZYfBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aca55eaa5d61bda96491477486a87652faa40185002e0ca67abb040113969689","last_reissued_at":"2026-07-05T07:31:52.826146Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:31:52.826146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2306.08152","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-05T07:31:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"abYUcIM9BmTzMPcW41CE0NJqJf52nEFgpB4ok2PyqowI3fN0WIs4mpCsIonp2TRVms5crmmkb89XZ7zAnLssBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T03:10:06.242174Z"},"content_sha256":"0e1c41e5885b74e263502f6b1352d94d900d322b8438dd5bb1fe6e7eb836e48f","schema_version":"1.0","event_id":"sha256:0e1c41e5885b74e263502f6b1352d94d900d322b8438dd5bb1fe6e7eb836e48f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:VSSV5KS5MG62SZERI52INKDWKL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"QFactor: A Domain-Specific Optimizer for Quantum Circuit Instantiation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alon Kukliansky, Costin Iancu, Ed Younis, Lukasz Cincio","submitted_at":"2023-06-13T21:51:20Z","abstract_excerpt":"We introduce a domain-specific algorithm for numerical optimization operations used by quantum circuit instantiation, synthesis, and compilation methods. QFactor uses a tensor network formulation together with analytic methods and an iterative local optimization algorithm to reduce the number of problem parameters. Besides tailoring the optimization process, the formulation is amenable to portable parallelization across CPU and GPU architectures, which is usually challenging in general purpose optimizers (GPO). Compared with several GPOs, our algorithm achieves exponential memory and performan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.08152","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/2306.08152/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-05T07:31:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dGZY6H8UxR3rOj0xrc+D7Jl296mwghnuInPSbsZ3GPzWUKqPm/raFK//POFxfnVde5o9bhpRDJP+/I1d9Kt9Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T03:10:06.242926Z"},"content_sha256":"69e270a88298a8e4dc7de4fc68df09acf032092a9e93ab60dcde00e2376be8a9","schema_version":"1.0","event_id":"sha256:69e270a88298a8e4dc7de4fc68df09acf032092a9e93ab60dcde00e2376be8a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VSSV5KS5MG62SZERI52INKDWKL/bundle.json","state_url":"https://pith.science/pith/VSSV5KS5MG62SZERI52INKDWKL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VSSV5KS5MG62SZERI52INKDWKL/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-06T03:10:06Z","links":{"resolver":"https://pith.science/pith/VSSV5KS5MG62SZERI52INKDWKL","bundle":"https://pith.science/pith/VSSV5KS5MG62SZERI52INKDWKL/bundle.json","state":"https://pith.science/pith/VSSV5KS5MG62SZERI52INKDWKL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VSSV5KS5MG62SZERI52INKDWKL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:VSSV5KS5MG62SZERI52INKDWKL","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":"8885fed1051db21cf73fbdcd9598c80d8382c6eec3a9a43f6df940b65d543e3e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-06-13T21:51:20Z","title_canon_sha256":"b249db3c72c15d70057952c98eaec85d68063126d7f896791703e9b42160f9a3"},"schema_version":"1.0","source":{"id":"2306.08152","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.08152","created_at":"2026-07-05T07:31:52Z"},{"alias_kind":"arxiv_version","alias_value":"2306.08152v2","created_at":"2026-07-05T07:31:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.08152","created_at":"2026-07-05T07:31:52Z"},{"alias_kind":"pith_short_12","alias_value":"VSSV5KS5MG62","created_at":"2026-07-05T07:31:52Z"},{"alias_kind":"pith_short_16","alias_value":"VSSV5KS5MG62SZER","created_at":"2026-07-05T07:31:52Z"},{"alias_kind":"pith_short_8","alias_value":"VSSV5KS5","created_at":"2026-07-05T07:31:52Z"}],"graph_snapshots":[{"event_id":"sha256:69e270a88298a8e4dc7de4fc68df09acf032092a9e93ab60dcde00e2376be8a9","target":"graph","created_at":"2026-07-05T07:31:52Z","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/2306.08152/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce a domain-specific algorithm for numerical optimization operations used by quantum circuit instantiation, synthesis, and compilation methods. QFactor uses a tensor network formulation together with analytic methods and an iterative local optimization algorithm to reduce the number of problem parameters. Besides tailoring the optimization process, the formulation is amenable to portable parallelization across CPU and GPU architectures, which is usually challenging in general purpose optimizers (GPO). Compared with several GPOs, our algorithm achieves exponential memory and performan","authors_text":"Alon Kukliansky, Costin Iancu, Ed Younis, Lukasz Cincio","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-06-13T21:51:20Z","title":"QFactor: A Domain-Specific Optimizer for Quantum Circuit Instantiation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.08152","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:0e1c41e5885b74e263502f6b1352d94d900d322b8438dd5bb1fe6e7eb836e48f","target":"record","created_at":"2026-07-05T07:31:52Z","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":"8885fed1051db21cf73fbdcd9598c80d8382c6eec3a9a43f6df940b65d543e3e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-06-13T21:51:20Z","title_canon_sha256":"b249db3c72c15d70057952c98eaec85d68063126d7f896791703e9b42160f9a3"},"schema_version":"1.0","source":{"id":"2306.08152","kind":"arxiv","version":2}},"canonical_sha256":"aca55eaa5d61bda96491477486a87652faa40185002e0ca67abb040113969689","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aca55eaa5d61bda96491477486a87652faa40185002e0ca67abb040113969689","first_computed_at":"2026-07-05T07:31:52.826146Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:31:52.826146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dugH87LwJdFH2sF3EbA088Hdy/s8hqiUdy/uGSjPegJb9O8+IHTu8V94mKpY3gk+9fIkOHGyY83WgnLfMZYfBA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:31:52.826532Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.08152","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e1c41e5885b74e263502f6b1352d94d900d322b8438dd5bb1fe6e7eb836e48f","sha256:69e270a88298a8e4dc7de4fc68df09acf032092a9e93ab60dcde00e2376be8a9"],"state_sha256":"08f93d58038ea0e60b1954803c378048b63e77105b55a41b65f56fb1326f0634"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rS6R35WedfCl14tf0h29kpdjfrlo3oLMiocfZp7pLgO/smB4NPxCF7N77YCc7Nvsk+VlVaQjWtfcn1Gogip2CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T03:10:06.248583Z","bundle_sha256":"fca2c20cb92427547dc76afa5bf6a5205702965c360f55dbee61ce988f5fc1db"}}