{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:KQJPWWRGBA2SYOOIUQNRB3EQ4X","short_pith_number":"pith:KQJPWWRG","canonical_record":{"source":{"id":"1010.5423","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-10-26T15:12:51Z","cross_cats_sorted":[],"title_canon_sha256":"07172b89b411ed9ccbb20cb10f2387f03259ec70025d91d25d6bf8a2e9e3e699","abstract_canon_sha256":"01f1f798102439c094c88f3c9ada37d85aef0266525114e187abff03647ce284"},"schema_version":"1.0"},"canonical_sha256":"5412fb5a2608352c39c8a41b10ec90e5df1cd54b4fbfaed757aaee394bcfab7e","source":{"kind":"arxiv","id":"1010.5423","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.5423","created_at":"2026-05-18T04:38:38Z"},{"alias_kind":"arxiv_version","alias_value":"1010.5423v1","created_at":"2026-05-18T04:38:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5423","created_at":"2026-05-18T04:38:38Z"},{"alias_kind":"pith_short_12","alias_value":"KQJPWWRGBA2S","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"KQJPWWRGBA2SYOOI","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"KQJPWWRG","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:KQJPWWRGBA2SYOOIUQNRB3EQ4X","target":"record","payload":{"canonical_record":{"source":{"id":"1010.5423","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-10-26T15:12:51Z","cross_cats_sorted":[],"title_canon_sha256":"07172b89b411ed9ccbb20cb10f2387f03259ec70025d91d25d6bf8a2e9e3e699","abstract_canon_sha256":"01f1f798102439c094c88f3c9ada37d85aef0266525114e187abff03647ce284"},"schema_version":"1.0"},"canonical_sha256":"5412fb5a2608352c39c8a41b10ec90e5df1cd54b4fbfaed757aaee394bcfab7e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:38:38.794363Z","signature_b64":"/Lmzsrotp6uCf8E+M+CqLFAr2RG7Jo89eOETxquV1fGElhw5Tw0C+uSaWBWzpLRUhUfdKck4resJV+knfCE4Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5412fb5a2608352c39c8a41b10ec90e5df1cd54b4fbfaed757aaee394bcfab7e","last_reissued_at":"2026-05-18T04:38:38.793730Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:38:38.793730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.5423","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:38:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2oOUxzkzFmS5MkCiB3oKrwRRPBjLnfx1mAyyAfhRE2qPSYzg5c9s/uQNAbjXPOunbvP5SVjPEkjGRpcf+UZWDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T03:50:04.280685Z"},"content_sha256":"29f821378f604f9249519fae68729e15e5f86363c3df5e4c37cd4cfcad65737f","schema_version":"1.0","event_id":"sha256:29f821378f604f9249519fae68729e15e5f86363c3df5e4c37cd4cfcad65737f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:KQJPWWRGBA2SYOOIUQNRB3EQ4X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Super Greedy Type Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Entao Liu, Vladimir N. Temlyakov","submitted_at":"2010-10-26T15:12:51Z","abstract_excerpt":"We study greedy-type algorithms such that at a greedy step we pick several dictionary elements contrary to a single dictionary element in standard greedy-type algorithms. We call such greedy algorithms {\\it super greedy algorithms}. The idea of picking several elements at a greedy step of the algorithm is not new. Recently, we observed the following new phenomenon. For incoherent dictionaries these new type of algorithms (super greedy algorithms) provide the same (in the sense of order) upper bound for the error as their analogues from the standard greedy algorithms. The super greedy algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5423","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:38:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ndLsa8kVPQVJs6s5T6tM0icmGiaFxOWeh2Fkp86zRVTPZ3SWdwVbvDRQaAiI0dBbhu2zcE+N6AozeTUugUAlAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T03:50:04.281030Z"},"content_sha256":"3019310d4e825c4eadb27ac95d04ab95c7be97cfd82984ded4035968929eaf1a","schema_version":"1.0","event_id":"sha256:3019310d4e825c4eadb27ac95d04ab95c7be97cfd82984ded4035968929eaf1a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KQJPWWRGBA2SYOOIUQNRB3EQ4X/bundle.json","state_url":"https://pith.science/pith/KQJPWWRGBA2SYOOIUQNRB3EQ4X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KQJPWWRGBA2SYOOIUQNRB3EQ4X/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-27T03:50:04Z","links":{"resolver":"https://pith.science/pith/KQJPWWRGBA2SYOOIUQNRB3EQ4X","bundle":"https://pith.science/pith/KQJPWWRGBA2SYOOIUQNRB3EQ4X/bundle.json","state":"https://pith.science/pith/KQJPWWRGBA2SYOOIUQNRB3EQ4X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KQJPWWRGBA2SYOOIUQNRB3EQ4X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:KQJPWWRGBA2SYOOIUQNRB3EQ4X","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":"01f1f798102439c094c88f3c9ada37d85aef0266525114e187abff03647ce284","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-10-26T15:12:51Z","title_canon_sha256":"07172b89b411ed9ccbb20cb10f2387f03259ec70025d91d25d6bf8a2e9e3e699"},"schema_version":"1.0","source":{"id":"1010.5423","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.5423","created_at":"2026-05-18T04:38:38Z"},{"alias_kind":"arxiv_version","alias_value":"1010.5423v1","created_at":"2026-05-18T04:38:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5423","created_at":"2026-05-18T04:38:38Z"},{"alias_kind":"pith_short_12","alias_value":"KQJPWWRGBA2S","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"KQJPWWRGBA2SYOOI","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"KQJPWWRG","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:3019310d4e825c4eadb27ac95d04ab95c7be97cfd82984ded4035968929eaf1a","target":"graph","created_at":"2026-05-18T04:38:38Z","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 study greedy-type algorithms such that at a greedy step we pick several dictionary elements contrary to a single dictionary element in standard greedy-type algorithms. We call such greedy algorithms {\\it super greedy algorithms}. The idea of picking several elements at a greedy step of the algorithm is not new. Recently, we observed the following new phenomenon. For incoherent dictionaries these new type of algorithms (super greedy algorithms) provide the same (in the sense of order) upper bound for the error as their analogues from the standard greedy algorithms. The super greedy algorithm","authors_text":"Entao Liu, Vladimir N. Temlyakov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-10-26T15:12:51Z","title":"Super Greedy Type Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5423","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:29f821378f604f9249519fae68729e15e5f86363c3df5e4c37cd4cfcad65737f","target":"record","created_at":"2026-05-18T04:38:38Z","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":"01f1f798102439c094c88f3c9ada37d85aef0266525114e187abff03647ce284","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-10-26T15:12:51Z","title_canon_sha256":"07172b89b411ed9ccbb20cb10f2387f03259ec70025d91d25d6bf8a2e9e3e699"},"schema_version":"1.0","source":{"id":"1010.5423","kind":"arxiv","version":1}},"canonical_sha256":"5412fb5a2608352c39c8a41b10ec90e5df1cd54b4fbfaed757aaee394bcfab7e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5412fb5a2608352c39c8a41b10ec90e5df1cd54b4fbfaed757aaee394bcfab7e","first_computed_at":"2026-05-18T04:38:38.793730Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:38:38.793730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/Lmzsrotp6uCf8E+M+CqLFAr2RG7Jo89eOETxquV1fGElhw5Tw0C+uSaWBWzpLRUhUfdKck4resJV+knfCE4Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:38:38.794363Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.5423","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:29f821378f604f9249519fae68729e15e5f86363c3df5e4c37cd4cfcad65737f","sha256:3019310d4e825c4eadb27ac95d04ab95c7be97cfd82984ded4035968929eaf1a"],"state_sha256":"69a544bdfab093bad54144e0a5f18dd5ffa7cc97f9b409cc46621ce4ea4d112f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CE2USmM134aY146Qdb1uKlbi9nNBHKzKABJRDATYq+A3Le+ydVx9NHqmgYPvBVjepLaTD3iEz8MLzEB4XrwWBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T03:50:04.282984Z","bundle_sha256":"c4a6ed3ac8cbbdfc7053018d16dba831818253c1f2d0941dc92a442c548505f4"}}