{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GHGYPMI4UFWDHTSCL5MKKKOZIS","short_pith_number":"pith:GHGYPMI4","schema_version":"1.0","canonical_sha256":"31cd87b11ca16c33ce425f58a529d944b185f50b954f627bb4cc0d86aa0fe8f0","source":{"kind":"arxiv","id":"1408.2035","version":1},"attestation_state":"computed","paper":{"title":"Quantum Annealing for Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Kenichi Kurihara, Seiji Miyashita, Shu Tanaka","submitted_at":"2014-08-09T05:31:06Z","abstract_excerpt":"This paper studies quantum annealing (QA) for clustering, which can be seen as an extension of simulated annealing (SA). We derive a QA algorithm for clustering and propose an annealing schedule, which is crucial in practice. Experiments show the proposed QA algorithm finds better clustering assignments than SA. Furthermore, QA is as easy as SA to implement."},"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":"1408.2035","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-08-09T05:31:06Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d2cc8ad3fcb095dd0bcec20c84dc724ff923ce936e47acc684d0ef730d858ba0","abstract_canon_sha256":"a3424e8a53f57e55a36f1a2d32fe123f55c31a5d26bbf097f596493491aedc4b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:30.644358Z","signature_b64":"NQa25uHfE9l3aaA6ElwYiz5ok0MG4Z25sRAvq6zfhqt9VLn064TDHDxW0l0B+pjKn0qfXDVgPWfNkH+CwTBaBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31cd87b11ca16c33ce425f58a529d944b185f50b954f627bb4cc0d86aa0fe8f0","last_reissued_at":"2026-05-18T02:45:30.643724Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:30.643724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Annealing for Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Kenichi Kurihara, Seiji Miyashita, Shu Tanaka","submitted_at":"2014-08-09T05:31:06Z","abstract_excerpt":"This paper studies quantum annealing (QA) for clustering, which can be seen as an extension of simulated annealing (SA). We derive a QA algorithm for clustering and propose an annealing schedule, which is crucial in practice. Experiments show the proposed QA algorithm finds better clustering assignments than SA. Furthermore, QA is as easy as SA to implement."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2035","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":""},"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":"1408.2035","created_at":"2026-05-18T02:45:30.643836+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.2035v1","created_at":"2026-05-18T02:45:30.643836+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2035","created_at":"2026-05-18T02:45:30.643836+00:00"},{"alias_kind":"pith_short_12","alias_value":"GHGYPMI4UFWD","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GHGYPMI4UFWDHTSC","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GHGYPMI4","created_at":"2026-05-18T12:28:30.664211+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/GHGYPMI4UFWDHTSCL5MKKKOZIS","json":"https://pith.science/pith/GHGYPMI4UFWDHTSCL5MKKKOZIS.json","graph_json":"https://pith.science/api/pith-number/GHGYPMI4UFWDHTSCL5MKKKOZIS/graph.json","events_json":"https://pith.science/api/pith-number/GHGYPMI4UFWDHTSCL5MKKKOZIS/events.json","paper":"https://pith.science/paper/GHGYPMI4"},"agent_actions":{"view_html":"https://pith.science/pith/GHGYPMI4UFWDHTSCL5MKKKOZIS","download_json":"https://pith.science/pith/GHGYPMI4UFWDHTSCL5MKKKOZIS.json","view_paper":"https://pith.science/paper/GHGYPMI4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.2035&json=true","fetch_graph":"https://pith.science/api/pith-number/GHGYPMI4UFWDHTSCL5MKKKOZIS/graph.json","fetch_events":"https://pith.science/api/pith-number/GHGYPMI4UFWDHTSCL5MKKKOZIS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GHGYPMI4UFWDHTSCL5MKKKOZIS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GHGYPMI4UFWDHTSCL5MKKKOZIS/action/storage_attestation","attest_author":"https://pith.science/pith/GHGYPMI4UFWDHTSCL5MKKKOZIS/action/author_attestation","sign_citation":"https://pith.science/pith/GHGYPMI4UFWDHTSCL5MKKKOZIS/action/citation_signature","submit_replication":"https://pith.science/pith/GHGYPMI4UFWDHTSCL5MKKKOZIS/action/replication_record"}},"created_at":"2026-05-18T02:45:30.643836+00:00","updated_at":"2026-05-18T02:45:30.643836+00:00"}