{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YDWLL2J7BPPVB6YQ6U4XHZRFHN","short_pith_number":"pith:YDWLL2J7","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"},"canonical_sha256":"c0ecb5e93f0bdf50fb10f53973e6253b7e6efd3974b8143dd5f4c2b70d4d15a2","source":{"kind":"arxiv","id":"1809.05815","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.05815","created_at":"2026-05-18T00:00:50Z"},{"alias_kind":"arxiv_version","alias_value":"1809.05815v1","created_at":"2026-05-18T00:00:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05815","created_at":"2026-05-18T00:00:50Z"},{"alias_kind":"pith_short_12","alias_value":"YDWLL2J7BPPV","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YDWLL2J7BPPVB6YQ","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YDWLL2J7","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YDWLL2J7BPPVB6YQ6U4XHZRFHN","target":"record","payload":{"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"},"canonical_sha256":"c0ecb5e93f0bdf50fb10f53973e6253b7e6efd3974b8143dd5f4c2b70d4d15a2","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"},"source_kind":"arxiv","source_id":"1809.05815","source_version":1,"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-18T00:00:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KyNwYkgrE0T6KrndlLmmv1JtwxlEsAKbHndVgyATgjOtii47RlGK4TON0+Jfw/ruYPG/HsgvICCEq4rpczRlBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:05:06.031278Z"},"content_sha256":"d5680f2be17204ddcda17e2e1f0a72e448e09129cd78be27e81b885fa7242849","schema_version":"1.0","event_id":"sha256:d5680f2be17204ddcda17e2e1f0a72e448e09129cd78be27e81b885fa7242849"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YDWLL2J7BPPVB6YQ6U4XHZRFHN","target":"graph","payload":{"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"},"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-18T00:00:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C2tJMK+BlIxAcA+lBjPLpFPJcf0Su2N9pQSWXbTq9qK6iPZa9pOODfNtZP0C+4lfnWAIwh0bLm11kOm/Ar6LAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:05:06.031676Z"},"content_sha256":"07ba67dbebe062ffe5c2124ef97d0bb3ab00a64a0d2769e4b52de34a3ae027d7","schema_version":"1.0","event_id":"sha256:07ba67dbebe062ffe5c2124ef97d0bb3ab00a64a0d2769e4b52de34a3ae027d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YDWLL2J7BPPVB6YQ6U4XHZRFHN/bundle.json","state_url":"https://pith.science/pith/YDWLL2J7BPPVB6YQ6U4XHZRFHN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YDWLL2J7BPPVB6YQ6U4XHZRFHN/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-31T23:05:06Z","links":{"resolver":"https://pith.science/pith/YDWLL2J7BPPVB6YQ6U4XHZRFHN","bundle":"https://pith.science/pith/YDWLL2J7BPPVB6YQ6U4XHZRFHN/bundle.json","state":"https://pith.science/pith/YDWLL2J7BPPVB6YQ6U4XHZRFHN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YDWLL2J7BPPVB6YQ6U4XHZRFHN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YDWLL2J7BPPVB6YQ6U4XHZRFHN","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":"d27d39c173809cc0376cb0843adefb8c8816130f935c08aababa439bff5feb15","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-09-16T04:33:21Z","title_canon_sha256":"f291fbed00237a00e70e740fa66f6e497ffcfc2411b123c3159f163d5a24e0bc"},"schema_version":"1.0","source":{"id":"1809.05815","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.05815","created_at":"2026-05-18T00:00:50Z"},{"alias_kind":"arxiv_version","alias_value":"1809.05815v1","created_at":"2026-05-18T00:00:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05815","created_at":"2026-05-18T00:00:50Z"},{"alias_kind":"pith_short_12","alias_value":"YDWLL2J7BPPV","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YDWLL2J7BPPVB6YQ","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YDWLL2J7","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:07ba67dbebe062ffe5c2124ef97d0bb3ab00a64a0d2769e4b52de34a3ae027d7","target":"graph","created_at":"2026-05-18T00:00:50Z","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 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","authors_text":"Amichai Painsky, Meir Feder, Saharon Rosset","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-09-16T04:33:21Z","title":"Linear Independent Component Analysis over Finite Fields: Algorithms and Bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05815","kind":"arxiv","version":1},"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:d5680f2be17204ddcda17e2e1f0a72e448e09129cd78be27e81b885fa7242849","target":"record","created_at":"2026-05-18T00:00:50Z","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":"d27d39c173809cc0376cb0843adefb8c8816130f935c08aababa439bff5feb15","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-09-16T04:33:21Z","title_canon_sha256":"f291fbed00237a00e70e740fa66f6e497ffcfc2411b123c3159f163d5a24e0bc"},"schema_version":"1.0","source":{"id":"1809.05815","kind":"arxiv","version":1}},"canonical_sha256":"c0ecb5e93f0bdf50fb10f53973e6253b7e6efd3974b8143dd5f4c2b70d4d15a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0ecb5e93f0bdf50fb10f53973e6253b7e6efd3974b8143dd5f4c2b70d4d15a2","first_computed_at":"2026-05-18T00:00:50.113178Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:50.113178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wFyf4cZeyWK3NVqkDjQwM60VPJx56JqyPz3fGSBR28OfN7oUy90J5JQ3Ls+2tccRlaqkdlD4JxfCyit58zTCCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:50.113754Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.05815","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5680f2be17204ddcda17e2e1f0a72e448e09129cd78be27e81b885fa7242849","sha256:07ba67dbebe062ffe5c2124ef97d0bb3ab00a64a0d2769e4b52de34a3ae027d7"],"state_sha256":"3e3b6d2dd4a87e6527645382998b71533ce95e8615b77b56a4b5a6cdcb91cfc0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7ew9hBcHwtJR3plRbUa3smuEYrFfEfsYrXVwwHOi8djQM2nmkH3qKenzY3zjQT45kd7xUXfzO0yqWKJCl+hMBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:05:06.034277Z","bundle_sha256":"a2766ed0f16d9f893db9614aa183fec10dbe78de88c447989fd5a4f9a82c59c1"}}