{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6GBS5ZWT7FKNI4T7TL2PW4N6WF","short_pith_number":"pith:6GBS5ZWT","canonical_record":{"source":{"id":"1302.1419","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.IT","submitted_at":"2013-02-06T16:16:47Z","cross_cats_sorted":["math.IT","math.NA"],"title_canon_sha256":"425b77f6ef533b4f1e0592a8e8f26e7719eb629d6d18a9ef5b384223bd0120e6","abstract_canon_sha256":"2a0711c440d87cd97dfa3877c8ead870f3568208b7b547eb741fd03e6be64bdd"},"schema_version":"1.0"},"canonical_sha256":"f1832ee6d3f954d4727f9af4fb71beb1781d153f192abceb40639d5370587d2a","source":{"kind":"arxiv","id":"1302.1419","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1419","created_at":"2026-05-18T03:34:24Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1419v1","created_at":"2026-05-18T03:34:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1419","created_at":"2026-05-18T03:34:24Z"},{"alias_kind":"pith_short_12","alias_value":"6GBS5ZWT7FKN","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6GBS5ZWT7FKNI4T7","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6GBS5ZWT","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6GBS5ZWT7FKNI4T7TL2PW4N6WF","target":"record","payload":{"canonical_record":{"source":{"id":"1302.1419","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.IT","submitted_at":"2013-02-06T16:16:47Z","cross_cats_sorted":["math.IT","math.NA"],"title_canon_sha256":"425b77f6ef533b4f1e0592a8e8f26e7719eb629d6d18a9ef5b384223bd0120e6","abstract_canon_sha256":"2a0711c440d87cd97dfa3877c8ead870f3568208b7b547eb741fd03e6be64bdd"},"schema_version":"1.0"},"canonical_sha256":"f1832ee6d3f954d4727f9af4fb71beb1781d153f192abceb40639d5370587d2a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:24.310147Z","signature_b64":"mKBzEItHwPabe1iVTYJG2lV0DmUvm5LtawGpNvNFJwiPHEAWmQKdd3fNaaOAmMeJ+rUVEBmoRKSNBJg987aZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1832ee6d3f954d4727f9af4fb71beb1781d153f192abceb40639d5370587d2a","last_reissued_at":"2026-05-18T03:34:24.309365Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:24.309365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.1419","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-18T03:34:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/bq+bsWoYEPljaXc39B7/Fh8fulcin+cPkHQmU+xwdyCzOVIo/Sv7oGBNL199mkHgV7xJLLVq66G50SQUBwdBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:13:32.555685Z"},"content_sha256":"0514e694c1d2ad76549fcc4eac511d0cd8c2b96e7ad70eadb7b3153d47de6209","schema_version":"1.0","event_id":"sha256:0514e694c1d2ad76549fcc4eac511d0cd8c2b96e7ad70eadb7b3153d47de6209"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6GBS5ZWT7FKNI4T7TL2PW4N6WF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Blind One-Bit Compressive Sampling","license":"http://creativecommons.org/licenses/publicdomain/","headline":"","cross_cats":["math.IT","math.NA"],"primary_cat":"cs.IT","authors_text":"Bruce W. Suter, Lixin Shen","submitted_at":"2013-02-06T16:16:47Z","abstract_excerpt":"The problem of 1-bit compressive sampling is addressed in this paper. We introduce an optimization model for reconstruction of sparse signals from 1-bit measurements. The model targets a solution that has the least l0-norm among all signals satisfying consistency constraints stemming from the 1-bit measurements. An algorithm for solving the model is developed. Convergence analysis of the algorithm is presented. Our approach is to obtain a sequence of optimization problems by successively approximating the l0-norm and to solve resulting problems by exploiting the proximity operator. We examine "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1419","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-18T03:34:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vy8SzeFP8GvqBdBX2DaEZ3gXxHtLXNCIHAaHUNRIcVIcwB55VDg9sASc1NGEaAJDmHdGzJxXw9SAXh9+SQzrDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:13:32.556095Z"},"content_sha256":"1356ebf2ad799a5a655e484beec9b3f7fa7a037bf8d4ba7d41be6d71d5d0d7f1","schema_version":"1.0","event_id":"sha256:1356ebf2ad799a5a655e484beec9b3f7fa7a037bf8d4ba7d41be6d71d5d0d7f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6GBS5ZWT7FKNI4T7TL2PW4N6WF/bundle.json","state_url":"https://pith.science/pith/6GBS5ZWT7FKNI4T7TL2PW4N6WF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6GBS5ZWT7FKNI4T7TL2PW4N6WF/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:13:32Z","links":{"resolver":"https://pith.science/pith/6GBS5ZWT7FKNI4T7TL2PW4N6WF","bundle":"https://pith.science/pith/6GBS5ZWT7FKNI4T7TL2PW4N6WF/bundle.json","state":"https://pith.science/pith/6GBS5ZWT7FKNI4T7TL2PW4N6WF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6GBS5ZWT7FKNI4T7TL2PW4N6WF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6GBS5ZWT7FKNI4T7TL2PW4N6WF","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":"2a0711c440d87cd97dfa3877c8ead870f3568208b7b547eb741fd03e6be64bdd","cross_cats_sorted":["math.IT","math.NA"],"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.IT","submitted_at":"2013-02-06T16:16:47Z","title_canon_sha256":"425b77f6ef533b4f1e0592a8e8f26e7719eb629d6d18a9ef5b384223bd0120e6"},"schema_version":"1.0","source":{"id":"1302.1419","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1419","created_at":"2026-05-18T03:34:24Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1419v1","created_at":"2026-05-18T03:34:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1419","created_at":"2026-05-18T03:34:24Z"},{"alias_kind":"pith_short_12","alias_value":"6GBS5ZWT7FKN","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6GBS5ZWT7FKNI4T7","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6GBS5ZWT","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:1356ebf2ad799a5a655e484beec9b3f7fa7a037bf8d4ba7d41be6d71d5d0d7f1","target":"graph","created_at":"2026-05-18T03:34:24Z","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":"The problem of 1-bit compressive sampling is addressed in this paper. We introduce an optimization model for reconstruction of sparse signals from 1-bit measurements. The model targets a solution that has the least l0-norm among all signals satisfying consistency constraints stemming from the 1-bit measurements. An algorithm for solving the model is developed. Convergence analysis of the algorithm is presented. Our approach is to obtain a sequence of optimization problems by successively approximating the l0-norm and to solve resulting problems by exploiting the proximity operator. We examine ","authors_text":"Bruce W. Suter, Lixin Shen","cross_cats":["math.IT","math.NA"],"headline":"","license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.IT","submitted_at":"2013-02-06T16:16:47Z","title":"Blind One-Bit Compressive Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1419","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:0514e694c1d2ad76549fcc4eac511d0cd8c2b96e7ad70eadb7b3153d47de6209","target":"record","created_at":"2026-05-18T03:34:24Z","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":"2a0711c440d87cd97dfa3877c8ead870f3568208b7b547eb741fd03e6be64bdd","cross_cats_sorted":["math.IT","math.NA"],"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.IT","submitted_at":"2013-02-06T16:16:47Z","title_canon_sha256":"425b77f6ef533b4f1e0592a8e8f26e7719eb629d6d18a9ef5b384223bd0120e6"},"schema_version":"1.0","source":{"id":"1302.1419","kind":"arxiv","version":1}},"canonical_sha256":"f1832ee6d3f954d4727f9af4fb71beb1781d153f192abceb40639d5370587d2a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1832ee6d3f954d4727f9af4fb71beb1781d153f192abceb40639d5370587d2a","first_computed_at":"2026-05-18T03:34:24.309365Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:24.309365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mKBzEItHwPabe1iVTYJG2lV0DmUvm5LtawGpNvNFJwiPHEAWmQKdd3fNaaOAmMeJ+rUVEBmoRKSNBJg987aZDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:24.310147Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.1419","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0514e694c1d2ad76549fcc4eac511d0cd8c2b96e7ad70eadb7b3153d47de6209","sha256:1356ebf2ad799a5a655e484beec9b3f7fa7a037bf8d4ba7d41be6d71d5d0d7f1"],"state_sha256":"2815a23c2fdb01165e6e6a7a8a0f56e1764b8e1edec8fef9f8dccf8f2afff32f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ym2Qs26jIIrkqASx6zTkfjrMhSzusCBTGDLzyR/NKsnx+zFVBsaKqlfIPIc9FsdSkFqadY76QYELzbDP8scqAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T18:13:32.558236Z","bundle_sha256":"aa1fd47a674f06bbb1037fa1925de07f444b6e100b037982a1f7a0958be90048"}}