{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BSFMGO35MEQCPICLKLBUOR23BR","short_pith_number":"pith:BSFMGO35","canonical_record":{"source":{"id":"1603.01507","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-04T15:41:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1cbf08e1ebaa26a1928a3525d46894635f8c479d65b99fe07edf42605b0bd52e","abstract_canon_sha256":"fb736f97c172a3e8a66316ffdcca38ced5b99908beafa328c2e1870154ce1b3e"},"schema_version":"1.0"},"canonical_sha256":"0c8ac33b7d612027a04b52c347475b0c719f318f06d302d912b42678371c4850","source":{"kind":"arxiv","id":"1603.01507","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.01507","created_at":"2026-05-18T00:54:47Z"},{"alias_kind":"arxiv_version","alias_value":"1603.01507v2","created_at":"2026-05-18T00:54:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01507","created_at":"2026-05-18T00:54:47Z"},{"alias_kind":"pith_short_12","alias_value":"BSFMGO35MEQC","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BSFMGO35MEQCPICL","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BSFMGO35","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BSFMGO35MEQCPICLKLBUOR23BR","target":"record","payload":{"canonical_record":{"source":{"id":"1603.01507","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-04T15:41:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1cbf08e1ebaa26a1928a3525d46894635f8c479d65b99fe07edf42605b0bd52e","abstract_canon_sha256":"fb736f97c172a3e8a66316ffdcca38ced5b99908beafa328c2e1870154ce1b3e"},"schema_version":"1.0"},"canonical_sha256":"0c8ac33b7d612027a04b52c347475b0c719f318f06d302d912b42678371c4850","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:47.929356Z","signature_b64":"u06LNZaov/y6iuXLfUCl2gMiTum7wrdpQycxWtgL5jCQQyBB62dyn6GNDS59LbF+7MK8R3T+jIPnobYj2zT/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c8ac33b7d612027a04b52c347475b0c719f318f06d302d912b42678371c4850","last_reissued_at":"2026-05-18T00:54:47.928890Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:47.928890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.01507","source_version":2,"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-18T00:54:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bHfSOoGYa2frPtvnsSchqkho68z3ebK6ZRn/x/PF8UvisSnfibcMTcEJBcWn5tMcaVn+zYPeOntvmQ9cIDyoDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:21:33.383253Z"},"content_sha256":"f77c64b0ff3c6440bf938b82886b4b8047d38f1783925afccd25e2c385dae8af","schema_version":"1.0","event_id":"sha256:f77c64b0ff3c6440bf938b82886b4b8047d38f1783925afccd25e2c385dae8af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BSFMGO35MEQCPICLKLBUOR23BR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Novel Sufficient Condition for Generalized Orthogonal Matching Pursuit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dongfang Li, Jinming Wen, Xiaohu Tang, Zhengchun Zhou","submitted_at":"2016-03-04T15:41:33Z","abstract_excerpt":"Generalized orthogonal matching pursuit (gOMP), also called orthogonal multi-matching pursuit, is an extension of OMP in the sense that $N\\geq1$ indices are identified per iteration. In this paper, we show that if the restricted isometry constant (RIC) $\\delta_{NK+1}$ of a sensing matrix $\\A$ satisfies $\\delta_{NK+1} < 1/\\sqrt {K/N+1}$, then under a condition on the signal-to-noise ratio, gOMP identifies at least one index in the support of any $K$-sparse signal $\\x$ from $\\y=\\A\\x+\\v$ at each iteration, where $\\v$ is a noise vector. Surprisingly, this condition does not require $N\\leq K$ which"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01507","kind":"arxiv","version":2},"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-18T00:54:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3WHZmBtLPKu7zjEU49YyOfLFYTmR7eIKsyPBu1NLofWRt/JpD/+a3yk4x+r5GEEuxd0NzxPVEc6DYWtmAXmqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:21:33.383789Z"},"content_sha256":"c6153ff9f0c64b21b198b8f3fc804a0d649d53cbf18f0954cee72863d446cecb","schema_version":"1.0","event_id":"sha256:c6153ff9f0c64b21b198b8f3fc804a0d649d53cbf18f0954cee72863d446cecb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BSFMGO35MEQCPICLKLBUOR23BR/bundle.json","state_url":"https://pith.science/pith/BSFMGO35MEQCPICLKLBUOR23BR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BSFMGO35MEQCPICLKLBUOR23BR/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-30T09:21:33Z","links":{"resolver":"https://pith.science/pith/BSFMGO35MEQCPICLKLBUOR23BR","bundle":"https://pith.science/pith/BSFMGO35MEQCPICLKLBUOR23BR/bundle.json","state":"https://pith.science/pith/BSFMGO35MEQCPICLKLBUOR23BR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BSFMGO35MEQCPICLKLBUOR23BR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BSFMGO35MEQCPICLKLBUOR23BR","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":"fb736f97c172a3e8a66316ffdcca38ced5b99908beafa328c2e1870154ce1b3e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-04T15:41:33Z","title_canon_sha256":"1cbf08e1ebaa26a1928a3525d46894635f8c479d65b99fe07edf42605b0bd52e"},"schema_version":"1.0","source":{"id":"1603.01507","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.01507","created_at":"2026-05-18T00:54:47Z"},{"alias_kind":"arxiv_version","alias_value":"1603.01507v2","created_at":"2026-05-18T00:54:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01507","created_at":"2026-05-18T00:54:47Z"},{"alias_kind":"pith_short_12","alias_value":"BSFMGO35MEQC","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BSFMGO35MEQCPICL","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BSFMGO35","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:c6153ff9f0c64b21b198b8f3fc804a0d649d53cbf18f0954cee72863d446cecb","target":"graph","created_at":"2026-05-18T00:54:47Z","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":"Generalized orthogonal matching pursuit (gOMP), also called orthogonal multi-matching pursuit, is an extension of OMP in the sense that $N\\geq1$ indices are identified per iteration. In this paper, we show that if the restricted isometry constant (RIC) $\\delta_{NK+1}$ of a sensing matrix $\\A$ satisfies $\\delta_{NK+1} < 1/\\sqrt {K/N+1}$, then under a condition on the signal-to-noise ratio, gOMP identifies at least one index in the support of any $K$-sparse signal $\\x$ from $\\y=\\A\\x+\\v$ at each iteration, where $\\v$ is a noise vector. Surprisingly, this condition does not require $N\\leq K$ which","authors_text":"Dongfang Li, Jinming Wen, Xiaohu Tang, Zhengchun Zhou","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-04T15:41:33Z","title":"A Novel Sufficient Condition for Generalized Orthogonal Matching Pursuit"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01507","kind":"arxiv","version":2},"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:f77c64b0ff3c6440bf938b82886b4b8047d38f1783925afccd25e2c385dae8af","target":"record","created_at":"2026-05-18T00:54:47Z","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":"fb736f97c172a3e8a66316ffdcca38ced5b99908beafa328c2e1870154ce1b3e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-04T15:41:33Z","title_canon_sha256":"1cbf08e1ebaa26a1928a3525d46894635f8c479d65b99fe07edf42605b0bd52e"},"schema_version":"1.0","source":{"id":"1603.01507","kind":"arxiv","version":2}},"canonical_sha256":"0c8ac33b7d612027a04b52c347475b0c719f318f06d302d912b42678371c4850","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c8ac33b7d612027a04b52c347475b0c719f318f06d302d912b42678371c4850","first_computed_at":"2026-05-18T00:54:47.928890Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:47.928890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u06LNZaov/y6iuXLfUCl2gMiTum7wrdpQycxWtgL5jCQQyBB62dyn6GNDS59LbF+7MK8R3T+jIPnobYj2zT/AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:47.929356Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.01507","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f77c64b0ff3c6440bf938b82886b4b8047d38f1783925afccd25e2c385dae8af","sha256:c6153ff9f0c64b21b198b8f3fc804a0d649d53cbf18f0954cee72863d446cecb"],"state_sha256":"85947a2cb231e3cd2bca032d80a1894ac33cafa664a81a79c55ed2da9ed332ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e+A+ekf8r8sboWc6oPONRD5I9Z0P1xEPDEFJFLoIgAJCSipBOsoHanZ4Jqs2EIQCaGrlXmGxCFFZtWuCUTMpAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:21:33.386822Z","bundle_sha256":"714d72308feb5d19775963f5eecf450c0af57510eb98076270aa94fa3b380db7"}}