{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4CPC4OSRH2NEJWFHQ7WMXAHHZ2","short_pith_number":"pith:4CPC4OSR","schema_version":"1.0","canonical_sha256":"e09e2e3a513e9a44d8a787eccb80e7ceaba3149c109c52db6b0853d227d65706","source":{"kind":"arxiv","id":"1402.5074","version":1},"attestation_state":"computed","paper":{"title":"Binary Fused Compressive Sensing: 1-Bit Compressive Sensing meets Group Sparsity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CV","authors_text":"M\\'ario A. T. Figueiredo, Xiangrong Zeng","submitted_at":"2014-02-20T17:06:15Z","abstract_excerpt":"We propose a new method, {\\it binary fused compressive sensing} (BFCS), to recover sparse piece-wise smooth signals from 1-bit compressive measurements. The proposed algorithm is a modification of the previous {\\it binary iterative hard thresholding} (BIHT) algorithm, where, in addition to the sparsity constraint, the total-variation of the recovered signal is upper constrained. As in BIHT, the data term of the objective function is an one-sided $\\ell_1$ (or $\\ell_2$) norm. Experiments on the recovery of sparse piece-wise smooth signals show that the proposed algorithm is able to take advantag"},"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":"1402.5074","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-02-20T17:06:15Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ac862f0448afac540ca357533c986b7fcde1c9a0a7c2076c071d2fde470dcead","abstract_canon_sha256":"d15c4e18e006bd98f682d69e8466a7d6fcfbb89455e9d55da64fc4c59aaa2656"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:31.245962Z","signature_b64":"an5VpiywYtJO8UjBzI2DMkHz19oHhMts11mz7S+H7znOUk+/gnOAL2E+u+GBV2pIqgNP6+EnaKWIuypzPCzGBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e09e2e3a513e9a44d8a787eccb80e7ceaba3149c109c52db6b0853d227d65706","last_reissued_at":"2026-05-18T02:58:31.245451Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:31.245451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Binary Fused Compressive Sensing: 1-Bit Compressive Sensing meets Group Sparsity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CV","authors_text":"M\\'ario A. T. Figueiredo, Xiangrong Zeng","submitted_at":"2014-02-20T17:06:15Z","abstract_excerpt":"We propose a new method, {\\it binary fused compressive sensing} (BFCS), to recover sparse piece-wise smooth signals from 1-bit compressive measurements. The proposed algorithm is a modification of the previous {\\it binary iterative hard thresholding} (BIHT) algorithm, where, in addition to the sparsity constraint, the total-variation of the recovered signal is upper constrained. As in BIHT, the data term of the objective function is an one-sided $\\ell_1$ (or $\\ell_2$) norm. Experiments on the recovery of sparse piece-wise smooth signals show that the proposed algorithm is able to take advantag"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5074","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":"1402.5074","created_at":"2026-05-18T02:58:31.245532+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.5074v1","created_at":"2026-05-18T02:58:31.245532+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5074","created_at":"2026-05-18T02:58:31.245532+00:00"},{"alias_kind":"pith_short_12","alias_value":"4CPC4OSRH2NE","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4CPC4OSRH2NEJWFH","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4CPC4OSR","created_at":"2026-05-18T12:28:14.216126+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/4CPC4OSRH2NEJWFHQ7WMXAHHZ2","json":"https://pith.science/pith/4CPC4OSRH2NEJWFHQ7WMXAHHZ2.json","graph_json":"https://pith.science/api/pith-number/4CPC4OSRH2NEJWFHQ7WMXAHHZ2/graph.json","events_json":"https://pith.science/api/pith-number/4CPC4OSRH2NEJWFHQ7WMXAHHZ2/events.json","paper":"https://pith.science/paper/4CPC4OSR"},"agent_actions":{"view_html":"https://pith.science/pith/4CPC4OSRH2NEJWFHQ7WMXAHHZ2","download_json":"https://pith.science/pith/4CPC4OSRH2NEJWFHQ7WMXAHHZ2.json","view_paper":"https://pith.science/paper/4CPC4OSR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.5074&json=true","fetch_graph":"https://pith.science/api/pith-number/4CPC4OSRH2NEJWFHQ7WMXAHHZ2/graph.json","fetch_events":"https://pith.science/api/pith-number/4CPC4OSRH2NEJWFHQ7WMXAHHZ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4CPC4OSRH2NEJWFHQ7WMXAHHZ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4CPC4OSRH2NEJWFHQ7WMXAHHZ2/action/storage_attestation","attest_author":"https://pith.science/pith/4CPC4OSRH2NEJWFHQ7WMXAHHZ2/action/author_attestation","sign_citation":"https://pith.science/pith/4CPC4OSRH2NEJWFHQ7WMXAHHZ2/action/citation_signature","submit_replication":"https://pith.science/pith/4CPC4OSRH2NEJWFHQ7WMXAHHZ2/action/replication_record"}},"created_at":"2026-05-18T02:58:31.245532+00:00","updated_at":"2026-05-18T02:58:31.245532+00:00"}