{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:A43LSBTV7BBMJVB3544JYYR7KN","short_pith_number":"pith:A43LSBTV","canonical_record":{"source":{"id":"2602.00878","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.CO","submitted_at":"2026-01-31T19:46:19Z","cross_cats_sorted":[],"title_canon_sha256":"e22cbcdaadb5259192d6557a8709248f81601359bcb5671a034901e1ca767063","abstract_canon_sha256":"d58249ed855804f492c673302651de176e9639300aceea5652e6b5d935ba88d6"},"schema_version":"1.0"},"canonical_sha256":"0736b90675f842c4d43bef389c623f5372bb9349d30252a43462bbbf97e2e79e","source":{"kind":"arxiv","id":"2602.00878","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.00878","created_at":"2026-06-02T01:03:41Z"},{"alias_kind":"arxiv_version","alias_value":"2602.00878v2","created_at":"2026-06-02T01:03:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.00878","created_at":"2026-06-02T01:03:41Z"},{"alias_kind":"pith_short_12","alias_value":"A43LSBTV7BBM","created_at":"2026-06-02T01:03:41Z"},{"alias_kind":"pith_short_16","alias_value":"A43LSBTV7BBMJVB3","created_at":"2026-06-02T01:03:41Z"},{"alias_kind":"pith_short_8","alias_value":"A43LSBTV","created_at":"2026-06-02T01:03:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:A43LSBTV7BBMJVB3544JYYR7KN","target":"record","payload":{"canonical_record":{"source":{"id":"2602.00878","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.CO","submitted_at":"2026-01-31T19:46:19Z","cross_cats_sorted":[],"title_canon_sha256":"e22cbcdaadb5259192d6557a8709248f81601359bcb5671a034901e1ca767063","abstract_canon_sha256":"d58249ed855804f492c673302651de176e9639300aceea5652e6b5d935ba88d6"},"schema_version":"1.0"},"canonical_sha256":"0736b90675f842c4d43bef389c623f5372bb9349d30252a43462bbbf97e2e79e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:03:41.705159Z","signature_b64":"SmVkLbVjXdOzNPm2yaekqEbAPx/OKLAlpuQZH8LnBf9+mrZ38jFXIzuNKMXY31WWKnQvaOaIrRR7BWM7SfrWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0736b90675f842c4d43bef389c623f5372bb9349d30252a43462bbbf97e2e79e","last_reissued_at":"2026-06-02T01:03:41.704636Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:03:41.704636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2602.00878","source_version":2,"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-06-02T01:03:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sq8PQJEy78cc4M2AwXK9RRqfrCvqQ4uJwfNKSuSf5XMGxd2BsTPQpOklDgrZwn93tCbGT++SET48NY2ttkXACQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T12:52:30.595825Z"},"content_sha256":"7e1636f55a4d63fe0dcb53f699f96b024e0a15c7f137f6bb256a44e51e6c1574","schema_version":"1.0","event_id":"sha256:7e1636f55a4d63fe0dcb53f699f96b024e0a15c7f137f6bb256a44e51e6c1574"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:A43LSBTV7BBMJVB3544JYYR7KN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity bounds for Dirichlet process slice samplers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Beatrice Franzolini, Francesco Gaffi","submitted_at":"2026-01-31T19:46:19Z","abstract_excerpt":"Slice sampling is a standard Monte Carlo technique for Dirichlet process (DP)-based models, widely used in posterior simulation. However, formal assessments of the scalability of posterior slice samplers have remained largely unexplored, primarily because the computational cost of a slice-sampling iteration is random and potentially unbounded. In this work, we obtain high-probability bounds on the computational complexity of DP slice samplers. Our main results show that, uniformly across posterior cluster-growth regimes, the overhead induced by slice variables, relatively to the number of clus"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.00878","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2602.00878/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-02T01:03:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/FkroYOuB1eYZgeRwBWmweETyNRasOBzBYwmWxthFM5EWXFhIrmxqs8E3C5Fil+HetbHKM9Kcx2J9RTEQHhmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T12:52:30.596582Z"},"content_sha256":"3d351932000429de8bbe1c325b7099250eb00cb2ed2b9170c8a90300100c8ab0","schema_version":"1.0","event_id":"sha256:3d351932000429de8bbe1c325b7099250eb00cb2ed2b9170c8a90300100c8ab0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A43LSBTV7BBMJVB3544JYYR7KN/bundle.json","state_url":"https://pith.science/pith/A43LSBTV7BBMJVB3544JYYR7KN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A43LSBTV7BBMJVB3544JYYR7KN/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-10T12:52:30Z","links":{"resolver":"https://pith.science/pith/A43LSBTV7BBMJVB3544JYYR7KN","bundle":"https://pith.science/pith/A43LSBTV7BBMJVB3544JYYR7KN/bundle.json","state":"https://pith.science/pith/A43LSBTV7BBMJVB3544JYYR7KN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A43LSBTV7BBMJVB3544JYYR7KN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:A43LSBTV7BBMJVB3544JYYR7KN","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":"d58249ed855804f492c673302651de176e9639300aceea5652e6b5d935ba88d6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.CO","submitted_at":"2026-01-31T19:46:19Z","title_canon_sha256":"e22cbcdaadb5259192d6557a8709248f81601359bcb5671a034901e1ca767063"},"schema_version":"1.0","source":{"id":"2602.00878","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.00878","created_at":"2026-06-02T01:03:41Z"},{"alias_kind":"arxiv_version","alias_value":"2602.00878v2","created_at":"2026-06-02T01:03:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.00878","created_at":"2026-06-02T01:03:41Z"},{"alias_kind":"pith_short_12","alias_value":"A43LSBTV7BBM","created_at":"2026-06-02T01:03:41Z"},{"alias_kind":"pith_short_16","alias_value":"A43LSBTV7BBMJVB3","created_at":"2026-06-02T01:03:41Z"},{"alias_kind":"pith_short_8","alias_value":"A43LSBTV","created_at":"2026-06-02T01:03:41Z"}],"graph_snapshots":[{"event_id":"sha256:3d351932000429de8bbe1c325b7099250eb00cb2ed2b9170c8a90300100c8ab0","target":"graph","created_at":"2026-06-02T01:03:41Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2602.00878/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Slice sampling is a standard Monte Carlo technique for Dirichlet process (DP)-based models, widely used in posterior simulation. However, formal assessments of the scalability of posterior slice samplers have remained largely unexplored, primarily because the computational cost of a slice-sampling iteration is random and potentially unbounded. In this work, we obtain high-probability bounds on the computational complexity of DP slice samplers. Our main results show that, uniformly across posterior cluster-growth regimes, the overhead induced by slice variables, relatively to the number of clus","authors_text":"Beatrice Franzolini, Francesco Gaffi","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.CO","submitted_at":"2026-01-31T19:46:19Z","title":"Complexity bounds for Dirichlet process slice samplers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.00878","kind":"arxiv","version":2},"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:7e1636f55a4d63fe0dcb53f699f96b024e0a15c7f137f6bb256a44e51e6c1574","target":"record","created_at":"2026-06-02T01:03:41Z","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":"d58249ed855804f492c673302651de176e9639300aceea5652e6b5d935ba88d6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.CO","submitted_at":"2026-01-31T19:46:19Z","title_canon_sha256":"e22cbcdaadb5259192d6557a8709248f81601359bcb5671a034901e1ca767063"},"schema_version":"1.0","source":{"id":"2602.00878","kind":"arxiv","version":2}},"canonical_sha256":"0736b90675f842c4d43bef389c623f5372bb9349d30252a43462bbbf97e2e79e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0736b90675f842c4d43bef389c623f5372bb9349d30252a43462bbbf97e2e79e","first_computed_at":"2026-06-02T01:03:41.704636Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T01:03:41.704636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SmVkLbVjXdOzNPm2yaekqEbAPx/OKLAlpuQZH8LnBf9+mrZ38jFXIzuNKMXY31WWKnQvaOaIrRR7BWM7SfrWCQ==","signature_status":"signed_v1","signed_at":"2026-06-02T01:03:41.705159Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.00878","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e1636f55a4d63fe0dcb53f699f96b024e0a15c7f137f6bb256a44e51e6c1574","sha256:3d351932000429de8bbe1c325b7099250eb00cb2ed2b9170c8a90300100c8ab0"],"state_sha256":"d86330debadf3b027dcabed6f17fceba2c58e3d50c486d3ef0e4f14a793bddf1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SAxcyhMVoQgGpD9qywFmFD3LA2opx6sivsyFiA0l9eqQEtLkN9wvxvtmXaxzLvRP3McghF2h/6vYr0A4XVyACw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T12:52:30.601287Z","bundle_sha256":"3313c45da6eff1d87a8308706ed001f9eb7282fce8669bb3cb97297c57da4377"}}