{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7V7KFH52UXC54XD6ZM34VHDLR2","short_pith_number":"pith:7V7KFH52","schema_version":"1.0","canonical_sha256":"fd7ea29fbaa5c5de5c7ecb37ca9c6b8ebf254162792720f248bf35afa029899b","source":{"kind":"arxiv","id":"1706.08171","version":3},"attestation_state":"computed","paper":{"title":"Faster independent component analysis by preconditioning with Hessian approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"stat.ML","authors_text":"Alexandre Gramfort, Jean-Fran\\c{c}ois Cardoso, Pierre Ablin","submitted_at":"2017-06-25T20:47:33Z","abstract_excerpt":"Independent Component Analysis (ICA) is a technique for unsupervised exploration of multi-channel data that is widely used in observational sciences. In its classic form, ICA relies on modeling the data as linear mixtures of non-Gaussian independent sources. The maximization of the corresponding likelihood is a challenging problem if it has to be completed quickly and accurately on large sets of real data. We introduce the Preconditioned ICA for Real Data (Picard) algorithm, which is a relative L-BFGS algorithm preconditioned with sparse Hessian approximations. Extensive numerical comparisons "},"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":"1706.08171","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-25T20:47:33Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"62d0fbf6169d0a4b1c14fc7d3346c646662d5ef7b167bd62ce47d7b70104892e","abstract_canon_sha256":"eb544793bdd78dc8b5b2d6028213dfc276a97cf698c0b17a476d34f19d7576b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:20.284565Z","signature_b64":"1wyzlgNCOe6gkL32mZah9kx81myssHJ1W6WZR1tn2kqSE65xRi0iIFjKoWTBXYa59Dz31UaQcds1Ro6Vm4iVDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd7ea29fbaa5c5de5c7ecb37ca9c6b8ebf254162792720f248bf35afa029899b","last_reissued_at":"2026-05-18T00:09:20.284064Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:20.284064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster independent component analysis by preconditioning with Hessian approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"stat.ML","authors_text":"Alexandre Gramfort, Jean-Fran\\c{c}ois Cardoso, Pierre Ablin","submitted_at":"2017-06-25T20:47:33Z","abstract_excerpt":"Independent Component Analysis (ICA) is a technique for unsupervised exploration of multi-channel data that is widely used in observational sciences. In its classic form, ICA relies on modeling the data as linear mixtures of non-Gaussian independent sources. The maximization of the corresponding likelihood is a challenging problem if it has to be completed quickly and accurately on large sets of real data. We introduce the Preconditioned ICA for Real Data (Picard) algorithm, which is a relative L-BFGS algorithm preconditioned with sparse Hessian approximations. Extensive numerical comparisons "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08171","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.08171","created_at":"2026-05-18T00:09:20.284145+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.08171v3","created_at":"2026-05-18T00:09:20.284145+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08171","created_at":"2026-05-18T00:09:20.284145+00:00"},{"alias_kind":"pith_short_12","alias_value":"7V7KFH52UXC5","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7V7KFH52UXC54XD6","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7V7KFH52","created_at":"2026-05-18T12:31:05.417338+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/7V7KFH52UXC54XD6ZM34VHDLR2","json":"https://pith.science/pith/7V7KFH52UXC54XD6ZM34VHDLR2.json","graph_json":"https://pith.science/api/pith-number/7V7KFH52UXC54XD6ZM34VHDLR2/graph.json","events_json":"https://pith.science/api/pith-number/7V7KFH52UXC54XD6ZM34VHDLR2/events.json","paper":"https://pith.science/paper/7V7KFH52"},"agent_actions":{"view_html":"https://pith.science/pith/7V7KFH52UXC54XD6ZM34VHDLR2","download_json":"https://pith.science/pith/7V7KFH52UXC54XD6ZM34VHDLR2.json","view_paper":"https://pith.science/paper/7V7KFH52","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.08171&json=true","fetch_graph":"https://pith.science/api/pith-number/7V7KFH52UXC54XD6ZM34VHDLR2/graph.json","fetch_events":"https://pith.science/api/pith-number/7V7KFH52UXC54XD6ZM34VHDLR2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7V7KFH52UXC54XD6ZM34VHDLR2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7V7KFH52UXC54XD6ZM34VHDLR2/action/storage_attestation","attest_author":"https://pith.science/pith/7V7KFH52UXC54XD6ZM34VHDLR2/action/author_attestation","sign_citation":"https://pith.science/pith/7V7KFH52UXC54XD6ZM34VHDLR2/action/citation_signature","submit_replication":"https://pith.science/pith/7V7KFH52UXC54XD6ZM34VHDLR2/action/replication_record"}},"created_at":"2026-05-18T00:09:20.284145+00:00","updated_at":"2026-05-18T00:09:20.284145+00:00"}