{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Y5NSAFYAET27JRKW7AHCCNAMAE","short_pith_number":"pith:Y5NSAFYA","schema_version":"1.0","canonical_sha256":"c75b20170024f5f4c556f80e21340c013f8bf73b3ef1af7f0da5b55e299fc8a3","source":{"kind":"arxiv","id":"1711.10873","version":1},"attestation_state":"computed","paper":{"title":"Faster ICA under orthogonal constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Alexandre Gramfort, Jean-Fran\\c{c}ois Cardoso, Pierre Ablin","submitted_at":"2017-11-29T14:25:25Z","abstract_excerpt":"Independent Component Analysis (ICA) is a technique for unsupervised exploration of multi-channel data widely used in observational sciences. In its classical form, ICA relies on modeling the data as a linear mixture of non-Gaussian independent sources. The problem can be seen as a likelihood maximization problem. We introduce Picard-O, a preconditioned L-BFGS strategy over the set of orthogonal matrices, which can quickly separate both super- and sub-Gaussian signals. It returns the same set of sources as the widely used FastICA algorithm. Through numerical experiments, we show that our metho"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1711.10873","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-29T14:25:25Z","cross_cats_sorted":[],"title_canon_sha256":"b7668d5dc90533bd38b853a119cbdbe68f76942835adf3303d7f9e4f657f9f95","abstract_canon_sha256":"133d61c987d30b598648b42dab6603c835910603e7121e7d4f61a347491157cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:16.596497Z","signature_b64":"wK+BwORl+7AfyQ9uncHrhhvUWcXuNVT68q4Mx1HjjE78QjARm2unzFI/TsmsJVtm0uQlAC8eEOzkC1VEXULkBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c75b20170024f5f4c556f80e21340c013f8bf73b3ef1af7f0da5b55e299fc8a3","last_reissued_at":"2026-05-18T00:29:16.596006Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:16.596006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster ICA under orthogonal constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Alexandre Gramfort, Jean-Fran\\c{c}ois Cardoso, Pierre Ablin","submitted_at":"2017-11-29T14:25:25Z","abstract_excerpt":"Independent Component Analysis (ICA) is a technique for unsupervised exploration of multi-channel data widely used in observational sciences. In its classical form, ICA relies on modeling the data as a linear mixture of non-Gaussian independent sources. The problem can be seen as a likelihood maximization problem. We introduce Picard-O, a preconditioned L-BFGS strategy over the set of orthogonal matrices, which can quickly separate both super- and sub-Gaussian signals. It returns the same set of sources as the widely used FastICA algorithm. Through numerical experiments, we show that our metho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10873","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.10873","created_at":"2026-05-18T00:29:16.596093+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.10873v1","created_at":"2026-05-18T00:29:16.596093+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10873","created_at":"2026-05-18T00:29:16.596093+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y5NSAFYAET27","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y5NSAFYAET27JRKW","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y5NSAFYA","created_at":"2026-05-18T12:31:56.362134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y5NSAFYAET27JRKW7AHCCNAMAE","json":"https://pith.science/pith/Y5NSAFYAET27JRKW7AHCCNAMAE.json","graph_json":"https://pith.science/api/pith-number/Y5NSAFYAET27JRKW7AHCCNAMAE/graph.json","events_json":"https://pith.science/api/pith-number/Y5NSAFYAET27JRKW7AHCCNAMAE/events.json","paper":"https://pith.science/paper/Y5NSAFYA"},"agent_actions":{"view_html":"https://pith.science/pith/Y5NSAFYAET27JRKW7AHCCNAMAE","download_json":"https://pith.science/pith/Y5NSAFYAET27JRKW7AHCCNAMAE.json","view_paper":"https://pith.science/paper/Y5NSAFYA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.10873&json=true","fetch_graph":"https://pith.science/api/pith-number/Y5NSAFYAET27JRKW7AHCCNAMAE/graph.json","fetch_events":"https://pith.science/api/pith-number/Y5NSAFYAET27JRKW7AHCCNAMAE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y5NSAFYAET27JRKW7AHCCNAMAE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y5NSAFYAET27JRKW7AHCCNAMAE/action/storage_attestation","attest_author":"https://pith.science/pith/Y5NSAFYAET27JRKW7AHCCNAMAE/action/author_attestation","sign_citation":"https://pith.science/pith/Y5NSAFYAET27JRKW7AHCCNAMAE/action/citation_signature","submit_replication":"https://pith.science/pith/Y5NSAFYAET27JRKW7AHCCNAMAE/action/replication_record"}},"created_at":"2026-05-18T00:29:16.596093+00:00","updated_at":"2026-05-18T00:29:16.596093+00:00"}