{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:25QGMUDPWE5CUUURH2N6IZBNMM","short_pith_number":"pith:25QGMUDP","canonical_record":{"source":{"id":"1901.08334","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-01-24T10:38:11Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c328903de68eda6cdba1dee20187d9474d5dabb5322e7b012cab6b34bf09b8ad","abstract_canon_sha256":"593c7c6944206c4d08a71c048c0a884abd479efba6671c5e7179b1406d620c54"},"schema_version":"1.0"},"canonical_sha256":"d76066506fb13a2a52913e9be4642d633709348b1a5f5ec73b3520f4bedb2484","source":{"kind":"arxiv","id":"1901.08334","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.08334","created_at":"2026-05-17T23:55:37Z"},{"alias_kind":"arxiv_version","alias_value":"1901.08334v1","created_at":"2026-05-17T23:55:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.08334","created_at":"2026-05-17T23:55:37Z"},{"alias_kind":"pith_short_12","alias_value":"25QGMUDPWE5C","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"25QGMUDPWE5CUUUR","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"25QGMUDP","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:25QGMUDPWE5CUUURH2N6IZBNMM","target":"record","payload":{"canonical_record":{"source":{"id":"1901.08334","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-01-24T10:38:11Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c328903de68eda6cdba1dee20187d9474d5dabb5322e7b012cab6b34bf09b8ad","abstract_canon_sha256":"593c7c6944206c4d08a71c048c0a884abd479efba6671c5e7179b1406d620c54"},"schema_version":"1.0"},"canonical_sha256":"d76066506fb13a2a52913e9be4642d633709348b1a5f5ec73b3520f4bedb2484","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:37.310513Z","signature_b64":"QRkhlei27hzJwwbo76tL+E5woK2m2N5Po77MWlmEOzMmJMt6JOBst5QoGomEnFXRDhsxXi8wmgrw0o12w3a5Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d76066506fb13a2a52913e9be4642d633709348b1a5f5ec73b3520f4bedb2484","last_reissued_at":"2026-05-17T23:55:37.310074Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:37.310074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.08334","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-17T23:55:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ra2L1GXknrqbw8oBjHrd+iV1vY4nU1CLr3QWmLSs/tebPy351aOYU6i/lEWYvI+c5+eNof4iWVMaCVNdQ43jCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:36:30.473233Z"},"content_sha256":"1f44f13445287b2eca34a1723a5012735a692c6622d45055a14af3142706e26d","schema_version":"1.0","event_id":"sha256:1f44f13445287b2eca34a1723a5012735a692c6622d45055a14af3142706e26d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:25QGMUDPWE5CUUURH2N6IZBNMM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Overcomplete Independent Component Analysis via SDP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Alexander Wein, Alexandre d'Aspremont, Amelia Perry, Anastasia Podosinnikova, David Sontag, Francis Bach","submitted_at":"2019-01-24T10:38:11Z","abstract_excerpt":"We present a novel algorithm for overcomplete independent components analysis (ICA), where the number of latent sources k exceeds the dimension p of observed variables. Previous algorithms either suffer from high computational complexity or make strong assumptions about the form of the mixing matrix. Our algorithm does not make any sparsity assumption yet enjoys favorable computational and theoretical properties. Our algorithm consists of two main steps: (a) estimation of the Hessians of the cumulant generating function (as opposed to the fourth and higher order cumulants used by most algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.08334","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-17T23:55:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J0riEP8xUKhGkCNZmMgOUCjtb9alSxMG4lR23EtughouQQaQ/a7Mg66dSGzcKegBwf/MXVKQQn3D+6N45ALZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:36:30.473586Z"},"content_sha256":"fe01081d5c57d8b5908c855f05d625f76172d0c127d0467ce28163de8d63ad83","schema_version":"1.0","event_id":"sha256:fe01081d5c57d8b5908c855f05d625f76172d0c127d0467ce28163de8d63ad83"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/25QGMUDPWE5CUUURH2N6IZBNMM/bundle.json","state_url":"https://pith.science/pith/25QGMUDPWE5CUUURH2N6IZBNMM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/25QGMUDPWE5CUUURH2N6IZBNMM/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-05-28T11:36:30Z","links":{"resolver":"https://pith.science/pith/25QGMUDPWE5CUUURH2N6IZBNMM","bundle":"https://pith.science/pith/25QGMUDPWE5CUUURH2N6IZBNMM/bundle.json","state":"https://pith.science/pith/25QGMUDPWE5CUUURH2N6IZBNMM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/25QGMUDPWE5CUUURH2N6IZBNMM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:25QGMUDPWE5CUUURH2N6IZBNMM","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":"593c7c6944206c4d08a71c048c0a884abd479efba6671c5e7179b1406d620c54","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-01-24T10:38:11Z","title_canon_sha256":"c328903de68eda6cdba1dee20187d9474d5dabb5322e7b012cab6b34bf09b8ad"},"schema_version":"1.0","source":{"id":"1901.08334","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.08334","created_at":"2026-05-17T23:55:37Z"},{"alias_kind":"arxiv_version","alias_value":"1901.08334v1","created_at":"2026-05-17T23:55:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.08334","created_at":"2026-05-17T23:55:37Z"},{"alias_kind":"pith_short_12","alias_value":"25QGMUDPWE5C","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"25QGMUDPWE5CUUUR","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"25QGMUDP","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:fe01081d5c57d8b5908c855f05d625f76172d0c127d0467ce28163de8d63ad83","target":"graph","created_at":"2026-05-17T23:55:37Z","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 algorithm for overcomplete independent components analysis (ICA), where the number of latent sources k exceeds the dimension p of observed variables. Previous algorithms either suffer from high computational complexity or make strong assumptions about the form of the mixing matrix. Our algorithm does not make any sparsity assumption yet enjoys favorable computational and theoretical properties. Our algorithm consists of two main steps: (a) estimation of the Hessians of the cumulant generating function (as opposed to the fourth and higher order cumulants used by most algorith","authors_text":"Alexander Wein, Alexandre d'Aspremont, Amelia Perry, Anastasia Podosinnikova, David Sontag, Francis Bach","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-01-24T10:38:11Z","title":"Overcomplete Independent Component Analysis via SDP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.08334","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:1f44f13445287b2eca34a1723a5012735a692c6622d45055a14af3142706e26d","target":"record","created_at":"2026-05-17T23:55:37Z","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":"593c7c6944206c4d08a71c048c0a884abd479efba6671c5e7179b1406d620c54","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-01-24T10:38:11Z","title_canon_sha256":"c328903de68eda6cdba1dee20187d9474d5dabb5322e7b012cab6b34bf09b8ad"},"schema_version":"1.0","source":{"id":"1901.08334","kind":"arxiv","version":1}},"canonical_sha256":"d76066506fb13a2a52913e9be4642d633709348b1a5f5ec73b3520f4bedb2484","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d76066506fb13a2a52913e9be4642d633709348b1a5f5ec73b3520f4bedb2484","first_computed_at":"2026-05-17T23:55:37.310074Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:37.310074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QRkhlei27hzJwwbo76tL+E5woK2m2N5Po77MWlmEOzMmJMt6JOBst5QoGomEnFXRDhsxXi8wmgrw0o12w3a5Cw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:37.310513Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.08334","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f44f13445287b2eca34a1723a5012735a692c6622d45055a14af3142706e26d","sha256:fe01081d5c57d8b5908c855f05d625f76172d0c127d0467ce28163de8d63ad83"],"state_sha256":"3453089d9b02c7e2d71be22c4b856c0992777d6ce5e9f9a77e8ac7eeee855c81"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"goeRoujxpwf/v1KvGGDvn5Xk6Fg38aEtZS9lJFvhjgUkVDzYkWyQucKo4D6elYLOl/e5pXwUty3Ad/U+gFsSDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T11:36:30.475525Z","bundle_sha256":"7da3cccfed97bc64aeb62d51653a1659093bb7e585e5dce1d9c956beda06eca3"}}