{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:J56XQQGKLD35OJ4Y6RWSV62O4P","short_pith_number":"pith:J56XQQGK","canonical_record":{"source":{"id":"1106.2774","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-14T18:13:40Z","cross_cats_sorted":["math.IT","stat.ML"],"title_canon_sha256":"c64a73b1bd92ca5bc5dfe03d78318a9c51fe3d8fb253da18575ce60f19dbd88c","abstract_canon_sha256":"70956b210e36c47f65d14aaa25d2d8d0b868b2bbd4b96b23d6343f18f2387bb7"},"schema_version":"1.0"},"canonical_sha256":"4f7d7840ca58f7d72798f46d2afb4ee3c026f652885708db2d0b91497ea0054d","source":{"kind":"arxiv","id":"1106.2774","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.2774","created_at":"2026-05-18T04:20:04Z"},{"alias_kind":"arxiv_version","alias_value":"1106.2774v1","created_at":"2026-05-18T04:20:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2774","created_at":"2026-05-18T04:20:04Z"},{"alias_kind":"pith_short_12","alias_value":"J56XQQGKLD35","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"J56XQQGKLD35OJ4Y","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"J56XQQGK","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:J56XQQGKLD35OJ4Y6RWSV62O4P","target":"record","payload":{"canonical_record":{"source":{"id":"1106.2774","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-14T18:13:40Z","cross_cats_sorted":["math.IT","stat.ML"],"title_canon_sha256":"c64a73b1bd92ca5bc5dfe03d78318a9c51fe3d8fb253da18575ce60f19dbd88c","abstract_canon_sha256":"70956b210e36c47f65d14aaa25d2d8d0b868b2bbd4b96b23d6343f18f2387bb7"},"schema_version":"1.0"},"canonical_sha256":"4f7d7840ca58f7d72798f46d2afb4ee3c026f652885708db2d0b91497ea0054d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:04.176000Z","signature_b64":"UbZi6k9zH9B0alHOa4tvCgxZC3z9mGjwBztWF++/xJKuG7Z7icG2AkWJRHqzYuQap6QAPhnKamLzeVojfHkcBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f7d7840ca58f7d72798f46d2afb4ee3c026f652885708db2d0b91497ea0054d","last_reissued_at":"2026-05-18T04:20:04.175598Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:04.175598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.2774","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-18T04:20:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6pt1eeF4mg22LIHTXbjWWtD/2xmW9McHRtMachODJZeiQzbXuLdyVgi3uDXVo7Qk2zcbfL5MYopXYAFxL8MBAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T04:00:00.414862Z"},"content_sha256":"f0ad7ca33b0afce798817fd587cbeceafea0d89985a61b18995d8103192e2094","schema_version":"1.0","event_id":"sha256:f0ad7ca33b0afce798817fd587cbeceafea0d89985a61b18995d8103192e2094"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:J56XQQGKLD35OJ4Y6RWSV62O4P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Orthogonal Matching Pursuit with Replacement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Ambuj Tewari, Inderjit S. Dhillon, Prateek Jain","submitted_at":"2011-06-14T18:13:40Z","abstract_excerpt":"In this paper, we consider the problem of compressed sensing where the goal is to recover almost all the sparse vectors using a small number of fixed linear measurements. For this problem, we propose a novel partial hard-thresholding operator that leads to a general family of iterative algorithms. While one extreme of the family yields well known hard thresholding algorithms like ITI (Iterative Thresholding with Inversion) and HTP (Hard Thresholding Pursuit), the other end of the spectrum leads to a novel algorithm that we call Orthogonal Matching Pursuit with Replacement (OMPR). OMPR, like th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2774","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-18T04:20:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0KW7UTCy4njNJnoLr6rNKzO1GPtZiyju5D2AAkzfWmrAuGme9yCx/u4x8lcQJa6EVvo20uqnePppgTDluERFDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T04:00:00.415453Z"},"content_sha256":"c275d643b03efee6b6f9b80d36f2f2019dfafd8961d14a121d240c878976831b","schema_version":"1.0","event_id":"sha256:c275d643b03efee6b6f9b80d36f2f2019dfafd8961d14a121d240c878976831b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J56XQQGKLD35OJ4Y6RWSV62O4P/bundle.json","state_url":"https://pith.science/pith/J56XQQGKLD35OJ4Y6RWSV62O4P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J56XQQGKLD35OJ4Y6RWSV62O4P/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-25T04:00:00Z","links":{"resolver":"https://pith.science/pith/J56XQQGKLD35OJ4Y6RWSV62O4P","bundle":"https://pith.science/pith/J56XQQGKLD35OJ4Y6RWSV62O4P/bundle.json","state":"https://pith.science/pith/J56XQQGKLD35OJ4Y6RWSV62O4P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J56XQQGKLD35OJ4Y6RWSV62O4P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:J56XQQGKLD35OJ4Y6RWSV62O4P","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":"70956b210e36c47f65d14aaa25d2d8d0b868b2bbd4b96b23d6343f18f2387bb7","cross_cats_sorted":["math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-14T18:13:40Z","title_canon_sha256":"c64a73b1bd92ca5bc5dfe03d78318a9c51fe3d8fb253da18575ce60f19dbd88c"},"schema_version":"1.0","source":{"id":"1106.2774","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.2774","created_at":"2026-05-18T04:20:04Z"},{"alias_kind":"arxiv_version","alias_value":"1106.2774v1","created_at":"2026-05-18T04:20:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2774","created_at":"2026-05-18T04:20:04Z"},{"alias_kind":"pith_short_12","alias_value":"J56XQQGKLD35","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"J56XQQGKLD35OJ4Y","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"J56XQQGK","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:c275d643b03efee6b6f9b80d36f2f2019dfafd8961d14a121d240c878976831b","target":"graph","created_at":"2026-05-18T04:20:04Z","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 consider the problem of compressed sensing where the goal is to recover almost all the sparse vectors using a small number of fixed linear measurements. For this problem, we propose a novel partial hard-thresholding operator that leads to a general family of iterative algorithms. While one extreme of the family yields well known hard thresholding algorithms like ITI (Iterative Thresholding with Inversion) and HTP (Hard Thresholding Pursuit), the other end of the spectrum leads to a novel algorithm that we call Orthogonal Matching Pursuit with Replacement (OMPR). OMPR, like th","authors_text":"Ambuj Tewari, Inderjit S. Dhillon, Prateek Jain","cross_cats":["math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-14T18:13:40Z","title":"Orthogonal Matching Pursuit with Replacement"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2774","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:f0ad7ca33b0afce798817fd587cbeceafea0d89985a61b18995d8103192e2094","target":"record","created_at":"2026-05-18T04:20:04Z","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":"70956b210e36c47f65d14aaa25d2d8d0b868b2bbd4b96b23d6343f18f2387bb7","cross_cats_sorted":["math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-14T18:13:40Z","title_canon_sha256":"c64a73b1bd92ca5bc5dfe03d78318a9c51fe3d8fb253da18575ce60f19dbd88c"},"schema_version":"1.0","source":{"id":"1106.2774","kind":"arxiv","version":1}},"canonical_sha256":"4f7d7840ca58f7d72798f46d2afb4ee3c026f652885708db2d0b91497ea0054d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f7d7840ca58f7d72798f46d2afb4ee3c026f652885708db2d0b91497ea0054d","first_computed_at":"2026-05-18T04:20:04.175598Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:20:04.175598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UbZi6k9zH9B0alHOa4tvCgxZC3z9mGjwBztWF++/xJKuG7Z7icG2AkWJRHqzYuQap6QAPhnKamLzeVojfHkcBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:20:04.176000Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.2774","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0ad7ca33b0afce798817fd587cbeceafea0d89985a61b18995d8103192e2094","sha256:c275d643b03efee6b6f9b80d36f2f2019dfafd8961d14a121d240c878976831b"],"state_sha256":"a49731f9e6df4b08eaeec42658f42d25aeb0ccbd8030b670b1fe80c1d3a3a25c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"noadpDBa+LzEFAfJ+IK/pgXhxBe8ggvPRG6uBYfzKEUrQ8jol2XZrxZrx8MPBj3W3gMhKMWZDuutTXoFuO+TDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T04:00:00.418739Z","bundle_sha256":"94c1c7c75a124c566e3a4b92df6b3c3f13ec2bb08c4107f2f25b4e876741f05d"}}