{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GVOYJYNNK7PPMW5SSV73JCTBTX","short_pith_number":"pith:GVOYJYNN","canonical_record":{"source":{"id":"1304.3285","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-04-11T13:20:51Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"48edf3607b1c2cdb7eb915b1e584f9da536927d940e4caa05a8293cf0e09c179","abstract_canon_sha256":"9f0dc7cced16d89ccff2c991b5d0fcfde9614d9b18ed202db3412e02473548ef"},"schema_version":"1.0"},"canonical_sha256":"355d84e1ad57def65bb2957fb48a619dc20b8faad872eec8a8eafbee8303c807","source":{"kind":"arxiv","id":"1304.3285","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.3285","created_at":"2026-05-18T03:17:44Z"},{"alias_kind":"arxiv_version","alias_value":"1304.3285v4","created_at":"2026-05-18T03:17:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.3285","created_at":"2026-05-18T03:17:44Z"},{"alias_kind":"pith_short_12","alias_value":"GVOYJYNNK7PP","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GVOYJYNNK7PPMW5S","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GVOYJYNN","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GVOYJYNNK7PPMW5SSV73JCTBTX","target":"record","payload":{"canonical_record":{"source":{"id":"1304.3285","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-04-11T13:20:51Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"48edf3607b1c2cdb7eb915b1e584f9da536927d940e4caa05a8293cf0e09c179","abstract_canon_sha256":"9f0dc7cced16d89ccff2c991b5d0fcfde9614d9b18ed202db3412e02473548ef"},"schema_version":"1.0"},"canonical_sha256":"355d84e1ad57def65bb2957fb48a619dc20b8faad872eec8a8eafbee8303c807","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:44.280354Z","signature_b64":"sliwON/UN9S82nZoHxhw46i66AtleEfsRvYtu0PnmoqH113eaGcwrurssV0PI53m01FPtgsHfLxxlxiZln9+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"355d84e1ad57def65bb2957fb48a619dc20b8faad872eec8a8eafbee8303c807","last_reissued_at":"2026-05-18T03:17:44.279754Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:44.279754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.3285","source_version":4,"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-18T03:17:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lxxAE08gPb63GBbBy/dYK/lSaKiW4KKZ7eQUS7pwBjhUcaPsJ2NS7EZxjzEk9CdLRizTTaO0ZEdyU+Fy5LxkCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:39:17.766619Z"},"content_sha256":"afdb090f5af2c4260ac75ce45a4537a9c3f3f1d98465f798994dbb54286c6525","schema_version":"1.0","event_id":"sha256:afdb090f5af2c4260ac75ce45a4537a9c3f3f1d98465f798994dbb54286c6525"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GVOYJYNNK7PPMW5SSV73JCTBTX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scaling the Indian Buffet Process via Submodular Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Colorado Reed, Zoubin Ghahramani","submitted_at":"2013-04-11T13:20:51Z","abstract_excerpt":"Inference for latent feature models is inherently difficult as the inference space grows exponentially with the size of the input data and number of latent features. In this work, we use Kurihara & Welling (2008)'s maximization-expectation framework to perform approximate MAP inference for linear-Gaussian latent feature models with an Indian Buffet Process (IBP) prior. This formulation yields a submodular function of the features that corresponds to a lower bound on the model evidence. By adding a constant to this function, we obtain a nonnegative submodular function that can be maximized via "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.3285","kind":"arxiv","version":4},"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-18T03:17:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"txLQnMMY1KoBVxBc0V5IwJ0Quz1bhEytcOAJUzlfNCsqan8iF5BR/NLbPtkZGkkYZ9O99gd3ngTrSdUcF27tBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:39:17.766976Z"},"content_sha256":"1010157b3d2398a1ed519bd1705fe0e96350c7e2607e4ac983b25aa449857863","schema_version":"1.0","event_id":"sha256:1010157b3d2398a1ed519bd1705fe0e96350c7e2607e4ac983b25aa449857863"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GVOYJYNNK7PPMW5SSV73JCTBTX/bundle.json","state_url":"https://pith.science/pith/GVOYJYNNK7PPMW5SSV73JCTBTX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GVOYJYNNK7PPMW5SSV73JCTBTX/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-06T18:39:17Z","links":{"resolver":"https://pith.science/pith/GVOYJYNNK7PPMW5SSV73JCTBTX","bundle":"https://pith.science/pith/GVOYJYNNK7PPMW5SSV73JCTBTX/bundle.json","state":"https://pith.science/pith/GVOYJYNNK7PPMW5SSV73JCTBTX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GVOYJYNNK7PPMW5SSV73JCTBTX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GVOYJYNNK7PPMW5SSV73JCTBTX","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":"9f0dc7cced16d89ccff2c991b5d0fcfde9614d9b18ed202db3412e02473548ef","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-04-11T13:20:51Z","title_canon_sha256":"48edf3607b1c2cdb7eb915b1e584f9da536927d940e4caa05a8293cf0e09c179"},"schema_version":"1.0","source":{"id":"1304.3285","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.3285","created_at":"2026-05-18T03:17:44Z"},{"alias_kind":"arxiv_version","alias_value":"1304.3285v4","created_at":"2026-05-18T03:17:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.3285","created_at":"2026-05-18T03:17:44Z"},{"alias_kind":"pith_short_12","alias_value":"GVOYJYNNK7PP","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GVOYJYNNK7PPMW5S","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GVOYJYNN","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:1010157b3d2398a1ed519bd1705fe0e96350c7e2607e4ac983b25aa449857863","target":"graph","created_at":"2026-05-18T03:17:44Z","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":"Inference for latent feature models is inherently difficult as the inference space grows exponentially with the size of the input data and number of latent features. In this work, we use Kurihara & Welling (2008)'s maximization-expectation framework to perform approximate MAP inference for linear-Gaussian latent feature models with an Indian Buffet Process (IBP) prior. This formulation yields a submodular function of the features that corresponds to a lower bound on the model evidence. By adding a constant to this function, we obtain a nonnegative submodular function that can be maximized via ","authors_text":"Colorado Reed, Zoubin Ghahramani","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-04-11T13:20:51Z","title":"Scaling the Indian Buffet Process via Submodular Maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.3285","kind":"arxiv","version":4},"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:afdb090f5af2c4260ac75ce45a4537a9c3f3f1d98465f798994dbb54286c6525","target":"record","created_at":"2026-05-18T03:17:44Z","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":"9f0dc7cced16d89ccff2c991b5d0fcfde9614d9b18ed202db3412e02473548ef","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-04-11T13:20:51Z","title_canon_sha256":"48edf3607b1c2cdb7eb915b1e584f9da536927d940e4caa05a8293cf0e09c179"},"schema_version":"1.0","source":{"id":"1304.3285","kind":"arxiv","version":4}},"canonical_sha256":"355d84e1ad57def65bb2957fb48a619dc20b8faad872eec8a8eafbee8303c807","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"355d84e1ad57def65bb2957fb48a619dc20b8faad872eec8a8eafbee8303c807","first_computed_at":"2026-05-18T03:17:44.279754Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:44.279754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sliwON/UN9S82nZoHxhw46i66AtleEfsRvYtu0PnmoqH113eaGcwrurssV0PI53m01FPtgsHfLxxlxiZln9+Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:44.280354Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.3285","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:afdb090f5af2c4260ac75ce45a4537a9c3f3f1d98465f798994dbb54286c6525","sha256:1010157b3d2398a1ed519bd1705fe0e96350c7e2607e4ac983b25aa449857863"],"state_sha256":"28b0651184b3737b2d74ecf55bb690ffd88c505c8b9a8ea69ab93c2ac6c45091"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EZRiaflYxZe7U/EUIBH5Xqg7XLPvfZaz7OQnIy3lNDiWeYuoaGm1wlZxNK2ClkaUIPx9yffvgXhClIBxjJGtBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T18:39:17.769078Z","bundle_sha256":"25d8ec95274d532712b8a217d1a854c6549a5c9b952bc5cd9dda7458c4f34cc2"}}