{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DRUWTCILUGAPRN7NAN3GNW4WHJ","short_pith_number":"pith:DRUWTCIL","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"},"canonical_sha256":"1c6969890ba180f8b7ed037666db963a735b3e02f5b92bd7d28c9cd48662c830","source":{"kind":"arxiv","id":"1809.08359","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.08359","created_at":"2026-05-17T23:56:47Z"},{"alias_kind":"arxiv_version","alias_value":"1809.08359v1","created_at":"2026-05-17T23:56:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08359","created_at":"2026-05-17T23:56:47Z"},{"alias_kind":"pith_short_12","alias_value":"DRUWTCILUGAP","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DRUWTCILUGAPRN7N","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DRUWTCIL","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DRUWTCILUGAPRN7NAN3GNW4WHJ","target":"record","payload":{"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"},"canonical_sha256":"1c6969890ba180f8b7ed037666db963a735b3e02f5b92bd7d28c9cd48662c830","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"},"source_kind":"arxiv","source_id":"1809.08359","source_version":1,"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:56:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KMyTaxWR4HnZc/qAy4sD7c1sIoXBab3N1WN98xrA3YKOdEabZRdPYjihxheBXdELPUUVchYAzEJJhhEpJZJiDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:46:14.185456Z"},"content_sha256":"717b675d27663e64ba3e36e9642750aa04173c97ea9e33045dafd4264f38e620","schema_version":"1.0","event_id":"sha256:717b675d27663e64ba3e36e9642750aa04173c97ea9e33045dafd4264f38e620"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DRUWTCILUGAPRN7NAN3GNW4WHJ","target":"graph","payload":{"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"},"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:56:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yt+i8RM1Ykyd6Q6bM/qbAN6TLJFUFIXQb0JOfYiB3r1QGEXYud20blZ71xOgfvopB2rSoTgvW8FuTYe8COSLBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:46:14.185851Z"},"content_sha256":"fa0b6c8688788f952808b9cd980d85b9efa4592af46e09a38265147bcb7b082f","schema_version":"1.0","event_id":"sha256:fa0b6c8688788f952808b9cd980d85b9efa4592af46e09a38265147bcb7b082f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DRUWTCILUGAPRN7NAN3GNW4WHJ/bundle.json","state_url":"https://pith.science/pith/DRUWTCILUGAPRN7NAN3GNW4WHJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DRUWTCILUGAPRN7NAN3GNW4WHJ/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-06-01T20:46:14Z","links":{"resolver":"https://pith.science/pith/DRUWTCILUGAPRN7NAN3GNW4WHJ","bundle":"https://pith.science/pith/DRUWTCILUGAPRN7NAN3GNW4WHJ/bundle.json","state":"https://pith.science/pith/DRUWTCILUGAPRN7NAN3GNW4WHJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DRUWTCILUGAPRN7NAN3GNW4WHJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DRUWTCILUGAPRN7NAN3GNW4WHJ","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":"f93ff91e31c59db57ce36b373afad0f9bec65574beda624ebdf016635dd4e306","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-22T01:03:00Z","title_canon_sha256":"4c95f7d380b13e11e1398ea72d640789e1885f8fc9f6cd7312d145359e747eb9"},"schema_version":"1.0","source":{"id":"1809.08359","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.08359","created_at":"2026-05-17T23:56:47Z"},{"alias_kind":"arxiv_version","alias_value":"1809.08359v1","created_at":"2026-05-17T23:56:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08359","created_at":"2026-05-17T23:56:47Z"},{"alias_kind":"pith_short_12","alias_value":"DRUWTCILUGAP","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DRUWTCILUGAPRN7N","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DRUWTCIL","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:fa0b6c8688788f952808b9cd980d85b9efa4592af46e09a38265147bcb7b082f","target":"graph","created_at":"2026-05-17T23:56:47Z","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 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","authors_text":"Ali Ahmed, Alireza Aghasi, Babhru Joshi, Paul Hand","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-22T01:03:00Z","title":"A convex program for bilinear inversion of sparse vectors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08359","kind":"arxiv","version":1},"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:717b675d27663e64ba3e36e9642750aa04173c97ea9e33045dafd4264f38e620","target":"record","created_at":"2026-05-17T23:56:47Z","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":"f93ff91e31c59db57ce36b373afad0f9bec65574beda624ebdf016635dd4e306","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-22T01:03:00Z","title_canon_sha256":"4c95f7d380b13e11e1398ea72d640789e1885f8fc9f6cd7312d145359e747eb9"},"schema_version":"1.0","source":{"id":"1809.08359","kind":"arxiv","version":1}},"canonical_sha256":"1c6969890ba180f8b7ed037666db963a735b3e02f5b92bd7d28c9cd48662c830","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c6969890ba180f8b7ed037666db963a735b3e02f5b92bd7d28c9cd48662c830","first_computed_at":"2026-05-17T23:56:47.112423Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:47.112423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H0YnlRHK0HHtkp6Hgh8DNACzJQ3P2C8OeyFlP8exNFR0AuWH8SLohs2I2rE7EyH7sZzExUq1fQAQiAtBH33UBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:47.112947Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.08359","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:717b675d27663e64ba3e36e9642750aa04173c97ea9e33045dafd4264f38e620","sha256:fa0b6c8688788f952808b9cd980d85b9efa4592af46e09a38265147bcb7b082f"],"state_sha256":"8eb88f0f0ad18d49d7b92e0300a4c05be09a14049005c8b2a8dc452a6570bbee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mJMrbDOEUW4VngLNUmm3JOwljRbjoFCVVdqiRTu7RdvD1xcwCwBxTw6ux4faf73AwBExfiblIwKqoGlmFQ94Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T20:46:14.187844Z","bundle_sha256":"391ae511d3787b8515cf121970f60ebbbcd701de837aac9752932e862ec70012"}}