{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ZHRDHSGNPIQSZ4AGHSA76AIJYA","short_pith_number":"pith:ZHRDHSGN","schema_version":"1.0","canonical_sha256":"c9e233c8cd7a212cf0063c81ff0109c003d672993a161745137bef4534fd6519","source":{"kind":"arxiv","id":"2311.12328","version":1},"attestation_state":"computed","paper":{"title":"Quantum-Enhanced Support Vector Machine for Large-Scale Stellar Classification with GPU Acceleration","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["astro-ph.IM","cs.AI","cs.PF"],"primary_cat":"quant-ph","authors_text":"Chen-Yu Liu, Henry Makhanov, Hui-Hsuan Chung, Kuan-Cheng Chen, Xiaotian Xu","submitted_at":"2023-11-21T03:40:20Z","abstract_excerpt":"In this study, we introduce an innovative Quantum-enhanced Support Vector Machine (QSVM) approach for stellar classification, leveraging the power of quantum computing and GPU acceleration. Our QSVM algorithm significantly surpasses traditional methods such as K-Nearest Neighbors (KNN) and Logistic Regression (LR), particularly in handling complex binary and multi-class scenarios within the Harvard stellar classification system. The integration of quantum principles notably enhances classification accuracy, while GPU acceleration using the cuQuantum SDK ensures computational efficiency and sca"},"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":"2311.12328","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-11-21T03:40:20Z","cross_cats_sorted":["astro-ph.IM","cs.AI","cs.PF"],"title_canon_sha256":"1e522d735365a245d9babfdce3f7bb60193f425fb88ceddf1e33645519f03877","abstract_canon_sha256":"8f3444eecf8db758779faf6f256c747ecccd5fec2db29728d163dc154263eb13"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:15:03.971204Z","signature_b64":"bRo9kjBfu9h8HCnEN7bBeqclk0oIXNabIlzzGtCw351R3pxaRDnXbLYgGM4f8s9DzXGn/4/4pmWDlA6qsnKkAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9e233c8cd7a212cf0063c81ff0109c003d672993a161745137bef4534fd6519","last_reissued_at":"2026-07-05T07:15:03.970724Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:15:03.970724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum-Enhanced Support Vector Machine for Large-Scale Stellar Classification with GPU Acceleration","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["astro-ph.IM","cs.AI","cs.PF"],"primary_cat":"quant-ph","authors_text":"Chen-Yu Liu, Henry Makhanov, Hui-Hsuan Chung, Kuan-Cheng Chen, Xiaotian Xu","submitted_at":"2023-11-21T03:40:20Z","abstract_excerpt":"In this study, we introduce an innovative Quantum-enhanced Support Vector Machine (QSVM) approach for stellar classification, leveraging the power of quantum computing and GPU acceleration. Our QSVM algorithm significantly surpasses traditional methods such as K-Nearest Neighbors (KNN) and Logistic Regression (LR), particularly in handling complex binary and multi-class scenarios within the Harvard stellar classification system. The integration of quantum principles notably enhances classification accuracy, while GPU acceleration using the cuQuantum SDK ensures computational efficiency and sca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.12328","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/2311.12328/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":"2311.12328","created_at":"2026-07-05T07:15:03.970782+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.12328v1","created_at":"2026-07-05T07:15:03.970782+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.12328","created_at":"2026-07-05T07:15:03.970782+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZHRDHSGNPIQS","created_at":"2026-07-05T07:15:03.970782+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZHRDHSGNPIQSZ4AG","created_at":"2026-07-05T07:15:03.970782+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZHRDHSGN","created_at":"2026-07-05T07:15:03.970782+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.00013","citing_title":"From Provable Correctness to Probabilistic Generation: A Comparative Review of Program Synthesis Paradigms","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZHRDHSGNPIQSZ4AGHSA76AIJYA","json":"https://pith.science/pith/ZHRDHSGNPIQSZ4AGHSA76AIJYA.json","graph_json":"https://pith.science/api/pith-number/ZHRDHSGNPIQSZ4AGHSA76AIJYA/graph.json","events_json":"https://pith.science/api/pith-number/ZHRDHSGNPIQSZ4AGHSA76AIJYA/events.json","paper":"https://pith.science/paper/ZHRDHSGN"},"agent_actions":{"view_html":"https://pith.science/pith/ZHRDHSGNPIQSZ4AGHSA76AIJYA","download_json":"https://pith.science/pith/ZHRDHSGNPIQSZ4AGHSA76AIJYA.json","view_paper":"https://pith.science/paper/ZHRDHSGN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.12328&json=true","fetch_graph":"https://pith.science/api/pith-number/ZHRDHSGNPIQSZ4AGHSA76AIJYA/graph.json","fetch_events":"https://pith.science/api/pith-number/ZHRDHSGNPIQSZ4AGHSA76AIJYA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZHRDHSGNPIQSZ4AGHSA76AIJYA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZHRDHSGNPIQSZ4AGHSA76AIJYA/action/storage_attestation","attest_author":"https://pith.science/pith/ZHRDHSGNPIQSZ4AGHSA76AIJYA/action/author_attestation","sign_citation":"https://pith.science/pith/ZHRDHSGNPIQSZ4AGHSA76AIJYA/action/citation_signature","submit_replication":"https://pith.science/pith/ZHRDHSGNPIQSZ4AGHSA76AIJYA/action/replication_record"}},"created_at":"2026-07-05T07:15:03.970782+00:00","updated_at":"2026-07-05T07:15:03.970782+00:00"}