{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:MUGRFMQURS3QAYDGF5JNHQHFPN","short_pith_number":"pith:MUGRFMQU","canonical_record":{"source":{"id":"1411.3434","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-11-13T03:06:37Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"5b6d659983747f847c8cdabc2baa29a25bb6182d011cceb081433bc2f32e4fb0","abstract_canon_sha256":"4b45cca30d4d6f9f552538cf3c1cc771a23f436e1fe5319183d0251d74c37e71"},"schema_version":"1.0"},"canonical_sha256":"650d12b2148cb70060662f52d3c0e57b720eac8df649ae6d0adab8a844780981","source":{"kind":"arxiv","id":"1411.3434","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.3434","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"arxiv_version","alias_value":"1411.3434v1","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3434","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"pith_short_12","alias_value":"MUGRFMQURS3Q","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MUGRFMQURS3QAYDG","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MUGRFMQU","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:MUGRFMQURS3QAYDGF5JNHQHFPN","target":"record","payload":{"canonical_record":{"source":{"id":"1411.3434","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-11-13T03:06:37Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"5b6d659983747f847c8cdabc2baa29a25bb6182d011cceb081433bc2f32e4fb0","abstract_canon_sha256":"4b45cca30d4d6f9f552538cf3c1cc771a23f436e1fe5319183d0251d74c37e71"},"schema_version":"1.0"},"canonical_sha256":"650d12b2148cb70060662f52d3c0e57b720eac8df649ae6d0adab8a844780981","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:43.780515Z","signature_b64":"lNVtvTZg0u7OJibSa6BOabTkGYybiLOGSK9918YMA4qROC/xJ/Az5EbieYiFPFn1isHGoGc5FSdj5bUSGioODw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"650d12b2148cb70060662f52d3c0e57b720eac8df649ae6d0adab8a844780981","last_reissued_at":"2026-05-18T02:37:43.780066Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:43.780066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.3434","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-18T02:37:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0syX7lxIvjvpiwPuS6W4Jd1mdSnbjs3iowuQVO1DGUx10yxv8AnMKJv/NWEiu7RanzLEnb4F00FoRquEPJ6kAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T14:50:46.263329Z"},"content_sha256":"145ab7a24ba1ef26ce413d1a2ca35c6b25a15cb3a17426d524de8a54718ce0e9","schema_version":"1.0","event_id":"sha256:145ab7a24ba1ef26ce413d1a2ca35c6b25a15cb3a17426d524de8a54718ce0e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:MUGRFMQURS3QAYDGF5JNHQHFPN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Approximations of the Beta Process in Latent Feature Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Luai Al Labadi, Mahmoud Zarepour","submitted_at":"2014-11-13T03:06:37Z","abstract_excerpt":"The beta process has recently been widely used as a nonparametric prior for different models in machine learning, including latent feature models. In this paper, we prove the asymptotic consistency of the finite dimensional approximation of the beta process due to Paisley \\& Carin (2009). In addition, we derive an almost sure approximation of the beta process. This approximation provides a direct method to efficiently simulate the beta process. A simulated example, illustrating the work of the method and comparing its performance to several existing algorithms, is also included."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3434","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-18T02:37:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K07xU83L2octGB3zkoTdAQKP2QzPadQKKXK+s6jPARSi+NEdUAJa34mjEqvaM4G6hkR6pZv4F38HL7YY37MoDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T14:50:46.263679Z"},"content_sha256":"510e7a09b3b7223d54e5dc4349f75b931ad9a2f8b587752b834e4c7a1043ee69","schema_version":"1.0","event_id":"sha256:510e7a09b3b7223d54e5dc4349f75b931ad9a2f8b587752b834e4c7a1043ee69"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MUGRFMQURS3QAYDGF5JNHQHFPN/bundle.json","state_url":"https://pith.science/pith/MUGRFMQURS3QAYDGF5JNHQHFPN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MUGRFMQURS3QAYDGF5JNHQHFPN/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-07T14:50:46Z","links":{"resolver":"https://pith.science/pith/MUGRFMQURS3QAYDGF5JNHQHFPN","bundle":"https://pith.science/pith/MUGRFMQURS3QAYDGF5JNHQHFPN/bundle.json","state":"https://pith.science/pith/MUGRFMQURS3QAYDGF5JNHQHFPN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MUGRFMQURS3QAYDGF5JNHQHFPN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:MUGRFMQURS3QAYDGF5JNHQHFPN","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":"4b45cca30d4d6f9f552538cf3c1cc771a23f436e1fe5319183d0251d74c37e71","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-11-13T03:06:37Z","title_canon_sha256":"5b6d659983747f847c8cdabc2baa29a25bb6182d011cceb081433bc2f32e4fb0"},"schema_version":"1.0","source":{"id":"1411.3434","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.3434","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"arxiv_version","alias_value":"1411.3434v1","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3434","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"pith_short_12","alias_value":"MUGRFMQURS3Q","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MUGRFMQURS3QAYDG","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MUGRFMQU","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:510e7a09b3b7223d54e5dc4349f75b931ad9a2f8b587752b834e4c7a1043ee69","target":"graph","created_at":"2026-05-18T02:37:43Z","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 beta process has recently been widely used as a nonparametric prior for different models in machine learning, including latent feature models. In this paper, we prove the asymptotic consistency of the finite dimensional approximation of the beta process due to Paisley \\& Carin (2009). In addition, we derive an almost sure approximation of the beta process. This approximation provides a direct method to efficiently simulate the beta process. A simulated example, illustrating the work of the method and comparing its performance to several existing algorithms, is also included.","authors_text":"Luai Al Labadi, Mahmoud Zarepour","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-11-13T03:06:37Z","title":"On Approximations of the Beta Process in Latent Feature Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3434","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:145ab7a24ba1ef26ce413d1a2ca35c6b25a15cb3a17426d524de8a54718ce0e9","target":"record","created_at":"2026-05-18T02:37:43Z","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":"4b45cca30d4d6f9f552538cf3c1cc771a23f436e1fe5319183d0251d74c37e71","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-11-13T03:06:37Z","title_canon_sha256":"5b6d659983747f847c8cdabc2baa29a25bb6182d011cceb081433bc2f32e4fb0"},"schema_version":"1.0","source":{"id":"1411.3434","kind":"arxiv","version":1}},"canonical_sha256":"650d12b2148cb70060662f52d3c0e57b720eac8df649ae6d0adab8a844780981","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"650d12b2148cb70060662f52d3c0e57b720eac8df649ae6d0adab8a844780981","first_computed_at":"2026-05-18T02:37:43.780066Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:37:43.780066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lNVtvTZg0u7OJibSa6BOabTkGYybiLOGSK9918YMA4qROC/xJ/Az5EbieYiFPFn1isHGoGc5FSdj5bUSGioODw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:37:43.780515Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.3434","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:145ab7a24ba1ef26ce413d1a2ca35c6b25a15cb3a17426d524de8a54718ce0e9","sha256:510e7a09b3b7223d54e5dc4349f75b931ad9a2f8b587752b834e4c7a1043ee69"],"state_sha256":"d6d6ca487819d43f4a3d93651efe3469a091cb85afb748ddf98c1e7cd80307dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J3YXEKmCI3V4lvujDMscDKy5wzNjEmvYV+CJv20JE2QXx+Cmw3YZdPdyDRebeHquJhyokrWNJfEiNhOhXP94CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T14:50:46.265551Z","bundle_sha256":"051882660899401ebb8ebb37529144c6dd5d6da6516edea0e93061da00108fa8"}}