{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XJ62PRNZL6VP427WW5UE6QYUSK","short_pith_number":"pith:XJ62PRNZ","canonical_record":{"source":{"id":"1809.08055","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-21T12:15:49Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"fcd1ccb99cf55441740ba9134afc00e402bb23928a88073743b87e956ad364bb","abstract_canon_sha256":"97814115b33696d7b836237dbf0dd23148616faa7ea7e112bf2c6f18c72165b5"},"schema_version":"1.0"},"canonical_sha256":"ba7da7c5b95faafe6bf6b7684f431492b62278644cc6f0f5e3c1b7b04f11b72f","source":{"kind":"arxiv","id":"1809.08055","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.08055","created_at":"2026-05-17T23:56:52Z"},{"alias_kind":"arxiv_version","alias_value":"1809.08055v4","created_at":"2026-05-17T23:56:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08055","created_at":"2026-05-17T23:56:52Z"},{"alias_kind":"pith_short_12","alias_value":"XJ62PRNZL6VP","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XJ62PRNZL6VP427W","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XJ62PRNZ","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XJ62PRNZL6VP427WW5UE6QYUSK","target":"record","payload":{"canonical_record":{"source":{"id":"1809.08055","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-21T12:15:49Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"fcd1ccb99cf55441740ba9134afc00e402bb23928a88073743b87e956ad364bb","abstract_canon_sha256":"97814115b33696d7b836237dbf0dd23148616faa7ea7e112bf2c6f18c72165b5"},"schema_version":"1.0"},"canonical_sha256":"ba7da7c5b95faafe6bf6b7684f431492b62278644cc6f0f5e3c1b7b04f11b72f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:52.889477Z","signature_b64":"U94KXMpOMK5tEv0u1qcA6b0niivPRwFuTR6Vx4iEfF9Qo7g5BXIMPLzJvQdF/6F7kEtyRxB+lFaMiytnXLzvAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba7da7c5b95faafe6bf6b7684f431492b62278644cc6f0f5e3c1b7b04f11b72f","last_reissued_at":"2026-05-17T23:56:52.889048Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:52.889048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.08055","source_version":4,"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-17T23:56:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VH504s7Q7iyMcjOR5Ep6ypBURAZ5Oq53DhPnGn9qzKHy5AzM5SLfoEcz6tI4Wj0ySRGWRf7y5/YBrvHgiRgCAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:08:14.761905Z"},"content_sha256":"a4fd2938292cd71ca9fbad375b930929f13cfc7a7c0315e937c0fc9a9b39322d","schema_version":"1.0","event_id":"sha256:a4fd2938292cd71ca9fbad375b930929f13cfc7a7c0315e937c0fc9a9b39322d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XJ62PRNZL6VP427WW5UE6QYUSK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compressed Sensing with Adversarial Sparse Noise via L1 Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Eric Price, Sushrut Karmalkar","submitted_at":"2018-09-21T12:15:49Z","abstract_excerpt":"We present a simple and effective algorithm for the problem of \\emph{sparse robust linear regression}. In this problem, one would like to estimate a sparse vector $w^* \\in \\mathbb{R}^n$ from linear measurements corrupted by sparse noise that can arbitrarily change an adversarially chosen $\\eta$ fraction of measured responses $y$, as well as introduce bounded norm noise to the responses. For Gaussian measurements, we show that a simple algorithm based on L1 regression can successfully estimate $w^*$ for any $\\eta < \\eta_0 \\approx 0.239$, and that this threshold is tight for the algorithm. The n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08055","kind":"arxiv","version":4},"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-17T23:56:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2FsElsAMLFD6LFzVjPf9oATgAA8YzdbnKLpFod5yheoAnmPOZdqcdy2tI58kBhBtXE1d6+CApFe19+2s9v2pAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:08:14.762284Z"},"content_sha256":"2102cd1b8066ba75d6aca443e7e77980b107d1073d1fe0b2fe42e9d8a6ac46d0","schema_version":"1.0","event_id":"sha256:2102cd1b8066ba75d6aca443e7e77980b107d1073d1fe0b2fe42e9d8a6ac46d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XJ62PRNZL6VP427WW5UE6QYUSK/bundle.json","state_url":"https://pith.science/pith/XJ62PRNZL6VP427WW5UE6QYUSK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XJ62PRNZL6VP427WW5UE6QYUSK/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:08:14Z","links":{"resolver":"https://pith.science/pith/XJ62PRNZL6VP427WW5UE6QYUSK","bundle":"https://pith.science/pith/XJ62PRNZL6VP427WW5UE6QYUSK/bundle.json","state":"https://pith.science/pith/XJ62PRNZL6VP427WW5UE6QYUSK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XJ62PRNZL6VP427WW5UE6QYUSK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XJ62PRNZL6VP427WW5UE6QYUSK","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":"97814115b33696d7b836237dbf0dd23148616faa7ea7e112bf2c6f18c72165b5","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-21T12:15:49Z","title_canon_sha256":"fcd1ccb99cf55441740ba9134afc00e402bb23928a88073743b87e956ad364bb"},"schema_version":"1.0","source":{"id":"1809.08055","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.08055","created_at":"2026-05-17T23:56:52Z"},{"alias_kind":"arxiv_version","alias_value":"1809.08055v4","created_at":"2026-05-17T23:56:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08055","created_at":"2026-05-17T23:56:52Z"},{"alias_kind":"pith_short_12","alias_value":"XJ62PRNZL6VP","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XJ62PRNZL6VP427W","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XJ62PRNZ","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:2102cd1b8066ba75d6aca443e7e77980b107d1073d1fe0b2fe42e9d8a6ac46d0","target":"graph","created_at":"2026-05-17T23:56:52Z","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":"We present a simple and effective algorithm for the problem of \\emph{sparse robust linear regression}. In this problem, one would like to estimate a sparse vector $w^* \\in \\mathbb{R}^n$ from linear measurements corrupted by sparse noise that can arbitrarily change an adversarially chosen $\\eta$ fraction of measured responses $y$, as well as introduce bounded norm noise to the responses. For Gaussian measurements, we show that a simple algorithm based on L1 regression can successfully estimate $w^*$ for any $\\eta < \\eta_0 \\approx 0.239$, and that this threshold is tight for the algorithm. The n","authors_text":"Eric Price, Sushrut Karmalkar","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-21T12:15:49Z","title":"Compressed Sensing with Adversarial Sparse Noise via L1 Regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08055","kind":"arxiv","version":4},"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:a4fd2938292cd71ca9fbad375b930929f13cfc7a7c0315e937c0fc9a9b39322d","target":"record","created_at":"2026-05-17T23:56:52Z","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":"97814115b33696d7b836237dbf0dd23148616faa7ea7e112bf2c6f18c72165b5","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-21T12:15:49Z","title_canon_sha256":"fcd1ccb99cf55441740ba9134afc00e402bb23928a88073743b87e956ad364bb"},"schema_version":"1.0","source":{"id":"1809.08055","kind":"arxiv","version":4}},"canonical_sha256":"ba7da7c5b95faafe6bf6b7684f431492b62278644cc6f0f5e3c1b7b04f11b72f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba7da7c5b95faafe6bf6b7684f431492b62278644cc6f0f5e3c1b7b04f11b72f","first_computed_at":"2026-05-17T23:56:52.889048Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:52.889048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U94KXMpOMK5tEv0u1qcA6b0niivPRwFuTR6Vx4iEfF9Qo7g5BXIMPLzJvQdF/6F7kEtyRxB+lFaMiytnXLzvAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:52.889477Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.08055","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4fd2938292cd71ca9fbad375b930929f13cfc7a7c0315e937c0fc9a9b39322d","sha256:2102cd1b8066ba75d6aca443e7e77980b107d1073d1fe0b2fe42e9d8a6ac46d0"],"state_sha256":"025f2a97702782aadb1d7a2b9e2c017a3f344247e1f19e9e1e3097f44e12f4d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7NGe7AkdlY+SV2GX9JzNLa2vRoBM+AkJH6QdowJFFiSwgzKiniv8PFL91o3OQQdpocM0PnB0iUc4eFChSQSPDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:08:14.765761Z","bundle_sha256":"9a2bfa689e3b9dea3d8688031d543cb83efad811b00364ca9b26b197f2b82aa7"}}