{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:VJEUQZQ4M3G52LKTGWSUZTZVBA","short_pith_number":"pith:VJEUQZQ4","canonical_record":{"source":{"id":"2409.19129","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.ST","submitted_at":"2024-09-27T20:22:01Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"5b60909ceeb1c77f6fd1b95e7d4f9f67490f76c2dfa21ac9dd2db41dc8cc1991","abstract_canon_sha256":"56cf81112fc6cad59ab77f5520f8a5083cc2af248bfd097568224206e2f64e7b"},"schema_version":"1.0"},"canonical_sha256":"aa4948661c66cddd2d5335a54ccf3508148394deeb61e380d7fab4b1dc75d4dd","source":{"kind":"arxiv","id":"2409.19129","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.19129","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"2409.19129v4","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.19129","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"VJEUQZQ4M3G5","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"VJEUQZQ4M3G52LKT","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"VJEUQZQ4","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:VJEUQZQ4M3G52LKTGWSUZTZVBA","target":"record","payload":{"canonical_record":{"source":{"id":"2409.19129","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.ST","submitted_at":"2024-09-27T20:22:01Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"5b60909ceeb1c77f6fd1b95e7d4f9f67490f76c2dfa21ac9dd2db41dc8cc1991","abstract_canon_sha256":"56cf81112fc6cad59ab77f5520f8a5083cc2af248bfd097568224206e2f64e7b"},"schema_version":"1.0"},"canonical_sha256":"aa4948661c66cddd2d5335a54ccf3508148394deeb61e380d7fab4b1dc75d4dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:18.369513Z","signature_b64":"/IVdolbtwFoYYFFO0glDcgaxPgXNkyjzmk/IziWqx1CqKaqtBgqK/bLbW4w8+sjsvhpu/3bVx0Y19a5DINSRBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa4948661c66cddd2d5335a54ccf3508148394deeb61e380d7fab4b1dc75d4dd","last_reissued_at":"2026-05-17T23:39:18.368833Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:18.368833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2409.19129","source_version":4,"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-17T23:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7UFOFkHMPcc3/oTqyk39xM0hfm6hbJ2ISNQaGP/2IdTGu/kPK32pBc2A/acO/fKd49+z1T84JnVNLhsNUrARAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T20:21:52.157074Z"},"content_sha256":"7b2e6a4b333f8bab4838627f6bc1786982b76fe42693981fe7c82ab9209a09a4","schema_version":"1.0","event_id":"sha256:7b2e6a4b333f8bab4838627f6bc1786982b76fe42693981fe7c82ab9209a09a4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:VJEUQZQ4M3G52LKTGWSUZTZVBA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Consistency of Graphical Model-based Clustering: Robust Clustering using Bayesian Spanning Forest","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Arkaprava Roy, Leo L. Duan, Yu Zheng","submitted_at":"2024-09-27T20:22:01Z","abstract_excerpt":"Mixture model-based frameworks are very popular for statistical inference in clustering. While convenient for producing probabilistic estimates of cluster assignments and uncertainty, they are prone to misspecification, which can lead to inconsistent clustering results. Graphical model-based clustering adopts a different strategy, specifying the likelihood by treating data as dependently generated from a disjoint union of component graphs. Recent work on Bayesian spanning forests addresses graph uncertainty by using the integrated posterior of the node partition, marginalized over the latent e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.19129","kind":"arxiv","version":4},"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-17T23:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wzMYHsonSu3dc4p84Yh14GhD4aIQupmdu3kq7RlqPJXULJtsvZnq7jnFTjhwm50AdEQ4ao7wQsASg4P6mzbqAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T20:21:52.157746Z"},"content_sha256":"7e63a5d929bd3e85a96f0f7b7a47809345d208e8f69eed94a546aaf0e71230d3","schema_version":"1.0","event_id":"sha256:7e63a5d929bd3e85a96f0f7b7a47809345d208e8f69eed94a546aaf0e71230d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VJEUQZQ4M3G52LKTGWSUZTZVBA/bundle.json","state_url":"https://pith.science/pith/VJEUQZQ4M3G52LKTGWSUZTZVBA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VJEUQZQ4M3G52LKTGWSUZTZVBA/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-06-11T20:21:52Z","links":{"resolver":"https://pith.science/pith/VJEUQZQ4M3G52LKTGWSUZTZVBA","bundle":"https://pith.science/pith/VJEUQZQ4M3G52LKTGWSUZTZVBA/bundle.json","state":"https://pith.science/pith/VJEUQZQ4M3G52LKTGWSUZTZVBA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VJEUQZQ4M3G52LKTGWSUZTZVBA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:VJEUQZQ4M3G52LKTGWSUZTZVBA","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":"56cf81112fc6cad59ab77f5520f8a5083cc2af248bfd097568224206e2f64e7b","cross_cats_sorted":["stat.TH"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.ST","submitted_at":"2024-09-27T20:22:01Z","title_canon_sha256":"5b60909ceeb1c77f6fd1b95e7d4f9f67490f76c2dfa21ac9dd2db41dc8cc1991"},"schema_version":"1.0","source":{"id":"2409.19129","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.19129","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"2409.19129v4","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.19129","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"VJEUQZQ4M3G5","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"VJEUQZQ4M3G52LKT","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"VJEUQZQ4","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:7e63a5d929bd3e85a96f0f7b7a47809345d208e8f69eed94a546aaf0e71230d3","target":"graph","created_at":"2026-05-17T23:39:18Z","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":"Mixture model-based frameworks are very popular for statistical inference in clustering. While convenient for producing probabilistic estimates of cluster assignments and uncertainty, they are prone to misspecification, which can lead to inconsistent clustering results. Graphical model-based clustering adopts a different strategy, specifying the likelihood by treating data as dependently generated from a disjoint union of component graphs. Recent work on Bayesian spanning forests addresses graph uncertainty by using the integrated posterior of the node partition, marginalized over the latent e","authors_text":"Arkaprava Roy, Leo L. Duan, Yu Zheng","cross_cats":["stat.TH"],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.ST","submitted_at":"2024-09-27T20:22:01Z","title":"Consistency of Graphical Model-based Clustering: Robust Clustering using Bayesian Spanning Forest"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.19129","kind":"arxiv","version":4},"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:7b2e6a4b333f8bab4838627f6bc1786982b76fe42693981fe7c82ab9209a09a4","target":"record","created_at":"2026-05-17T23:39:18Z","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":"56cf81112fc6cad59ab77f5520f8a5083cc2af248bfd097568224206e2f64e7b","cross_cats_sorted":["stat.TH"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.ST","submitted_at":"2024-09-27T20:22:01Z","title_canon_sha256":"5b60909ceeb1c77f6fd1b95e7d4f9f67490f76c2dfa21ac9dd2db41dc8cc1991"},"schema_version":"1.0","source":{"id":"2409.19129","kind":"arxiv","version":4}},"canonical_sha256":"aa4948661c66cddd2d5335a54ccf3508148394deeb61e380d7fab4b1dc75d4dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa4948661c66cddd2d5335a54ccf3508148394deeb61e380d7fab4b1dc75d4dd","first_computed_at":"2026-05-17T23:39:18.368833Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:18.368833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/IVdolbtwFoYYFFO0glDcgaxPgXNkyjzmk/IziWqx1CqKaqtBgqK/bLbW4w8+sjsvhpu/3bVx0Y19a5DINSRBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:18.369513Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.19129","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b2e6a4b333f8bab4838627f6bc1786982b76fe42693981fe7c82ab9209a09a4","sha256:7e63a5d929bd3e85a96f0f7b7a47809345d208e8f69eed94a546aaf0e71230d3"],"state_sha256":"c8a637a3624e2780902314fa605cdb578c0a87ae4a582ab6ed566cdcc8cacc0f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kBt3RHKZQG0gQFmISbTbJUeEWBNZP9ONy6ZrKgEEjjks/17wcAGhaxJuQcPnKgBj1bvWaooNPH6o4VNgpbwzBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T20:21:52.161686Z","bundle_sha256":"a3a8055c9a592363fd1477cd415fe6874f10cd59a1d91f151d7d61e4b09d6ef5"}}