{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:PTS5KPMBL4NDENBREEKHKPAJN4","short_pith_number":"pith:PTS5KPMB","schema_version":"1.0","canonical_sha256":"7ce5d53d815f1a3234312114753c096f25572867375963e08cd8f68060f2a159","source":{"kind":"arxiv","id":"2312.01567","version":1},"attestation_state":"computed","paper":{"title":"Toward Automated Quantum Variational Machine Learning","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.ET","quant-ph"],"primary_cat":"cs.LG","authors_text":"Omer Subasi","submitted_at":"2023-12-04T01:47:05Z","abstract_excerpt":"In this work, we address the problem of automating quantum variational machine learning. We develop a multi-locality parallelizable search algorithm, called MUSE, to find the initial points and the sets of parameters that achieve the best performance for quantum variational circuit learning. Simulations with five real-world classification datasets indicate that on average, MUSE improves the detection accuracy of quantum variational classifiers 2.3 times with respect to the observed lowest scores. Moreover, when applied to two real-world regression datasets, MUSE improves the quality of the pre"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2312.01567","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2023-12-04T01:47:05Z","cross_cats_sorted":["cs.ET","quant-ph"],"title_canon_sha256":"e239cf791368521b813a1815249faf0fb26a6beec8aed391d99c3809679595b4","abstract_canon_sha256":"2b4a307c4846032b3db2f035b5b73c933d20de985d21ab0c6edca951a696f1ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:19:56.768057Z","signature_b64":"QDjtV8A+mCm3fzcsiT/uRS+zuBPUnF/D68T64TDD7FnyoV3BrUFvw5GggFNBXzse6NWJ7BiUOF/kw2Rq/6UgAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ce5d53d815f1a3234312114753c096f25572867375963e08cd8f68060f2a159","last_reissued_at":"2026-07-05T07:19:56.767513Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:19:56.767513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Toward Automated Quantum Variational Machine Learning","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.ET","quant-ph"],"primary_cat":"cs.LG","authors_text":"Omer Subasi","submitted_at":"2023-12-04T01:47:05Z","abstract_excerpt":"In this work, we address the problem of automating quantum variational machine learning. We develop a multi-locality parallelizable search algorithm, called MUSE, to find the initial points and the sets of parameters that achieve the best performance for quantum variational circuit learning. Simulations with five real-world classification datasets indicate that on average, MUSE improves the detection accuracy of quantum variational classifiers 2.3 times with respect to the observed lowest scores. Moreover, when applied to two real-world regression datasets, MUSE improves the quality of the pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.01567","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/2312.01567/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2312.01567","created_at":"2026-07-05T07:19:56.767583+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.01567v1","created_at":"2026-07-05T07:19:56.767583+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.01567","created_at":"2026-07-05T07:19:56.767583+00:00"},{"alias_kind":"pith_short_12","alias_value":"PTS5KPMBL4ND","created_at":"2026-07-05T07:19:56.767583+00:00"},{"alias_kind":"pith_short_16","alias_value":"PTS5KPMBL4NDENBR","created_at":"2026-07-05T07:19:56.767583+00:00"},{"alias_kind":"pith_short_8","alias_value":"PTS5KPMB","created_at":"2026-07-05T07:19:56.767583+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.12484","citing_title":"Evolutionary Optimization for Designing Variational Quantum Circuits with High Model Capacity","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PTS5KPMBL4NDENBREEKHKPAJN4","json":"https://pith.science/pith/PTS5KPMBL4NDENBREEKHKPAJN4.json","graph_json":"https://pith.science/api/pith-number/PTS5KPMBL4NDENBREEKHKPAJN4/graph.json","events_json":"https://pith.science/api/pith-number/PTS5KPMBL4NDENBREEKHKPAJN4/events.json","paper":"https://pith.science/paper/PTS5KPMB"},"agent_actions":{"view_html":"https://pith.science/pith/PTS5KPMBL4NDENBREEKHKPAJN4","download_json":"https://pith.science/pith/PTS5KPMBL4NDENBREEKHKPAJN4.json","view_paper":"https://pith.science/paper/PTS5KPMB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.01567&json=true","fetch_graph":"https://pith.science/api/pith-number/PTS5KPMBL4NDENBREEKHKPAJN4/graph.json","fetch_events":"https://pith.science/api/pith-number/PTS5KPMBL4NDENBREEKHKPAJN4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PTS5KPMBL4NDENBREEKHKPAJN4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PTS5KPMBL4NDENBREEKHKPAJN4/action/storage_attestation","attest_author":"https://pith.science/pith/PTS5KPMBL4NDENBREEKHKPAJN4/action/author_attestation","sign_citation":"https://pith.science/pith/PTS5KPMBL4NDENBREEKHKPAJN4/action/citation_signature","submit_replication":"https://pith.science/pith/PTS5KPMBL4NDENBREEKHKPAJN4/action/replication_record"}},"created_at":"2026-07-05T07:19:56.767583+00:00","updated_at":"2026-07-05T07:19:56.767583+00:00"}