{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NEZCK6JJVHZADOYUIZ5VC4LNM6","short_pith_number":"pith:NEZCK6JJ","schema_version":"1.0","canonical_sha256":"6932257929a9f201bb14467b51716d67ab4d82e396cf50124630633dadc67d3f","source":{"kind":"arxiv","id":"1501.06120","version":1},"attestation_state":"computed","paper":{"title":"A Unified Framework for Identifiability Analysis in Bilinear Inverse Problems with Applications to Subspace and Sparsity Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kiryung Lee, Yanjun Li, Yoram Bresler","submitted_at":"2015-01-25T06:28:47Z","abstract_excerpt":"Bilinear inverse problems (BIPs), the resolution of two vectors given their image under a bilinear mapping, arise in many applications. Without further constraints, BIPs are usually ill-posed. In practice, properties of natural signals are exploited to solve BIPs. For example, subspace constraints or sparsity constraints are imposed to reduce the search space. These approaches have shown some success in practice. However, there are few results on uniqueness in BIPs. For most BIPs, the fundamental question of under what condition the problem admits a unique solution, is yet to be answered. For "},"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":"1501.06120","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-25T06:28:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"614c3140b603b56024394a353579ab2cca25cd30fae3a14fae27184b904d2222","abstract_canon_sha256":"92629bec64f0361cefaffbb198602c1e5cf16cb6f374db9e5c6b5b4849f082d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:42.298448Z","signature_b64":"nhgrs0Oo0l3PvR7FClQ9Jajq7JLcxG2aMOTP4jtLbNUzpAxTdNot+/H0G0GrBrTEb40lYTtRpO9TWsh0qIHHAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6932257929a9f201bb14467b51716d67ab4d82e396cf50124630633dadc67d3f","last_reissued_at":"2026-05-18T02:28:42.297878Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:42.297878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Unified Framework for Identifiability Analysis in Bilinear Inverse Problems with Applications to Subspace and Sparsity Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kiryung Lee, Yanjun Li, Yoram Bresler","submitted_at":"2015-01-25T06:28:47Z","abstract_excerpt":"Bilinear inverse problems (BIPs), the resolution of two vectors given their image under a bilinear mapping, arise in many applications. Without further constraints, BIPs are usually ill-posed. In practice, properties of natural signals are exploited to solve BIPs. For example, subspace constraints or sparsity constraints are imposed to reduce the search space. These approaches have shown some success in practice. However, there are few results on uniqueness in BIPs. For most BIPs, the fundamental question of under what condition the problem admits a unique solution, is yet to be answered. For "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06120","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":"1501.06120","created_at":"2026-05-18T02:28:42.297970+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.06120v1","created_at":"2026-05-18T02:28:42.297970+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06120","created_at":"2026-05-18T02:28:42.297970+00:00"},{"alias_kind":"pith_short_12","alias_value":"NEZCK6JJVHZA","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"NEZCK6JJVHZADOYU","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"NEZCK6JJ","created_at":"2026-05-18T12:29:32.376354+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.16377","citing_title":"Subtleties in the pseudomodes formalism","ref_index":90,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NEZCK6JJVHZADOYUIZ5VC4LNM6","json":"https://pith.science/pith/NEZCK6JJVHZADOYUIZ5VC4LNM6.json","graph_json":"https://pith.science/api/pith-number/NEZCK6JJVHZADOYUIZ5VC4LNM6/graph.json","events_json":"https://pith.science/api/pith-number/NEZCK6JJVHZADOYUIZ5VC4LNM6/events.json","paper":"https://pith.science/paper/NEZCK6JJ"},"agent_actions":{"view_html":"https://pith.science/pith/NEZCK6JJVHZADOYUIZ5VC4LNM6","download_json":"https://pith.science/pith/NEZCK6JJVHZADOYUIZ5VC4LNM6.json","view_paper":"https://pith.science/paper/NEZCK6JJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.06120&json=true","fetch_graph":"https://pith.science/api/pith-number/NEZCK6JJVHZADOYUIZ5VC4LNM6/graph.json","fetch_events":"https://pith.science/api/pith-number/NEZCK6JJVHZADOYUIZ5VC4LNM6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NEZCK6JJVHZADOYUIZ5VC4LNM6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NEZCK6JJVHZADOYUIZ5VC4LNM6/action/storage_attestation","attest_author":"https://pith.science/pith/NEZCK6JJVHZADOYUIZ5VC4LNM6/action/author_attestation","sign_citation":"https://pith.science/pith/NEZCK6JJVHZADOYUIZ5VC4LNM6/action/citation_signature","submit_replication":"https://pith.science/pith/NEZCK6JJVHZADOYUIZ5VC4LNM6/action/replication_record"}},"created_at":"2026-05-18T02:28:42.297970+00:00","updated_at":"2026-05-18T02:28:42.297970+00:00"}