{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MPMRU2SNBRLPYAFVGN2KPTION5","short_pith_number":"pith:MPMRU2SN","schema_version":"1.0","canonical_sha256":"63d91a6a4d0c56fc00b53374a7cd0e6f699fcc3b4a15561a672c184d65cdbeba","source":{"kind":"arxiv","id":"1601.00350","version":1},"attestation_state":"computed","paper":{"title":"Sparse Diffusion Steepest-Descent for One Bit Compressed Sensing in Wireless Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Farrokh Marvasti, Hadi Zayyani, Mehdi Korki","submitted_at":"2016-01-03T23:03:09Z","abstract_excerpt":"This letter proposes a sparse diffusion steepest-descent algorithm for one bit compressed sensing in wireless sensor networks. The approach exploits the diffusion strategy from distributed learning in the one bit compressed sensing framework. To estimate a common sparse vector cooperatively from only the sign of measurements, steepest-descent is used to minimize the suitable global and local convex cost functions. A diffusion strategy is suggested for distributive learning of the sparse vector. Simulation results show the effectiveness of the proposed distributed algorithm compared to the stat"},"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":"1601.00350","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-01-03T23:03:09Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"37c9c80df4b32482a2de5a8f25d81bdbfe519f000a3cd7f573490fff7bd230e6","abstract_canon_sha256":"b947ba9a016dea831b8eb25ab13a7bef8e232408a7201df12c119623cb8ff586"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:27.700082Z","signature_b64":"hwqto8jU3xxipgiovFV/ZmYULffVhElu9DFlGXAivtjZt+6lhJFD2uyXVaKiVwuwxZv3Ebx/FEWQm+UJFmMoCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63d91a6a4d0c56fc00b53374a7cd0e6f699fcc3b4a15561a672c184d65cdbeba","last_reissued_at":"2026-05-18T01:23:27.699362Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:27.699362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Diffusion Steepest-Descent for One Bit Compressed Sensing in Wireless Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Farrokh Marvasti, Hadi Zayyani, Mehdi Korki","submitted_at":"2016-01-03T23:03:09Z","abstract_excerpt":"This letter proposes a sparse diffusion steepest-descent algorithm for one bit compressed sensing in wireless sensor networks. The approach exploits the diffusion strategy from distributed learning in the one bit compressed sensing framework. To estimate a common sparse vector cooperatively from only the sign of measurements, steepest-descent is used to minimize the suitable global and local convex cost functions. A diffusion strategy is suggested for distributive learning of the sparse vector. Simulation results show the effectiveness of the proposed distributed algorithm compared to the stat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.00350","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":"1601.00350","created_at":"2026-05-18T01:23:27.699484+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.00350v1","created_at":"2026-05-18T01:23:27.699484+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.00350","created_at":"2026-05-18T01:23:27.699484+00:00"},{"alias_kind":"pith_short_12","alias_value":"MPMRU2SNBRLP","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MPMRU2SNBRLPYAFV","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MPMRU2SN","created_at":"2026-05-18T12:30:32.724797+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/MPMRU2SNBRLPYAFVGN2KPTION5","json":"https://pith.science/pith/MPMRU2SNBRLPYAFVGN2KPTION5.json","graph_json":"https://pith.science/api/pith-number/MPMRU2SNBRLPYAFVGN2KPTION5/graph.json","events_json":"https://pith.science/api/pith-number/MPMRU2SNBRLPYAFVGN2KPTION5/events.json","paper":"https://pith.science/paper/MPMRU2SN"},"agent_actions":{"view_html":"https://pith.science/pith/MPMRU2SNBRLPYAFVGN2KPTION5","download_json":"https://pith.science/pith/MPMRU2SNBRLPYAFVGN2KPTION5.json","view_paper":"https://pith.science/paper/MPMRU2SN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.00350&json=true","fetch_graph":"https://pith.science/api/pith-number/MPMRU2SNBRLPYAFVGN2KPTION5/graph.json","fetch_events":"https://pith.science/api/pith-number/MPMRU2SNBRLPYAFVGN2KPTION5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MPMRU2SNBRLPYAFVGN2KPTION5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MPMRU2SNBRLPYAFVGN2KPTION5/action/storage_attestation","attest_author":"https://pith.science/pith/MPMRU2SNBRLPYAFVGN2KPTION5/action/author_attestation","sign_citation":"https://pith.science/pith/MPMRU2SNBRLPYAFVGN2KPTION5/action/citation_signature","submit_replication":"https://pith.science/pith/MPMRU2SNBRLPYAFVGN2KPTION5/action/replication_record"}},"created_at":"2026-05-18T01:23:27.699484+00:00","updated_at":"2026-05-18T01:23:27.699484+00:00"}