{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:27MB2XPTO5TTYKE64AELI2XYTT","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":"9731f576df7a92acc67339fecc3a04f174048307df7fc3071cfaf052b79ea81d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-30T18:45:21Z","title_canon_sha256":"64b7aaffb0954b254993b28fe3d3d54e91c0fdda48ed26907ab1ea4a98df3645"},"schema_version":"1.0","source":{"id":"1210.8116","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.8116","created_at":"2026-05-18T01:53:35Z"},{"alias_kind":"arxiv_version","alias_value":"1210.8116v1","created_at":"2026-05-18T01:53:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.8116","created_at":"2026-05-18T01:53:35Z"},{"alias_kind":"pith_short_12","alias_value":"27MB2XPTO5TT","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"27MB2XPTO5TTYKE6","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"27MB2XPT","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:f8903344a8bd5141ffe4dc1af231f330c61af3d89d772bc8920dd7db22781ade","target":"graph","created_at":"2026-05-18T01:53:35Z","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":"Hoeffding's U-statistics model combinatorial-type matrix parameters (appearing in CS theory) in a natural way. This paper proposes using these statistics for analyzing random compressed sensing matrices, in the non-asymptotic regime (relevant to practice). The aim is to address certain pessimisms of \"worst-case\" restricted isometry analyses, as observed by both Blanchard & Dossal, et. al.\n  We show how U-statistics can obtain \"average-case\" analyses, by relating to statistical restricted isometry property (StRIP) type recovery guarantees. However unlike standard StRIP, random signal models are","authors_text":"Fabian Lim, Vladimir Marko Stojanovic","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-30T18:45:21Z","title":"On U-Statistics and Compressed Sensing I: Non-Asymptotic Average-Case Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.8116","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:6f36a8a4c34598082d8b8a23b2fdf188fc3862ff97dae20e8ee759ff1bc2625e","target":"record","created_at":"2026-05-18T01:53:35Z","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":"9731f576df7a92acc67339fecc3a04f174048307df7fc3071cfaf052b79ea81d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-30T18:45:21Z","title_canon_sha256":"64b7aaffb0954b254993b28fe3d3d54e91c0fdda48ed26907ab1ea4a98df3645"},"schema_version":"1.0","source":{"id":"1210.8116","kind":"arxiv","version":1}},"canonical_sha256":"d7d81d5df377673c289ee008b46af89cf4970833a532b3a17c50640b660902e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7d81d5df377673c289ee008b46af89cf4970833a532b3a17c50640b660902e2","first_computed_at":"2026-05-18T01:53:35.440628Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:53:35.440628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tvp7/a3hCxQl7QtfuBevhij6Go9WXiG6dqfPljt+WLyVOdvMh261wDbwIxNX71a+ibT/yHWVgWMVXJKv17PrBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:53:35.441430Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.8116","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f36a8a4c34598082d8b8a23b2fdf188fc3862ff97dae20e8ee759ff1bc2625e","sha256:f8903344a8bd5141ffe4dc1af231f330c61af3d89d772bc8920dd7db22781ade"],"state_sha256":"01588b03723aa8e1b03cdd2f268519e56274e4930aff75c4f166b05941c25fa3"}