{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:EAI4O55AL5OKBPD7UNTVN5LPKG","short_pith_number":"pith:EAI4O55A","canonical_record":{"source":{"id":"1001.0160","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2009-12-31T19:47:34Z","cross_cats_sorted":[],"title_canon_sha256":"4d87851c3a67359939e8f2c37ed3b8abd950834c8d8a24f23ce8bb2f3c35a907","abstract_canon_sha256":"84ade5b623c8c6476c3216399da187e5305537cbb0892d4f9cac371d6aade8e6"},"schema_version":"1.0"},"canonical_sha256":"2011c777a05f5ca0bc7fa36756f56f51a2874c45d380da73a20624a36556f5f1","source":{"kind":"arxiv","id":"1001.0160","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.0160","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"arxiv_version","alias_value":"1001.0160v2","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.0160","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"pith_short_12","alias_value":"EAI4O55AL5OK","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"EAI4O55AL5OKBPD7","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"EAI4O55A","created_at":"2026-05-18T12:25:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:EAI4O55AL5OKBPD7UNTVN5LPKG","target":"record","payload":{"canonical_record":{"source":{"id":"1001.0160","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2009-12-31T19:47:34Z","cross_cats_sorted":[],"title_canon_sha256":"4d87851c3a67359939e8f2c37ed3b8abd950834c8d8a24f23ce8bb2f3c35a907","abstract_canon_sha256":"84ade5b623c8c6476c3216399da187e5305537cbb0892d4f9cac371d6aade8e6"},"schema_version":"1.0"},"canonical_sha256":"2011c777a05f5ca0bc7fa36756f56f51a2874c45d380da73a20624a36556f5f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:03.373338Z","signature_b64":"QoMa3WGC7n/ecy70SPk4Q1p73gtFH38VOfKGhbc6IBsbNHl1ypaZ4f7e10jasg67whwuHXSP5aoQppKWnO7OCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2011c777a05f5ca0bc7fa36756f56f51a2874c45d380da73a20624a36556f5f1","last_reissued_at":"2026-05-18T04:42:03.372892Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:03.372892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1001.0160","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-05-18T04:42:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tSJUVGQzhaD1b094aUqFP9XnJzzY9m2uOZ/wSviFhaUfnXy2M1IMlV01iM/kj2y/TBlIMl9DVGuN++R4x/+aAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:27:08.520212Z"},"content_sha256":"023fec00c99c0f6ba5089775b479556cc2218bf2b6d0646390117bf45f579c7c","schema_version":"1.0","event_id":"sha256:023fec00c99c0f6ba5089775b479556cc2218bf2b6d0646390117bf45f579c7c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:EAI4O55AL5OKBPD7UNTVN5LPKG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning the Structure of Deep Sparse Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Hanna M. Wallach, Ryan Prescott Adams, Zoubin Ghahramani","submitted_at":"2009-12-31T19:47:34Z","abstract_excerpt":"Deep belief networks are a powerful way to model complex probability distributions. However, learning the structure of a belief network, particularly one with hidden units, is difficult. The Indian buffet process has been used as a nonparametric Bayesian prior on the directed structure of a belief network with a single infinitely wide hidden layer. In this paper, we introduce the cascading Indian buffet process (CIBP), which provides a nonparametric prior on the structure of a layered, directed belief network that is unbounded in both depth and width, yet allows tractable inference. We use the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.0160","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":""},"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-18T04:42:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dP46/k6DTgJXX/SI3x072CyQNXd6zXkOr44ynDjuyS8S7orfWufpztYd7nRf/sULZuNyRKNNzYzToC+fPkb7Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:27:08.520587Z"},"content_sha256":"2c70da83b39b58eba5a80c927fe4981a349a5cdda91eec69ddb237c94367db01","schema_version":"1.0","event_id":"sha256:2c70da83b39b58eba5a80c927fe4981a349a5cdda91eec69ddb237c94367db01"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EAI4O55AL5OKBPD7UNTVN5LPKG/bundle.json","state_url":"https://pith.science/pith/EAI4O55AL5OKBPD7UNTVN5LPKG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EAI4O55AL5OKBPD7UNTVN5LPKG/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-02T11:27:08Z","links":{"resolver":"https://pith.science/pith/EAI4O55AL5OKBPD7UNTVN5LPKG","bundle":"https://pith.science/pith/EAI4O55AL5OKBPD7UNTVN5LPKG/bundle.json","state":"https://pith.science/pith/EAI4O55AL5OKBPD7UNTVN5LPKG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EAI4O55AL5OKBPD7UNTVN5LPKG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:EAI4O55AL5OKBPD7UNTVN5LPKG","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":"84ade5b623c8c6476c3216399da187e5305537cbb0892d4f9cac371d6aade8e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2009-12-31T19:47:34Z","title_canon_sha256":"4d87851c3a67359939e8f2c37ed3b8abd950834c8d8a24f23ce8bb2f3c35a907"},"schema_version":"1.0","source":{"id":"1001.0160","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.0160","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"arxiv_version","alias_value":"1001.0160v2","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.0160","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"pith_short_12","alias_value":"EAI4O55AL5OK","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"EAI4O55AL5OKBPD7","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"EAI4O55A","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:2c70da83b39b58eba5a80c927fe4981a349a5cdda91eec69ddb237c94367db01","target":"graph","created_at":"2026-05-18T04:42:03Z","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":"Deep belief networks are a powerful way to model complex probability distributions. However, learning the structure of a belief network, particularly one with hidden units, is difficult. The Indian buffet process has been used as a nonparametric Bayesian prior on the directed structure of a belief network with a single infinitely wide hidden layer. In this paper, we introduce the cascading Indian buffet process (CIBP), which provides a nonparametric prior on the structure of a layered, directed belief network that is unbounded in both depth and width, yet allows tractable inference. We use the","authors_text":"Hanna M. Wallach, Ryan Prescott Adams, Zoubin Ghahramani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2009-12-31T19:47:34Z","title":"Learning the Structure of Deep Sparse Graphical Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.0160","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:023fec00c99c0f6ba5089775b479556cc2218bf2b6d0646390117bf45f579c7c","target":"record","created_at":"2026-05-18T04:42:03Z","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":"84ade5b623c8c6476c3216399da187e5305537cbb0892d4f9cac371d6aade8e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2009-12-31T19:47:34Z","title_canon_sha256":"4d87851c3a67359939e8f2c37ed3b8abd950834c8d8a24f23ce8bb2f3c35a907"},"schema_version":"1.0","source":{"id":"1001.0160","kind":"arxiv","version":2}},"canonical_sha256":"2011c777a05f5ca0bc7fa36756f56f51a2874c45d380da73a20624a36556f5f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2011c777a05f5ca0bc7fa36756f56f51a2874c45d380da73a20624a36556f5f1","first_computed_at":"2026-05-18T04:42:03.372892Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:42:03.372892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QoMa3WGC7n/ecy70SPk4Q1p73gtFH38VOfKGhbc6IBsbNHl1ypaZ4f7e10jasg67whwuHXSP5aoQppKWnO7OCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:42:03.373338Z","signed_message":"canonical_sha256_bytes"},"source_id":"1001.0160","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:023fec00c99c0f6ba5089775b479556cc2218bf2b6d0646390117bf45f579c7c","sha256:2c70da83b39b58eba5a80c927fe4981a349a5cdda91eec69ddb237c94367db01"],"state_sha256":"cf7c537eaf4ef04a8d6e26a0eff5eefa0afabe77fc909923c22418551555b5ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CTvBYVg0ojNEdqLTdOkW1brLgfB3K2ZwzzXM1xHYwEypW2H74rKSN2HyKtnr8PgPC3MwTY5bi2H4r3nFWJPFBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T11:27:08.522985Z","bundle_sha256":"a549fb531d0c555ff28b48aa8ccf3863f757901b8e922f00e7f04d6a57271d28"}}