{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QKELLN76276DWD2TRH4SWDBN5S","short_pith_number":"pith:QKELLN76","canonical_record":{"source":{"id":"1706.01014","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-04T02:17:12Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c17ac4bec9daf6c12ec6e336cc92330a0ac29449520c0cae8e3b6ccefe719d25","abstract_canon_sha256":"de551c983ed808aa2e5e147dc4563a0849d0e17b2d350da05a4d1baf9c1b7923"},"schema_version":"1.0"},"canonical_sha256":"8288b5b7fed7fc3b0f5389f92b0c2deca309a6f3e09619b510fd9769ede5cc27","source":{"kind":"arxiv","id":"1706.01014","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.01014","created_at":"2026-05-18T00:31:12Z"},{"alias_kind":"arxiv_version","alias_value":"1706.01014v2","created_at":"2026-05-18T00:31:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01014","created_at":"2026-05-18T00:31:12Z"},{"alias_kind":"pith_short_12","alias_value":"QKELLN76276D","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QKELLN76276DWD2T","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QKELLN76","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QKELLN76276DWD2TRH4SWDBN5S","target":"record","payload":{"canonical_record":{"source":{"id":"1706.01014","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-04T02:17:12Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c17ac4bec9daf6c12ec6e336cc92330a0ac29449520c0cae8e3b6ccefe719d25","abstract_canon_sha256":"de551c983ed808aa2e5e147dc4563a0849d0e17b2d350da05a4d1baf9c1b7923"},"schema_version":"1.0"},"canonical_sha256":"8288b5b7fed7fc3b0f5389f92b0c2deca309a6f3e09619b510fd9769ede5cc27","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:12.569029Z","signature_b64":"QnC6xZabr5eMXXzcjwwbZHqKP7BObtWuCzproncF3DHkW1qfd2diBsAYX1XkLMwo+nysjZAGjBJL4K6smcs6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8288b5b7fed7fc3b0f5389f92b0c2deca309a6f3e09619b510fd9769ede5cc27","last_reissued_at":"2026-05-18T00:31:12.568502Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:12.568502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.01014","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-18T00:31:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aBQFUBprR/jb7fqKnRE06hxWOkBChumBrj4RVLjKO5HtVD+wmMsfTcsoMOvhbLh3lw4hnUdEKz3tvgOMhoYOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T08:12:07.265232Z"},"content_sha256":"e66b5fcc0c207bfd21247c7c7320536d4f04bea2b7b94beaf1dd18b5bed699d8","schema_version":"1.0","event_id":"sha256:e66b5fcc0c207bfd21247c7c7320536d4f04bea2b7b94beaf1dd18b5bed699d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QKELLN76276DWD2TRH4SWDBN5S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nonconvex penalties with analytical solutions for one-bit compressive sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ming Yan, Xiaolin Huang","submitted_at":"2017-06-04T02:17:12Z","abstract_excerpt":"One-bit measurements widely exist in the real world, and they can be used to recover sparse signals. This task is known as the problem of learning halfspaces in learning theory and one-bit compressive sensing (1bit-CS) in signal processing. In this paper, we propose novel algorithms based on both convex and nonconvex sparsity-inducing penalties for robust 1bit-CS. We provide a sufficient condition to verify whether a solution is globally optimal or not. Then we show that the globally optimal solution for positive homogeneous penalties can be obtained in two steps: a proximal operator and a nor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.01014","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-18T00:31:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iW0zkvZanRRA9DdveC0FwWqkdvborVEfdKY5fI4rNVk0oKtgt9PPHbcY7ijE6G7hrBWdOYXCrxmCvPm1NOjNCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T08:12:07.265896Z"},"content_sha256":"98e31d2f74607e316b2285ab268e4a636e29435c51438bf08e59786a3d2c3929","schema_version":"1.0","event_id":"sha256:98e31d2f74607e316b2285ab268e4a636e29435c51438bf08e59786a3d2c3929"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QKELLN76276DWD2TRH4SWDBN5S/bundle.json","state_url":"https://pith.science/pith/QKELLN76276DWD2TRH4SWDBN5S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QKELLN76276DWD2TRH4SWDBN5S/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-05T08:12:07Z","links":{"resolver":"https://pith.science/pith/QKELLN76276DWD2TRH4SWDBN5S","bundle":"https://pith.science/pith/QKELLN76276DWD2TRH4SWDBN5S/bundle.json","state":"https://pith.science/pith/QKELLN76276DWD2TRH4SWDBN5S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QKELLN76276DWD2TRH4SWDBN5S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QKELLN76276DWD2TRH4SWDBN5S","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":"de551c983ed808aa2e5e147dc4563a0849d0e17b2d350da05a4d1baf9c1b7923","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-04T02:17:12Z","title_canon_sha256":"c17ac4bec9daf6c12ec6e336cc92330a0ac29449520c0cae8e3b6ccefe719d25"},"schema_version":"1.0","source":{"id":"1706.01014","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.01014","created_at":"2026-05-18T00:31:12Z"},{"alias_kind":"arxiv_version","alias_value":"1706.01014v2","created_at":"2026-05-18T00:31:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01014","created_at":"2026-05-18T00:31:12Z"},{"alias_kind":"pith_short_12","alias_value":"QKELLN76276D","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QKELLN76276DWD2T","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QKELLN76","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:98e31d2f74607e316b2285ab268e4a636e29435c51438bf08e59786a3d2c3929","target":"graph","created_at":"2026-05-18T00:31:12Z","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":"One-bit measurements widely exist in the real world, and they can be used to recover sparse signals. This task is known as the problem of learning halfspaces in learning theory and one-bit compressive sensing (1bit-CS) in signal processing. In this paper, we propose novel algorithms based on both convex and nonconvex sparsity-inducing penalties for robust 1bit-CS. We provide a sufficient condition to verify whether a solution is globally optimal or not. Then we show that the globally optimal solution for positive homogeneous penalties can be obtained in two steps: a proximal operator and a nor","authors_text":"Ming Yan, Xiaolin Huang","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-04T02:17:12Z","title":"Nonconvex penalties with analytical solutions for one-bit compressive sensing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.01014","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:e66b5fcc0c207bfd21247c7c7320536d4f04bea2b7b94beaf1dd18b5bed699d8","target":"record","created_at":"2026-05-18T00:31:12Z","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":"de551c983ed808aa2e5e147dc4563a0849d0e17b2d350da05a4d1baf9c1b7923","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-04T02:17:12Z","title_canon_sha256":"c17ac4bec9daf6c12ec6e336cc92330a0ac29449520c0cae8e3b6ccefe719d25"},"schema_version":"1.0","source":{"id":"1706.01014","kind":"arxiv","version":2}},"canonical_sha256":"8288b5b7fed7fc3b0f5389f92b0c2deca309a6f3e09619b510fd9769ede5cc27","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8288b5b7fed7fc3b0f5389f92b0c2deca309a6f3e09619b510fd9769ede5cc27","first_computed_at":"2026-05-18T00:31:12.568502Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:12.568502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QnC6xZabr5eMXXzcjwwbZHqKP7BObtWuCzproncF3DHkW1qfd2diBsAYX1XkLMwo+nysjZAGjBJL4K6smcs6AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:12.569029Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.01014","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e66b5fcc0c207bfd21247c7c7320536d4f04bea2b7b94beaf1dd18b5bed699d8","sha256:98e31d2f74607e316b2285ab268e4a636e29435c51438bf08e59786a3d2c3929"],"state_sha256":"6b3ce160b9f4e27b3278db2a574337cbf429025220e5bfa2af66fdcd1404cd76"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fo92Xctov+gSNUdg80oMkD7oMzO4o3mqv9SWDdwo4XYzrSMhBsin4af+IkMHH8QEyFPARt+rjpBw6xb72QnXBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T08:12:07.269060Z","bundle_sha256":"1dae37dd0b156166b98263a235178def27352c40cbbeff2046f1e735ca53a6e9"}}