{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MPKDOSKMUYIIGS3IJ3T5UBUNUP","short_pith_number":"pith:MPKDOSKM","canonical_record":{"source":{"id":"1803.10108","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-03-27T14:32:49Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"137e44cdfacb2079f4b09cf4b517f9ebdfe134253cc05a5590c10190f95904b4","abstract_canon_sha256":"7f3b88ba58bef5064f4759f5fea5e77b6655b547423cbea279c7b49d8cdb00d3"},"schema_version":"1.0"},"canonical_sha256":"63d437494ca610834b684ee7da068da3ea3aaa746310622d99ba845c6f571145","source":{"kind":"arxiv","id":"1803.10108","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.10108","created_at":"2026-05-17T23:55:21Z"},{"alias_kind":"arxiv_version","alias_value":"1803.10108v2","created_at":"2026-05-17T23:55:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10108","created_at":"2026-05-17T23:55:21Z"},{"alias_kind":"pith_short_12","alias_value":"MPKDOSKMUYII","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MPKDOSKMUYIIGS3I","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MPKDOSKM","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MPKDOSKMUYIIGS3IJ3T5UBUNUP","target":"record","payload":{"canonical_record":{"source":{"id":"1803.10108","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-03-27T14:32:49Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"137e44cdfacb2079f4b09cf4b517f9ebdfe134253cc05a5590c10190f95904b4","abstract_canon_sha256":"7f3b88ba58bef5064f4759f5fea5e77b6655b547423cbea279c7b49d8cdb00d3"},"schema_version":"1.0"},"canonical_sha256":"63d437494ca610834b684ee7da068da3ea3aaa746310622d99ba845c6f571145","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:21.086211Z","signature_b64":"0acFNAJOMFACwq9Xe9sq3PLx8H2AiEv1acnhtssSczeS6u/u0ckJvwPMuzdAclhL+lLMj1ZA1uVtSIhZ09qAAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63d437494ca610834b684ee7da068da3ea3aaa746310622d99ba845c6f571145","last_reissued_at":"2026-05-17T23:55:21.085717Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:21.085717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.10108","source_version":2,"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-17T23:55:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r2JrV3qoStxe9qyMp2FH42ERHPlgywcnSUMRlsfBJoeQPls0weGZbk+SPb4o8OrOrbD3zVxgJg8Knc3l++zmAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T03:35:38.692854Z"},"content_sha256":"1992dc3d7a370100c137b97797db8b0409f53870c5451e9b17e1980b92170e10","schema_version":"1.0","event_id":"sha256:1992dc3d7a370100c137b97797db8b0409f53870c5451e9b17e1980b92170e10"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MPKDOSKMUYIIGS3IJ3T5UBUNUP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gradient Algorithms for Complex Non-Gaussian Independent Component/Vector Extraction, Question of Convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"eess.SP","authors_text":"Petr Tichavsk\\'y, Zbyn\\v{e}k Koldovsk\\'y","submitted_at":"2018-03-27T14:32:49Z","abstract_excerpt":"We revise the problem of extracting one independent component from an instantaneous linear mixture of signals. The mixing matrix is parameterized by two vectors, one column of the mixing matrix and one row of the de-mixing matrix. The separation is based on the non-Gaussianity of the source of interest, while the other background signals are assumed to be Gaussian. Three gradient-based estimation algorithms are derived using the maximum likelihood principle and are compared with the Natural Gradient algorithm for Independent Component Analysis and with One-unit FastICA based on negentropy maxi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10108","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"},"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-17T23:55:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"50L9haNrQ6qm4WeebYztcOpMOdGA0HMPybuSMhh6p5u6Gqd1Vx2t83+w6U6umZBc11oHJlLNEarjUPZn1BRlBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T03:35:38.693204Z"},"content_sha256":"a926680e924aa2641b5cec1f8c6fce53e716bfd85328b15ffacea5213fb28363","schema_version":"1.0","event_id":"sha256:a926680e924aa2641b5cec1f8c6fce53e716bfd85328b15ffacea5213fb28363"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MPKDOSKMUYIIGS3IJ3T5UBUNUP/bundle.json","state_url":"https://pith.science/pith/MPKDOSKMUYIIGS3IJ3T5UBUNUP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MPKDOSKMUYIIGS3IJ3T5UBUNUP/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-07-09T03:35:38Z","links":{"resolver":"https://pith.science/pith/MPKDOSKMUYIIGS3IJ3T5UBUNUP","bundle":"https://pith.science/pith/MPKDOSKMUYIIGS3IJ3T5UBUNUP/bundle.json","state":"https://pith.science/pith/MPKDOSKMUYIIGS3IJ3T5UBUNUP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MPKDOSKMUYIIGS3IJ3T5UBUNUP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MPKDOSKMUYIIGS3IJ3T5UBUNUP","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":"7f3b88ba58bef5064f4759f5fea5e77b6655b547423cbea279c7b49d8cdb00d3","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-03-27T14:32:49Z","title_canon_sha256":"137e44cdfacb2079f4b09cf4b517f9ebdfe134253cc05a5590c10190f95904b4"},"schema_version":"1.0","source":{"id":"1803.10108","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.10108","created_at":"2026-05-17T23:55:21Z"},{"alias_kind":"arxiv_version","alias_value":"1803.10108v2","created_at":"2026-05-17T23:55:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10108","created_at":"2026-05-17T23:55:21Z"},{"alias_kind":"pith_short_12","alias_value":"MPKDOSKMUYII","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MPKDOSKMUYIIGS3I","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MPKDOSKM","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:a926680e924aa2641b5cec1f8c6fce53e716bfd85328b15ffacea5213fb28363","target":"graph","created_at":"2026-05-17T23:55:21Z","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":"We revise the problem of extracting one independent component from an instantaneous linear mixture of signals. The mixing matrix is parameterized by two vectors, one column of the mixing matrix and one row of the de-mixing matrix. The separation is based on the non-Gaussianity of the source of interest, while the other background signals are assumed to be Gaussian. Three gradient-based estimation algorithms are derived using the maximum likelihood principle and are compared with the Natural Gradient algorithm for Independent Component Analysis and with One-unit FastICA based on negentropy maxi","authors_text":"Petr Tichavsk\\'y, Zbyn\\v{e}k Koldovsk\\'y","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-03-27T14:32:49Z","title":"Gradient Algorithms for Complex Non-Gaussian Independent Component/Vector Extraction, Question of Convergence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10108","kind":"arxiv","version":2},"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:1992dc3d7a370100c137b97797db8b0409f53870c5451e9b17e1980b92170e10","target":"record","created_at":"2026-05-17T23:55:21Z","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":"7f3b88ba58bef5064f4759f5fea5e77b6655b547423cbea279c7b49d8cdb00d3","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-03-27T14:32:49Z","title_canon_sha256":"137e44cdfacb2079f4b09cf4b517f9ebdfe134253cc05a5590c10190f95904b4"},"schema_version":"1.0","source":{"id":"1803.10108","kind":"arxiv","version":2}},"canonical_sha256":"63d437494ca610834b684ee7da068da3ea3aaa746310622d99ba845c6f571145","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63d437494ca610834b684ee7da068da3ea3aaa746310622d99ba845c6f571145","first_computed_at":"2026-05-17T23:55:21.085717Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:21.085717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0acFNAJOMFACwq9Xe9sq3PLx8H2AiEv1acnhtssSczeS6u/u0ckJvwPMuzdAclhL+lLMj1ZA1uVtSIhZ09qAAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:21.086211Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.10108","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1992dc3d7a370100c137b97797db8b0409f53870c5451e9b17e1980b92170e10","sha256:a926680e924aa2641b5cec1f8c6fce53e716bfd85328b15ffacea5213fb28363"],"state_sha256":"1c454ba5fdf9841a6286c4e73d830efe849d61dfcd19eed1b60cf7ef7dae2b9b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AOvkMezsCcrymODkl1lGC4TLNPg6Un2Fl0X0hS7jbXDWamx5uPiT3gbAm/C3M/mcp7PnDbg2gAxMPK4WoJozCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T03:35:38.695136Z","bundle_sha256":"8a74b13073ad4e5e4a9f5006da3710d68b134d778e418bff69b37b6a03148e5c"}}