{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:ELFQ7IT2GVTTYAB7V3R52YYATY","short_pith_number":"pith:ELFQ7IT2","canonical_record":{"source":{"id":"2502.13432","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2025-02-19T05:07:50Z","cross_cats_sorted":["cs.NA","math.FA"],"title_canon_sha256":"1abedd51f5d2b9f8f7709cc9d71118f9177ca50a5f250937c412ea44ab5eb309","abstract_canon_sha256":"21c50c43a038156757f4d25d7ea4a1d666d91a9cad5469d9403e518270a56f05"},"schema_version":"1.0"},"canonical_sha256":"22cb0fa27a35673c003faee3dd63009e3e4108d1c5db9327344dc5b458482aeb","source":{"kind":"arxiv","id":"2502.13432","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.13432","created_at":"2026-07-05T10:16:47Z"},{"alias_kind":"arxiv_version","alias_value":"2502.13432v1","created_at":"2026-07-05T10:16:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.13432","created_at":"2026-07-05T10:16:47Z"},{"alias_kind":"pith_short_12","alias_value":"ELFQ7IT2GVTT","created_at":"2026-07-05T10:16:47Z"},{"alias_kind":"pith_short_16","alias_value":"ELFQ7IT2GVTTYAB7","created_at":"2026-07-05T10:16:47Z"},{"alias_kind":"pith_short_8","alias_value":"ELFQ7IT2","created_at":"2026-07-05T10:16:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:ELFQ7IT2GVTTYAB7V3R52YYATY","target":"record","payload":{"canonical_record":{"source":{"id":"2502.13432","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2025-02-19T05:07:50Z","cross_cats_sorted":["cs.NA","math.FA"],"title_canon_sha256":"1abedd51f5d2b9f8f7709cc9d71118f9177ca50a5f250937c412ea44ab5eb309","abstract_canon_sha256":"21c50c43a038156757f4d25d7ea4a1d666d91a9cad5469d9403e518270a56f05"},"schema_version":"1.0"},"canonical_sha256":"22cb0fa27a35673c003faee3dd63009e3e4108d1c5db9327344dc5b458482aeb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:16:47.146293Z","signature_b64":"1BMpxY12395cPb/OHQuUXrtE3MEyfh/OyT4IBG/a52VLeA8WCVUh+2aqwZ3y1+asuvw8af6i5hwFAThbER5cDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22cb0fa27a35673c003faee3dd63009e3e4108d1c5db9327344dc5b458482aeb","last_reissued_at":"2026-07-05T10:16:47.145853Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:16:47.145853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.13432","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-07-05T10:16:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BIXht9Ab8tQ6LoMSuGWx7g7StGj2uZYVo4N2Pw8AeHE1O+zzfTI1hDfko53GhzpqCAyRcjw3XOE87OLCgk7VDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T23:45:08.187052Z"},"content_sha256":"c31cab84b307d1a8c6a73e73962efc99c7aa014fec1c2f7c2904630c17968436","schema_version":"1.0","event_id":"sha256:c31cab84b307d1a8c6a73e73962efc99c7aa014fec1c2f7c2904630c17968436"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:ELFQ7IT2GVTTYAB7V3R52YYATY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Brief introduction in greedy approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.FA"],"primary_cat":"math.NA","authors_text":"V. Temlyakov","submitted_at":"2025-02-19T05:07:50Z","abstract_excerpt":"Sparse approximation is important in many applications because of concise form of an approximant and good accuracy guarantees. The theory of compressed sensing, which proved to be very useful in the image processing and data sciences, is based on the concept of sparsity. A fundamental issue of sparse approximation is the problem of construction of efficient algorithms, which provide good approximation. It turns out that greedy algorithms with respect to dictionaries are very good from this point of view. They are simple in implementation and there are well developed theoretical guarantees of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.13432","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.13432/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T10:16:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iZTL2sOhEMyIpy5fHC60G8HeeDhqwtyfZg6e4KeVWBhcCOZn6lW+CuyZ8m5x0Bucj1s8D9v/frvi8U4rxdSXAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T23:45:08.187609Z"},"content_sha256":"6d0f534754951acf906dd9d9353e4aa6e99a63e8743361541fdcfc48b21b1f6f","schema_version":"1.0","event_id":"sha256:6d0f534754951acf906dd9d9353e4aa6e99a63e8743361541fdcfc48b21b1f6f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ELFQ7IT2GVTTYAB7V3R52YYATY/bundle.json","state_url":"https://pith.science/pith/ELFQ7IT2GVTTYAB7V3R52YYATY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ELFQ7IT2GVTTYAB7V3R52YYATY/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-08-16T23:45:08Z","links":{"resolver":"https://pith.science/pith/ELFQ7IT2GVTTYAB7V3R52YYATY","bundle":"https://pith.science/pith/ELFQ7IT2GVTTYAB7V3R52YYATY/bundle.json","state":"https://pith.science/pith/ELFQ7IT2GVTTYAB7V3R52YYATY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ELFQ7IT2GVTTYAB7V3R52YYATY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ELFQ7IT2GVTTYAB7V3R52YYATY","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":"21c50c43a038156757f4d25d7ea4a1d666d91a9cad5469d9403e518270a56f05","cross_cats_sorted":["cs.NA","math.FA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2025-02-19T05:07:50Z","title_canon_sha256":"1abedd51f5d2b9f8f7709cc9d71118f9177ca50a5f250937c412ea44ab5eb309"},"schema_version":"1.0","source":{"id":"2502.13432","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.13432","created_at":"2026-07-05T10:16:47Z"},{"alias_kind":"arxiv_version","alias_value":"2502.13432v1","created_at":"2026-07-05T10:16:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.13432","created_at":"2026-07-05T10:16:47Z"},{"alias_kind":"pith_short_12","alias_value":"ELFQ7IT2GVTT","created_at":"2026-07-05T10:16:47Z"},{"alias_kind":"pith_short_16","alias_value":"ELFQ7IT2GVTTYAB7","created_at":"2026-07-05T10:16:47Z"},{"alias_kind":"pith_short_8","alias_value":"ELFQ7IT2","created_at":"2026-07-05T10:16:47Z"}],"graph_snapshots":[{"event_id":"sha256:6d0f534754951acf906dd9d9353e4aa6e99a63e8743361541fdcfc48b21b1f6f","target":"graph","created_at":"2026-07-05T10:16: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2502.13432/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Sparse approximation is important in many applications because of concise form of an approximant and good accuracy guarantees. The theory of compressed sensing, which proved to be very useful in the image processing and data sciences, is based on the concept of sparsity. A fundamental issue of sparse approximation is the problem of construction of efficient algorithms, which provide good approximation. It turns out that greedy algorithms with respect to dictionaries are very good from this point of view. They are simple in implementation and there are well developed theoretical guarantees of t","authors_text":"V. Temlyakov","cross_cats":["cs.NA","math.FA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2025-02-19T05:07:50Z","title":"Brief introduction in greedy approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.13432","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:c31cab84b307d1a8c6a73e73962efc99c7aa014fec1c2f7c2904630c17968436","target":"record","created_at":"2026-07-05T10:16: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":"21c50c43a038156757f4d25d7ea4a1d666d91a9cad5469d9403e518270a56f05","cross_cats_sorted":["cs.NA","math.FA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2025-02-19T05:07:50Z","title_canon_sha256":"1abedd51f5d2b9f8f7709cc9d71118f9177ca50a5f250937c412ea44ab5eb309"},"schema_version":"1.0","source":{"id":"2502.13432","kind":"arxiv","version":1}},"canonical_sha256":"22cb0fa27a35673c003faee3dd63009e3e4108d1c5db9327344dc5b458482aeb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22cb0fa27a35673c003faee3dd63009e3e4108d1c5db9327344dc5b458482aeb","first_computed_at":"2026-07-05T10:16:47.145853Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:16:47.145853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1BMpxY12395cPb/OHQuUXrtE3MEyfh/OyT4IBG/a52VLeA8WCVUh+2aqwZ3y1+asuvw8af6i5hwFAThbER5cDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:16:47.146293Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.13432","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c31cab84b307d1a8c6a73e73962efc99c7aa014fec1c2f7c2904630c17968436","sha256:6d0f534754951acf906dd9d9353e4aa6e99a63e8743361541fdcfc48b21b1f6f"],"state_sha256":"77647c70e6ce1049fa0047a448bb620aac3bd05686c9b98d975c7e3551610e06"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hBa7Rd0S1wTT+SeesPcJ7MhrNqTthhyOq3uEjWXofyOIjZdqwvul3WR8xNZ9r1ER86cLh5sNK9NPyg6jmpb7Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T23:45:08.192969Z","bundle_sha256":"2847deae08e36a310ed30fcb1ec581cd59f44ca1ac82401694a540c8d3dbeb57"}}