{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KUYGSXH7K2QWCDWM7KCPNM7ZTW","short_pith_number":"pith:KUYGSXH7","schema_version":"1.0","canonical_sha256":"5530695cff56a1610eccfa84f6b3f99d96601e809350ae8c35cdf7fcc779d275","source":{"kind":"arxiv","id":"1909.12183","version":1},"attestation_state":"computed","paper":{"title":"K-Means Clustering on Noisy Intermediate Scale Quantum Computers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.ET","authors_text":"Ahsan Javed Awan, Gemma Vall-Llosera, Sumsam Ullah Khan","submitted_at":"2019-09-26T15:21:36Z","abstract_excerpt":"Real-time clustering of big performance data generated by the telecommunication networks requires domain-specific high performance compute infrastructure to detect anomalies. In this paper, we evaluate noisy intermediate-scale quantum (NISQ) computers characterized by low decoherence times, for K-means clustering and propose three strategies to generate shorter-depth quantum circuits needed to overcome the limitation of NISQ computers. The strategies are based on exploiting; i) quantum interference, ii) negative rotations and iii) destructive interference. By comparing our implementations on I"},"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":"1909.12183","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2019-09-26T15:21:36Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"06905f3a2a3740062dea49b17ac092bcd4085a5ffbd442ba1b8ee3db8cb94525","abstract_canon_sha256":"6d69bfec96d725096c81c66ba7cb92035ca7286dafe4f7bc1522dda2c3695a1d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:07:31.813155Z","signature_b64":"ryaet97OBuCt0CneoWKDWr/qGsZ0TEAyqIfGkRJxDMau/HmBxsq+qPjJVtCqaH6TyzPi/lPplq0HMd2s2DsbCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5530695cff56a1610eccfa84f6b3f99d96601e809350ae8c35cdf7fcc779d275","last_reissued_at":"2026-07-05T00:07:31.812768Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:07:31.812768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"K-Means Clustering on Noisy Intermediate Scale Quantum Computers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.ET","authors_text":"Ahsan Javed Awan, Gemma Vall-Llosera, Sumsam Ullah Khan","submitted_at":"2019-09-26T15:21:36Z","abstract_excerpt":"Real-time clustering of big performance data generated by the telecommunication networks requires domain-specific high performance compute infrastructure to detect anomalies. In this paper, we evaluate noisy intermediate-scale quantum (NISQ) computers characterized by low decoherence times, for K-means clustering and propose three strategies to generate shorter-depth quantum circuits needed to overcome the limitation of NISQ computers. The strategies are based on exploiting; i) quantum interference, ii) negative rotations and iii) destructive interference. By comparing our implementations on I"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.12183","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/1909.12183/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":"1909.12183","created_at":"2026-07-05T00:07:31.812832+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.12183v1","created_at":"2026-07-05T00:07:31.812832+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.12183","created_at":"2026-07-05T00:07:31.812832+00:00"},{"alias_kind":"pith_short_12","alias_value":"KUYGSXH7K2QW","created_at":"2026-07-05T00:07:31.812832+00:00"},{"alias_kind":"pith_short_16","alias_value":"KUYGSXH7K2QWCDWM","created_at":"2026-07-05T00:07:31.812832+00:00"},{"alias_kind":"pith_short_8","alias_value":"KUYGSXH7","created_at":"2026-07-05T00:07:31.812832+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2507.07018","citing_title":"Quantum Spectral Clustering: Comparing Parameterized and Neuromorphic Quantum Kernels","ref_index":38,"is_internal_anchor":false},{"citing_arxiv_id":"2604.07873","citing_title":"Hybrid Quantum--Classical k-Means Clustering via Quantum Feature Maps","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KUYGSXH7K2QWCDWM7KCPNM7ZTW","json":"https://pith.science/pith/KUYGSXH7K2QWCDWM7KCPNM7ZTW.json","graph_json":"https://pith.science/api/pith-number/KUYGSXH7K2QWCDWM7KCPNM7ZTW/graph.json","events_json":"https://pith.science/api/pith-number/KUYGSXH7K2QWCDWM7KCPNM7ZTW/events.json","paper":"https://pith.science/paper/KUYGSXH7"},"agent_actions":{"view_html":"https://pith.science/pith/KUYGSXH7K2QWCDWM7KCPNM7ZTW","download_json":"https://pith.science/pith/KUYGSXH7K2QWCDWM7KCPNM7ZTW.json","view_paper":"https://pith.science/paper/KUYGSXH7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.12183&json=true","fetch_graph":"https://pith.science/api/pith-number/KUYGSXH7K2QWCDWM7KCPNM7ZTW/graph.json","fetch_events":"https://pith.science/api/pith-number/KUYGSXH7K2QWCDWM7KCPNM7ZTW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KUYGSXH7K2QWCDWM7KCPNM7ZTW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KUYGSXH7K2QWCDWM7KCPNM7ZTW/action/storage_attestation","attest_author":"https://pith.science/pith/KUYGSXH7K2QWCDWM7KCPNM7ZTW/action/author_attestation","sign_citation":"https://pith.science/pith/KUYGSXH7K2QWCDWM7KCPNM7ZTW/action/citation_signature","submit_replication":"https://pith.science/pith/KUYGSXH7K2QWCDWM7KCPNM7ZTW/action/replication_record"}},"created_at":"2026-07-05T00:07:31.812832+00:00","updated_at":"2026-07-05T00:07:31.812832+00:00"}