{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:X7BES3L7NLMFI2HYCBPBMFYF3G","short_pith_number":"pith:X7BES3L7","canonical_record":{"source":{"id":"1309.6840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-26T12:42:25Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"15fd6696c7e94b29c809b967a094973bd79fecf9607dfdbdf30d8db42ef141f0","abstract_canon_sha256":"088553a91adeb0ce17e138b92b55ab80318a09073808e8df4cfa5d1df3383258"},"schema_version":"1.0"},"canonical_sha256":"bfc2496d7f6ad85468f8105e161705d9863d88107b31ccc58d251ae5855e8ab0","source":{"kind":"arxiv","id":"1309.6840","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6840","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6840v1","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6840","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"X7BES3L7NLMF","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"X7BES3L7NLMFI2HY","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"X7BES3L7","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:X7BES3L7NLMFI2HYCBPBMFYF3G","target":"record","payload":{"canonical_record":{"source":{"id":"1309.6840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-26T12:42:25Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"15fd6696c7e94b29c809b967a094973bd79fecf9607dfdbdf30d8db42ef141f0","abstract_canon_sha256":"088553a91adeb0ce17e138b92b55ab80318a09073808e8df4cfa5d1df3383258"},"schema_version":"1.0"},"canonical_sha256":"bfc2496d7f6ad85468f8105e161705d9863d88107b31ccc58d251ae5855e8ab0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:10.176720Z","signature_b64":"Ozdr9vj1y0xiOkhAMs4V5ft/XJk+XPfyKl5VdauLr8hO2flfCRSP5ZRovVsf+COWSBzmr/ncSCmufgoycuSVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfc2496d7f6ad85468f8105e161705d9863d88107b31ccc58d251ae5855e8ab0","last_reissued_at":"2026-05-18T03:12:10.175941Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:10.175941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.6840","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-18T03:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SQwRTrC3o7nOBF/VzuCHWh1ul01f8wb2rUUEOFw0tzGlBHW7hinIt4NcjM0bo9tIzE4qgay7xjhlb6eoRPpTDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:58:07.049402Z"},"content_sha256":"e6296b5abb17d84a97370691f7ccdee71fcd6dcddf85412c12419e7f57c30b26","schema_version":"1.0","event_id":"sha256:e6296b5abb17d84a97370691f7ccdee71fcd6dcddf85412c12419e7f57c30b26"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:X7BES3L7NLMFI2HYCBPBMFYF3G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constrained Bayesian Inference for Low Rank Multitask Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Joydeep Ghosh, Oluwasanmi Koyejo","submitted_at":"2013-09-26T12:42:25Z","abstract_excerpt":"We present a novel approach for constrained Bayesian inference. Unlike current methods, our approach does not require convexity of the constraint set. We reduce the constrained variational inference to a parametric optimization over the feasible set of densities and propose a general recipe for such problems. We apply the proposed constrained Bayesian inference approach to multitask learning subject to rank constraints on the weight matrix. Further, constrained parameter estimation is applied to recover the sparse conditional independence structure encoded by prior precision matrices. Our appr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6840","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-18T03:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hynh7g/cuxOxpyzGPbLfzhJEBTrH0eth5Vy5HhQxONZzYvZaKRue4SEB6FufURYtXsURYFEmzxG3dpNfm8MyBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:58:07.049757Z"},"content_sha256":"8aac2dfb3a89a9d708fb7b480fc7e907372b106685823d3879fdef398a5c0177","schema_version":"1.0","event_id":"sha256:8aac2dfb3a89a9d708fb7b480fc7e907372b106685823d3879fdef398a5c0177"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X7BES3L7NLMFI2HYCBPBMFYF3G/bundle.json","state_url":"https://pith.science/pith/X7BES3L7NLMFI2HYCBPBMFYF3G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X7BES3L7NLMFI2HYCBPBMFYF3G/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-02T15:58:07Z","links":{"resolver":"https://pith.science/pith/X7BES3L7NLMFI2HYCBPBMFYF3G","bundle":"https://pith.science/pith/X7BES3L7NLMFI2HYCBPBMFYF3G/bundle.json","state":"https://pith.science/pith/X7BES3L7NLMFI2HYCBPBMFYF3G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X7BES3L7NLMFI2HYCBPBMFYF3G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:X7BES3L7NLMFI2HYCBPBMFYF3G","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":"088553a91adeb0ce17e138b92b55ab80318a09073808e8df4cfa5d1df3383258","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-26T12:42:25Z","title_canon_sha256":"15fd6696c7e94b29c809b967a094973bd79fecf9607dfdbdf30d8db42ef141f0"},"schema_version":"1.0","source":{"id":"1309.6840","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6840","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6840v1","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6840","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"X7BES3L7NLMF","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"X7BES3L7NLMFI2HY","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"X7BES3L7","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:8aac2dfb3a89a9d708fb7b480fc7e907372b106685823d3879fdef398a5c0177","target":"graph","created_at":"2026-05-18T03:12:10Z","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":"We present a novel approach for constrained Bayesian inference. Unlike current methods, our approach does not require convexity of the constraint set. We reduce the constrained variational inference to a parametric optimization over the feasible set of densities and propose a general recipe for such problems. We apply the proposed constrained Bayesian inference approach to multitask learning subject to rank constraints on the weight matrix. Further, constrained parameter estimation is applied to recover the sparse conditional independence structure encoded by prior precision matrices. Our appr","authors_text":"Joydeep Ghosh, Oluwasanmi Koyejo","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-26T12:42:25Z","title":"Constrained Bayesian Inference for Low Rank Multitask Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6840","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:e6296b5abb17d84a97370691f7ccdee71fcd6dcddf85412c12419e7f57c30b26","target":"record","created_at":"2026-05-18T03:12:10Z","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":"088553a91adeb0ce17e138b92b55ab80318a09073808e8df4cfa5d1df3383258","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-26T12:42:25Z","title_canon_sha256":"15fd6696c7e94b29c809b967a094973bd79fecf9607dfdbdf30d8db42ef141f0"},"schema_version":"1.0","source":{"id":"1309.6840","kind":"arxiv","version":1}},"canonical_sha256":"bfc2496d7f6ad85468f8105e161705d9863d88107b31ccc58d251ae5855e8ab0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bfc2496d7f6ad85468f8105e161705d9863d88107b31ccc58d251ae5855e8ab0","first_computed_at":"2026-05-18T03:12:10.175941Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:10.175941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ozdr9vj1y0xiOkhAMs4V5ft/XJk+XPfyKl5VdauLr8hO2flfCRSP5ZRovVsf+COWSBzmr/ncSCmufgoycuSVAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:10.176720Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.6840","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6296b5abb17d84a97370691f7ccdee71fcd6dcddf85412c12419e7f57c30b26","sha256:8aac2dfb3a89a9d708fb7b480fc7e907372b106685823d3879fdef398a5c0177"],"state_sha256":"80f7a3ad8e27707e3cdcbf9ff08f52ac23ed899f3c8bd2c0d8eaa0e094e99389"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cWhvclKj/ZGXteBTF58btg1BQKcDeu4bEdq35Po8Xjevy+NOKgn8NNFvcuLejSHRsAv+qA09i83PZOQ6cPrlAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T15:58:07.051954Z","bundle_sha256":"4313c323a2f3791736c862ccd07fdaef62daa9cf7a5ce4eb7092a49d756f64c4"}}