{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NVHR5GK6INFXQRDZBVTHSX55U7","short_pith_number":"pith:NVHR5GK6","canonical_record":{"source":{"id":"1502.04643","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-02-16T17:30:57Z","cross_cats_sorted":["cs.IT","math.IT","stat.TH"],"title_canon_sha256":"55f669bdbdfe87f9c2b5faf996507a238d987a6927b41d46ca753f3df1702148","abstract_canon_sha256":"cda5a21a7f5b090d8822dd1a8fde087835ed82c5711db8429b3c23f94f8859de"},"schema_version":"1.0"},"canonical_sha256":"6d4f1e995e434b7844790d66795fbda7eb40a24f5471dbabc43848082cb15949","source":{"kind":"arxiv","id":"1502.04643","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04643","created_at":"2026-05-18T01:34:13Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04643v2","created_at":"2026-05-18T01:34:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04643","created_at":"2026-05-18T01:34:13Z"},{"alias_kind":"pith_short_12","alias_value":"NVHR5GK6INFX","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"NVHR5GK6INFXQRDZ","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"NVHR5GK6","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NVHR5GK6INFXQRDZBVTHSX55U7","target":"record","payload":{"canonical_record":{"source":{"id":"1502.04643","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-02-16T17:30:57Z","cross_cats_sorted":["cs.IT","math.IT","stat.TH"],"title_canon_sha256":"55f669bdbdfe87f9c2b5faf996507a238d987a6927b41d46ca753f3df1702148","abstract_canon_sha256":"cda5a21a7f5b090d8822dd1a8fde087835ed82c5711db8429b3c23f94f8859de"},"schema_version":"1.0"},"canonical_sha256":"6d4f1e995e434b7844790d66795fbda7eb40a24f5471dbabc43848082cb15949","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:13.075982Z","signature_b64":"YBKR6vWytYmt3qMzC24V9q5reJyXwo7fOcsJz4X46Yt8ptPyfV4OH/PssbPDursvbqgN3aKN6FCAf/PU3lYXCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d4f1e995e434b7844790d66795fbda7eb40a24f5471dbabc43848082cb15949","last_reissued_at":"2026-05-18T01:34:13.075348Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:13.075348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.04643","source_version":2,"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-18T01:34:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H50GY1A8oeYNGCJbEfc8UzU2i3PpuFpqaInKeGra5xCaDwX2qhKZzR7SAtsNfwtE148bZIwq3yrOJf9USs7lCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:22:11.407371Z"},"content_sha256":"901f284650e9876916ed021ae06e6a1c231db4d96dcdca4851427432d56f87a2","schema_version":"1.0","event_id":"sha256:901f284650e9876916ed021ae06e6a1c231db4d96dcdca4851427432d56f87a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NVHR5GK6INFXQRDZBVTHSX55U7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Using the LASSO's Dual for Regularization in Sparse Signal Reconstruction from Array Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.TH"],"primary_cat":"math.ST","authors_text":"Christoph F. Mecklenbr\\\"auker, Erich Z\\\"ochmann, Peter Gerstoft","submitted_at":"2015-02-16T17:30:57Z","abstract_excerpt":"Waves from a sparse set of source hidden in additive noise are observed by a sensor array. We treat the estimation of the sparse set of sources as a generalized complex-valued LASSO problem. The corresponding dual problem is formulated and it is shown that the dual solution is useful for selecting the regularization parameter of the LASSO when the number of sources is given. The solution path of the complex-valued LASSO is analyzed. For a given number of sources, the corresponding regularization parameter is determined by an order-recursive algorithm and two iterative algorithms that are based"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04643","kind":"arxiv","version":2},"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-18T01:34:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"chbQia4Cqp0P3dUX3TQkhQJuJ3Iyh1/aCKZjr7HdR/2T5gffdCBBmMEqXVSZzPm0xJk9mhlwa3I5gSVk2ShEDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:22:11.408097Z"},"content_sha256":"6ccd04561f9acbd4b94d954979392758bf51af99cd3c2f3e8f6405af64695617","schema_version":"1.0","event_id":"sha256:6ccd04561f9acbd4b94d954979392758bf51af99cd3c2f3e8f6405af64695617"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NVHR5GK6INFXQRDZBVTHSX55U7/bundle.json","state_url":"https://pith.science/pith/NVHR5GK6INFXQRDZBVTHSX55U7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NVHR5GK6INFXQRDZBVTHSX55U7/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-10T23:22:11Z","links":{"resolver":"https://pith.science/pith/NVHR5GK6INFXQRDZBVTHSX55U7","bundle":"https://pith.science/pith/NVHR5GK6INFXQRDZBVTHSX55U7/bundle.json","state":"https://pith.science/pith/NVHR5GK6INFXQRDZBVTHSX55U7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NVHR5GK6INFXQRDZBVTHSX55U7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NVHR5GK6INFXQRDZBVTHSX55U7","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":"cda5a21a7f5b090d8822dd1a8fde087835ed82c5711db8429b3c23f94f8859de","cross_cats_sorted":["cs.IT","math.IT","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-02-16T17:30:57Z","title_canon_sha256":"55f669bdbdfe87f9c2b5faf996507a238d987a6927b41d46ca753f3df1702148"},"schema_version":"1.0","source":{"id":"1502.04643","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04643","created_at":"2026-05-18T01:34:13Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04643v2","created_at":"2026-05-18T01:34:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04643","created_at":"2026-05-18T01:34:13Z"},{"alias_kind":"pith_short_12","alias_value":"NVHR5GK6INFX","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"NVHR5GK6INFXQRDZ","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"NVHR5GK6","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:6ccd04561f9acbd4b94d954979392758bf51af99cd3c2f3e8f6405af64695617","target":"graph","created_at":"2026-05-18T01:34:13Z","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":"Waves from a sparse set of source hidden in additive noise are observed by a sensor array. We treat the estimation of the sparse set of sources as a generalized complex-valued LASSO problem. The corresponding dual problem is formulated and it is shown that the dual solution is useful for selecting the regularization parameter of the LASSO when the number of sources is given. The solution path of the complex-valued LASSO is analyzed. For a given number of sources, the corresponding regularization parameter is determined by an order-recursive algorithm and two iterative algorithms that are based","authors_text":"Christoph F. Mecklenbr\\\"auker, Erich Z\\\"ochmann, Peter Gerstoft","cross_cats":["cs.IT","math.IT","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-02-16T17:30:57Z","title":"Using the LASSO's Dual for Regularization in Sparse Signal Reconstruction from Array Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04643","kind":"arxiv","version":2},"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:901f284650e9876916ed021ae06e6a1c231db4d96dcdca4851427432d56f87a2","target":"record","created_at":"2026-05-18T01:34:13Z","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":"cda5a21a7f5b090d8822dd1a8fde087835ed82c5711db8429b3c23f94f8859de","cross_cats_sorted":["cs.IT","math.IT","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-02-16T17:30:57Z","title_canon_sha256":"55f669bdbdfe87f9c2b5faf996507a238d987a6927b41d46ca753f3df1702148"},"schema_version":"1.0","source":{"id":"1502.04643","kind":"arxiv","version":2}},"canonical_sha256":"6d4f1e995e434b7844790d66795fbda7eb40a24f5471dbabc43848082cb15949","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d4f1e995e434b7844790d66795fbda7eb40a24f5471dbabc43848082cb15949","first_computed_at":"2026-05-18T01:34:13.075348Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:13.075348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YBKR6vWytYmt3qMzC24V9q5reJyXwo7fOcsJz4X46Yt8ptPyfV4OH/PssbPDursvbqgN3aKN6FCAf/PU3lYXCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:13.075982Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.04643","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:901f284650e9876916ed021ae06e6a1c231db4d96dcdca4851427432d56f87a2","sha256:6ccd04561f9acbd4b94d954979392758bf51af99cd3c2f3e8f6405af64695617"],"state_sha256":"5cd845a9f3e8229190d5b2599cf665edb2933ebab7c3377ec263577c72336ec0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P3rrlnOAzEGQ6IDtV4s7u3E6pRUFGsK8DqMkZa0cZSl8CsABLTwts6Eg4VPc6FDs7nos9lifMY7H8t7zHYooAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T23:22:11.412008Z","bundle_sha256":"cade9a286e5d8225e80756a7df06d3447f7fe5c8bba5c892e699a35b1f7d34ae"}}