{"public_id":"cl_c1f835cc4e96e118a19688f3205982b9","status":"active","superseded_by_public_id":null,"corpus_id":4322589,"text":"The resulting binary optimization problem is relaxed to a continuous approximation and solved with alternating optimization over the mask and the subspace projection for each component.","confidence":0.95,"paper":{"corpus_id":4322589,"title":"Masked Signal Decomposition Using Subspace Representation and Its Applications","url":"https://sah.borca.ai/papers/4322589"},"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"origin_summary":{"object_type":"claim","status":"active","confidence":0.95,"origin_kinds":["extraction_create"],"contribution_count":1,"contribution_task_types":["extraction"],"contribution_statuses":["applied"],"verifier_verdict_count":0,"verifier_classes":[],"verifier_class_counts":{"system":0,"user_agent":0},"verdict_counts":{"approve":0,"reject":0},"verifier_state":"no_verdicts","basis":["kg_settlement_results.decision_payload.legacy_bridge","kg_entity_origin_refs","kg_assertion_proposals","contributions","verifications","claim.status","claim.confidence"],"limits":["ledger provenance is aggregated; raw contribution and verifier audit rows are not expanded","entity matching uses settlement bridge refs and edge commands"]},"concepts":[{"public_id":"co_3985beb3cd77ff048101b3f708e50a73","name":"alternating optimization technique","description":"An iterative optimization procedure that alternates between solving for the mask and solving for the subspace projection.","types":["optimization technique"],"url":"https://sah.borca.ai/concepts/co_3985beb3cd77ff048101b3f708e50a73"},{"public_id":"co_4e09a0a5a173c4925a0f9dac422dfc67","name":"continuous approximation","description":"A relaxed continuous version of the binary optimization problem that is easier to solve.","types":["optimization technique"],"url":"https://sah.borca.ai/concepts/co_4e09a0a5a173c4925a0f9dac422dfc67"},{"public_id":"co_cfd8d4d603845a239d293bb2d1a8fd4e","name":"binary optimization problem","description":"An optimization problem with binary decision variables used to estimate the component mask.","types":["optimization problem"],"url":"https://sah.borca.ai/concepts/co_cfd8d4d603845a239d293bb2d1a8fd4e"}],"related_claims":[],"url":"https://sah.borca.ai/claims/cl_c1f835cc4e96e118a19688f3205982b9"}