{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:AM7XOZXR5TAMBKRNR6HR7RKLEU","short_pith_number":"pith:AM7XOZXR","schema_version":"1.0","canonical_sha256":"033f7766f1ecc0c0aa2d8f8f1fc54b25289c07dfcb0f93585eee26bf3c6f5c18","source":{"kind":"arxiv","id":"1505.03604","version":1},"attestation_state":"computed","paper":{"title":"Rescaled Pure Greedy Algorithm for Hilbert and Banach Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Guergana Petrova","submitted_at":"2015-05-14T03:27:14Z","abstract_excerpt":"We show that a very simple modification of the Pure Greedy Algorithm for approximating functions by sparse sums from a dictionary in a Hilbert or more generally a Banach space has optimal convergence rates on the class of convex combinations of dictionary elements"},"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":"1505.03604","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-05-14T03:27:14Z","cross_cats_sorted":[],"title_canon_sha256":"76f609ee89f6510c24a3f1d4b1924ac93860b81819e99a579eee23928c12a345","abstract_canon_sha256":"ecc515dbb6bcc67d3dc4a307391c910dc4303a4d4e7378dd5357683dc779a2ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:09:53.590309Z","signature_b64":"crK4GNUnGwQsoyNq564NIesfDHQJzL0hA031jB54Zx0xg88403ElX5Wryga9SqQw65jt6oyDGkx8BkW/qCR3Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"033f7766f1ecc0c0aa2d8f8f1fc54b25289c07dfcb0f93585eee26bf3c6f5c18","last_reissued_at":"2026-05-18T02:09:53.589684Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:09:53.589684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rescaled Pure Greedy Algorithm for Hilbert and Banach Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Guergana Petrova","submitted_at":"2015-05-14T03:27:14Z","abstract_excerpt":"We show that a very simple modification of the Pure Greedy Algorithm for approximating functions by sparse sums from a dictionary in a Hilbert or more generally a Banach space has optimal convergence rates on the class of convex combinations of dictionary elements"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03604","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.03604","created_at":"2026-05-18T02:09:53.589769+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.03604v1","created_at":"2026-05-18T02:09:53.589769+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03604","created_at":"2026-05-18T02:09:53.589769+00:00"},{"alias_kind":"pith_short_12","alias_value":"AM7XOZXR5TAM","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"AM7XOZXR5TAMBKRN","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"AM7XOZXR","created_at":"2026-05-18T12:29:10.953037+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/AM7XOZXR5TAMBKRNR6HR7RKLEU","json":"https://pith.science/pith/AM7XOZXR5TAMBKRNR6HR7RKLEU.json","graph_json":"https://pith.science/api/pith-number/AM7XOZXR5TAMBKRNR6HR7RKLEU/graph.json","events_json":"https://pith.science/api/pith-number/AM7XOZXR5TAMBKRNR6HR7RKLEU/events.json","paper":"https://pith.science/paper/AM7XOZXR"},"agent_actions":{"view_html":"https://pith.science/pith/AM7XOZXR5TAMBKRNR6HR7RKLEU","download_json":"https://pith.science/pith/AM7XOZXR5TAMBKRNR6HR7RKLEU.json","view_paper":"https://pith.science/paper/AM7XOZXR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.03604&json=true","fetch_graph":"https://pith.science/api/pith-number/AM7XOZXR5TAMBKRNR6HR7RKLEU/graph.json","fetch_events":"https://pith.science/api/pith-number/AM7XOZXR5TAMBKRNR6HR7RKLEU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AM7XOZXR5TAMBKRNR6HR7RKLEU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AM7XOZXR5TAMBKRNR6HR7RKLEU/action/storage_attestation","attest_author":"https://pith.science/pith/AM7XOZXR5TAMBKRNR6HR7RKLEU/action/author_attestation","sign_citation":"https://pith.science/pith/AM7XOZXR5TAMBKRNR6HR7RKLEU/action/citation_signature","submit_replication":"https://pith.science/pith/AM7XOZXR5TAMBKRNR6HR7RKLEU/action/replication_record"}},"created_at":"2026-05-18T02:09:53.589769+00:00","updated_at":"2026-05-18T02:09:53.589769+00:00"}