{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZB43QRIGBFSXIPVKSHNFZGFKJ3","short_pith_number":"pith:ZB43QRIG","schema_version":"1.0","canonical_sha256":"c879b845060965743eaa91da5c98aa4ec891adf50d0a881893b0f1c1b74cac85","source":{"kind":"arxiv","id":"1506.00540","version":1},"attestation_state":"computed","paper":{"title":"Joint Sparsity Pattern Recovery with 1-bit Compressive Sensing in Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bhavya Kailkhura, Pramod K. Varshney, Thakshila Wimalajeewa, Vipul Gupta","submitted_at":"2015-06-01T15:34:27Z","abstract_excerpt":"We study the problem of jointly sparse support recovery with 1-bit compressive measurements in a sensor network. Sensors are assumed to observe sparse signals having the same but unknown sparse support. Each sensor quantizes its measurement vector element-wise to 1-bit and transmits the quantized observations to a fusion center. We develop a computationally tractable support recovery algorithm which minimizes a cost function defined in terms of the likelihood function and the $l_{1,\\infty}$ norm. We observe that even with noisy 1-bit measurements, jointly sparse support can be recovered accura"},"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":"1506.00540","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-01T15:34:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8e4da33a364c5d01e3454b7e5c6932a3870df2af56e14d42da4c1c1dc7a23c0c","abstract_canon_sha256":"569675a1f4c36e74f51a99fc21e51dd66da9868e61887e9858eae0cbfbf578d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:54.306203Z","signature_b64":"KaLv2o6NQI7gSDsexDgDA8izPcq5f0jNLkZQ11LdfFyoqiTe4phYO3zxJ+U8GV1a4HbBbtG92RjMEfXeyK5eBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c879b845060965743eaa91da5c98aa4ec891adf50d0a881893b0f1c1b74cac85","last_reissued_at":"2026-05-18T01:59:54.305657Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:54.305657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Joint Sparsity Pattern Recovery with 1-bit Compressive Sensing in Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bhavya Kailkhura, Pramod K. Varshney, Thakshila Wimalajeewa, Vipul Gupta","submitted_at":"2015-06-01T15:34:27Z","abstract_excerpt":"We study the problem of jointly sparse support recovery with 1-bit compressive measurements in a sensor network. Sensors are assumed to observe sparse signals having the same but unknown sparse support. Each sensor quantizes its measurement vector element-wise to 1-bit and transmits the quantized observations to a fusion center. We develop a computationally tractable support recovery algorithm which minimizes a cost function defined in terms of the likelihood function and the $l_{1,\\infty}$ norm. We observe that even with noisy 1-bit measurements, jointly sparse support can be recovered accura"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00540","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":"1506.00540","created_at":"2026-05-18T01:59:54.305745+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.00540v1","created_at":"2026-05-18T01:59:54.305745+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00540","created_at":"2026-05-18T01:59:54.305745+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZB43QRIGBFSX","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZB43QRIGBFSXIPVK","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZB43QRIG","created_at":"2026-05-18T12:29:52.810259+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/ZB43QRIGBFSXIPVKSHNFZGFKJ3","json":"https://pith.science/pith/ZB43QRIGBFSXIPVKSHNFZGFKJ3.json","graph_json":"https://pith.science/api/pith-number/ZB43QRIGBFSXIPVKSHNFZGFKJ3/graph.json","events_json":"https://pith.science/api/pith-number/ZB43QRIGBFSXIPVKSHNFZGFKJ3/events.json","paper":"https://pith.science/paper/ZB43QRIG"},"agent_actions":{"view_html":"https://pith.science/pith/ZB43QRIGBFSXIPVKSHNFZGFKJ3","download_json":"https://pith.science/pith/ZB43QRIGBFSXIPVKSHNFZGFKJ3.json","view_paper":"https://pith.science/paper/ZB43QRIG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.00540&json=true","fetch_graph":"https://pith.science/api/pith-number/ZB43QRIGBFSXIPVKSHNFZGFKJ3/graph.json","fetch_events":"https://pith.science/api/pith-number/ZB43QRIGBFSXIPVKSHNFZGFKJ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZB43QRIGBFSXIPVKSHNFZGFKJ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZB43QRIGBFSXIPVKSHNFZGFKJ3/action/storage_attestation","attest_author":"https://pith.science/pith/ZB43QRIGBFSXIPVKSHNFZGFKJ3/action/author_attestation","sign_citation":"https://pith.science/pith/ZB43QRIGBFSXIPVKSHNFZGFKJ3/action/citation_signature","submit_replication":"https://pith.science/pith/ZB43QRIGBFSXIPVKSHNFZGFKJ3/action/replication_record"}},"created_at":"2026-05-18T01:59:54.305745+00:00","updated_at":"2026-05-18T01:59:54.305745+00:00"}