{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:5EARB467KLMKYQ2YOCHOSF3CFH","short_pith_number":"pith:5EARB467","canonical_record":{"source":{"id":"0908.4489","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2009-08-31T09:44:06Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"18c1cbb0824f4affd50018f4eb0cf75d87a60ae4cdcc5951a7e9099f6fca71e8","abstract_canon_sha256":"b6ba5860b8c04083a38707e4279039dacc6f5956b522d2493270d56db88f437e"},"schema_version":"1.0"},"canonical_sha256":"e90110f3df52d8ac4358708ee9176229ea1bdd310fdf965bf54a09e19e7d1048","source":{"kind":"arxiv","id":"0908.4489","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0908.4489","created_at":"2026-05-18T04:41:44Z"},{"alias_kind":"arxiv_version","alias_value":"0908.4489v3","created_at":"2026-05-18T04:41:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.4489","created_at":"2026-05-18T04:41:44Z"},{"alias_kind":"pith_short_12","alias_value":"5EARB467KLMK","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"5EARB467KLMKYQ2Y","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"5EARB467","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:5EARB467KLMKYQ2YOCHOSF3CFH","target":"record","payload":{"canonical_record":{"source":{"id":"0908.4489","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2009-08-31T09:44:06Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"18c1cbb0824f4affd50018f4eb0cf75d87a60ae4cdcc5951a7e9099f6fca71e8","abstract_canon_sha256":"b6ba5860b8c04083a38707e4279039dacc6f5956b522d2493270d56db88f437e"},"schema_version":"1.0"},"canonical_sha256":"e90110f3df52d8ac4358708ee9176229ea1bdd310fdf965bf54a09e19e7d1048","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:44.884725Z","signature_b64":"a1fmKKTa8D9GQCMEKWLpf6SamVSI6vqCPZFNY1a9XelGOXyh7RMZgn9Qa3Ezej1wTOgfHLdZxAKwPg4ErE+lBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e90110f3df52d8ac4358708ee9176229ea1bdd310fdf965bf54a09e19e7d1048","last_reissued_at":"2026-05-18T04:41:44.884373Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:44.884373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0908.4489","source_version":3,"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:41:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nhtkq6hxisoMogYr23kWlUjFUwQuvS76qcWChioFgXLl/ri7yUjgk/I/T58O/6f/LFwnBdGEqcT0/L/1uTBLCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T14:14:03.584255Z"},"content_sha256":"1b27f07f6a9bb28be4555f547c72cba09a80b0d032924272b125c6f0aed0680b","schema_version":"1.0","event_id":"sha256:1b27f07f6a9bb28be4555f547c72cba09a80b0d032924272b125c6f0aed0680b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:5EARB467KLMKYQ2YOCHOSF3CFH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bayesian orthogonal component analysis for sparse representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.ME","authors_text":"Jean-Yves Tourneret, Nicolas Dobigeon","submitted_at":"2009-08-31T09:44:06Z","abstract_excerpt":"This paper addresses the problem of identifying a lower dimensional space where observed data can be sparsely represented. This under-complete dictionary learning task can be formulated as a blind separation problem of sparse sources linearly mixed with an unknown orthogonal mixing matrix. This issue is formulated in a Bayesian framework. First, the unknown sparse sources are modeled as Bernoulli-Gaussian processes. To promote sparsity, a weighted mixture of an atom at zero and a Gaussian distribution is proposed as prior distribution for the unobserved sources. A non-informative prior distrib"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.4489","kind":"arxiv","version":3},"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:41:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JGdoUNr2ejlomkauVQ472XX4uBDvHNRKo2li8UdR6Xh9posCaBgw9ZPOy84sS7rpYzNYBWBtW2+fiPfBYzGcCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T14:14:03.584616Z"},"content_sha256":"6aadf31c7ff88931d266a3904077ba632c5f1115b9320142eae3263e86d7b5a5","schema_version":"1.0","event_id":"sha256:6aadf31c7ff88931d266a3904077ba632c5f1115b9320142eae3263e86d7b5a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5EARB467KLMKYQ2YOCHOSF3CFH/bundle.json","state_url":"https://pith.science/pith/5EARB467KLMKYQ2YOCHOSF3CFH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5EARB467KLMKYQ2YOCHOSF3CFH/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-22T14:14:03Z","links":{"resolver":"https://pith.science/pith/5EARB467KLMKYQ2YOCHOSF3CFH","bundle":"https://pith.science/pith/5EARB467KLMKYQ2YOCHOSF3CFH/bundle.json","state":"https://pith.science/pith/5EARB467KLMKYQ2YOCHOSF3CFH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5EARB467KLMKYQ2YOCHOSF3CFH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:5EARB467KLMKYQ2YOCHOSF3CFH","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":"b6ba5860b8c04083a38707e4279039dacc6f5956b522d2493270d56db88f437e","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2009-08-31T09:44:06Z","title_canon_sha256":"18c1cbb0824f4affd50018f4eb0cf75d87a60ae4cdcc5951a7e9099f6fca71e8"},"schema_version":"1.0","source":{"id":"0908.4489","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0908.4489","created_at":"2026-05-18T04:41:44Z"},{"alias_kind":"arxiv_version","alias_value":"0908.4489v3","created_at":"2026-05-18T04:41:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.4489","created_at":"2026-05-18T04:41:44Z"},{"alias_kind":"pith_short_12","alias_value":"5EARB467KLMK","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"5EARB467KLMKYQ2Y","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"5EARB467","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:6aadf31c7ff88931d266a3904077ba632c5f1115b9320142eae3263e86d7b5a5","target":"graph","created_at":"2026-05-18T04:41: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":"This paper addresses the problem of identifying a lower dimensional space where observed data can be sparsely represented. This under-complete dictionary learning task can be formulated as a blind separation problem of sparse sources linearly mixed with an unknown orthogonal mixing matrix. This issue is formulated in a Bayesian framework. First, the unknown sparse sources are modeled as Bernoulli-Gaussian processes. To promote sparsity, a weighted mixture of an atom at zero and a Gaussian distribution is proposed as prior distribution for the unobserved sources. A non-informative prior distrib","authors_text":"Jean-Yves Tourneret, Nicolas Dobigeon","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2009-08-31T09:44:06Z","title":"Bayesian orthogonal component analysis for sparse representation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.4489","kind":"arxiv","version":3},"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:1b27f07f6a9bb28be4555f547c72cba09a80b0d032924272b125c6f0aed0680b","target":"record","created_at":"2026-05-18T04:41: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":"b6ba5860b8c04083a38707e4279039dacc6f5956b522d2493270d56db88f437e","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2009-08-31T09:44:06Z","title_canon_sha256":"18c1cbb0824f4affd50018f4eb0cf75d87a60ae4cdcc5951a7e9099f6fca71e8"},"schema_version":"1.0","source":{"id":"0908.4489","kind":"arxiv","version":3}},"canonical_sha256":"e90110f3df52d8ac4358708ee9176229ea1bdd310fdf965bf54a09e19e7d1048","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e90110f3df52d8ac4358708ee9176229ea1bdd310fdf965bf54a09e19e7d1048","first_computed_at":"2026-05-18T04:41:44.884373Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:41:44.884373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a1fmKKTa8D9GQCMEKWLpf6SamVSI6vqCPZFNY1a9XelGOXyh7RMZgn9Qa3Ezej1wTOgfHLdZxAKwPg4ErE+lBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:41:44.884725Z","signed_message":"canonical_sha256_bytes"},"source_id":"0908.4489","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b27f07f6a9bb28be4555f547c72cba09a80b0d032924272b125c6f0aed0680b","sha256:6aadf31c7ff88931d266a3904077ba632c5f1115b9320142eae3263e86d7b5a5"],"state_sha256":"dc7f3acef573422d53533a8fff357e6c0c58d77e59842199bfc289d8ccec791d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v8MYTvfHA38kn0UszTWC7wrE1q5ry55Jis036Ox/Zgtvp0k/zQbpIvWd8PkK90Zj3lhJ0Ccm3hq8A05wA2lIAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T14:14:03.586693Z","bundle_sha256":"84096e0bf55f3120afa76cb55b32df06aae8287086fc543e14a8f7278f0cb5c1"}}