{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:A43LSBTV7BBMJVB3544JYYR7KN","short_pith_number":"pith:A43LSBTV","schema_version":"1.0","canonical_sha256":"0736b90675f842c4d43bef389c623f5372bb9349d30252a43462bbbf97e2e79e","source":{"kind":"arxiv","id":"2602.00878","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2602.00878","created_at":"2026-06-02T01:03:41.704694+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.00878v2","created_at":"2026-06-02T01:03:41.704694+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.00878","created_at":"2026-06-02T01:03:41.704694+00:00"},{"alias_kind":"pith_short_12","alias_value":"A43LSBTV7BBM","created_at":"2026-06-02T01:03:41.704694+00:00"},{"alias_kind":"pith_short_16","alias_value":"A43LSBTV7BBMJVB3","created_at":"2026-06-02T01:03:41.704694+00:00"},{"alias_kind":"pith_short_8","alias_value":"A43LSBTV","created_at":"2026-06-02T01:03:41.704694+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.25410","citing_title":"Laplace and skew-Laplace approximations for Dirichlet process mixture posterior density","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A43LSBTV7BBMJVB3544JYYR7KN","json":"https://pith.science/pith/A43LSBTV7BBMJVB3544JYYR7KN.json","graph_json":"https://pith.science/api/pith-number/A43LSBTV7BBMJVB3544JYYR7KN/graph.json","events_json":"https://pith.science/api/pith-number/A43LSBTV7BBMJVB3544JYYR7KN/events.json","paper":"https://pith.science/paper/A43LSBTV"},"agent_actions":{"view_html":"https://pith.science/pith/A43LSBTV7BBMJVB3544JYYR7KN","download_json":"https://pith.science/pith/A43LSBTV7BBMJVB3544JYYR7KN.json","view_paper":"https://pith.science/paper/A43LSBTV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.00878&json=true","fetch_graph":"https://pith.science/api/pith-number/A43LSBTV7BBMJVB3544JYYR7KN/graph.json","fetch_events":"https://pith.science/api/pith-number/A43LSBTV7BBMJVB3544JYYR7KN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A43LSBTV7BBMJVB3544JYYR7KN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A43LSBTV7BBMJVB3544JYYR7KN/action/storage_attestation","attest_author":"https://pith.science/pith/A43LSBTV7BBMJVB3544JYYR7KN/action/author_attestation","sign_citation":"https://pith.science/pith/A43LSBTV7BBMJVB3544JYYR7KN/action/citation_signature","submit_replication":"https://pith.science/pith/A43LSBTV7BBMJVB3544JYYR7KN/action/replication_record"}},"created_at":"2026-06-02T01:03:41.704694+00:00","updated_at":"2026-06-02T01:03:41.704694+00:00"}