{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:65KADYNUB5SMJK7ZKZPLAIBE5Z","short_pith_number":"pith:65KADYNU","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"},"canonical_sha256":"f75401e1b40f64c4abf9565eb02024ee41f8fc399a1750d40d2d95d185d19823","source":{"kind":"arxiv","id":"1402.5076","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5076","created_at":"2026-05-18T02:55:58Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5076v2","created_at":"2026-05-18T02:55:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5076","created_at":"2026-05-18T02:55:58Z"},{"alias_kind":"pith_short_12","alias_value":"65KADYNUB5SM","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"65KADYNUB5SMJK7Z","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"65KADYNU","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:65KADYNUB5SMJK7ZKZPLAIBE5Z","target":"record","payload":{"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"},"canonical_sha256":"f75401e1b40f64c4abf9565eb02024ee41f8fc399a1750d40d2d95d185d19823","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"},"source_kind":"arxiv","source_id":"1402.5076","source_version":2,"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-18T02:55:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cMQl0cH04Z2HoWxjq2AUxApprMbSYY7ofxdYTuKmQ8vhE90afLsvvNBdgt2qeMM9uuv58QADrCT42MNfif39CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:40:18.217890Z"},"content_sha256":"875c08a20a63a0308b56e5fc8da4aed6fcb460d5a15e6fcaa34837cc0d976fa9","schema_version":"1.0","event_id":"sha256:875c08a20a63a0308b56e5fc8da4aed6fcb460d5a15e6fcaa34837cc0d976fa9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:65KADYNUB5SMJK7ZKZPLAIBE5Z","target":"graph","payload":{"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"},"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-18T02:55:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0AInwovldj604CwgVffXEGr2P1zVwaMAOji6IDQ5Bzd0Ku3VahZ2Og4BJm0ys1QOoKnYzH6CzH5AO+DtDjnICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:40:18.218231Z"},"content_sha256":"d144838d79bc0b31197ceaa8e437f22d78984ca798c16aefd0177d7c46c11e87","schema_version":"1.0","event_id":"sha256:d144838d79bc0b31197ceaa8e437f22d78984ca798c16aefd0177d7c46c11e87"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/65KADYNUB5SMJK7ZKZPLAIBE5Z/bundle.json","state_url":"https://pith.science/pith/65KADYNUB5SMJK7ZKZPLAIBE5Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/65KADYNUB5SMJK7ZKZPLAIBE5Z/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-27T18:40:18Z","links":{"resolver":"https://pith.science/pith/65KADYNUB5SMJK7ZKZPLAIBE5Z","bundle":"https://pith.science/pith/65KADYNUB5SMJK7ZKZPLAIBE5Z/bundle.json","state":"https://pith.science/pith/65KADYNUB5SMJK7ZKZPLAIBE5Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/65KADYNUB5SMJK7ZKZPLAIBE5Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:65KADYNUB5SMJK7ZKZPLAIBE5Z","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":"dfe88eafed03d366ab9a0736207ccd338bd8d0fba8574de85af45825f121165f","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-02-20T17:07:23Z","title_canon_sha256":"da792bd2dee9c885c70857e08dc4b43250c377d0f4c85ccd371bd1e17c2f04a6"},"schema_version":"1.0","source":{"id":"1402.5076","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5076","created_at":"2026-05-18T02:55:58Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5076v2","created_at":"2026-05-18T02:55:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5076","created_at":"2026-05-18T02:55:58Z"},{"alias_kind":"pith_short_12","alias_value":"65KADYNUB5SM","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"65KADYNUB5SMJK7Z","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"65KADYNU","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:d144838d79bc0b31197ceaa8e437f22d78984ca798c16aefd0177d7c46c11e87","target":"graph","created_at":"2026-05-18T02:55:58Z","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":"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","authors_text":"M\\'ario A. T. Figueiredo, Xiangrong Zeng","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-02-20T17:07:23Z","title":"Robust Binary Fused Compressive Sensing using Adaptive Outlier Pursuit"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5076","kind":"arxiv","version":2},"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:875c08a20a63a0308b56e5fc8da4aed6fcb460d5a15e6fcaa34837cc0d976fa9","target":"record","created_at":"2026-05-18T02:55:58Z","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":"dfe88eafed03d366ab9a0736207ccd338bd8d0fba8574de85af45825f121165f","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-02-20T17:07:23Z","title_canon_sha256":"da792bd2dee9c885c70857e08dc4b43250c377d0f4c85ccd371bd1e17c2f04a6"},"schema_version":"1.0","source":{"id":"1402.5076","kind":"arxiv","version":2}},"canonical_sha256":"f75401e1b40f64c4abf9565eb02024ee41f8fc399a1750d40d2d95d185d19823","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f75401e1b40f64c4abf9565eb02024ee41f8fc399a1750d40d2d95d185d19823","first_computed_at":"2026-05-18T02:55:58.554289Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:58.554289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oIur7T/0H7dzKSulkkFoFdgFgvhGDIRuIDjOTN3oLYbRzUjZy2e5ErFoSVLBWsv5NptPL/wqI/ZpJEyM+5iQAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:58.554898Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.5076","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:875c08a20a63a0308b56e5fc8da4aed6fcb460d5a15e6fcaa34837cc0d976fa9","sha256:d144838d79bc0b31197ceaa8e437f22d78984ca798c16aefd0177d7c46c11e87"],"state_sha256":"243220f3f341dd93787d11e38454475855d9c2af1e329357df86f8b1cb4e5847"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/c/j3wL493nhkj2fN5s/wXKKHiYAan59zSXm5wP/Ox/ZqDqAK13PTgZvtjcqI1Y6z7I3maz8jYizCjGvqLPyCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T18:40:18.220102Z","bundle_sha256":"5ba0f6fab53950402dcc29092c15e812ec1a01bf07344b1f9cc988258e23a285"}}