{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:54XAR4CGB33ST2ZPA5SBR6BAMY","short_pith_number":"pith:54XAR4CG","schema_version":"1.0","canonical_sha256":"ef2e08f0460ef729eb2f076418f8206625a17ea38b579fc4e31ded4a8b9ee4a2","source":{"kind":"arxiv","id":"1612.09466","version":4},"attestation_state":"computed","paper":{"title":"Double Coupled Canonical Polyadic Decomposition for Joint Blind Source Separation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Feng-Yu Cong, Lieven De Lathauwer, Qiu-Hua Lin, Xiao-Feng Gong","submitted_at":"2016-12-30T11:57:31Z","abstract_excerpt":"Joint blind source separation (J-BSS) is an emerging data-driven technique for multi-set data-fusion. In this paper, J-BSS is addressed from a tensorial perspective. We show how, by using second-order multi-set statistics in J-BSS, a specific double coupled canonical polyadic decomposition (DC-CPD) problem can be formulated. We propose an algebraic DC-CPD algorithm based on a coupled rank-1 detection mapping. This algorithm converts a possibly underdetermined DC-CPD to a set of overdetermined CPDs. The latter can be solved algebraically via a generalized eigenvalue decomposition based scheme. "},"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":"1612.09466","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-12-30T11:57:31Z","cross_cats_sorted":[],"title_canon_sha256":"fdd7380758560c9942b2f1e81022260b949332b2de4baaf55e96a50f48704665","abstract_canon_sha256":"930dee0b5759c1a5753bc779097712e18770e8aa065a414d2d1a94c74f0c90c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:19.651885Z","signature_b64":"VY3OujK4PyYxPRPQ7usmreyXgtpi2jXIPho+Hk4LAqcBMqAl6PMHQPUFK/mLIqF2YtG0hD7Dd9rPYr3s3xh7CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef2e08f0460ef729eb2f076418f8206625a17ea38b579fc4e31ded4a8b9ee4a2","last_reissued_at":"2026-05-18T00:17:19.651232Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:19.651232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Double Coupled Canonical Polyadic Decomposition for Joint Blind Source Separation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Feng-Yu Cong, Lieven De Lathauwer, Qiu-Hua Lin, Xiao-Feng Gong","submitted_at":"2016-12-30T11:57:31Z","abstract_excerpt":"Joint blind source separation (J-BSS) is an emerging data-driven technique for multi-set data-fusion. In this paper, J-BSS is addressed from a tensorial perspective. We show how, by using second-order multi-set statistics in J-BSS, a specific double coupled canonical polyadic decomposition (DC-CPD) problem can be formulated. We propose an algebraic DC-CPD algorithm based on a coupled rank-1 detection mapping. This algorithm converts a possibly underdetermined DC-CPD to a set of overdetermined CPDs. The latter can be solved algebraically via a generalized eigenvalue decomposition based scheme. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.09466","kind":"arxiv","version":4},"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":"1612.09466","created_at":"2026-05-18T00:17:19.651326+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.09466v4","created_at":"2026-05-18T00:17:19.651326+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.09466","created_at":"2026-05-18T00:17:19.651326+00:00"},{"alias_kind":"pith_short_12","alias_value":"54XAR4CGB33S","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"54XAR4CGB33ST2ZP","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"54XAR4CG","created_at":"2026-05-18T12:29:58.707656+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/54XAR4CGB33ST2ZPA5SBR6BAMY","json":"https://pith.science/pith/54XAR4CGB33ST2ZPA5SBR6BAMY.json","graph_json":"https://pith.science/api/pith-number/54XAR4CGB33ST2ZPA5SBR6BAMY/graph.json","events_json":"https://pith.science/api/pith-number/54XAR4CGB33ST2ZPA5SBR6BAMY/events.json","paper":"https://pith.science/paper/54XAR4CG"},"agent_actions":{"view_html":"https://pith.science/pith/54XAR4CGB33ST2ZPA5SBR6BAMY","download_json":"https://pith.science/pith/54XAR4CGB33ST2ZPA5SBR6BAMY.json","view_paper":"https://pith.science/paper/54XAR4CG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.09466&json=true","fetch_graph":"https://pith.science/api/pith-number/54XAR4CGB33ST2ZPA5SBR6BAMY/graph.json","fetch_events":"https://pith.science/api/pith-number/54XAR4CGB33ST2ZPA5SBR6BAMY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/54XAR4CGB33ST2ZPA5SBR6BAMY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/54XAR4CGB33ST2ZPA5SBR6BAMY/action/storage_attestation","attest_author":"https://pith.science/pith/54XAR4CGB33ST2ZPA5SBR6BAMY/action/author_attestation","sign_citation":"https://pith.science/pith/54XAR4CGB33ST2ZPA5SBR6BAMY/action/citation_signature","submit_replication":"https://pith.science/pith/54XAR4CGB33ST2ZPA5SBR6BAMY/action/replication_record"}},"created_at":"2026-05-18T00:17:19.651326+00:00","updated_at":"2026-05-18T00:17:19.651326+00:00"}