{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BSP2HTXT5HIUFBLLAPFKZJZ7LK","short_pith_number":"pith:BSP2HTXT","schema_version":"1.0","canonical_sha256":"0c9fa3cef3e9d142856b03caaca73f5a87c99ac9287e0395ba17c2e5ebc9dc58","source":{"kind":"arxiv","id":"1708.05753","version":2},"attestation_state":"computed","paper":{"title":"Quantum Annealing for Combinatorial Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Casey Tomlin, Gideon Bass, Joseph Dulny III, Vaibhaw Kumar","submitted_at":"2017-08-18T20:24:41Z","abstract_excerpt":"Clustering is a powerful machine learning technique that groups \"similar\" data points based on their characteristics. Many clustering algorithms work by approximating the minimization of an objective function, namely the sum of within-the-cluster distances between points. The straightforward approach involves examining all the possible assignments of points to each of the clusters. This approach guarantees the solution will be a global minimum, however the number of possible assignments scales quickly with the number of data points and becomes computationally intractable even for very small da"},"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":"1708.05753","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-08-18T20:24:41Z","cross_cats_sorted":[],"title_canon_sha256":"8963c7b1797aabacb1a83ff8d0104c7f0a5bb051523e49d44bd96db8f8c7748f","abstract_canon_sha256":"b188ca9fa69aac05cbdd7c22ab90a0da366fcd19e87d2a03b28969dc621843ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:04.023104Z","signature_b64":"lm5Qgne8+nkctRQGrwOdxn4J5jOLSgBYf0iBjZq+RReLqk7CGEQ+cH03+/6nU1lFNPeQjL6vh6/J5Jb4E3cSCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c9fa3cef3e9d142856b03caaca73f5a87c99ac9287e0395ba17c2e5ebc9dc58","last_reissued_at":"2026-05-18T00:25:04.022700Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:04.022700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Annealing for Combinatorial Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Casey Tomlin, Gideon Bass, Joseph Dulny III, Vaibhaw Kumar","submitted_at":"2017-08-18T20:24:41Z","abstract_excerpt":"Clustering is a powerful machine learning technique that groups \"similar\" data points based on their characteristics. Many clustering algorithms work by approximating the minimization of an objective function, namely the sum of within-the-cluster distances between points. The straightforward approach involves examining all the possible assignments of points to each of the clusters. This approach guarantees the solution will be a global minimum, however the number of possible assignments scales quickly with the number of data points and becomes computationally intractable even for very small da"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05753","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":""},"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":"1708.05753","created_at":"2026-05-18T00:25:04.022763+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.05753v2","created_at":"2026-05-18T00:25:04.022763+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05753","created_at":"2026-05-18T00:25:04.022763+00:00"},{"alias_kind":"pith_short_12","alias_value":"BSP2HTXT5HIU","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BSP2HTXT5HIUFBLL","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BSP2HTXT","created_at":"2026-05-18T12:31:08.081275+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BSP2HTXT5HIUFBLLAPFKZJZ7LK","json":"https://pith.science/pith/BSP2HTXT5HIUFBLLAPFKZJZ7LK.json","graph_json":"https://pith.science/api/pith-number/BSP2HTXT5HIUFBLLAPFKZJZ7LK/graph.json","events_json":"https://pith.science/api/pith-number/BSP2HTXT5HIUFBLLAPFKZJZ7LK/events.json","paper":"https://pith.science/paper/BSP2HTXT"},"agent_actions":{"view_html":"https://pith.science/pith/BSP2HTXT5HIUFBLLAPFKZJZ7LK","download_json":"https://pith.science/pith/BSP2HTXT5HIUFBLLAPFKZJZ7LK.json","view_paper":"https://pith.science/paper/BSP2HTXT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.05753&json=true","fetch_graph":"https://pith.science/api/pith-number/BSP2HTXT5HIUFBLLAPFKZJZ7LK/graph.json","fetch_events":"https://pith.science/api/pith-number/BSP2HTXT5HIUFBLLAPFKZJZ7LK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BSP2HTXT5HIUFBLLAPFKZJZ7LK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BSP2HTXT5HIUFBLLAPFKZJZ7LK/action/storage_attestation","attest_author":"https://pith.science/pith/BSP2HTXT5HIUFBLLAPFKZJZ7LK/action/author_attestation","sign_citation":"https://pith.science/pith/BSP2HTXT5HIUFBLLAPFKZJZ7LK/action/citation_signature","submit_replication":"https://pith.science/pith/BSP2HTXT5HIUFBLLAPFKZJZ7LK/action/replication_record"}},"created_at":"2026-05-18T00:25:04.022763+00:00","updated_at":"2026-05-18T00:25:04.022763+00:00"}