{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:PRO4KLUWOJEQULJOLZKCD2WRFZ","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":"4d42df9519a873edb173ee7c29a0375cb173e591fcc8c5369a46c61c90225d7d","cross_cats_sorted":["cond-mat.dis-nn","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-08T06:36:47Z","title_canon_sha256":"72b9ad60ecdbc7d26a6c4d0a490c7e7a353cef1020334362132b701a6c7a04a5"},"schema_version":"1.0","source":{"id":"1301.1423","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.1423","created_at":"2026-05-18T02:58:57Z"},{"alias_kind":"arxiv_version","alias_value":"1301.1423v2","created_at":"2026-05-18T02:58:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1423","created_at":"2026-05-18T02:58:57Z"},{"alias_kind":"pith_short_12","alias_value":"PRO4KLUWOJEQ","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PRO4KLUWOJEQULJO","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PRO4KLUW","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:a61eab244151d931cbac279f2118f26dd33316b3d9dea0c4770682d78fb04662","target":"graph","created_at":"2026-05-18T02:58:57Z","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":"Compressed sensing is a technique for recovering a high-dimensional signal from lower-dimensional data, whose components represent partial information about the signal, utilizing prior knowledge on the sparsity of the signal. For further reducing the data size of the compressed expression, a scheme to recover the original signal utilizing only the sign of each entry of the linearly transformed vector was recently proposed. This approach is often termed the 1-bit compressed sensing. Here we analyze the typical performance of an L1-norm based signal recovery scheme for the 1-bit compressed sensi","authors_text":"Yingying Xu, Yoshiyuki Kabashima","cross_cats":["cond-mat.dis-nn","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-08T06:36:47Z","title":"Statistical mechanics approach to 1-bit compressed sensing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.1423","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:9b43dd67ae3a1293c23b4d878716819d97017f4a944e6d100fc0973810e1bd51","target":"record","created_at":"2026-05-18T02:58:57Z","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":"4d42df9519a873edb173ee7c29a0375cb173e591fcc8c5369a46c61c90225d7d","cross_cats_sorted":["cond-mat.dis-nn","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-08T06:36:47Z","title_canon_sha256":"72b9ad60ecdbc7d26a6c4d0a490c7e7a353cef1020334362132b701a6c7a04a5"},"schema_version":"1.0","source":{"id":"1301.1423","kind":"arxiv","version":2}},"canonical_sha256":"7c5dc52e9672490a2d2e5e5421ead12e410588edf4f0b31e90796d324be49343","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c5dc52e9672490a2d2e5e5421ead12e410588edf4f0b31e90796d324be49343","first_computed_at":"2026-05-18T02:58:57.492020Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:57.492020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t+73icp5WTiyE64TvfACdzzKHupVcTXB4bB1ggMG/l/upbghcA81KnJqyNfwJkoGh2PUHD2HF24V5Rx0Af+9DA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:57.492803Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.1423","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b43dd67ae3a1293c23b4d878716819d97017f4a944e6d100fc0973810e1bd51","sha256:a61eab244151d931cbac279f2118f26dd33316b3d9dea0c4770682d78fb04662"],"state_sha256":"55fdce1ade6ba1fed811e05f8377fd0641a4f913fcf2f6030ae665c56971b20b"}