{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:W7ZNZX77XOANPXK2BRC262FQTG","short_pith_number":"pith:W7ZNZX77","schema_version":"1.0","canonical_sha256":"b7f2dcdfffbb80d7dd5a0c45af68b099815a33a2951d330cb4c6f60d51703daf","source":{"kind":"arxiv","id":"0910.1202","version":1},"attestation_state":"computed","paper":{"title":"Derivation of an upper bound of the constant in the error bound for a near best m-term approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Evgeny Spodarev, Hans-Peter Scheffler, Wolfgang Karcher","submitted_at":"2009-10-07T09:54:14Z","abstract_excerpt":"In the paper \"The best m-term approximation and greedy algorithms\" (V. N. Temlyakov), an error bound for a near best m-term approximation of a function g in L^p([0,1]^d) is provided, using a basis L^p-equivalent to the Haar system, where p is greater than one and less than infinity and d is a natural number. The bound includes a constant C(p) that is not given explicitly. The goal of this paper is to find an upper bound of the constant for the Haar system."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"0910.1202","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2009-10-07T09:54:14Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"7f4586770390064cf7199f3a5b15776b66bedc59233f3951caf0b83654337098","abstract_canon_sha256":"24d5d389527a82828e73d1426b7d66f76a9dd9a05d49dd24b623ae4015d53cae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T23:06:29.631694Z","signature_b64":"jF+s3MiSflkoCgcAL+/2rIubyrJei0t3ywBt8XlL67gzPY0Jzi8Znn3S3I8JwSgOjiBWRAxoS5kGcNzvIBGBAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7f2dcdfffbb80d7dd5a0c45af68b099815a33a2951d330cb4c6f60d51703daf","last_reissued_at":"2026-06-03T23:06:29.631234Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T23:06:29.631234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Derivation of an upper bound of the constant in the error bound for a near best m-term approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Evgeny Spodarev, Hans-Peter Scheffler, Wolfgang Karcher","submitted_at":"2009-10-07T09:54:14Z","abstract_excerpt":"In the paper \"The best m-term approximation and greedy algorithms\" (V. N. Temlyakov), an error bound for a near best m-term approximation of a function g in L^p([0,1]^d) is provided, using a basis L^p-equivalent to the Haar system, where p is greater than one and less than infinity and d is a natural number. The bound includes a constant C(p) that is not given explicitly. The goal of this paper is to find an upper bound of the constant for the Haar system."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.1202","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/0910.1202/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0910.1202","created_at":"2026-06-03T23:06:29.631292+00:00"},{"alias_kind":"arxiv_version","alias_value":"0910.1202v1","created_at":"2026-06-03T23:06:29.631292+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.1202","created_at":"2026-06-03T23:06:29.631292+00:00"},{"alias_kind":"pith_short_12","alias_value":"W7ZNZX77XOAN","created_at":"2026-06-03T23:06:29.631292+00:00"},{"alias_kind":"pith_short_16","alias_value":"W7ZNZX77XOANPXK2","created_at":"2026-06-03T23:06:29.631292+00:00"},{"alias_kind":"pith_short_8","alias_value":"W7ZNZX77","created_at":"2026-06-03T23:06:29.631292+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/W7ZNZX77XOANPXK2BRC262FQTG","json":"https://pith.science/pith/W7ZNZX77XOANPXK2BRC262FQTG.json","graph_json":"https://pith.science/api/pith-number/W7ZNZX77XOANPXK2BRC262FQTG/graph.json","events_json":"https://pith.science/api/pith-number/W7ZNZX77XOANPXK2BRC262FQTG/events.json","paper":"https://pith.science/paper/W7ZNZX77"},"agent_actions":{"view_html":"https://pith.science/pith/W7ZNZX77XOANPXK2BRC262FQTG","download_json":"https://pith.science/pith/W7ZNZX77XOANPXK2BRC262FQTG.json","view_paper":"https://pith.science/paper/W7ZNZX77","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0910.1202&json=true","fetch_graph":"https://pith.science/api/pith-number/W7ZNZX77XOANPXK2BRC262FQTG/graph.json","fetch_events":"https://pith.science/api/pith-number/W7ZNZX77XOANPXK2BRC262FQTG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W7ZNZX77XOANPXK2BRC262FQTG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W7ZNZX77XOANPXK2BRC262FQTG/action/storage_attestation","attest_author":"https://pith.science/pith/W7ZNZX77XOANPXK2BRC262FQTG/action/author_attestation","sign_citation":"https://pith.science/pith/W7ZNZX77XOANPXK2BRC262FQTG/action/citation_signature","submit_replication":"https://pith.science/pith/W7ZNZX77XOANPXK2BRC262FQTG/action/replication_record"}},"created_at":"2026-06-03T23:06:29.631292+00:00","updated_at":"2026-06-03T23:06:29.631292+00:00"}