{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5XTMSQKTHOCONPJPYBKT6UCANP","short_pith_number":"pith:5XTMSQKT","canonical_record":{"source":{"id":"1701.03268","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-12T08:48:03Z","cross_cats_sorted":["cond-mat.stat-mech","quant-ph"],"title_canon_sha256":"734d26d07241c3ce0b897e5acd6ffd8afb7ccb3c1395f3559a62699d7d9c8150","abstract_canon_sha256":"2f7a21d205cdf3a81c793f1f8e08c7d047be1a953b4f9a8491fe5197241019eb"},"schema_version":"1.0"},"canonical_sha256":"ede6c941533b84e6bd2fc0553f50406bffb8cc9a908f8d31247509e826b4d7ec","source":{"kind":"arxiv","id":"1701.03268","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03268","created_at":"2026-05-18T00:52:58Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03268v1","created_at":"2026-05-18T00:52:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03268","created_at":"2026-05-18T00:52:58Z"},{"alias_kind":"pith_short_12","alias_value":"5XTMSQKTHOCO","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"5XTMSQKTHOCONPJP","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"5XTMSQKT","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5XTMSQKTHOCONPJPYBKT6UCANP","target":"record","payload":{"canonical_record":{"source":{"id":"1701.03268","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-12T08:48:03Z","cross_cats_sorted":["cond-mat.stat-mech","quant-ph"],"title_canon_sha256":"734d26d07241c3ce0b897e5acd6ffd8afb7ccb3c1395f3559a62699d7d9c8150","abstract_canon_sha256":"2f7a21d205cdf3a81c793f1f8e08c7d047be1a953b4f9a8491fe5197241019eb"},"schema_version":"1.0"},"canonical_sha256":"ede6c941533b84e6bd2fc0553f50406bffb8cc9a908f8d31247509e826b4d7ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:58.071554Z","signature_b64":"KuKD7ft78DYU4aU5hAsi6/21utX2lbSfPXREoXNt0GhcI213LMOzrf6PGhlKWN0U08Mee2R9T4vFXxz+h+O2Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ede6c941533b84e6bd2fc0553f50406bffb8cc9a908f8d31247509e826b4d7ec","last_reissued_at":"2026-05-18T00:52:58.071161Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:58.071161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.03268","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-05-18T00:52:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8YaJtTeahCdx7kOvIA9PYlleUwDBTLz1BRd+XxFXA31/TvREWhdjTxDV6Wgi9DP2LaicDndrzGb195qXYtm4AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T02:30:39.600004Z"},"content_sha256":"44d0affc3677f35e4c93374cb4c41c3888f3d8d6a9cb602a0b37fa44c1da4164","schema_version":"1.0","event_id":"sha256:44d0affc3677f35e4c93374cb4c41c3888f3d8d6a9cb602a0b37fa44c1da4164"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5XTMSQKTHOCONPJPYBKT6UCANP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relaxation of the EM Algorithm via Quantum Annealing for Gaussian Mixture Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","quant-ph"],"primary_cat":"stat.ML","authors_text":"Hideyuki Miyahara, Koji Tsumura, Yuki Sughiyama","submitted_at":"2017-01-12T08:48:03Z","abstract_excerpt":"We propose a modified expectation-maximization algorithm by introducing the concept of quantum annealing, which we call the deterministic quantum annealing expectation-maximization (DQAEM) algorithm. The expectation-maximization (EM) algorithm is an established algorithm to compute maximum likelihood estimates and applied to many practical applications. However, it is known that EM heavily depends on initial values and its estimates are sometimes trapped by local optima. To solve such a problem, quantum annealing (QA) was proposed as a novel optimization approach motivated by quantum mechanics"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03268","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"},"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-05-18T00:52:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hReUepgSvYI8SN0e8K0wogVYv+4oIrQu+/BEJNT0C/WSgM7lQyTC+oST19iYSz1SqxXbuffI/j2MV4KVMXQyAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T02:30:39.600716Z"},"content_sha256":"78e71160a2075b4c28910328927f4dcb329b85f480f227cc25c578956e9406b9","schema_version":"1.0","event_id":"sha256:78e71160a2075b4c28910328927f4dcb329b85f480f227cc25c578956e9406b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5XTMSQKTHOCONPJPYBKT6UCANP/bundle.json","state_url":"https://pith.science/pith/5XTMSQKTHOCONPJPYBKT6UCANP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5XTMSQKTHOCONPJPYBKT6UCANP/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-05-23T02:30:39Z","links":{"resolver":"https://pith.science/pith/5XTMSQKTHOCONPJPYBKT6UCANP","bundle":"https://pith.science/pith/5XTMSQKTHOCONPJPYBKT6UCANP/bundle.json","state":"https://pith.science/pith/5XTMSQKTHOCONPJPYBKT6UCANP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5XTMSQKTHOCONPJPYBKT6UCANP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5XTMSQKTHOCONPJPYBKT6UCANP","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":"2f7a21d205cdf3a81c793f1f8e08c7d047be1a953b4f9a8491fe5197241019eb","cross_cats_sorted":["cond-mat.stat-mech","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-12T08:48:03Z","title_canon_sha256":"734d26d07241c3ce0b897e5acd6ffd8afb7ccb3c1395f3559a62699d7d9c8150"},"schema_version":"1.0","source":{"id":"1701.03268","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03268","created_at":"2026-05-18T00:52:58Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03268v1","created_at":"2026-05-18T00:52:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03268","created_at":"2026-05-18T00:52:58Z"},{"alias_kind":"pith_short_12","alias_value":"5XTMSQKTHOCO","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"5XTMSQKTHOCONPJP","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"5XTMSQKT","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:78e71160a2075b4c28910328927f4dcb329b85f480f227cc25c578956e9406b9","target":"graph","created_at":"2026-05-18T00:52:58Z","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"},"paper":{"abstract_excerpt":"We propose a modified expectation-maximization algorithm by introducing the concept of quantum annealing, which we call the deterministic quantum annealing expectation-maximization (DQAEM) algorithm. The expectation-maximization (EM) algorithm is an established algorithm to compute maximum likelihood estimates and applied to many practical applications. However, it is known that EM heavily depends on initial values and its estimates are sometimes trapped by local optima. To solve such a problem, quantum annealing (QA) was proposed as a novel optimization approach motivated by quantum mechanics","authors_text":"Hideyuki Miyahara, Koji Tsumura, Yuki Sughiyama","cross_cats":["cond-mat.stat-mech","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-12T08:48:03Z","title":"Relaxation of the EM Algorithm via Quantum Annealing for Gaussian Mixture Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03268","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:44d0affc3677f35e4c93374cb4c41c3888f3d8d6a9cb602a0b37fa44c1da4164","target":"record","created_at":"2026-05-18T00:52:58Z","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":"2f7a21d205cdf3a81c793f1f8e08c7d047be1a953b4f9a8491fe5197241019eb","cross_cats_sorted":["cond-mat.stat-mech","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-12T08:48:03Z","title_canon_sha256":"734d26d07241c3ce0b897e5acd6ffd8afb7ccb3c1395f3559a62699d7d9c8150"},"schema_version":"1.0","source":{"id":"1701.03268","kind":"arxiv","version":1}},"canonical_sha256":"ede6c941533b84e6bd2fc0553f50406bffb8cc9a908f8d31247509e826b4d7ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ede6c941533b84e6bd2fc0553f50406bffb8cc9a908f8d31247509e826b4d7ec","first_computed_at":"2026-05-18T00:52:58.071161Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:58.071161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KuKD7ft78DYU4aU5hAsi6/21utX2lbSfPXREoXNt0GhcI213LMOzrf6PGhlKWN0U08Mee2R9T4vFXxz+h+O2Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:58.071554Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.03268","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44d0affc3677f35e4c93374cb4c41c3888f3d8d6a9cb602a0b37fa44c1da4164","sha256:78e71160a2075b4c28910328927f4dcb329b85f480f227cc25c578956e9406b9"],"state_sha256":"69e7537f55126da823aab6a274cb7bef2c89cc5555ab30912c5c37aaabdae146"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D0OmjOanzJ4f2oIv3EVARtOecfblTciupdVl7VMD8ATgNmCLlBBGsHCGYLhyn+l2eaa+pTpX4N1eA6hsJ5guCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T02:30:39.604347Z","bundle_sha256":"2bbaed47308cfe22606618642ec4a89a5f957ae06e06f73519ecc15b26c0c57a"}}