{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CM6WOUGB7HYIHUR2KKJNRRTPEG","short_pith_number":"pith:CM6WOUGB","canonical_record":{"source":{"id":"1605.09646","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-31T14:38:03Z","cross_cats_sorted":["cs.CC","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"af4905c4066af5696450b9bca9f275e928e29527980bbe349d227c2d78602c84","abstract_canon_sha256":"8ecdfb22d8520fe170d0b869532fdfed2ba52d73e71eb401151c5a9bb4e4ad39"},"schema_version":"1.0"},"canonical_sha256":"133d6750c1f9f083d23a5292d8c66f21a43031b89ca031ba914fcf3ea334ec08","source":{"kind":"arxiv","id":"1605.09646","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.09646","created_at":"2026-05-18T01:13:10Z"},{"alias_kind":"arxiv_version","alias_value":"1605.09646v1","created_at":"2026-05-18T01:13:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.09646","created_at":"2026-05-18T01:13:10Z"},{"alias_kind":"pith_short_12","alias_value":"CM6WOUGB7HYI","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CM6WOUGB7HYIHUR2","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CM6WOUGB","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CM6WOUGB7HYIHUR2KKJNRRTPEG","target":"record","payload":{"canonical_record":{"source":{"id":"1605.09646","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-31T14:38:03Z","cross_cats_sorted":["cs.CC","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"af4905c4066af5696450b9bca9f275e928e29527980bbe349d227c2d78602c84","abstract_canon_sha256":"8ecdfb22d8520fe170d0b869532fdfed2ba52d73e71eb401151c5a9bb4e4ad39"},"schema_version":"1.0"},"canonical_sha256":"133d6750c1f9f083d23a5292d8c66f21a43031b89ca031ba914fcf3ea334ec08","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:10.410838Z","signature_b64":"2/iAzmjnLZ3V1kqJzS8/IeBfbIEjunhg19reXZaFxx6PfxeMyV+j9K8D7L53bjBs5osbnqcJ6JR+b9nvbZpzCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"133d6750c1f9f083d23a5292d8c66f21a43031b89ca031ba914fcf3ea334ec08","last_reissued_at":"2026-05-18T01:13:10.410438Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:10.410438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.09646","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-18T01:13:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"15YhVeE6LQ5IxsWD0pxSdPQH0eiSE1VluOcyFtJCmGC6XKMN+KQV1OnlzBrKSdtWPa+GLaT1rMQfhHK8vvzwAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:24:43.163886Z"},"content_sha256":"62bccb9f583f378e6f7a4377fb1a30f249ee76c4113637d878d5422771d52a88","schema_version":"1.0","event_id":"sha256:62bccb9f583f378e6f7a4377fb1a30f249ee76c4113637d878d5422771d52a88"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CM6WOUGB7HYIHUR2KKJNRRTPEG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Average-case Hardness of RIP Certification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Quentin Berthet, Tengyao Wang, Yaniv Plan","submitted_at":"2016-05-31T14:38:03Z","abstract_excerpt":"The restricted isometry property (RIP) for design matrices gives guarantees for optimal recovery in sparse linear models. It is of high interest in compressed sensing and statistical learning. This property is particularly important for computationally efficient recovery methods. As a consequence, even though it is in general NP-hard to check that RIP holds, there have been substantial efforts to find tractable proxies for it. These would allow the construction of RIP matrices and the polynomial-time verification of RIP given an arbitrary matrix. We consider the framework of average-case certi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.09646","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-18T01:13:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GBsBr5iHJKcDZeYc5WsVsu9nyZOrHfRxQFIRk9XoPmM/AhQxKFxXVMahvcN+qMj9g7UIouVQlhDcaTxKk1LKCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:24:43.164247Z"},"content_sha256":"b6dd0785ab022816665ac521015174a747ae2ba96f9345bdd88848e675e5348f","schema_version":"1.0","event_id":"sha256:b6dd0785ab022816665ac521015174a747ae2ba96f9345bdd88848e675e5348f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CM6WOUGB7HYIHUR2KKJNRRTPEG/bundle.json","state_url":"https://pith.science/pith/CM6WOUGB7HYIHUR2KKJNRRTPEG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CM6WOUGB7HYIHUR2KKJNRRTPEG/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-09T19:24:43Z","links":{"resolver":"https://pith.science/pith/CM6WOUGB7HYIHUR2KKJNRRTPEG","bundle":"https://pith.science/pith/CM6WOUGB7HYIHUR2KKJNRRTPEG/bundle.json","state":"https://pith.science/pith/CM6WOUGB7HYIHUR2KKJNRRTPEG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CM6WOUGB7HYIHUR2KKJNRRTPEG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CM6WOUGB7HYIHUR2KKJNRRTPEG","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":"8ecdfb22d8520fe170d0b869532fdfed2ba52d73e71eb401151c5a9bb4e4ad39","cross_cats_sorted":["cs.CC","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-31T14:38:03Z","title_canon_sha256":"af4905c4066af5696450b9bca9f275e928e29527980bbe349d227c2d78602c84"},"schema_version":"1.0","source":{"id":"1605.09646","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.09646","created_at":"2026-05-18T01:13:10Z"},{"alias_kind":"arxiv_version","alias_value":"1605.09646v1","created_at":"2026-05-18T01:13:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.09646","created_at":"2026-05-18T01:13:10Z"},{"alias_kind":"pith_short_12","alias_value":"CM6WOUGB7HYI","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CM6WOUGB7HYIHUR2","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CM6WOUGB","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:b6dd0785ab022816665ac521015174a747ae2ba96f9345bdd88848e675e5348f","target":"graph","created_at":"2026-05-18T01:13:10Z","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":"The restricted isometry property (RIP) for design matrices gives guarantees for optimal recovery in sparse linear models. It is of high interest in compressed sensing and statistical learning. This property is particularly important for computationally efficient recovery methods. As a consequence, even though it is in general NP-hard to check that RIP holds, there have been substantial efforts to find tractable proxies for it. These would allow the construction of RIP matrices and the polynomial-time verification of RIP given an arbitrary matrix. We consider the framework of average-case certi","authors_text":"Quentin Berthet, Tengyao Wang, Yaniv Plan","cross_cats":["cs.CC","math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-31T14:38:03Z","title":"Average-case Hardness of RIP Certification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.09646","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:62bccb9f583f378e6f7a4377fb1a30f249ee76c4113637d878d5422771d52a88","target":"record","created_at":"2026-05-18T01:13:10Z","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":"8ecdfb22d8520fe170d0b869532fdfed2ba52d73e71eb401151c5a9bb4e4ad39","cross_cats_sorted":["cs.CC","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-31T14:38:03Z","title_canon_sha256":"af4905c4066af5696450b9bca9f275e928e29527980bbe349d227c2d78602c84"},"schema_version":"1.0","source":{"id":"1605.09646","kind":"arxiv","version":1}},"canonical_sha256":"133d6750c1f9f083d23a5292d8c66f21a43031b89ca031ba914fcf3ea334ec08","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"133d6750c1f9f083d23a5292d8c66f21a43031b89ca031ba914fcf3ea334ec08","first_computed_at":"2026-05-18T01:13:10.410438Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:10.410438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2/iAzmjnLZ3V1kqJzS8/IeBfbIEjunhg19reXZaFxx6PfxeMyV+j9K8D7L53bjBs5osbnqcJ6JR+b9nvbZpzCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:10.410838Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.09646","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:62bccb9f583f378e6f7a4377fb1a30f249ee76c4113637d878d5422771d52a88","sha256:b6dd0785ab022816665ac521015174a747ae2ba96f9345bdd88848e675e5348f"],"state_sha256":"cc7c6f66f3aefe9f38d3ff94a6c0ab0ee9d2157b8152a908a4355d2c1e019bd0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uaKL62S2Y7XFl7I85cZtpomFzrlZNnaLVPbHugMUVgTDlnHCJWPiCH9uDLCkTDS2HgGwymjnRCyEkFWPoxLpCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T19:24:43.166650Z","bundle_sha256":"92e04da98f9ab727acd7ea1d04002105e12ea5e60f83256212509f99e94c78de"}}