{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DRUWTCILUGAPRN7NAN3GNW4WHJ","short_pith_number":"pith:DRUWTCIL","schema_version":"1.0","canonical_sha256":"1c6969890ba180f8b7ed037666db963a735b3e02f5b92bd7d28c9cd48662c830","source":{"kind":"arxiv","id":"1809.08359","version":1},"attestation_state":"computed","paper":{"title":"A convex program for bilinear inversion of sparse vectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Ali Ahmed, Alireza Aghasi, Babhru Joshi, Paul Hand","submitted_at":"2018-09-22T01:03:00Z","abstract_excerpt":"We consider the bilinear inverse problem of recovering two vectors, $\\boldsymbol{x}\\in\\mathbb{R}^L$ and $\\boldsymbol{w}\\in\\mathbb{R}^L$, from their entrywise product. We consider the case where $\\boldsymbol{x}$ and $\\boldsymbol{w}$ have known signs and are sparse with respect to known dictionaries of size $K$ and $N$, respectively. Here, $K$ and $N$ may be larger than, smaller than, or equal to $L$. We introduce $\\ell_1$-BranchHull, which is a convex program posed in the natural parameter space and does not require an approximate solution or initialization in order to be stated or solved. We s"},"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":"1809.08359","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-22T01:03:00Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"4c95f7d380b13e11e1398ea72d640789e1885f8fc9f6cd7312d145359e747eb9","abstract_canon_sha256":"f93ff91e31c59db57ce36b373afad0f9bec65574beda624ebdf016635dd4e306"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:47.112947Z","signature_b64":"H0YnlRHK0HHtkp6Hgh8DNACzJQ3P2C8OeyFlP8exNFR0AuWH8SLohs2I2rE7EyH7sZzExUq1fQAQiAtBH33UBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c6969890ba180f8b7ed037666db963a735b3e02f5b92bd7d28c9cd48662c830","last_reissued_at":"2026-05-17T23:56:47.112423Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:47.112423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A convex program for bilinear inversion of sparse vectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Ali Ahmed, Alireza Aghasi, Babhru Joshi, Paul Hand","submitted_at":"2018-09-22T01:03:00Z","abstract_excerpt":"We consider the bilinear inverse problem of recovering two vectors, $\\boldsymbol{x}\\in\\mathbb{R}^L$ and $\\boldsymbol{w}\\in\\mathbb{R}^L$, from their entrywise product. We consider the case where $\\boldsymbol{x}$ and $\\boldsymbol{w}$ have known signs and are sparse with respect to known dictionaries of size $K$ and $N$, respectively. Here, $K$ and $N$ may be larger than, smaller than, or equal to $L$. We introduce $\\ell_1$-BranchHull, which is a convex program posed in the natural parameter space and does not require an approximate solution or initialization in order to be stated or solved. We s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08359","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":"1809.08359","created_at":"2026-05-17T23:56:47.112518+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.08359v1","created_at":"2026-05-17T23:56:47.112518+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08359","created_at":"2026-05-17T23:56:47.112518+00:00"},{"alias_kind":"pith_short_12","alias_value":"DRUWTCILUGAP","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DRUWTCILUGAPRN7N","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DRUWTCIL","created_at":"2026-05-18T12:32:19.392346+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/DRUWTCILUGAPRN7NAN3GNW4WHJ","json":"https://pith.science/pith/DRUWTCILUGAPRN7NAN3GNW4WHJ.json","graph_json":"https://pith.science/api/pith-number/DRUWTCILUGAPRN7NAN3GNW4WHJ/graph.json","events_json":"https://pith.science/api/pith-number/DRUWTCILUGAPRN7NAN3GNW4WHJ/events.json","paper":"https://pith.science/paper/DRUWTCIL"},"agent_actions":{"view_html":"https://pith.science/pith/DRUWTCILUGAPRN7NAN3GNW4WHJ","download_json":"https://pith.science/pith/DRUWTCILUGAPRN7NAN3GNW4WHJ.json","view_paper":"https://pith.science/paper/DRUWTCIL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.08359&json=true","fetch_graph":"https://pith.science/api/pith-number/DRUWTCILUGAPRN7NAN3GNW4WHJ/graph.json","fetch_events":"https://pith.science/api/pith-number/DRUWTCILUGAPRN7NAN3GNW4WHJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DRUWTCILUGAPRN7NAN3GNW4WHJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DRUWTCILUGAPRN7NAN3GNW4WHJ/action/storage_attestation","attest_author":"https://pith.science/pith/DRUWTCILUGAPRN7NAN3GNW4WHJ/action/author_attestation","sign_citation":"https://pith.science/pith/DRUWTCILUGAPRN7NAN3GNW4WHJ/action/citation_signature","submit_replication":"https://pith.science/pith/DRUWTCILUGAPRN7NAN3GNW4WHJ/action/replication_record"}},"created_at":"2026-05-17T23:56:47.112518+00:00","updated_at":"2026-05-17T23:56:47.112518+00:00"}