{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:7BL5QMG2VVMGTZ5PLXYO4POIFT","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":"b85a486074004c5a3e6e48e738aae5a50478317f8851b9d9bd19d31cafdd719a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-30T18:46:09Z","title_canon_sha256":"59875fa4009c859cd5e7cd9bab1c88f07b20138282a8997e76af05296e986cc2"},"schema_version":"1.0","source":{"id":"1210.8117","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.8117","created_at":"2026-05-18T01:53:35Z"},{"alias_kind":"arxiv_version","alias_value":"1210.8117v1","created_at":"2026-05-18T01:53:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.8117","created_at":"2026-05-18T01:53:35Z"},{"alias_kind":"pith_short_12","alias_value":"7BL5QMG2VVMG","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"7BL5QMG2VVMGTZ5P","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"7BL5QMG2","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:8c368dd32b9073670d8bdc64788841c20b0b3bbac8224eacb785909009f6f958","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":"In another related work, U-statistics were used for non-asymptotic \"average-case\" analysis of random compressed sensing matrices. In this companion paper the same analytical tool is adopted differently - here we perform non-asymptotic \"worst-case\" analysis.\n  Simple union bounds are a natural choice for \"worst-case\" analyses, however their tightness is an issue (and questioned in previous works). Here we focus on a theoretical U-statistical result, which potentially allows us to prove that these union bounds are tight. To our knowledge, this kind of (powerful) result is completely new in the c","authors_text":"Fabian Lim, Vladimir Stojanovic","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-30T18:46:09Z","title":"On U-Statistics and Compressed Sensing II: Non-Asymptotic Worst-Case Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.8117","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:869dd233e0a8447a981bdc9ee1557a609e86f62dff699ee8ee1c6451c22d8c90","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":"b85a486074004c5a3e6e48e738aae5a50478317f8851b9d9bd19d31cafdd719a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-30T18:46:09Z","title_canon_sha256":"59875fa4009c859cd5e7cd9bab1c88f07b20138282a8997e76af05296e986cc2"},"schema_version":"1.0","source":{"id":"1210.8117","kind":"arxiv","version":1}},"canonical_sha256":"f857d830daad5869e7af5df0ee3dc82cce12f1e439555a9f9fd31a70b806c1e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f857d830daad5869e7af5df0ee3dc82cce12f1e439555a9f9fd31a70b806c1e0","first_computed_at":"2026-05-18T01:53:35.432494Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:53:35.432494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MMxV/fzqDNePryNXlR1RnU0dcXPMqH0eeyuOu9pjoIvViLHf7lY16nc89sBEKofuPCXzZKhqxlCHwFfP1YJvCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:53:35.433023Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.8117","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:869dd233e0a8447a981bdc9ee1557a609e86f62dff699ee8ee1c6451c22d8c90","sha256:8c368dd32b9073670d8bdc64788841c20b0b3bbac8224eacb785909009f6f958"],"state_sha256":"2d6e7eca03268bb7735a05cdabdef9b1724e9680cd26d889e654a2e111d52cc0"}