{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:ULGS2AEYLETWPJKE5IRR27VZG6","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":"1ff9ffd9c3f54791cf6fe6ed81fc422722305300e757ee40a7736c70d56f11e2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-24T04:11:42Z","title_canon_sha256":"43e822ce587974a52e90f99069d0bb9f16c41f9ff1aaf494db4fb8a36a502d29"},"schema_version":"1.0","source":{"id":"1012.5340","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.5340","created_at":"2026-05-18T04:32:35Z"},{"alias_kind":"arxiv_version","alias_value":"1012.5340v1","created_at":"2026-05-18T04:32:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.5340","created_at":"2026-05-18T04:32:35Z"},{"alias_kind":"pith_short_12","alias_value":"ULGS2AEYLETW","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"ULGS2AEYLETWPJKE","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"ULGS2AEY","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:dbecad6ad055895bba05eb130ac7a3d092fbfc05836a46ac2f0b2aef189331f6","target":"graph","created_at":"2026-05-18T04:32: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 many compressed sensing applications, linear programming (LP) has been used to reconstruct a sparse signal. When observation is noisy, the LP formulation is extended to allow an inequality constraint and the solution is dependent on a parameter $\\delta$, related to the observation noise level. Recently, some researchers also considered quadratic programming (QP) for compressed sensing signal reconstruction and the solution in this case is dependent on a Lagrange multiplier $\\beta$. In this work, we investigated the relation between $\\delta$ and $\\beta$ and derived an upper and a lower bound","authors_text":"Guangwu Xu, Jun Wang, Jun Zhang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-24T04:11:42Z","title":"Relations between $\\beta$ and $\\delta$ for QP and LP in Compressed Sensing Computations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.5340","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:1c740f0c81a6ede009cbd3800576ec46bd998f2c17a438cab668da494c2fe998","target":"record","created_at":"2026-05-18T04:32: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":"1ff9ffd9c3f54791cf6fe6ed81fc422722305300e757ee40a7736c70d56f11e2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-24T04:11:42Z","title_canon_sha256":"43e822ce587974a52e90f99069d0bb9f16c41f9ff1aaf494db4fb8a36a502d29"},"schema_version":"1.0","source":{"id":"1012.5340","kind":"arxiv","version":1}},"canonical_sha256":"a2cd2d0098592767a544ea231d7eb93786e511c223495b88ff5c9190f21c5da8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2cd2d0098592767a544ea231d7eb93786e511c223495b88ff5c9190f21c5da8","first_computed_at":"2026-05-18T04:32:35.065622Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:32:35.065622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p5AJ1GdYXwni54Z2LRR4YrQmYYnO2qYgLpDhUpvXs33VGD35Ro101VmDBwMZteE1uoy+U5dc7cJymW5aE4MODA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:32:35.066069Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.5340","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c740f0c81a6ede009cbd3800576ec46bd998f2c17a438cab668da494c2fe998","sha256:dbecad6ad055895bba05eb130ac7a3d092fbfc05836a46ac2f0b2aef189331f6"],"state_sha256":"ef8358440ba45421188f9d9c8ebb1356676bb31486098b51afca512d2adecc60"}