{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:VZVTJ5OG3HZLBNFHRWESKTNF6Y","short_pith_number":"pith:VZVTJ5OG","canonical_record":{"source":{"id":"2503.16363","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-20T17:20:26Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"cf8f6babdc6007941652e786a8e0f873395acf25a5f879866e1fdb266b7f87f7","abstract_canon_sha256":"d32fa6d314483fa709210bb1c4b942b3b2fda53c2a6a8e6146cfe7dd5c66a743"},"schema_version":"1.0"},"canonical_sha256":"ae6b34f5c6d9f2b0b4a78d89254da5f625421e360ba9663a66ef64aa17e883ef","source":{"kind":"arxiv","id":"2503.16363","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.16363","created_at":"2026-07-05T10:36:18Z"},{"alias_kind":"arxiv_version","alias_value":"2503.16363v1","created_at":"2026-07-05T10:36:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.16363","created_at":"2026-07-05T10:36:18Z"},{"alias_kind":"pith_short_12","alias_value":"VZVTJ5OG3HZL","created_at":"2026-07-05T10:36:18Z"},{"alias_kind":"pith_short_16","alias_value":"VZVTJ5OG3HZLBNFH","created_at":"2026-07-05T10:36:18Z"},{"alias_kind":"pith_short_8","alias_value":"VZVTJ5OG","created_at":"2026-07-05T10:36:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:VZVTJ5OG3HZLBNFHRWESKTNF6Y","target":"record","payload":{"canonical_record":{"source":{"id":"2503.16363","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-20T17:20:26Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"cf8f6babdc6007941652e786a8e0f873395acf25a5f879866e1fdb266b7f87f7","abstract_canon_sha256":"d32fa6d314483fa709210bb1c4b942b3b2fda53c2a6a8e6146cfe7dd5c66a743"},"schema_version":"1.0"},"canonical_sha256":"ae6b34f5c6d9f2b0b4a78d89254da5f625421e360ba9663a66ef64aa17e883ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:36:18.139133Z","signature_b64":"mw4hc4T4SFdaNPcNyFojOej3ikgsf5ravIZMZQrJpbLv6SiV6LVBnkYwOM0stpAxBC+4RbKLZSq/zjPIU13fCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae6b34f5c6d9f2b0b4a78d89254da5f625421e360ba9663a66ef64aa17e883ef","last_reissued_at":"2026-07-05T10:36:18.138498Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:36:18.138498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2503.16363","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:36:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o1jddTiDVko/WwcrxRSxwMCoXqRQb/Y8wsxWjvhRoZk54TCATrC7KR6/ncE5BrQK2hSHlimC/Nt96MPZcZkGAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T03:32:29.829533Z"},"content_sha256":"b5b0394e7cdb5f11ebe9c9ef5659a1422664cd5419582d3a9b0632108a6936f6","schema_version":"1.0","event_id":"sha256:b5b0394e7cdb5f11ebe9c9ef5659a1422664cd5419582d3a9b0632108a6936f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:VZVTJ5OG3HZLBNFHRWESKTNF6Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Probabilistic Quantum SVM Training on Ising Machine","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.LG","authors_text":"Haoqi He, Yan Xiao","submitted_at":"2025-03-20T17:20:26Z","abstract_excerpt":"Quantum computing holds significant potential to accelerate machine learning algorithms, especially in solving optimization problems like those encountered in Support Vector Machine (SVM) training. However, current QUBO-based Quantum SVM (QSVM) methods rely solely on binary optimal solutions, limiting their ability to identify fuzzy boundaries in data. Additionally, the limited qubit count in contemporary quantum devices constrains training on larger datasets. In this paper, we propose a probabilistic quantum SVM training framework suitable for Coherent Ising Machines (CIMs). By formulating th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.16363","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/2503.16363/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:36:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"io/jyxCU6S2HzzBYX5yCmKPQwyJqG23F/5hbmmpM/XkJZsdghySM8qv+Vsnaj4cp39hZZlXz5S1mq6Ovv/SQBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T03:32:29.830234Z"},"content_sha256":"444b0e666acc1110f05662ad3d2e1cba4e91c537a892b20e82d101f98af15861","schema_version":"1.0","event_id":"sha256:444b0e666acc1110f05662ad3d2e1cba4e91c537a892b20e82d101f98af15861"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VZVTJ5OG3HZLBNFHRWESKTNF6Y/bundle.json","state_url":"https://pith.science/pith/VZVTJ5OG3HZLBNFHRWESKTNF6Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VZVTJ5OG3HZLBNFHRWESKTNF6Y/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-07T03:32:29Z","links":{"resolver":"https://pith.science/pith/VZVTJ5OG3HZLBNFHRWESKTNF6Y","bundle":"https://pith.science/pith/VZVTJ5OG3HZLBNFHRWESKTNF6Y/bundle.json","state":"https://pith.science/pith/VZVTJ5OG3HZLBNFHRWESKTNF6Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VZVTJ5OG3HZLBNFHRWESKTNF6Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:VZVTJ5OG3HZLBNFHRWESKTNF6Y","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":"d32fa6d314483fa709210bb1c4b942b3b2fda53c2a6a8e6146cfe7dd5c66a743","cross_cats_sorted":["quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-20T17:20:26Z","title_canon_sha256":"cf8f6babdc6007941652e786a8e0f873395acf25a5f879866e1fdb266b7f87f7"},"schema_version":"1.0","source":{"id":"2503.16363","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.16363","created_at":"2026-07-05T10:36:18Z"},{"alias_kind":"arxiv_version","alias_value":"2503.16363v1","created_at":"2026-07-05T10:36:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.16363","created_at":"2026-07-05T10:36:18Z"},{"alias_kind":"pith_short_12","alias_value":"VZVTJ5OG3HZL","created_at":"2026-07-05T10:36:18Z"},{"alias_kind":"pith_short_16","alias_value":"VZVTJ5OG3HZLBNFH","created_at":"2026-07-05T10:36:18Z"},{"alias_kind":"pith_short_8","alias_value":"VZVTJ5OG","created_at":"2026-07-05T10:36:18Z"}],"graph_snapshots":[{"event_id":"sha256:444b0e666acc1110f05662ad3d2e1cba4e91c537a892b20e82d101f98af15861","target":"graph","created_at":"2026-07-05T10:36:18Z","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/2503.16363/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quantum computing holds significant potential to accelerate machine learning algorithms, especially in solving optimization problems like those encountered in Support Vector Machine (SVM) training. However, current QUBO-based Quantum SVM (QSVM) methods rely solely on binary optimal solutions, limiting their ability to identify fuzzy boundaries in data. Additionally, the limited qubit count in contemporary quantum devices constrains training on larger datasets. In this paper, we propose a probabilistic quantum SVM training framework suitable for Coherent Ising Machines (CIMs). By formulating th","authors_text":"Haoqi He, Yan Xiao","cross_cats":["quant-ph"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-20T17:20:26Z","title":"Probabilistic Quantum SVM Training on Ising Machine"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.16363","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:b5b0394e7cdb5f11ebe9c9ef5659a1422664cd5419582d3a9b0632108a6936f6","target":"record","created_at":"2026-07-05T10:36:18Z","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":"d32fa6d314483fa709210bb1c4b942b3b2fda53c2a6a8e6146cfe7dd5c66a743","cross_cats_sorted":["quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-20T17:20:26Z","title_canon_sha256":"cf8f6babdc6007941652e786a8e0f873395acf25a5f879866e1fdb266b7f87f7"},"schema_version":"1.0","source":{"id":"2503.16363","kind":"arxiv","version":1}},"canonical_sha256":"ae6b34f5c6d9f2b0b4a78d89254da5f625421e360ba9663a66ef64aa17e883ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae6b34f5c6d9f2b0b4a78d89254da5f625421e360ba9663a66ef64aa17e883ef","first_computed_at":"2026-07-05T10:36:18.138498Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:36:18.138498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mw4hc4T4SFdaNPcNyFojOej3ikgsf5ravIZMZQrJpbLv6SiV6LVBnkYwOM0stpAxBC+4RbKLZSq/zjPIU13fCg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:36:18.139133Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.16363","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5b0394e7cdb5f11ebe9c9ef5659a1422664cd5419582d3a9b0632108a6936f6","sha256:444b0e666acc1110f05662ad3d2e1cba4e91c537a892b20e82d101f98af15861"],"state_sha256":"ea707db0897cec8a399506194a28eb690990c6e7b69928d6a21b5d35fc7d5c34"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bbMBxQygXPVbgU98ezv9irxGJ82ZpmJWXsX9KcKu5uZrnmTRa4VbWl/CcuDkZLw/DYH11Qg3AdXfQ/bPv/wtCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T03:32:29.838294Z","bundle_sha256":"b6b333e494405719ea0a0ef55abf4d0a3fa80b04ab4e0e3057821c8d319d3606"}}