{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:WBRYZRFYNYXMMKA4PW73OYLMYE","short_pith_number":"pith:WBRYZRFY","canonical_record":{"source":{"id":"1401.0201","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-12-31T18:17:09Z","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT"],"title_canon_sha256":"4c6c1087baf8a62959da732b0e32d3a7513c52e673c0223e978b604aaa6ab686","abstract_canon_sha256":"a66a7aa6d7e1cb9d51156e3361265756ea1745e418ccfeac45fd351b8b3a0d42"},"schema_version":"1.0"},"canonical_sha256":"b0638cc4b86e2ec6281c7dbfb7616cc129c2c76eb4aaf301a671077c6a76f3af","source":{"kind":"arxiv","id":"1401.0201","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0201","created_at":"2026-05-18T03:03:30Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0201v1","created_at":"2026-05-18T03:03:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0201","created_at":"2026-05-18T03:03:30Z"},{"alias_kind":"pith_short_12","alias_value":"WBRYZRFYNYXM","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WBRYZRFYNYXMMKA4","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WBRYZRFY","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:WBRYZRFYNYXMMKA4PW73OYLMYE","target":"record","payload":{"canonical_record":{"source":{"id":"1401.0201","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-12-31T18:17:09Z","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT"],"title_canon_sha256":"4c6c1087baf8a62959da732b0e32d3a7513c52e673c0223e978b604aaa6ab686","abstract_canon_sha256":"a66a7aa6d7e1cb9d51156e3361265756ea1745e418ccfeac45fd351b8b3a0d42"},"schema_version":"1.0"},"canonical_sha256":"b0638cc4b86e2ec6281c7dbfb7616cc129c2c76eb4aaf301a671077c6a76f3af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:30.774219Z","signature_b64":"t+MTQBZ7b9/uQDpQfJtgnBzaJZaUgqTLp6BFCNC83zY5ld1uiCNzNwRfS+QG9JUPqlTGn+bVzEcgFWXbHz0xAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0638cc4b86e2ec6281c7dbfb7616cc129c2c76eb4aaf301a671077c6a76f3af","last_reissued_at":"2026-05-18T03:03:30.773722Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:30.773722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.0201","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:03:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nG3h3KUZ8K6qNUMaIqsfA25D0DmZj1GJ1LiWoO7mhRMur1tqMMwUl1QuE6/+0QpFb5YnhnYBhQpj6l5CBCMdDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:06:48.646982Z"},"content_sha256":"52d628a9958aa25572ff4733a0efa84433d5db79635577d4b99569a261bb3819","schema_version":"1.0","event_id":"sha256:52d628a9958aa25572ff4733a0efa84433d5db79635577d4b99569a261bb3819"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:WBRYZRFYNYXMMKA4PW73OYLMYE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparse Recovery with Very Sparse Compressed Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ME","authors_text":"Cun-Hui Zhang, Ping Li, Tong Zhang","submitted_at":"2013-12-31T18:17:09Z","abstract_excerpt":"Compressed sensing (sparse signal recovery) often encounters nonnegative data (e.g., images). Recently we developed the methodology of using (dense) Compressed Counting for recovering nonnegative K-sparse signals. In this paper, we adopt very sparse Compressed Counting for nonnegative signal recovery. Our design matrix is sampled from a maximally-skewed p-stable distribution (0<p<1), and we sparsify the design matrix so that on average (1-g)-fraction of the entries become zero. The idea is related to very sparse stable random projections (Li et al 2006 and Li 2007), the prior work for estimati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0201","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:03:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BjcNfyNwPzV0Ggdl+cghfvyVwMerYP9lvmzKR6FCCzp2HuWeM4YCDw2K4JKI63v8IXfJUqDgxPrr8xnLv8uWBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:06:48.647677Z"},"content_sha256":"c061b3fb4f719891a88a5977c0c2cd4df886b6603ec9fc9775c6ac51784d7efb","schema_version":"1.0","event_id":"sha256:c061b3fb4f719891a88a5977c0c2cd4df886b6603ec9fc9775c6ac51784d7efb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WBRYZRFYNYXMMKA4PW73OYLMYE/bundle.json","state_url":"https://pith.science/pith/WBRYZRFYNYXMMKA4PW73OYLMYE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WBRYZRFYNYXMMKA4PW73OYLMYE/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-11T22:06:48Z","links":{"resolver":"https://pith.science/pith/WBRYZRFYNYXMMKA4PW73OYLMYE","bundle":"https://pith.science/pith/WBRYZRFYNYXMMKA4PW73OYLMYE/bundle.json","state":"https://pith.science/pith/WBRYZRFYNYXMMKA4PW73OYLMYE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WBRYZRFYNYXMMKA4PW73OYLMYE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WBRYZRFYNYXMMKA4PW73OYLMYE","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":"a66a7aa6d7e1cb9d51156e3361265756ea1745e418ccfeac45fd351b8b3a0d42","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-12-31T18:17:09Z","title_canon_sha256":"4c6c1087baf8a62959da732b0e32d3a7513c52e673c0223e978b604aaa6ab686"},"schema_version":"1.0","source":{"id":"1401.0201","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0201","created_at":"2026-05-18T03:03:30Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0201v1","created_at":"2026-05-18T03:03:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0201","created_at":"2026-05-18T03:03:30Z"},{"alias_kind":"pith_short_12","alias_value":"WBRYZRFYNYXM","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WBRYZRFYNYXMMKA4","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WBRYZRFY","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:c061b3fb4f719891a88a5977c0c2cd4df886b6603ec9fc9775c6ac51784d7efb","target":"graph","created_at":"2026-05-18T03:03:30Z","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 (sparse signal recovery) often encounters nonnegative data (e.g., images). Recently we developed the methodology of using (dense) Compressed Counting for recovering nonnegative K-sparse signals. In this paper, we adopt very sparse Compressed Counting for nonnegative signal recovery. Our design matrix is sampled from a maximally-skewed p-stable distribution (0<p<1), and we sparsify the design matrix so that on average (1-g)-fraction of the entries become zero. The idea is related to very sparse stable random projections (Li et al 2006 and Li 2007), the prior work for estimati","authors_text":"Cun-Hui Zhang, Ping Li, Tong Zhang","cross_cats":["cs.DS","cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-12-31T18:17:09Z","title":"Sparse Recovery with Very Sparse Compressed Counting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0201","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:52d628a9958aa25572ff4733a0efa84433d5db79635577d4b99569a261bb3819","target":"record","created_at":"2026-05-18T03:03:30Z","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":"a66a7aa6d7e1cb9d51156e3361265756ea1745e418ccfeac45fd351b8b3a0d42","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-12-31T18:17:09Z","title_canon_sha256":"4c6c1087baf8a62959da732b0e32d3a7513c52e673c0223e978b604aaa6ab686"},"schema_version":"1.0","source":{"id":"1401.0201","kind":"arxiv","version":1}},"canonical_sha256":"b0638cc4b86e2ec6281c7dbfb7616cc129c2c76eb4aaf301a671077c6a76f3af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0638cc4b86e2ec6281c7dbfb7616cc129c2c76eb4aaf301a671077c6a76f3af","first_computed_at":"2026-05-18T03:03:30.773722Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:30.773722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t+MTQBZ7b9/uQDpQfJtgnBzaJZaUgqTLp6BFCNC83zY5ld1uiCNzNwRfS+QG9JUPqlTGn+bVzEcgFWXbHz0xAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:30.774219Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.0201","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52d628a9958aa25572ff4733a0efa84433d5db79635577d4b99569a261bb3819","sha256:c061b3fb4f719891a88a5977c0c2cd4df886b6603ec9fc9775c6ac51784d7efb"],"state_sha256":"50931947b0a79831c12e9e0f8c4074f674e3a8a1b182ee60e709e2f8128c00ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pudLiB0jHlnbfK5ce5r1RE3KaBtvt36CRfzFXbca2bYbcBkmgODbAICtTAV1Gz/TfDPHDLR4dSunvNFiBmbFBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T22:06:48.651295Z","bundle_sha256":"a1b4f2137284e548c7407f54abb98205ed5f3607423279d68be565e7b6df5a3f"}}