{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ARDDSWA3KLFEEADTYAGH7TSA4H","short_pith_number":"pith:ARDDSWA3","canonical_record":{"source":{"id":"1610.08495","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-09-12T17:48:38Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"f1107d42077383a9f0ebf1dcfeff138148ea2965e575cfb84c6265a4ddbc8392","abstract_canon_sha256":"4876d45216346832bd5b7dd2559e0ebc71560365262d3c12cf26a6263ba90fe1"},"schema_version":"1.0"},"canonical_sha256":"044639581b52ca420073c00c7fce40e1f9b8b28970b40d59c3bb1ad74dc93cd8","source":{"kind":"arxiv","id":"1610.08495","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.08495","created_at":"2026-05-18T01:01:09Z"},{"alias_kind":"arxiv_version","alias_value":"1610.08495v1","created_at":"2026-05-18T01:01:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08495","created_at":"2026-05-18T01:01:09Z"},{"alias_kind":"pith_short_12","alias_value":"ARDDSWA3KLFE","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"ARDDSWA3KLFEEADT","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"ARDDSWA3","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ARDDSWA3KLFEEADTYAGH7TSA4H","target":"record","payload":{"canonical_record":{"source":{"id":"1610.08495","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-09-12T17:48:38Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"f1107d42077383a9f0ebf1dcfeff138148ea2965e575cfb84c6265a4ddbc8392","abstract_canon_sha256":"4876d45216346832bd5b7dd2559e0ebc71560365262d3c12cf26a6263ba90fe1"},"schema_version":"1.0"},"canonical_sha256":"044639581b52ca420073c00c7fce40e1f9b8b28970b40d59c3bb1ad74dc93cd8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:09.258220Z","signature_b64":"yKk4GDUanirpngEkZUOP+s9dL1P9dxkzPHTtXExs5Ro+uzwzVCtIhLRK3Y79dt/udKqF3+IY4m9IYh34B/XVBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"044639581b52ca420073c00c7fce40e1f9b8b28970b40d59c3bb1ad74dc93cd8","last_reissued_at":"2026-05-18T01:01:09.257509Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:09.257509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.08495","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-18T01:01:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s6bTjA5D/JCeEl45+ho/lQPgr7TsOMqimwtXeq8UUjsJVzK2u6Fq28zeosv5uCJVcSszQ+97CwDjy2CbVfZGAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T22:48:46.289287Z"},"content_sha256":"3f70c2a496cb21935047a84656b7903f4dc1a8efa79d73e1d9836b24a19c150c","schema_version":"1.0","event_id":"sha256:3f70c2a496cb21935047a84656b7903f4dc1a8efa79d73e1d9836b24a19c150c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ARDDSWA3KLFEEADTYAGH7TSA4H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive matching pursuit for sparse signal recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hojjat S. Mousavi, Tiep H. Vu, Vishal Monga","submitted_at":"2016-09-12T17:48:38Z","abstract_excerpt":"Spike and Slab priors have been of much recent interest in signal processing as a means of inducing sparsity in Bayesian inference. Applications domains that benefit from the use of these priors include sparse recovery, regression and classification. It is well-known that solving for the sparse coefficient vector to maximize these priors results in a hard non-convex and mixed integer programming problem. Most existing solutions to this optimization problem either involve simplifying assumptions/relaxations or are computationally expensive. We propose a new greedy and adaptive matching pursuit "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08495","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-18T01:01:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TU+DM6pva5mZbCDYnuMRnhMU1Fehpb5/Md2CRYzGzM7nVpz9/+ytkSCKXsj0kkw0acmi9/qzB+x1QhyGMSVuBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T22:48:46.289989Z"},"content_sha256":"72df0420b1613cb8c92958e918b753e8d4300f662d53de87862d3e6ef2fdffad","schema_version":"1.0","event_id":"sha256:72df0420b1613cb8c92958e918b753e8d4300f662d53de87862d3e6ef2fdffad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ARDDSWA3KLFEEADTYAGH7TSA4H/bundle.json","state_url":"https://pith.science/pith/ARDDSWA3KLFEEADTYAGH7TSA4H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ARDDSWA3KLFEEADTYAGH7TSA4H/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-09T22:48:46Z","links":{"resolver":"https://pith.science/pith/ARDDSWA3KLFEEADTYAGH7TSA4H","bundle":"https://pith.science/pith/ARDDSWA3KLFEEADTYAGH7TSA4H/bundle.json","state":"https://pith.science/pith/ARDDSWA3KLFEEADTYAGH7TSA4H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ARDDSWA3KLFEEADTYAGH7TSA4H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ARDDSWA3KLFEEADTYAGH7TSA4H","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":"4876d45216346832bd5b7dd2559e0ebc71560365262d3c12cf26a6263ba90fe1","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-09-12T17:48:38Z","title_canon_sha256":"f1107d42077383a9f0ebf1dcfeff138148ea2965e575cfb84c6265a4ddbc8392"},"schema_version":"1.0","source":{"id":"1610.08495","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.08495","created_at":"2026-05-18T01:01:09Z"},{"alias_kind":"arxiv_version","alias_value":"1610.08495v1","created_at":"2026-05-18T01:01:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08495","created_at":"2026-05-18T01:01:09Z"},{"alias_kind":"pith_short_12","alias_value":"ARDDSWA3KLFE","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"ARDDSWA3KLFEEADT","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"ARDDSWA3","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:72df0420b1613cb8c92958e918b753e8d4300f662d53de87862d3e6ef2fdffad","target":"graph","created_at":"2026-05-18T01:01:09Z","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":"Spike and Slab priors have been of much recent interest in signal processing as a means of inducing sparsity in Bayesian inference. Applications domains that benefit from the use of these priors include sparse recovery, regression and classification. It is well-known that solving for the sparse coefficient vector to maximize these priors results in a hard non-convex and mixed integer programming problem. Most existing solutions to this optimization problem either involve simplifying assumptions/relaxations or are computationally expensive. We propose a new greedy and adaptive matching pursuit ","authors_text":"Hojjat S. Mousavi, Tiep H. Vu, Vishal Monga","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-09-12T17:48:38Z","title":"Adaptive matching pursuit for sparse signal recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08495","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:3f70c2a496cb21935047a84656b7903f4dc1a8efa79d73e1d9836b24a19c150c","target":"record","created_at":"2026-05-18T01:01:09Z","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":"4876d45216346832bd5b7dd2559e0ebc71560365262d3c12cf26a6263ba90fe1","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-09-12T17:48:38Z","title_canon_sha256":"f1107d42077383a9f0ebf1dcfeff138148ea2965e575cfb84c6265a4ddbc8392"},"schema_version":"1.0","source":{"id":"1610.08495","kind":"arxiv","version":1}},"canonical_sha256":"044639581b52ca420073c00c7fce40e1f9b8b28970b40d59c3bb1ad74dc93cd8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"044639581b52ca420073c00c7fce40e1f9b8b28970b40d59c3bb1ad74dc93cd8","first_computed_at":"2026-05-18T01:01:09.257509Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:09.257509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yKk4GDUanirpngEkZUOP+s9dL1P9dxkzPHTtXExs5Ro+uzwzVCtIhLRK3Y79dt/udKqF3+IY4m9IYh34B/XVBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:09.258220Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.08495","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f70c2a496cb21935047a84656b7903f4dc1a8efa79d73e1d9836b24a19c150c","sha256:72df0420b1613cb8c92958e918b753e8d4300f662d53de87862d3e6ef2fdffad"],"state_sha256":"3e4563f9358ee84842146f4ae5c963f7a4e7e0c9b37d6f2b9c31eb8e09db478a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FD9PTYu0Go5u7bh1PUJtNpUzY6mHYgRoc5wGEBetyWXk9PaadM2e8cXih/yJSZ01OsJ3dzf5fD9m1C/GKc+yCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T22:48:46.294229Z","bundle_sha256":"76531d31f2a91823001ecaa1ec006af64d2d068a00705b1cd393f64620cd5aaf"}}