{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SVQ5HTKVUWRI4YTBVNT3WZPJXS","short_pith_number":"pith:SVQ5HTKV","canonical_record":{"source":{"id":"1707.09094","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2017-07-28T03:15:22Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f6d3204a10f70da8af866014d1125f90b631674a82459f77d70b1bf4a93ad2cf","abstract_canon_sha256":"868343f1069a9d51ad20e06b7c79253c04f699d265db5b99b4eba9163ee1d850"},"schema_version":"1.0"},"canonical_sha256":"9561d3cd55a5a28e6261ab67bb65e9bcb1e02f9198e62e7bb23203dd7d258195","source":{"kind":"arxiv","id":"1707.09094","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.09094","created_at":"2026-05-18T00:16:23Z"},{"alias_kind":"arxiv_version","alias_value":"1707.09094v1","created_at":"2026-05-18T00:16:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.09094","created_at":"2026-05-18T00:16:23Z"},{"alias_kind":"pith_short_12","alias_value":"SVQ5HTKVUWRI","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SVQ5HTKVUWRI4YTB","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SVQ5HTKV","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SVQ5HTKVUWRI4YTBVNT3WZPJXS","target":"record","payload":{"canonical_record":{"source":{"id":"1707.09094","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2017-07-28T03:15:22Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f6d3204a10f70da8af866014d1125f90b631674a82459f77d70b1bf4a93ad2cf","abstract_canon_sha256":"868343f1069a9d51ad20e06b7c79253c04f699d265db5b99b4eba9163ee1d850"},"schema_version":"1.0"},"canonical_sha256":"9561d3cd55a5a28e6261ab67bb65e9bcb1e02f9198e62e7bb23203dd7d258195","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:23.669645Z","signature_b64":"r0dtM5FNuzt4YX40tEjBRLYFsgbb4VvRC+gSH2ITjoKtIaCltpHnh0UhZAaRpSZ0Y/jkMjYo7RRM9y6j0e1CBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9561d3cd55a5a28e6261ab67bb65e9bcb1e02f9198e62e7bb23203dd7d258195","last_reissued_at":"2026-05-18T00:16:23.668996Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:23.668996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.09094","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:16:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"drNDdE4EYS75NCuLPCQBM2MYAYkMcPxctnq+uLBPdcoAMwHzOLygxt64FCyvF2jiuVrkAUCzADie1e/hgTO+Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:23:35.807227Z"},"content_sha256":"ebcada641e42828f9e2cc993c144851d525f68f6866b655ef8f847a5109bd999","schema_version":"1.0","event_id":"sha256:ebcada641e42828f9e2cc993c144851d525f68f6866b655ef8f847a5109bd999"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SVQ5HTKVUWRI4YTBVNT3WZPJXS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Open Source C++ Implementation of Multi-Threaded Gaussian Mixture Models, k-Means and Expectation Maximisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.MS","authors_text":"Conrad Sanderson, Ryan Curtin","submitted_at":"2017-07-28T03:15:22Z","abstract_excerpt":"Modelling of multivariate densities is a core component in many signal processing, pattern recognition and machine learning applications. The modelling is often done via Gaussian mixture models (GMMs), which use computationally expensive and potentially unstable training algorithms. We provide an overview of a fast and robust implementation of GMMs in the C++ language, employing multi-threaded versions of the Expectation Maximisation (EM) and k-means training algorithms. Multi-threading is achieved through reformulation of the EM and k-means algorithms into a MapReduce-like framework. Furtherm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.09094","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:16:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M4DuiA3Rb4ioq5rhMlNdRjOZZYkGxejb5cT4uc6uan2G6By7iR6hH7KyKYaD/LGOI3zHkd4Zid8aYoFYjGMwCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:23:35.807585Z"},"content_sha256":"c8d91d13674411b230de344019d4d3f96afdc254ca1f9cf1c78a47771d9b7918","schema_version":"1.0","event_id":"sha256:c8d91d13674411b230de344019d4d3f96afdc254ca1f9cf1c78a47771d9b7918"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SVQ5HTKVUWRI4YTBVNT3WZPJXS/bundle.json","state_url":"https://pith.science/pith/SVQ5HTKVUWRI4YTBVNT3WZPJXS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SVQ5HTKVUWRI4YTBVNT3WZPJXS/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-31T12:23:35Z","links":{"resolver":"https://pith.science/pith/SVQ5HTKVUWRI4YTBVNT3WZPJXS","bundle":"https://pith.science/pith/SVQ5HTKVUWRI4YTBVNT3WZPJXS/bundle.json","state":"https://pith.science/pith/SVQ5HTKVUWRI4YTBVNT3WZPJXS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SVQ5HTKVUWRI4YTBVNT3WZPJXS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SVQ5HTKVUWRI4YTBVNT3WZPJXS","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":"868343f1069a9d51ad20e06b7c79253c04f699d265db5b99b4eba9163ee1d850","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2017-07-28T03:15:22Z","title_canon_sha256":"f6d3204a10f70da8af866014d1125f90b631674a82459f77d70b1bf4a93ad2cf"},"schema_version":"1.0","source":{"id":"1707.09094","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.09094","created_at":"2026-05-18T00:16:23Z"},{"alias_kind":"arxiv_version","alias_value":"1707.09094v1","created_at":"2026-05-18T00:16:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.09094","created_at":"2026-05-18T00:16:23Z"},{"alias_kind":"pith_short_12","alias_value":"SVQ5HTKVUWRI","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SVQ5HTKVUWRI4YTB","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SVQ5HTKV","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:c8d91d13674411b230de344019d4d3f96afdc254ca1f9cf1c78a47771d9b7918","target":"graph","created_at":"2026-05-18T00:16:23Z","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":"Modelling of multivariate densities is a core component in many signal processing, pattern recognition and machine learning applications. The modelling is often done via Gaussian mixture models (GMMs), which use computationally expensive and potentially unstable training algorithms. We provide an overview of a fast and robust implementation of GMMs in the C++ language, employing multi-threaded versions of the Expectation Maximisation (EM) and k-means training algorithms. Multi-threading is achieved through reformulation of the EM and k-means algorithms into a MapReduce-like framework. Furtherm","authors_text":"Conrad Sanderson, Ryan Curtin","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2017-07-28T03:15:22Z","title":"An Open Source C++ Implementation of Multi-Threaded Gaussian Mixture Models, k-Means and Expectation Maximisation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.09094","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:ebcada641e42828f9e2cc993c144851d525f68f6866b655ef8f847a5109bd999","target":"record","created_at":"2026-05-18T00:16:23Z","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":"868343f1069a9d51ad20e06b7c79253c04f699d265db5b99b4eba9163ee1d850","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2017-07-28T03:15:22Z","title_canon_sha256":"f6d3204a10f70da8af866014d1125f90b631674a82459f77d70b1bf4a93ad2cf"},"schema_version":"1.0","source":{"id":"1707.09094","kind":"arxiv","version":1}},"canonical_sha256":"9561d3cd55a5a28e6261ab67bb65e9bcb1e02f9198e62e7bb23203dd7d258195","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9561d3cd55a5a28e6261ab67bb65e9bcb1e02f9198e62e7bb23203dd7d258195","first_computed_at":"2026-05-18T00:16:23.668996Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:23.668996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r0dtM5FNuzt4YX40tEjBRLYFsgbb4VvRC+gSH2ITjoKtIaCltpHnh0UhZAaRpSZ0Y/jkMjYo7RRM9y6j0e1CBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:23.669645Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.09094","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ebcada641e42828f9e2cc993c144851d525f68f6866b655ef8f847a5109bd999","sha256:c8d91d13674411b230de344019d4d3f96afdc254ca1f9cf1c78a47771d9b7918"],"state_sha256":"8547a36a302f98244255e43c64c9209ca874b4b8e15edeb5c44b5177d0783b95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/xHw+f2N4jdtOTQhBk8lgUoaq0m/szJLMjYI8Py8Gx5PyDNno285JFBf6ElwNO0yOfbrkE73tL9kjJ9hlYikCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:23:35.809597Z","bundle_sha256":"cc703079982052c66cb91690e3098806d1c91a3b33ce4d95f5d2576b49bd5a65"}}