{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YDWLL2J7BPPVB6YQ6U4XHZRFHN","short_pith_number":"pith:YDWLL2J7","schema_version":"1.0","canonical_sha256":"c0ecb5e93f0bdf50fb10f53973e6253b7e6efd3974b8143dd5f4c2b70d4d15a2","source":{"kind":"arxiv","id":"1809.05815","version":1},"attestation_state":"computed","paper":{"title":"Linear Independent Component Analysis over Finite Fields: Algorithms and Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Amichai Painsky, Meir Feder, Saharon Rosset","submitted_at":"2018-09-16T04:33:21Z","abstract_excerpt":"Independent Component Analysis (ICA) is a statistical tool that decomposes an observed random vector into components that are as statistically independent as possible. ICA over finite fields is a special case of ICA, in which both the observations and the decomposed components take values over a finite alphabet. This problem is also known as minimal redundancy representation or factorial coding. In this work we focus on linear methods for ICA over finite fields. We introduce a basic lower bound which provides a fundamental limit to the ability of any linear solution to solve this problem. Base"},"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":"1809.05815","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-09-16T04:33:21Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f291fbed00237a00e70e740fa66f6e497ffcfc2411b123c3159f163d5a24e0bc","abstract_canon_sha256":"d27d39c173809cc0376cb0843adefb8c8816130f935c08aababa439bff5feb15"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:50.113754Z","signature_b64":"wFyf4cZeyWK3NVqkDjQwM60VPJx56JqyPz3fGSBR28OfN7oUy90J5JQ3Ls+2tccRlaqkdlD4JxfCyit58zTCCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0ecb5e93f0bdf50fb10f53973e6253b7e6efd3974b8143dd5f4c2b70d4d15a2","last_reissued_at":"2026-05-18T00:00:50.113178Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:50.113178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Independent Component Analysis over Finite Fields: Algorithms and Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Amichai Painsky, Meir Feder, Saharon Rosset","submitted_at":"2018-09-16T04:33:21Z","abstract_excerpt":"Independent Component Analysis (ICA) is a statistical tool that decomposes an observed random vector into components that are as statistically independent as possible. ICA over finite fields is a special case of ICA, in which both the observations and the decomposed components take values over a finite alphabet. This problem is also known as minimal redundancy representation or factorial coding. In this work we focus on linear methods for ICA over finite fields. We introduce a basic lower bound which provides a fundamental limit to the ability of any linear solution to solve this problem. Base"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05815","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":"1809.05815","created_at":"2026-05-18T00:00:50.113253+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.05815v1","created_at":"2026-05-18T00:00:50.113253+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05815","created_at":"2026-05-18T00:00:50.113253+00:00"},{"alias_kind":"pith_short_12","alias_value":"YDWLL2J7BPPV","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YDWLL2J7BPPVB6YQ","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YDWLL2J7","created_at":"2026-05-18T12:33:04.347982+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/YDWLL2J7BPPVB6YQ6U4XHZRFHN","json":"https://pith.science/pith/YDWLL2J7BPPVB6YQ6U4XHZRFHN.json","graph_json":"https://pith.science/api/pith-number/YDWLL2J7BPPVB6YQ6U4XHZRFHN/graph.json","events_json":"https://pith.science/api/pith-number/YDWLL2J7BPPVB6YQ6U4XHZRFHN/events.json","paper":"https://pith.science/paper/YDWLL2J7"},"agent_actions":{"view_html":"https://pith.science/pith/YDWLL2J7BPPVB6YQ6U4XHZRFHN","download_json":"https://pith.science/pith/YDWLL2J7BPPVB6YQ6U4XHZRFHN.json","view_paper":"https://pith.science/paper/YDWLL2J7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.05815&json=true","fetch_graph":"https://pith.science/api/pith-number/YDWLL2J7BPPVB6YQ6U4XHZRFHN/graph.json","fetch_events":"https://pith.science/api/pith-number/YDWLL2J7BPPVB6YQ6U4XHZRFHN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YDWLL2J7BPPVB6YQ6U4XHZRFHN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YDWLL2J7BPPVB6YQ6U4XHZRFHN/action/storage_attestation","attest_author":"https://pith.science/pith/YDWLL2J7BPPVB6YQ6U4XHZRFHN/action/author_attestation","sign_citation":"https://pith.science/pith/YDWLL2J7BPPVB6YQ6U4XHZRFHN/action/citation_signature","submit_replication":"https://pith.science/pith/YDWLL2J7BPPVB6YQ6U4XHZRFHN/action/replication_record"}},"created_at":"2026-05-18T00:00:50.113253+00:00","updated_at":"2026-05-18T00:00:50.113253+00:00"}