{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WDUIWSZLEIJ4ICDN5NNHURUDMH","short_pith_number":"pith:WDUIWSZL","canonical_record":{"source":{"id":"1805.10054","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-25T09:29:33Z","cross_cats_sorted":["cs.LG","stat.AP"],"title_canon_sha256":"9e72be3548fefeb378c247a23ce2e30921d2c671d36ff6448dc1c4378702b238","abstract_canon_sha256":"a41c5cc1b5cf1e64fbdab660a1191ed3f69a7965f6baa5bbb5091825df738d66"},"schema_version":"1.0"},"canonical_sha256":"b0e88b4b2b2213c4086deb5a7a468361da12004b14f49695947128a5d455b74d","source":{"kind":"arxiv","id":"1805.10054","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10054","created_at":"2026-05-17T23:45:04Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10054v2","created_at":"2026-05-17T23:45:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10054","created_at":"2026-05-17T23:45:04Z"},{"alias_kind":"pith_short_12","alias_value":"WDUIWSZLEIJ4","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WDUIWSZLEIJ4ICDN","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WDUIWSZL","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WDUIWSZLEIJ4ICDN5NNHURUDMH","target":"record","payload":{"canonical_record":{"source":{"id":"1805.10054","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-25T09:29:33Z","cross_cats_sorted":["cs.LG","stat.AP"],"title_canon_sha256":"9e72be3548fefeb378c247a23ce2e30921d2c671d36ff6448dc1c4378702b238","abstract_canon_sha256":"a41c5cc1b5cf1e64fbdab660a1191ed3f69a7965f6baa5bbb5091825df738d66"},"schema_version":"1.0"},"canonical_sha256":"b0e88b4b2b2213c4086deb5a7a468361da12004b14f49695947128a5d455b74d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:04.682109Z","signature_b64":"sEoC8DwM966t2R3w3CiN/PvPdqtFCeGl7Z9OGe3bpCe1bzPZrzRv7CAwOT1WaoMokzdPrVIEJF7jV0RPUmUwBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0e88b4b2b2213c4086deb5a7a468361da12004b14f49695947128a5d455b74d","last_reissued_at":"2026-05-17T23:45:04.681456Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:04.681456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.10054","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-17T23:45:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BXo3pQRYHPuj/Gw0p+MfH6eQdBilcaJdx+SjsvOkbJJ6ADS1I13diWGGVsibn8P/eDqFsqv5jU28psFXt6XyBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:22:45.180968Z"},"content_sha256":"806c9a0c5eb77fef4542ae3b41af0d8b5492b044e53be9c990c86b5c609e37cb","schema_version":"1.0","event_id":"sha256:806c9a0c5eb77fef4542ae3b41af0d8b5492b044e53be9c990c86b5c609e37cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WDUIWSZLEIJ4ICDN5NNHURUDMH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic algorithms with descent guarantees for ICA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.AP"],"primary_cat":"stat.ML","authors_text":"Alexandre Gramfort, Francis Bach, Jean-Fran\\c{c}ois Cardoso, Pierre Ablin","submitted_at":"2018-05-25T09:29:33Z","abstract_excerpt":"Independent component analysis (ICA) is a widespread data exploration technique, where observed signals are modeled as linear mixtures of independent components. From a machine learning point of view, it amounts to a matrix factorization problem with a statistical independence criterion. Infomax is one of the most used ICA algorithms. It is based on a loss function which is a non-convex log-likelihood. We develop a new majorization-minimization framework adapted to this loss function. We derive an online algorithm for the streaming setting, and an incremental algorithm for the finite sum setti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10054","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-17T23:45:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O1NW3GY3P5GDd4Dr6PlfczHZWmXeVmbkDCwUuqtYLsaK2b00DCu+jmTrwhqwrKlh3nIxw85BmGwEtYQaONoDAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:22:45.181323Z"},"content_sha256":"d726b23dd6501aa4c245aa1ae8436b5be16627a60a03d5b8dca7aed6bb16cff1","schema_version":"1.0","event_id":"sha256:d726b23dd6501aa4c245aa1ae8436b5be16627a60a03d5b8dca7aed6bb16cff1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WDUIWSZLEIJ4ICDN5NNHURUDMH/bundle.json","state_url":"https://pith.science/pith/WDUIWSZLEIJ4ICDN5NNHURUDMH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WDUIWSZLEIJ4ICDN5NNHURUDMH/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-30T06:22:45Z","links":{"resolver":"https://pith.science/pith/WDUIWSZLEIJ4ICDN5NNHURUDMH","bundle":"https://pith.science/pith/WDUIWSZLEIJ4ICDN5NNHURUDMH/bundle.json","state":"https://pith.science/pith/WDUIWSZLEIJ4ICDN5NNHURUDMH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WDUIWSZLEIJ4ICDN5NNHURUDMH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WDUIWSZLEIJ4ICDN5NNHURUDMH","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":"a41c5cc1b5cf1e64fbdab660a1191ed3f69a7965f6baa5bbb5091825df738d66","cross_cats_sorted":["cs.LG","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-25T09:29:33Z","title_canon_sha256":"9e72be3548fefeb378c247a23ce2e30921d2c671d36ff6448dc1c4378702b238"},"schema_version":"1.0","source":{"id":"1805.10054","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10054","created_at":"2026-05-17T23:45:04Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10054v2","created_at":"2026-05-17T23:45:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10054","created_at":"2026-05-17T23:45:04Z"},{"alias_kind":"pith_short_12","alias_value":"WDUIWSZLEIJ4","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WDUIWSZLEIJ4ICDN","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WDUIWSZL","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:d726b23dd6501aa4c245aa1ae8436b5be16627a60a03d5b8dca7aed6bb16cff1","target":"graph","created_at":"2026-05-17T23:45:04Z","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":"Independent component analysis (ICA) is a widespread data exploration technique, where observed signals are modeled as linear mixtures of independent components. From a machine learning point of view, it amounts to a matrix factorization problem with a statistical independence criterion. Infomax is one of the most used ICA algorithms. It is based on a loss function which is a non-convex log-likelihood. We develop a new majorization-minimization framework adapted to this loss function. We derive an online algorithm for the streaming setting, and an incremental algorithm for the finite sum setti","authors_text":"Alexandre Gramfort, Francis Bach, Jean-Fran\\c{c}ois Cardoso, Pierre Ablin","cross_cats":["cs.LG","stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-25T09:29:33Z","title":"Stochastic algorithms with descent guarantees for ICA"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10054","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:806c9a0c5eb77fef4542ae3b41af0d8b5492b044e53be9c990c86b5c609e37cb","target":"record","created_at":"2026-05-17T23:45:04Z","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":"a41c5cc1b5cf1e64fbdab660a1191ed3f69a7965f6baa5bbb5091825df738d66","cross_cats_sorted":["cs.LG","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-25T09:29:33Z","title_canon_sha256":"9e72be3548fefeb378c247a23ce2e30921d2c671d36ff6448dc1c4378702b238"},"schema_version":"1.0","source":{"id":"1805.10054","kind":"arxiv","version":2}},"canonical_sha256":"b0e88b4b2b2213c4086deb5a7a468361da12004b14f49695947128a5d455b74d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0e88b4b2b2213c4086deb5a7a468361da12004b14f49695947128a5d455b74d","first_computed_at":"2026-05-17T23:45:04.681456Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:04.681456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sEoC8DwM966t2R3w3CiN/PvPdqtFCeGl7Z9OGe3bpCe1bzPZrzRv7CAwOT1WaoMokzdPrVIEJF7jV0RPUmUwBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:04.682109Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.10054","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:806c9a0c5eb77fef4542ae3b41af0d8b5492b044e53be9c990c86b5c609e37cb","sha256:d726b23dd6501aa4c245aa1ae8436b5be16627a60a03d5b8dca7aed6bb16cff1"],"state_sha256":"7118f2edf692313cc4cf8a3c9a90669f0fb0da87b08ca019fe63cdfa3ee5055d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y63oX/H8M6d/7WEnbDLnlmj0yB7dZc3BBz4BzTdzIMOdv0BO4uJgTPCPqg/Z6urlAoyFOMqTi2Wze6azYTbwCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:22:45.183271Z","bundle_sha256":"e590b400f31e08c2a581706d26e94caddb72856243538eb54507f57013c41802"}}