{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SM6YOZ2BXCOJG7UF3VRKPUXDON","short_pith_number":"pith:SM6YOZ2B","schema_version":"1.0","canonical_sha256":"933d876741b89c937e85dd62a7d2e3736674d730c6d5dc233c6105d8f5919058","source":{"kind":"arxiv","id":"1502.04148","version":2},"attestation_state":"computed","paper":{"title":"A Pseudo-Euclidean Iteration for Optimal Recovery in Noisy ICA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"James Voss, Luis Rademacher, Mikhail Belkin","submitted_at":"2015-02-13T23:18:35Z","abstract_excerpt":"Independent Component Analysis (ICA) is a popular model for blind signal separation. The ICA model assumes that a number of independent source signals are linearly mixed to form the observed signals. We propose a new algorithm, PEGI (for pseudo-Euclidean Gradient Iteration), for provable model recovery for ICA with Gaussian noise. The main technical innovation of the algorithm is to use a fixed point iteration in a pseudo-Euclidean (indefinite \"inner product\") space. The use of this indefinite \"inner product\" resolves technical issues common to several existing algorithms for noisy ICA. This l"},"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":"1502.04148","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-13T23:18:35Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8bd5ad994d09a62f885c3c31b8ab413f5937899cd5f33e87c0b9fec70925c14c","abstract_canon_sha256":"36de96f38ebd7cc0cbaa192bbe561886889e1fed2af5775af35915046774eb61"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:19.830291Z","signature_b64":"SKH09FvkWnLOf5skrGKtliYRE9SlBMl63rBKUbjMAbKdenSXCdUWW7f8nJokSdGtdTBuf421h/5TAVy7u8X4BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"933d876741b89c937e85dd62a7d2e3736674d730c6d5dc233c6105d8f5919058","last_reissued_at":"2026-05-18T01:31:19.829674Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:19.829674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Pseudo-Euclidean Iteration for Optimal Recovery in Noisy ICA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"James Voss, Luis Rademacher, Mikhail Belkin","submitted_at":"2015-02-13T23:18:35Z","abstract_excerpt":"Independent Component Analysis (ICA) is a popular model for blind signal separation. The ICA model assumes that a number of independent source signals are linearly mixed to form the observed signals. We propose a new algorithm, PEGI (for pseudo-Euclidean Gradient Iteration), for provable model recovery for ICA with Gaussian noise. The main technical innovation of the algorithm is to use a fixed point iteration in a pseudo-Euclidean (indefinite \"inner product\") space. The use of this indefinite \"inner product\" resolves technical issues common to several existing algorithms for noisy ICA. This l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04148","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1502.04148","created_at":"2026-05-18T01:31:19.829755+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.04148v2","created_at":"2026-05-18T01:31:19.829755+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04148","created_at":"2026-05-18T01:31:19.829755+00:00"},{"alias_kind":"pith_short_12","alias_value":"SM6YOZ2BXCOJ","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"SM6YOZ2BXCOJG7UF","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"SM6YOZ2B","created_at":"2026-05-18T12:29:42.218222+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/SM6YOZ2BXCOJG7UF3VRKPUXDON","json":"https://pith.science/pith/SM6YOZ2BXCOJG7UF3VRKPUXDON.json","graph_json":"https://pith.science/api/pith-number/SM6YOZ2BXCOJG7UF3VRKPUXDON/graph.json","events_json":"https://pith.science/api/pith-number/SM6YOZ2BXCOJG7UF3VRKPUXDON/events.json","paper":"https://pith.science/paper/SM6YOZ2B"},"agent_actions":{"view_html":"https://pith.science/pith/SM6YOZ2BXCOJG7UF3VRKPUXDON","download_json":"https://pith.science/pith/SM6YOZ2BXCOJG7UF3VRKPUXDON.json","view_paper":"https://pith.science/paper/SM6YOZ2B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.04148&json=true","fetch_graph":"https://pith.science/api/pith-number/SM6YOZ2BXCOJG7UF3VRKPUXDON/graph.json","fetch_events":"https://pith.science/api/pith-number/SM6YOZ2BXCOJG7UF3VRKPUXDON/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SM6YOZ2BXCOJG7UF3VRKPUXDON/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SM6YOZ2BXCOJG7UF3VRKPUXDON/action/storage_attestation","attest_author":"https://pith.science/pith/SM6YOZ2BXCOJG7UF3VRKPUXDON/action/author_attestation","sign_citation":"https://pith.science/pith/SM6YOZ2BXCOJG7UF3VRKPUXDON/action/citation_signature","submit_replication":"https://pith.science/pith/SM6YOZ2BXCOJG7UF3VRKPUXDON/action/replication_record"}},"created_at":"2026-05-18T01:31:19.829755+00:00","updated_at":"2026-05-18T01:31:19.829755+00:00"}