{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:7BL5QMG2VVMGTZ5PLXYO4POIFT","short_pith_number":"pith:7BL5QMG2","schema_version":"1.0","canonical_sha256":"f857d830daad5869e7af5df0ee3dc82cce12f1e439555a9f9fd31a70b806c1e0","source":{"kind":"arxiv","id":"1210.8117","version":1},"attestation_state":"computed","paper":{"title":"On U-Statistics and Compressed Sensing II: Non-Asymptotic Worst-Case Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fabian Lim, Vladimir Stojanovic","submitted_at":"2012-10-30T18:46:09Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1210.8117","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-30T18:46:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"59875fa4009c859cd5e7cd9bab1c88f07b20138282a8997e76af05296e986cc2","abstract_canon_sha256":"b85a486074004c5a3e6e48e738aae5a50478317f8851b9d9bd19d31cafdd719a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:53:35.433023Z","signature_b64":"MMxV/fzqDNePryNXlR1RnU0dcXPMqH0eeyuOu9pjoIvViLHf7lY16nc89sBEKofuPCXzZKhqxlCHwFfP1YJvCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f857d830daad5869e7af5df0ee3dc82cce12f1e439555a9f9fd31a70b806c1e0","last_reissued_at":"2026-05-18T01:53:35.432494Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:53:35.432494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On U-Statistics and Compressed Sensing II: Non-Asymptotic Worst-Case Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fabian Lim, Vladimir Stojanovic","submitted_at":"2012-10-30T18:46:09Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.8117","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1210.8117","created_at":"2026-05-18T01:53:35.432579+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.8117v1","created_at":"2026-05-18T01:53:35.432579+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.8117","created_at":"2026-05-18T01:53:35.432579+00:00"},{"alias_kind":"pith_short_12","alias_value":"7BL5QMG2VVMG","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"7BL5QMG2VVMGTZ5P","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"7BL5QMG2","created_at":"2026-05-18T12:26:56.085431+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7BL5QMG2VVMGTZ5PLXYO4POIFT","json":"https://pith.science/pith/7BL5QMG2VVMGTZ5PLXYO4POIFT.json","graph_json":"https://pith.science/api/pith-number/7BL5QMG2VVMGTZ5PLXYO4POIFT/graph.json","events_json":"https://pith.science/api/pith-number/7BL5QMG2VVMGTZ5PLXYO4POIFT/events.json","paper":"https://pith.science/paper/7BL5QMG2"},"agent_actions":{"view_html":"https://pith.science/pith/7BL5QMG2VVMGTZ5PLXYO4POIFT","download_json":"https://pith.science/pith/7BL5QMG2VVMGTZ5PLXYO4POIFT.json","view_paper":"https://pith.science/paper/7BL5QMG2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.8117&json=true","fetch_graph":"https://pith.science/api/pith-number/7BL5QMG2VVMGTZ5PLXYO4POIFT/graph.json","fetch_events":"https://pith.science/api/pith-number/7BL5QMG2VVMGTZ5PLXYO4POIFT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7BL5QMG2VVMGTZ5PLXYO4POIFT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7BL5QMG2VVMGTZ5PLXYO4POIFT/action/storage_attestation","attest_author":"https://pith.science/pith/7BL5QMG2VVMGTZ5PLXYO4POIFT/action/author_attestation","sign_citation":"https://pith.science/pith/7BL5QMG2VVMGTZ5PLXYO4POIFT/action/citation_signature","submit_replication":"https://pith.science/pith/7BL5QMG2VVMGTZ5PLXYO4POIFT/action/replication_record"}},"created_at":"2026-05-18T01:53:35.432579+00:00","updated_at":"2026-05-18T01:53:35.432579+00:00"}