{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DWRAR7X2PFISDDV3YEXX4CRFUZ","short_pith_number":"pith:DWRAR7X2","canonical_record":{"source":{"id":"1309.2460","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-10T11:24:24Z","cross_cats_sorted":["cs.CG","math.CO"],"title_canon_sha256":"e521291291dd200ffd4f02379fd04f731f86a2c714ee5d05c6e574c3da452df7","abstract_canon_sha256":"7e6cefb5f7eaf10a3b2a4974ac5fe80158184179f9bb933809245155f75be0e3"},"schema_version":"1.0"},"canonical_sha256":"1da208fefa7951218ebbc12f7e0a25a655a834cb27a84b119e04fcf86c6c456c","source":{"kind":"arxiv","id":"1309.2460","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.2460","created_at":"2026-05-18T03:13:44Z"},{"alias_kind":"arxiv_version","alias_value":"1309.2460v1","created_at":"2026-05-18T03:13:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.2460","created_at":"2026-05-18T03:13:44Z"},{"alias_kind":"pith_short_12","alias_value":"DWRAR7X2PFIS","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DWRAR7X2PFISDDV3","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DWRAR7X2","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DWRAR7X2PFISDDV3YEXX4CRFUZ","target":"record","payload":{"canonical_record":{"source":{"id":"1309.2460","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-10T11:24:24Z","cross_cats_sorted":["cs.CG","math.CO"],"title_canon_sha256":"e521291291dd200ffd4f02379fd04f731f86a2c714ee5d05c6e574c3da452df7","abstract_canon_sha256":"7e6cefb5f7eaf10a3b2a4974ac5fe80158184179f9bb933809245155f75be0e3"},"schema_version":"1.0"},"canonical_sha256":"1da208fefa7951218ebbc12f7e0a25a655a834cb27a84b119e04fcf86c6c456c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:44.604301Z","signature_b64":"irT3IGDK4mhxMta7VXeeTyOJpf63xILaTRK1eOh8u5GCOW2xOX5sr0mHHC2pCHwO8CYMFjM21b5DLuGgQuf/DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1da208fefa7951218ebbc12f7e0a25a655a834cb27a84b119e04fcf86c6c456c","last_reissued_at":"2026-05-18T03:13:44.603598Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:44.603598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.2460","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-18T03:13:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YAjCol5NGd3J9NwWOQcW4nckOA3dM4/dUOsfhcNwHzC8UNaiOugrBpqCu4+jQZOajSCQF+y1RKV8SIWrvicmAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:48:02.672016Z"},"content_sha256":"9a676e299fab7797ce377c1addb7e170c73fde01a4c8472140631294e10a9893","schema_version":"1.0","event_id":"sha256:9a676e299fab7797ce377c1addb7e170c73fde01a4c8472140631294e10a9893"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DWRAR7X2PFISDDV3YEXX4CRFUZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing and Analyzing Recoverable Supports for Sparse Reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.CO"],"primary_cat":"math.OC","authors_text":"Christian Kruschel, Dirk A. Lorenz","submitted_at":"2013-09-10T11:24:24Z","abstract_excerpt":"Designing computational experiments involving $\\ell_1$ minimization with linear constraints in a finite-dimensional, real-valued space for receiving a sparse solution with a precise number $k$ of nonzero entries is, in general, difficult. Several conditions were introduced which guarantee that, for small $k$ and for certain matrices, simply placing entries with desired characteristics on a randomly chosen support will produce vectors which can be recovered by $\\ell_1$ minimization.\n  In this work, we consider the case of large $k$ and propose both a methodology to quickly check whether a given"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.2460","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-18T03:13:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OOsqPSlmewml/YTb3RLqgnP6BUwC4lxIQlCuWwr8dxXEKwdbAkFsZoswEwn/BzVOOID71D6tv/j92d3PpXd7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:48:02.672667Z"},"content_sha256":"5c2de091b8b965f6811873af92445afa298b556044c5e9d2662467e982d25434","schema_version":"1.0","event_id":"sha256:5c2de091b8b965f6811873af92445afa298b556044c5e9d2662467e982d25434"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DWRAR7X2PFISDDV3YEXX4CRFUZ/bundle.json","state_url":"https://pith.science/pith/DWRAR7X2PFISDDV3YEXX4CRFUZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DWRAR7X2PFISDDV3YEXX4CRFUZ/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-29T22:48:02Z","links":{"resolver":"https://pith.science/pith/DWRAR7X2PFISDDV3YEXX4CRFUZ","bundle":"https://pith.science/pith/DWRAR7X2PFISDDV3YEXX4CRFUZ/bundle.json","state":"https://pith.science/pith/DWRAR7X2PFISDDV3YEXX4CRFUZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DWRAR7X2PFISDDV3YEXX4CRFUZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DWRAR7X2PFISDDV3YEXX4CRFUZ","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":"7e6cefb5f7eaf10a3b2a4974ac5fe80158184179f9bb933809245155f75be0e3","cross_cats_sorted":["cs.CG","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-10T11:24:24Z","title_canon_sha256":"e521291291dd200ffd4f02379fd04f731f86a2c714ee5d05c6e574c3da452df7"},"schema_version":"1.0","source":{"id":"1309.2460","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.2460","created_at":"2026-05-18T03:13:44Z"},{"alias_kind":"arxiv_version","alias_value":"1309.2460v1","created_at":"2026-05-18T03:13:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.2460","created_at":"2026-05-18T03:13:44Z"},{"alias_kind":"pith_short_12","alias_value":"DWRAR7X2PFIS","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DWRAR7X2PFISDDV3","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DWRAR7X2","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:5c2de091b8b965f6811873af92445afa298b556044c5e9d2662467e982d25434","target":"graph","created_at":"2026-05-18T03:13:44Z","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":"Designing computational experiments involving $\\ell_1$ minimization with linear constraints in a finite-dimensional, real-valued space for receiving a sparse solution with a precise number $k$ of nonzero entries is, in general, difficult. Several conditions were introduced which guarantee that, for small $k$ and for certain matrices, simply placing entries with desired characteristics on a randomly chosen support will produce vectors which can be recovered by $\\ell_1$ minimization.\n  In this work, we consider the case of large $k$ and propose both a methodology to quickly check whether a given","authors_text":"Christian Kruschel, Dirk A. Lorenz","cross_cats":["cs.CG","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-10T11:24:24Z","title":"Computing and Analyzing Recoverable Supports for Sparse Reconstruction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.2460","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:9a676e299fab7797ce377c1addb7e170c73fde01a4c8472140631294e10a9893","target":"record","created_at":"2026-05-18T03:13:44Z","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":"7e6cefb5f7eaf10a3b2a4974ac5fe80158184179f9bb933809245155f75be0e3","cross_cats_sorted":["cs.CG","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-10T11:24:24Z","title_canon_sha256":"e521291291dd200ffd4f02379fd04f731f86a2c714ee5d05c6e574c3da452df7"},"schema_version":"1.0","source":{"id":"1309.2460","kind":"arxiv","version":1}},"canonical_sha256":"1da208fefa7951218ebbc12f7e0a25a655a834cb27a84b119e04fcf86c6c456c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1da208fefa7951218ebbc12f7e0a25a655a834cb27a84b119e04fcf86c6c456c","first_computed_at":"2026-05-18T03:13:44.603598Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:44.603598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"irT3IGDK4mhxMta7VXeeTyOJpf63xILaTRK1eOh8u5GCOW2xOX5sr0mHHC2pCHwO8CYMFjM21b5DLuGgQuf/DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:44.604301Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.2460","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a676e299fab7797ce377c1addb7e170c73fde01a4c8472140631294e10a9893","sha256:5c2de091b8b965f6811873af92445afa298b556044c5e9d2662467e982d25434"],"state_sha256":"3162ad2f15ead2053409741976d94ffa5bfee6e8bb051af6db12af350ec65feb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mCnvcvCXWAoWLb3EhQBP6aICAJLNUkawb6nUXmHccSf1Pa6dAw4sIMqstCbBSmgmEq3EBgdXH01ZxN9B0onhDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T22:48:02.676244Z","bundle_sha256":"1a7ab7262e320ce73164e67ab6321fa330d2f8a57c44b0fecbd44b71153cc0ec"}}