{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:DBNDRJAAFENUDG7I6G6RGCLC2A","short_pith_number":"pith:DBNDRJAA","canonical_record":{"source":{"id":"0809.4883","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-09-29T14:01:13Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"9cde8b760d58664a1ddd35c575d6d77a5c1c71d1408ab8e52162fbb61939a3ee","abstract_canon_sha256":"26a9b1b7bd3024de0459c1079c16fae2202dd59986246ee08142aeccc473e3fe"},"schema_version":"1.0"},"canonical_sha256":"185a38a400291b419be8f1bd130962d01fe78bb4bcc0ed035008e04cf0497575","source":{"kind":"arxiv","id":"0809.4883","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0809.4883","created_at":"2026-05-18T02:24:56Z"},{"alias_kind":"arxiv_version","alias_value":"0809.4883v3","created_at":"2026-05-18T02:24:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0809.4883","created_at":"2026-05-18T02:24:56Z"},{"alias_kind":"pith_short_12","alias_value":"DBNDRJAAFENU","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"DBNDRJAAFENUDG7I","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"DBNDRJAA","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:DBNDRJAAFENUDG7I6G6RGCLC2A","target":"record","payload":{"canonical_record":{"source":{"id":"0809.4883","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-09-29T14:01:13Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"9cde8b760d58664a1ddd35c575d6d77a5c1c71d1408ab8e52162fbb61939a3ee","abstract_canon_sha256":"26a9b1b7bd3024de0459c1079c16fae2202dd59986246ee08142aeccc473e3fe"},"schema_version":"1.0"},"canonical_sha256":"185a38a400291b419be8f1bd130962d01fe78bb4bcc0ed035008e04cf0497575","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:56.958657Z","signature_b64":"BL3PSANyWntrB4/pTgNsN0xfyFxaeHga3Yw3+3cpAypJQykpusKoLmGeEijRv0Y7FDV8EMR2UJl6/iJoedDQBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"185a38a400291b419be8f1bd130962d01fe78bb4bcc0ed035008e04cf0497575","last_reissued_at":"2026-05-18T02:24:56.957881Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:56.957881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0809.4883","source_version":3,"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-18T02:24:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0c2bdfHVvJ51MLlvrXwgbA++Z1kKGwwh2TNpUl5+qjtNMWDGJH50EFddoo/3VcBdIt9YaXlcc9YLfbEUkxHCDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:06:22.353395Z"},"content_sha256":"2cf341ee54f478f7723a5180b73e73f503157625ef8004a7200a17f995280a58","schema_version":"1.0","event_id":"sha256:2cf341ee54f478f7723a5180b73e73f503157625ef8004a7200a17f995280a58"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:DBNDRJAAFENUDG7I6G6RGCLC2A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Thresholded Basis Pursuit: An LP Algorithm for Achieving Optimal Support Recovery for Sparse and Approximately Sparse Signals from Noisy Random Measurements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"M. Zhao, V. Saligrama","submitted_at":"2008-09-29T14:01:13Z","abstract_excerpt":"In this paper we present a linear programming solution for sign pattern recovery of a sparse signal from noisy random projections of the signal. We consider two types of noise models, input noise, where noise enters before the random projection; and output noise, where noise enters after the random projection. Sign pattern recovery involves the estimation of sign pattern of a sparse signal. Our idea is to pretend that no noise exists and solve the noiseless $\\ell_1$ problem, namely, $\\min \\|\\beta\\|_1 ~ s.t. ~ y=G \\beta$ and quantizing the resulting solution. We show that the quantized solution"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0809.4883","kind":"arxiv","version":3},"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-18T02:24:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z3YSuqml0Xm4L7U17bUzO/rtpYlq8nsH9WnokWL3nEMdiJzVdqkhDetqNeVp+9HGNdKs7T5+8MZeQS0o9HHCBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:06:22.353756Z"},"content_sha256":"61d7e545121057dff617d498e623b71bfd3c89bf40696824ee589369b9619244","schema_version":"1.0","event_id":"sha256:61d7e545121057dff617d498e623b71bfd3c89bf40696824ee589369b9619244"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DBNDRJAAFENUDG7I6G6RGCLC2A/bundle.json","state_url":"https://pith.science/pith/DBNDRJAAFENUDG7I6G6RGCLC2A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DBNDRJAAFENUDG7I6G6RGCLC2A/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-02T23:06:22Z","links":{"resolver":"https://pith.science/pith/DBNDRJAAFENUDG7I6G6RGCLC2A","bundle":"https://pith.science/pith/DBNDRJAAFENUDG7I6G6RGCLC2A/bundle.json","state":"https://pith.science/pith/DBNDRJAAFENUDG7I6G6RGCLC2A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DBNDRJAAFENUDG7I6G6RGCLC2A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:DBNDRJAAFENUDG7I6G6RGCLC2A","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":"26a9b1b7bd3024de0459c1079c16fae2202dd59986246ee08142aeccc473e3fe","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-09-29T14:01:13Z","title_canon_sha256":"9cde8b760d58664a1ddd35c575d6d77a5c1c71d1408ab8e52162fbb61939a3ee"},"schema_version":"1.0","source":{"id":"0809.4883","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0809.4883","created_at":"2026-05-18T02:24:56Z"},{"alias_kind":"arxiv_version","alias_value":"0809.4883v3","created_at":"2026-05-18T02:24:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0809.4883","created_at":"2026-05-18T02:24:56Z"},{"alias_kind":"pith_short_12","alias_value":"DBNDRJAAFENU","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"DBNDRJAAFENUDG7I","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"DBNDRJAA","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:61d7e545121057dff617d498e623b71bfd3c89bf40696824ee589369b9619244","target":"graph","created_at":"2026-05-18T02:24:56Z","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 this paper we present a linear programming solution for sign pattern recovery of a sparse signal from noisy random projections of the signal. We consider two types of noise models, input noise, where noise enters before the random projection; and output noise, where noise enters after the random projection. Sign pattern recovery involves the estimation of sign pattern of a sparse signal. Our idea is to pretend that no noise exists and solve the noiseless $\\ell_1$ problem, namely, $\\min \\|\\beta\\|_1 ~ s.t. ~ y=G \\beta$ and quantizing the resulting solution. We show that the quantized solution","authors_text":"M. Zhao, V. Saligrama","cross_cats":["cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-09-29T14:01:13Z","title":"Thresholded Basis Pursuit: An LP Algorithm for Achieving Optimal Support Recovery for Sparse and Approximately Sparse Signals from Noisy Random Measurements"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0809.4883","kind":"arxiv","version":3},"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:2cf341ee54f478f7723a5180b73e73f503157625ef8004a7200a17f995280a58","target":"record","created_at":"2026-05-18T02:24:56Z","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":"26a9b1b7bd3024de0459c1079c16fae2202dd59986246ee08142aeccc473e3fe","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-09-29T14:01:13Z","title_canon_sha256":"9cde8b760d58664a1ddd35c575d6d77a5c1c71d1408ab8e52162fbb61939a3ee"},"schema_version":"1.0","source":{"id":"0809.4883","kind":"arxiv","version":3}},"canonical_sha256":"185a38a400291b419be8f1bd130962d01fe78bb4bcc0ed035008e04cf0497575","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"185a38a400291b419be8f1bd130962d01fe78bb4bcc0ed035008e04cf0497575","first_computed_at":"2026-05-18T02:24:56.957881Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:56.957881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BL3PSANyWntrB4/pTgNsN0xfyFxaeHga3Yw3+3cpAypJQykpusKoLmGeEijRv0Y7FDV8EMR2UJl6/iJoedDQBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:56.958657Z","signed_message":"canonical_sha256_bytes"},"source_id":"0809.4883","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2cf341ee54f478f7723a5180b73e73f503157625ef8004a7200a17f995280a58","sha256:61d7e545121057dff617d498e623b71bfd3c89bf40696824ee589369b9619244"],"state_sha256":"64cb848dab74cccb998ec9020297363f2a251b1f9cd229258ae5512f6ab85a1a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C/dsvUVIvl0N8eA89OrpPvS25Vlc8j84tUOlJ0SxlPkJQyIehbY6SeIlUjQruYlnAUQvUSN3jBevCfYtgpN0CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T23:06:22.355676Z","bundle_sha256":"bc9cd4ba9ff79091079d8b34e796f6601137ec9b7632ea25ca65c1d0b6ccd216"}}