{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KESV52LE5A2CAVISVISQZHU6PY","short_pith_number":"pith:KESV52LE","canonical_record":{"source":{"id":"1602.00522","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"stat.ML","submitted_at":"2016-02-01T13:49:06Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"49d2ad2f2f9dfd4f4d27101a770e3f73a212a0df3a119059659aa733c120e580","abstract_canon_sha256":"3c63eac46af4fe39395cafc0120488afc107844e2e43b9d33cbdba24825232af"},"schema_version":"1.0"},"canonical_sha256":"51255ee964e834205512aa250c9e9e7e129aa0454e8913c79dcb691e5cdccdb9","source":{"kind":"arxiv","id":"1602.00522","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00522","created_at":"2026-05-18T00:05:14Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00522v3","created_at":"2026-05-18T00:05:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00522","created_at":"2026-05-18T00:05:14Z"},{"alias_kind":"pith_short_12","alias_value":"KESV52LE5A2C","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KESV52LE5A2CAVIS","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KESV52LE","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KESV52LE5A2CAVISVISQZHU6PY","target":"record","payload":{"canonical_record":{"source":{"id":"1602.00522","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"stat.ML","submitted_at":"2016-02-01T13:49:06Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"49d2ad2f2f9dfd4f4d27101a770e3f73a212a0df3a119059659aa733c120e580","abstract_canon_sha256":"3c63eac46af4fe39395cafc0120488afc107844e2e43b9d33cbdba24825232af"},"schema_version":"1.0"},"canonical_sha256":"51255ee964e834205512aa250c9e9e7e129aa0454e8913c79dcb691e5cdccdb9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:14.861032Z","signature_b64":"j1o9AqgYxwkQnlDSQJycColKlQczR34hb0z9OSyuLAAOX3cQ5WO7arTzUZAE6KyQdgieM4RbfNtZ7mp4jpDLBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51255ee964e834205512aa250c9e9e7e129aa0454e8913c79dcb691e5cdccdb9","last_reissued_at":"2026-05-18T00:05:14.860281Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:14.860281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.00522","source_version":3,"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:05:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GMcXaYAJQVjOQgYxOc+KOMMrPda/QelKSgvPKCVQd5KAZqMrCusPKrXh8NOsDpogaVc3abZMhlXFv4BCMmNJCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T20:35:05.622796Z"},"content_sha256":"e3612bfdf0a6aab3da6bb836657d6e155120ea09ebde4b6bd3cfcfd57c20f391","schema_version":"1.0","event_id":"sha256:e3612bfdf0a6aab3da6bb836657d6e155120ea09ebde4b6bd3cfcfd57c20f391"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KESV52LE5A2CAVISVISQZHU6PY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Quasi-Bayesian Perspective to Online Clustering","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Benjamin Guedj, Le Li, S\\'ebastien Loustau","submitted_at":"2016-02-01T13:49:06Z","abstract_excerpt":"When faced with high frequency streams of data, clustering raises theoretical and algorithmic pitfalls. We introduce a new and adaptive online clustering algorithm relying on a quasi-Bayesian approach, with a dynamic (i.e., time-dependent) estimation of the (unknown and changing) number of clusters. We prove that our approach is supported by minimax regret bounds. We also provide an RJMCMC-flavored implementation (called PACBO, see https://cran.r-project.org/web/packages/PACBO/index.html) for which we give a convergence guarantee. Finally, numerical experiments illustrate the potential of our "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00522","kind":"arxiv","version":3},"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:05:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8REFtxlIINcvTZZTEnuHlgZsX2DiWS1aA6IEfhu1q54tgwht+X6Y1yOSJXooydiTKBIddkjF6PT7w2vsUf3tDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T20:35:05.623126Z"},"content_sha256":"92b78772c34aad6e75ea4f750ffdcbf034fe9bd4c4718057f3e9e45cd2900c7f","schema_version":"1.0","event_id":"sha256:92b78772c34aad6e75ea4f750ffdcbf034fe9bd4c4718057f3e9e45cd2900c7f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KESV52LE5A2CAVISVISQZHU6PY/bundle.json","state_url":"https://pith.science/pith/KESV52LE5A2CAVISVISQZHU6PY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KESV52LE5A2CAVISVISQZHU6PY/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-27T20:35:05Z","links":{"resolver":"https://pith.science/pith/KESV52LE5A2CAVISVISQZHU6PY","bundle":"https://pith.science/pith/KESV52LE5A2CAVISVISQZHU6PY/bundle.json","state":"https://pith.science/pith/KESV52LE5A2CAVISVISQZHU6PY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KESV52LE5A2CAVISVISQZHU6PY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KESV52LE5A2CAVISVISQZHU6PY","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":"3c63eac46af4fe39395cafc0120488afc107844e2e43b9d33cbdba24825232af","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"stat.ML","submitted_at":"2016-02-01T13:49:06Z","title_canon_sha256":"49d2ad2f2f9dfd4f4d27101a770e3f73a212a0df3a119059659aa733c120e580"},"schema_version":"1.0","source":{"id":"1602.00522","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00522","created_at":"2026-05-18T00:05:14Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00522v3","created_at":"2026-05-18T00:05:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00522","created_at":"2026-05-18T00:05:14Z"},{"alias_kind":"pith_short_12","alias_value":"KESV52LE5A2C","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KESV52LE5A2CAVIS","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KESV52LE","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:92b78772c34aad6e75ea4f750ffdcbf034fe9bd4c4718057f3e9e45cd2900c7f","target":"graph","created_at":"2026-05-18T00:05:14Z","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":"When faced with high frequency streams of data, clustering raises theoretical and algorithmic pitfalls. We introduce a new and adaptive online clustering algorithm relying on a quasi-Bayesian approach, with a dynamic (i.e., time-dependent) estimation of the (unknown and changing) number of clusters. We prove that our approach is supported by minimax regret bounds. We also provide an RJMCMC-flavored implementation (called PACBO, see https://cran.r-project.org/web/packages/PACBO/index.html) for which we give a convergence guarantee. Finally, numerical experiments illustrate the potential of our ","authors_text":"Benjamin Guedj, Le Li, S\\'ebastien Loustau","cross_cats":["math.ST","stat.TH"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"stat.ML","submitted_at":"2016-02-01T13:49:06Z","title":"A Quasi-Bayesian Perspective to Online Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00522","kind":"arxiv","version":3},"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:e3612bfdf0a6aab3da6bb836657d6e155120ea09ebde4b6bd3cfcfd57c20f391","target":"record","created_at":"2026-05-18T00:05:14Z","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":"3c63eac46af4fe39395cafc0120488afc107844e2e43b9d33cbdba24825232af","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"stat.ML","submitted_at":"2016-02-01T13:49:06Z","title_canon_sha256":"49d2ad2f2f9dfd4f4d27101a770e3f73a212a0df3a119059659aa733c120e580"},"schema_version":"1.0","source":{"id":"1602.00522","kind":"arxiv","version":3}},"canonical_sha256":"51255ee964e834205512aa250c9e9e7e129aa0454e8913c79dcb691e5cdccdb9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51255ee964e834205512aa250c9e9e7e129aa0454e8913c79dcb691e5cdccdb9","first_computed_at":"2026-05-18T00:05:14.860281Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:14.860281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j1o9AqgYxwkQnlDSQJycColKlQczR34hb0z9OSyuLAAOX3cQ5WO7arTzUZAE6KyQdgieM4RbfNtZ7mp4jpDLBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:14.861032Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.00522","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e3612bfdf0a6aab3da6bb836657d6e155120ea09ebde4b6bd3cfcfd57c20f391","sha256:92b78772c34aad6e75ea4f750ffdcbf034fe9bd4c4718057f3e9e45cd2900c7f"],"state_sha256":"a30cb7d88020d7b822fdc6d5f7473bda32a1ce6e579f0d0d951def4d611a681c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+1HXbqMk2xrik6ohghfl1LA+qa9pAzSonXLYJNmk1bPvVDUJMDOhK5zuiaSMvSqZPxPJmN/rQQI9G7fKhW/+Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T20:35:05.624920Z","bundle_sha256":"e6e0bc13f0cfba18fce874e2ca298140ecfb711be14dd849fefcf90d91951db1"}}