{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AVYHSJVLY67M4IMLM4ELMGRQYV","short_pith_number":"pith:AVYHSJVL","schema_version":"1.0","canonical_sha256":"05707926abc7bece218b6708b61a30c5640cfa2ddc194117f02312ea3e6b566f","source":{"kind":"arxiv","id":"1804.00609","version":2},"attestation_state":"computed","paper":{"title":"Adaptive Algorithm for Sparse Signal Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP"],"primary_cat":"stat.ME","authors_text":"Fekadu L. Bayisa, Jun Yu, Ottmar Cronie, Zhiyong Zhou","submitted_at":"2018-04-02T16:10:33Z","abstract_excerpt":"Spike and slab priors play a key role in inducing sparsity for sparse signal recovery. The use of such priors results in hard non-convex and mixed integer programming problems. Most of the existing algorithms to solve the optimization problems involve either simplifying assumptions, relaxations or high computational expenses. We propose a new adaptive alternating direction method of multipliers (AADMM) algorithm to directly solve the presented optimization problem. The algorithm is based on the one-to-one mapping property of the support and non-zero element of the signal. At each step of the a"},"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":"1804.00609","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-04-02T16:10:33Z","cross_cats_sorted":["eess.SP"],"title_canon_sha256":"af17625803a9b15a5f4e1c17c3befe77f2fa68b7fda19ad103baa20bd3cc9fbd","abstract_canon_sha256":"a382ecc17a407eca4d7db8e00d1b82dddd6467598098bd63305cbead9e6b6cb3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:52.960595Z","signature_b64":"Y2RjKldwO3zcqfy+gXR7P/ugbGe2PIpItkSxxvHD00r/PKCLbT1f/UOKqDluDH8BZIYzRS8mOhbOQT6HR4ZHDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05707926abc7bece218b6708b61a30c5640cfa2ddc194117f02312ea3e6b566f","last_reissued_at":"2026-05-17T23:49:52.960252Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:52.960252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Algorithm for Sparse Signal Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP"],"primary_cat":"stat.ME","authors_text":"Fekadu L. Bayisa, Jun Yu, Ottmar Cronie, Zhiyong Zhou","submitted_at":"2018-04-02T16:10:33Z","abstract_excerpt":"Spike and slab priors play a key role in inducing sparsity for sparse signal recovery. The use of such priors results in hard non-convex and mixed integer programming problems. Most of the existing algorithms to solve the optimization problems involve either simplifying assumptions, relaxations or high computational expenses. We propose a new adaptive alternating direction method of multipliers (AADMM) algorithm to directly solve the presented optimization problem. The algorithm is based on the one-to-one mapping property of the support and non-zero element of the signal. At each step of the a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00609","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1804.00609","created_at":"2026-05-17T23:49:52.960305+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.00609v2","created_at":"2026-05-17T23:49:52.960305+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00609","created_at":"2026-05-17T23:49:52.960305+00:00"},{"alias_kind":"pith_short_12","alias_value":"AVYHSJVLY67M","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AVYHSJVLY67M4IML","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AVYHSJVL","created_at":"2026-05-18T12:32:13.499390+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/AVYHSJVLY67M4IMLM4ELMGRQYV","json":"https://pith.science/pith/AVYHSJVLY67M4IMLM4ELMGRQYV.json","graph_json":"https://pith.science/api/pith-number/AVYHSJVLY67M4IMLM4ELMGRQYV/graph.json","events_json":"https://pith.science/api/pith-number/AVYHSJVLY67M4IMLM4ELMGRQYV/events.json","paper":"https://pith.science/paper/AVYHSJVL"},"agent_actions":{"view_html":"https://pith.science/pith/AVYHSJVLY67M4IMLM4ELMGRQYV","download_json":"https://pith.science/pith/AVYHSJVLY67M4IMLM4ELMGRQYV.json","view_paper":"https://pith.science/paper/AVYHSJVL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.00609&json=true","fetch_graph":"https://pith.science/api/pith-number/AVYHSJVLY67M4IMLM4ELMGRQYV/graph.json","fetch_events":"https://pith.science/api/pith-number/AVYHSJVLY67M4IMLM4ELMGRQYV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AVYHSJVLY67M4IMLM4ELMGRQYV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AVYHSJVLY67M4IMLM4ELMGRQYV/action/storage_attestation","attest_author":"https://pith.science/pith/AVYHSJVLY67M4IMLM4ELMGRQYV/action/author_attestation","sign_citation":"https://pith.science/pith/AVYHSJVLY67M4IMLM4ELMGRQYV/action/citation_signature","submit_replication":"https://pith.science/pith/AVYHSJVLY67M4IMLM4ELMGRQYV/action/replication_record"}},"created_at":"2026-05-17T23:49:52.960305+00:00","updated_at":"2026-05-17T23:49:52.960305+00:00"}