{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:BYF5VWWE62UMXCEDANZ7BAB6E4","short_pith_number":"pith:BYF5VWWE","canonical_record":{"source":{"id":"1205.2081","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-05-09T19:55:22Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"0a022e3c38e13e81178c42f8d818e875f44a8adf8136a56ed5dd3fa331f0d862","abstract_canon_sha256":"6f667d5b2d1f562a61fa735d65cabc4673a56693fd9f3c4be782d1405d268ef8"},"schema_version":"1.0"},"canonical_sha256":"0e0bdadac4f6a8cb88830373f0803e272e0cf1b4c71ee1fa6fb6eaae0c344730","source":{"kind":"arxiv","id":"1205.2081","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.2081","created_at":"2026-05-18T03:08:14Z"},{"alias_kind":"arxiv_version","alias_value":"1205.2081v6","created_at":"2026-05-18T03:08:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2081","created_at":"2026-05-18T03:08:14Z"},{"alias_kind":"pith_short_12","alias_value":"BYF5VWWE62UM","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BYF5VWWE62UMXCED","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BYF5VWWE","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:BYF5VWWE62UMXCEDANZ7BAB6E4","target":"record","payload":{"canonical_record":{"source":{"id":"1205.2081","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-05-09T19:55:22Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"0a022e3c38e13e81178c42f8d818e875f44a8adf8136a56ed5dd3fa331f0d862","abstract_canon_sha256":"6f667d5b2d1f562a61fa735d65cabc4673a56693fd9f3c4be782d1405d268ef8"},"schema_version":"1.0"},"canonical_sha256":"0e0bdadac4f6a8cb88830373f0803e272e0cf1b4c71ee1fa6fb6eaae0c344730","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:14.639989Z","signature_b64":"phwjSKTDuCZeM4sykyfNZ9ZE5K4cnE+S2dbeixLPswCp9zsTfmRZgUHKQfeGcVucFefGPw0oZj0Foh33l0XWBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e0bdadac4f6a8cb88830373f0803e272e0cf1b4c71ee1fa6fb6eaae0c344730","last_reissued_at":"2026-05-18T03:08:14.639587Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:14.639587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.2081","source_version":6,"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:08:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nCqgz9rmY6uEIDgtBxHyNGaCNKmsGiM08DXhbuNTzY4n1FYuQm00P1Gv8kuui9f1WSnfJ5IkjQ4zxi2NbeGcBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:58:14.101002Z"},"content_sha256":"76c0b73f5f121db8641538065abfd0227a1f3b57a5bbdbb62b367f989e00607c","schema_version":"1.0","event_id":"sha256:76c0b73f5f121db8641538065abfd0227a1f3b57a5bbdbb62b367f989e00607c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:BYF5VWWE62UMXCEDANZ7BAB6E4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Andreas M. Tillmann, Marc E. Pfetsch","submitted_at":"2012-05-09T19:55:22Z","abstract_excerpt":"This paper deals with the computational complexity of conditions which guarantee that the NP-hard problem of finding the sparsest solution to an underdetermined linear system can be solved by efficient algorithms. In the literature, several such conditions have been introduced. The most well-known ones are the mutual coherence, the restricted isometry property (RIP), and the nullspace property (NSP). While evaluating the mutual coherence of a given matrix is easy, it has been suspected for some time that evaluating RIP and NSP is computationally intractable in general. We confirm these conject"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2081","kind":"arxiv","version":6},"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:08:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YE9Nmf+1SQsJFQTxYoeoCuRADWyAk1BZOKz1UbwRZKpKLh6vxfi6alf02FFOZKzZNp7xxG5WrCBm7lXKHDBqBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:58:14.101385Z"},"content_sha256":"15c0fc5da7036f223f948850c3be6846b2ded86975991848249f26f6a2dca6a3","schema_version":"1.0","event_id":"sha256:15c0fc5da7036f223f948850c3be6846b2ded86975991848249f26f6a2dca6a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BYF5VWWE62UMXCEDANZ7BAB6E4/bundle.json","state_url":"https://pith.science/pith/BYF5VWWE62UMXCEDANZ7BAB6E4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BYF5VWWE62UMXCEDANZ7BAB6E4/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-05-25T22:58:14Z","links":{"resolver":"https://pith.science/pith/BYF5VWWE62UMXCEDANZ7BAB6E4","bundle":"https://pith.science/pith/BYF5VWWE62UMXCEDANZ7BAB6E4/bundle.json","state":"https://pith.science/pith/BYF5VWWE62UMXCEDANZ7BAB6E4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BYF5VWWE62UMXCEDANZ7BAB6E4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BYF5VWWE62UMXCEDANZ7BAB6E4","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":"6f667d5b2d1f562a61fa735d65cabc4673a56693fd9f3c4be782d1405d268ef8","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-05-09T19:55:22Z","title_canon_sha256":"0a022e3c38e13e81178c42f8d818e875f44a8adf8136a56ed5dd3fa331f0d862"},"schema_version":"1.0","source":{"id":"1205.2081","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.2081","created_at":"2026-05-18T03:08:14Z"},{"alias_kind":"arxiv_version","alias_value":"1205.2081v6","created_at":"2026-05-18T03:08:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2081","created_at":"2026-05-18T03:08:14Z"},{"alias_kind":"pith_short_12","alias_value":"BYF5VWWE62UM","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BYF5VWWE62UMXCED","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BYF5VWWE","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:15c0fc5da7036f223f948850c3be6846b2ded86975991848249f26f6a2dca6a3","target":"graph","created_at":"2026-05-18T03:08:14Z","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":"This paper deals with the computational complexity of conditions which guarantee that the NP-hard problem of finding the sparsest solution to an underdetermined linear system can be solved by efficient algorithms. In the literature, several such conditions have been introduced. The most well-known ones are the mutual coherence, the restricted isometry property (RIP), and the nullspace property (NSP). While evaluating the mutual coherence of a given matrix is easy, it has been suspected for some time that evaluating RIP and NSP is computationally intractable in general. We confirm these conject","authors_text":"Andreas M. Tillmann, Marc E. Pfetsch","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-05-09T19:55:22Z","title":"The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2081","kind":"arxiv","version":6},"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:76c0b73f5f121db8641538065abfd0227a1f3b57a5bbdbb62b367f989e00607c","target":"record","created_at":"2026-05-18T03:08:14Z","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":"6f667d5b2d1f562a61fa735d65cabc4673a56693fd9f3c4be782d1405d268ef8","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-05-09T19:55:22Z","title_canon_sha256":"0a022e3c38e13e81178c42f8d818e875f44a8adf8136a56ed5dd3fa331f0d862"},"schema_version":"1.0","source":{"id":"1205.2081","kind":"arxiv","version":6}},"canonical_sha256":"0e0bdadac4f6a8cb88830373f0803e272e0cf1b4c71ee1fa6fb6eaae0c344730","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e0bdadac4f6a8cb88830373f0803e272e0cf1b4c71ee1fa6fb6eaae0c344730","first_computed_at":"2026-05-18T03:08:14.639587Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:08:14.639587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"phwjSKTDuCZeM4sykyfNZ9ZE5K4cnE+S2dbeixLPswCp9zsTfmRZgUHKQfeGcVucFefGPw0oZj0Foh33l0XWBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:08:14.639989Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.2081","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76c0b73f5f121db8641538065abfd0227a1f3b57a5bbdbb62b367f989e00607c","sha256:15c0fc5da7036f223f948850c3be6846b2ded86975991848249f26f6a2dca6a3"],"state_sha256":"b5ec291f46164d297fb8419e7b3aa82cf376b2fbf0332ce6af8766af06f480dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FypnC06flYPW9afdVQ3ynf+MKjWEHIzdTAJKXMQD6qJ3hHg3hK2hqB62NN4bWyZkaq8EklBPOkx8TDHJWxeFBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:58:14.104487Z","bundle_sha256":"c9a931d8336fa81939574e255bb8f0f0e0eb8eb122bd16722cad181239404121"}}