{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NHLLB752AUBNOVVZMMTFOTWKMX","short_pith_number":"pith:NHLLB752","canonical_record":{"source":{"id":"1810.05450","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-10-12T11:17:17Z","cross_cats_sorted":["q-bio.GN","stat.AP"],"title_canon_sha256":"209d83556fa6d20950b2907235c4681f672a225625f55396d6c5a9646c9dff9b","abstract_canon_sha256":"b79fe2a8dc1504766f35d66259aea1e503d3aee3db30b0e0ef41624fc979cbd8"},"schema_version":"1.0"},"canonical_sha256":"69d6b0ffba0502d756b96326574eca65eba3c07fed3eb1ca36d90e536e2d404e","source":{"kind":"arxiv","id":"1810.05450","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05450","created_at":"2026-05-18T00:03:30Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05450v1","created_at":"2026-05-18T00:03:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05450","created_at":"2026-05-18T00:03:30Z"},{"alias_kind":"pith_short_12","alias_value":"NHLLB752AUBN","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NHLLB752AUBNOVVZ","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NHLLB752","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NHLLB752AUBNOVVZMMTFOTWKMX","target":"record","payload":{"canonical_record":{"source":{"id":"1810.05450","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-10-12T11:17:17Z","cross_cats_sorted":["q-bio.GN","stat.AP"],"title_canon_sha256":"209d83556fa6d20950b2907235c4681f672a225625f55396d6c5a9646c9dff9b","abstract_canon_sha256":"b79fe2a8dc1504766f35d66259aea1e503d3aee3db30b0e0ef41624fc979cbd8"},"schema_version":"1.0"},"canonical_sha256":"69d6b0ffba0502d756b96326574eca65eba3c07fed3eb1ca36d90e536e2d404e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:30.508668Z","signature_b64":"zIKkGKvmpDLsj+5m3t+TQ2xzSKMm4lzG+XoW4eSOI+95l1nnsjpIop5kooCppbj29fPjQkyhP1+rdRYNleWtDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69d6b0ffba0502d756b96326574eca65eba3c07fed3eb1ca36d90e536e2d404e","last_reissued_at":"2026-05-18T00:03:30.508103Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:30.508103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.05450","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:03:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8g29r1I0ttUcmSBd0D4WeR8SI8fFO6Nhq40oaAsaglAZOGtNswT0hygJMP6/KOUTjig5KW3z/eVVkjDdsri6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T10:55:31.089628Z"},"content_sha256":"443f353750546822d7638c6349bcf06de9660d37add70343268daacf9e8edc61","schema_version":"1.0","event_id":"sha256:443f353750546822d7638c6349bcf06de9660d37add70343268daacf9e8edc61"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NHLLB752AUBNOVVZMMTFOTWKMX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast approximate inference for variable selection in Dirichlet process mixtures, with an application to pan-cancer proteomics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.GN","stat.AP"],"primary_cat":"stat.ME","authors_text":"Laurent Gatto, Oliver M. Crook, Paul D. W. Kirk","submitted_at":"2018-10-12T11:17:17Z","abstract_excerpt":"The Dirichlet Process (DP) mixture model has become a popular choice for model-based clustering, largely because it allows the number of clusters to be inferred. The sequential updating and greedy search (SUGS) algorithm (Wang and Dunson, 2011) was proposed as a fast method for performing approximate Bayesian inference in DP mixture models, by posing clustering as a Bayesian model selection (BMS) problem and avoiding the use of computationally costly Markov chain Monte Carlo methods. Here we consider how this approach may be extended to permit variable selection for clustering, and also demons"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05450","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:03:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nhPYOs4CZ4UTmmJSaXbasulFIS8cQScZnjHLbcS9jqxXK3VrAXBcpBukBVi/MyBGy05Av72bTa1GQEdBoKWnDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T10:55:31.089971Z"},"content_sha256":"b0d1a2c98e145c6bfb33bff7178f04dbb655f13843a6a433ec657cfa18286fb1","schema_version":"1.0","event_id":"sha256:b0d1a2c98e145c6bfb33bff7178f04dbb655f13843a6a433ec657cfa18286fb1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NHLLB752AUBNOVVZMMTFOTWKMX/bundle.json","state_url":"https://pith.science/pith/NHLLB752AUBNOVVZMMTFOTWKMX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NHLLB752AUBNOVVZMMTFOTWKMX/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-07-02T10:55:31Z","links":{"resolver":"https://pith.science/pith/NHLLB752AUBNOVVZMMTFOTWKMX","bundle":"https://pith.science/pith/NHLLB752AUBNOVVZMMTFOTWKMX/bundle.json","state":"https://pith.science/pith/NHLLB752AUBNOVVZMMTFOTWKMX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NHLLB752AUBNOVVZMMTFOTWKMX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NHLLB752AUBNOVVZMMTFOTWKMX","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":"b79fe2a8dc1504766f35d66259aea1e503d3aee3db30b0e0ef41624fc979cbd8","cross_cats_sorted":["q-bio.GN","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-10-12T11:17:17Z","title_canon_sha256":"209d83556fa6d20950b2907235c4681f672a225625f55396d6c5a9646c9dff9b"},"schema_version":"1.0","source":{"id":"1810.05450","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05450","created_at":"2026-05-18T00:03:30Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05450v1","created_at":"2026-05-18T00:03:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05450","created_at":"2026-05-18T00:03:30Z"},{"alias_kind":"pith_short_12","alias_value":"NHLLB752AUBN","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NHLLB752AUBNOVVZ","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NHLLB752","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:b0d1a2c98e145c6bfb33bff7178f04dbb655f13843a6a433ec657cfa18286fb1","target":"graph","created_at":"2026-05-18T00:03:30Z","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":"The Dirichlet Process (DP) mixture model has become a popular choice for model-based clustering, largely because it allows the number of clusters to be inferred. The sequential updating and greedy search (SUGS) algorithm (Wang and Dunson, 2011) was proposed as a fast method for performing approximate Bayesian inference in DP mixture models, by posing clustering as a Bayesian model selection (BMS) problem and avoiding the use of computationally costly Markov chain Monte Carlo methods. Here we consider how this approach may be extended to permit variable selection for clustering, and also demons","authors_text":"Laurent Gatto, Oliver M. Crook, Paul D. W. Kirk","cross_cats":["q-bio.GN","stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-10-12T11:17:17Z","title":"Fast approximate inference for variable selection in Dirichlet process mixtures, with an application to pan-cancer proteomics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05450","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:443f353750546822d7638c6349bcf06de9660d37add70343268daacf9e8edc61","target":"record","created_at":"2026-05-18T00:03:30Z","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":"b79fe2a8dc1504766f35d66259aea1e503d3aee3db30b0e0ef41624fc979cbd8","cross_cats_sorted":["q-bio.GN","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-10-12T11:17:17Z","title_canon_sha256":"209d83556fa6d20950b2907235c4681f672a225625f55396d6c5a9646c9dff9b"},"schema_version":"1.0","source":{"id":"1810.05450","kind":"arxiv","version":1}},"canonical_sha256":"69d6b0ffba0502d756b96326574eca65eba3c07fed3eb1ca36d90e536e2d404e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69d6b0ffba0502d756b96326574eca65eba3c07fed3eb1ca36d90e536e2d404e","first_computed_at":"2026-05-18T00:03:30.508103Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:30.508103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zIKkGKvmpDLsj+5m3t+TQ2xzSKMm4lzG+XoW4eSOI+95l1nnsjpIop5kooCppbj29fPjQkyhP1+rdRYNleWtDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:30.508668Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.05450","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:443f353750546822d7638c6349bcf06de9660d37add70343268daacf9e8edc61","sha256:b0d1a2c98e145c6bfb33bff7178f04dbb655f13843a6a433ec657cfa18286fb1"],"state_sha256":"91fcc9eb79b7870784270065f1100f4c1c04cd17cf065f5f7b60c7dc17ad9831"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xuWUGWV/3u68VkSclFC/5BbF2yLv33VK4mqCV5Jl3oMNZr/rBi/ybuyl+no+gTdsqOejrzFc9JXKFtx0KattBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T10:55:31.091915Z","bundle_sha256":"b53ca492c3dd8e9e4676224bde5630b44728e17012fda304f6abc18ccf810023"}}