{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:GPNSVRN6VMQLUORK6QIUBZYX3M","short_pith_number":"pith:GPNSVRN6","schema_version":"1.0","canonical_sha256":"33db2ac5beab20ba3a2af41140e717db3ba34ce5fd51162f63ffde099a69b276","source":{"kind":"arxiv","id":"2207.06128","version":2},"attestation_state":"computed","paper":{"title":"Compositional Sparsity, Approximation Classes, and Parametric Transport Equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Wolfgang Dahmen","submitted_at":"2022-07-13T11:25:19Z","abstract_excerpt":"Approximating functions of a large number of variables poses particular challenges often subsumed under the term ``Curse of Dimensionality'' (CoD). Unless the approximated function exhibits a very high level of smoothness the CoD can be avoided only by exploiting some typically hidden {\\em structural sparsity}. In this paper we propose a general framework for new model classes of functions in high dimensions. They are based on suitable notions of {\\em compositional dimension-sparsity} quantifying, on a continuous level, approximability by compositions with certain structural properties. In par"},"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":"2207.06128","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2022-07-13T11:25:19Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"8af69e1bddde2b1ccd9efccb8d8d9f923fcecd43121c1bcf9deeabee649a88f1","abstract_canon_sha256":"73dac8bf20a0d1b85e8eb55f30c6787e9b400471af328713bc3689fb7052c15f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:20:35.928323Z","signature_b64":"3rMje34KUDZ2cGr+JlI0CAVnb3pW8xHW2Fk+DJoVsqBhffmm7GTm6JvLPG5MBNJwhUVXdPbH5Evcd5tomzKCDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33db2ac5beab20ba3a2af41140e717db3ba34ce5fd51162f63ffde099a69b276","last_reissued_at":"2026-07-05T06:20:35.927853Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:20:35.927853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compositional Sparsity, Approximation Classes, and Parametric Transport Equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Wolfgang Dahmen","submitted_at":"2022-07-13T11:25:19Z","abstract_excerpt":"Approximating functions of a large number of variables poses particular challenges often subsumed under the term ``Curse of Dimensionality'' (CoD). Unless the approximated function exhibits a very high level of smoothness the CoD can be avoided only by exploiting some typically hidden {\\em structural sparsity}. In this paper we propose a general framework for new model classes of functions in high dimensions. They are based on suitable notions of {\\em compositional dimension-sparsity} quantifying, on a continuous level, approximability by compositions with certain structural properties. In par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.06128","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2207.06128/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":"2207.06128","created_at":"2026-07-05T06:20:35.927906+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.06128v2","created_at":"2026-07-05T06:20:35.927906+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.06128","created_at":"2026-07-05T06:20:35.927906+00:00"},{"alias_kind":"pith_short_12","alias_value":"GPNSVRN6VMQL","created_at":"2026-07-05T06:20:35.927906+00:00"},{"alias_kind":"pith_short_16","alias_value":"GPNSVRN6VMQLUORK","created_at":"2026-07-05T06:20:35.927906+00:00"},{"alias_kind":"pith_short_8","alias_value":"GPNSVRN6","created_at":"2026-07-05T06:20:35.927906+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.02550","citing_title":"Position: A Theory of Deep Learning Must Include Compositional Sparsity","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GPNSVRN6VMQLUORK6QIUBZYX3M","json":"https://pith.science/pith/GPNSVRN6VMQLUORK6QIUBZYX3M.json","graph_json":"https://pith.science/api/pith-number/GPNSVRN6VMQLUORK6QIUBZYX3M/graph.json","events_json":"https://pith.science/api/pith-number/GPNSVRN6VMQLUORK6QIUBZYX3M/events.json","paper":"https://pith.science/paper/GPNSVRN6"},"agent_actions":{"view_html":"https://pith.science/pith/GPNSVRN6VMQLUORK6QIUBZYX3M","download_json":"https://pith.science/pith/GPNSVRN6VMQLUORK6QIUBZYX3M.json","view_paper":"https://pith.science/paper/GPNSVRN6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.06128&json=true","fetch_graph":"https://pith.science/api/pith-number/GPNSVRN6VMQLUORK6QIUBZYX3M/graph.json","fetch_events":"https://pith.science/api/pith-number/GPNSVRN6VMQLUORK6QIUBZYX3M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GPNSVRN6VMQLUORK6QIUBZYX3M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GPNSVRN6VMQLUORK6QIUBZYX3M/action/storage_attestation","attest_author":"https://pith.science/pith/GPNSVRN6VMQLUORK6QIUBZYX3M/action/author_attestation","sign_citation":"https://pith.science/pith/GPNSVRN6VMQLUORK6QIUBZYX3M/action/citation_signature","submit_replication":"https://pith.science/pith/GPNSVRN6VMQLUORK6QIUBZYX3M/action/replication_record"}},"created_at":"2026-07-05T06:20:35.927906+00:00","updated_at":"2026-07-05T06:20:35.927906+00:00"}