{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4CPC4OSRH2NEJWFHQ7WMXAHHZ2","short_pith_number":"pith:4CPC4OSR","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"},"canonical_sha256":"e09e2e3a513e9a44d8a787eccb80e7ceaba3149c109c52db6b0853d227d65706","source":{"kind":"arxiv","id":"1402.5074","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5074","created_at":"2026-05-18T02:58:31Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5074v1","created_at":"2026-05-18T02:58:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5074","created_at":"2026-05-18T02:58:31Z"},{"alias_kind":"pith_short_12","alias_value":"4CPC4OSRH2NE","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4CPC4OSRH2NEJWFH","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4CPC4OSR","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4CPC4OSRH2NEJWFHQ7WMXAHHZ2","target":"record","payload":{"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"},"canonical_sha256":"e09e2e3a513e9a44d8a787eccb80e7ceaba3149c109c52db6b0853d227d65706","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"},"source_kind":"arxiv","source_id":"1402.5074","source_version":1,"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:58:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xSaZFUxu3cLkTEJChXQbt2nTEV5fuqacrt53CVZs9MWvl3egBCYyFznNyRt7k6IKx4F/TO0XbcSU9uUZGTZFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T19:42:53.581642Z"},"content_sha256":"f2c60aa8f7d721c0ae4e96513d3dbd4b08b1065dd3a91897444121af0ed0389c","schema_version":"1.0","event_id":"sha256:f2c60aa8f7d721c0ae4e96513d3dbd4b08b1065dd3a91897444121af0ed0389c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4CPC4OSRH2NEJWFHQ7WMXAHHZ2","target":"graph","payload":{"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"},"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:58:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AULCIxiY6zm5H3jCVpBlgwvnDuGpBd33eXyQfKGyLVLyuN5RMZFCU/OnHias9A2upoOp4F4TVz4o8BN9CZ+3Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T19:42:53.581987Z"},"content_sha256":"f7896a11bbcefddaaf82cca512948d746e5d61b3bf1da744892575a152e1c6de","schema_version":"1.0","event_id":"sha256:f7896a11bbcefddaaf82cca512948d746e5d61b3bf1da744892575a152e1c6de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4CPC4OSRH2NEJWFHQ7WMXAHHZ2/bundle.json","state_url":"https://pith.science/pith/4CPC4OSRH2NEJWFHQ7WMXAHHZ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4CPC4OSRH2NEJWFHQ7WMXAHHZ2/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-27T19:42:53Z","links":{"resolver":"https://pith.science/pith/4CPC4OSRH2NEJWFHQ7WMXAHHZ2","bundle":"https://pith.science/pith/4CPC4OSRH2NEJWFHQ7WMXAHHZ2/bundle.json","state":"https://pith.science/pith/4CPC4OSRH2NEJWFHQ7WMXAHHZ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4CPC4OSRH2NEJWFHQ7WMXAHHZ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4CPC4OSRH2NEJWFHQ7WMXAHHZ2","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":"d15c4e18e006bd98f682d69e8466a7d6fcfbb89455e9d55da64fc4c59aaa2656","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:06:15Z","title_canon_sha256":"ac862f0448afac540ca357533c986b7fcde1c9a0a7c2076c071d2fde470dcead"},"schema_version":"1.0","source":{"id":"1402.5074","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5074","created_at":"2026-05-18T02:58:31Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5074v1","created_at":"2026-05-18T02:58:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5074","created_at":"2026-05-18T02:58:31Z"},{"alias_kind":"pith_short_12","alias_value":"4CPC4OSRH2NE","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4CPC4OSRH2NEJWFH","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4CPC4OSR","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:f7896a11bbcefddaaf82cca512948d746e5d61b3bf1da744892575a152e1c6de","target":"graph","created_at":"2026-05-18T02:58:31Z","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 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","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:06:15Z","title":"Binary Fused Compressive Sensing: 1-Bit Compressive Sensing meets Group Sparsity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5074","kind":"arxiv","version":1},"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:f2c60aa8f7d721c0ae4e96513d3dbd4b08b1065dd3a91897444121af0ed0389c","target":"record","created_at":"2026-05-18T02:58:31Z","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":"d15c4e18e006bd98f682d69e8466a7d6fcfbb89455e9d55da64fc4c59aaa2656","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:06:15Z","title_canon_sha256":"ac862f0448afac540ca357533c986b7fcde1c9a0a7c2076c071d2fde470dcead"},"schema_version":"1.0","source":{"id":"1402.5074","kind":"arxiv","version":1}},"canonical_sha256":"e09e2e3a513e9a44d8a787eccb80e7ceaba3149c109c52db6b0853d227d65706","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e09e2e3a513e9a44d8a787eccb80e7ceaba3149c109c52db6b0853d227d65706","first_computed_at":"2026-05-18T02:58:31.245451Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:31.245451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"an5VpiywYtJO8UjBzI2DMkHz19oHhMts11mz7S+H7znOUk+/gnOAL2E+u+GBV2pIqgNP6+EnaKWIuypzPCzGBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:31.245962Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.5074","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2c60aa8f7d721c0ae4e96513d3dbd4b08b1065dd3a91897444121af0ed0389c","sha256:f7896a11bbcefddaaf82cca512948d746e5d61b3bf1da744892575a152e1c6de"],"state_sha256":"36cbd55bd4dc8d386af6dab5ab29a6f7b93a55b78d3841660b1047c175aa7b07"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k5uh00GAaeUwCa0aM3DJbvxx8o5yE8uxmzCfm2jaRQr63QPln4GHEaBxaCTzA/ABBsjjYng4oj4gDmpkKq7MCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T19:42:53.583851Z","bundle_sha256":"fd9de3981d62207e945c2dca789f3e3f954e55041b0cf88c26bd0e4ed1655e42"}}