{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:65KADYNUB5SMJK7ZKZPLAIBE5Z","short_pith_number":"pith:65KADYNU","schema_version":"1.0","canonical_sha256":"f75401e1b40f64c4abf9565eb02024ee41f8fc399a1750d40d2d95d185d19823","source":{"kind":"arxiv","id":"1402.5076","version":2},"attestation_state":"computed","paper":{"title":"Robust Binary Fused Compressive Sensing using Adaptive Outlier Pursuit","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:07:23Z","abstract_excerpt":"We propose a new method, {\\it robust binary fused compressive sensing} (RoBFCS), to recover sparse piece-wise smooth signals from 1-bit compressive measurements. The proposed method is a modification of our previous {\\it binary fused compressive sensing} (BFCS) algorithm, which is based on the {\\it binary iterative hard thresholding} (BIHT) algorithm. As in BIHT, the data term of the objective function is a one-sided $\\ell_1$ (or $\\ell_2$) norm. Experiments show that the proposed algorithm is able to take advantage of the piece-wise smoothness of the original signal and detect sign flips and c"},"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.5076","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-02-20T17:07:23Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"da792bd2dee9c885c70857e08dc4b43250c377d0f4c85ccd371bd1e17c2f04a6","abstract_canon_sha256":"dfe88eafed03d366ab9a0736207ccd338bd8d0fba8574de85af45825f121165f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:58.554898Z","signature_b64":"oIur7T/0H7dzKSulkkFoFdgFgvhGDIRuIDjOTN3oLYbRzUjZy2e5ErFoSVLBWsv5NptPL/wqI/ZpJEyM+5iQAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f75401e1b40f64c4abf9565eb02024ee41f8fc399a1750d40d2d95d185d19823","last_reissued_at":"2026-05-18T02:55:58.554289Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:58.554289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Binary Fused Compressive Sensing using Adaptive Outlier Pursuit","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:07:23Z","abstract_excerpt":"We propose a new method, {\\it robust binary fused compressive sensing} (RoBFCS), to recover sparse piece-wise smooth signals from 1-bit compressive measurements. The proposed method is a modification of our previous {\\it binary fused compressive sensing} (BFCS) algorithm, which is based on the {\\it binary iterative hard thresholding} (BIHT) algorithm. As in BIHT, the data term of the objective function is a one-sided $\\ell_1$ (or $\\ell_2$) norm. Experiments show that the proposed algorithm is able to take advantage of the piece-wise smoothness of the original signal and detect sign flips and c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5076","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":"1402.5076","created_at":"2026-05-18T02:55:58.554389+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.5076v2","created_at":"2026-05-18T02:55:58.554389+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5076","created_at":"2026-05-18T02:55:58.554389+00:00"},{"alias_kind":"pith_short_12","alias_value":"65KADYNUB5SM","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"65KADYNUB5SMJK7Z","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"65KADYNU","created_at":"2026-05-18T12:28:16.859392+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/65KADYNUB5SMJK7ZKZPLAIBE5Z","json":"https://pith.science/pith/65KADYNUB5SMJK7ZKZPLAIBE5Z.json","graph_json":"https://pith.science/api/pith-number/65KADYNUB5SMJK7ZKZPLAIBE5Z/graph.json","events_json":"https://pith.science/api/pith-number/65KADYNUB5SMJK7ZKZPLAIBE5Z/events.json","paper":"https://pith.science/paper/65KADYNU"},"agent_actions":{"view_html":"https://pith.science/pith/65KADYNUB5SMJK7ZKZPLAIBE5Z","download_json":"https://pith.science/pith/65KADYNUB5SMJK7ZKZPLAIBE5Z.json","view_paper":"https://pith.science/paper/65KADYNU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.5076&json=true","fetch_graph":"https://pith.science/api/pith-number/65KADYNUB5SMJK7ZKZPLAIBE5Z/graph.json","fetch_events":"https://pith.science/api/pith-number/65KADYNUB5SMJK7ZKZPLAIBE5Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/65KADYNUB5SMJK7ZKZPLAIBE5Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/65KADYNUB5SMJK7ZKZPLAIBE5Z/action/storage_attestation","attest_author":"https://pith.science/pith/65KADYNUB5SMJK7ZKZPLAIBE5Z/action/author_attestation","sign_citation":"https://pith.science/pith/65KADYNUB5SMJK7ZKZPLAIBE5Z/action/citation_signature","submit_replication":"https://pith.science/pith/65KADYNUB5SMJK7ZKZPLAIBE5Z/action/replication_record"}},"created_at":"2026-05-18T02:55:58.554389+00:00","updated_at":"2026-05-18T02:55:58.554389+00:00"}