{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:3PZLJSF5JEVS2DWH5RJJ46S7DE","short_pith_number":"pith:3PZLJSF5","canonical_record":{"source":{"id":"1008.3043","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-08-18T08:36:21Z","cross_cats_sorted":["cs.CC","cs.LG","stat.ML"],"title_canon_sha256":"735750f6bfb0e5ca2910cb688d71d68521529be8ebb151f9d8776a05649c6d13","abstract_canon_sha256":"d2a2105860e289602bf1457ac00d2469048a27561dcaf237db740e34320d5a29"},"schema_version":"1.0"},"canonical_sha256":"dbf2b4c8bd492b2d0ec7ec529e7a5f19075895b95bed30dfa9e40c34a9597b23","source":{"kind":"arxiv","id":"1008.3043","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.3043","created_at":"2026-05-18T04:04:31Z"},{"alias_kind":"arxiv_version","alias_value":"1008.3043v2","created_at":"2026-05-18T04:04:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3043","created_at":"2026-05-18T04:04:31Z"},{"alias_kind":"pith_short_12","alias_value":"3PZLJSF5JEVS","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"3PZLJSF5JEVS2DWH","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"3PZLJSF5","created_at":"2026-05-18T12:26:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:3PZLJSF5JEVS2DWH5RJJ46S7DE","target":"record","payload":{"canonical_record":{"source":{"id":"1008.3043","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-08-18T08:36:21Z","cross_cats_sorted":["cs.CC","cs.LG","stat.ML"],"title_canon_sha256":"735750f6bfb0e5ca2910cb688d71d68521529be8ebb151f9d8776a05649c6d13","abstract_canon_sha256":"d2a2105860e289602bf1457ac00d2469048a27561dcaf237db740e34320d5a29"},"schema_version":"1.0"},"canonical_sha256":"dbf2b4c8bd492b2d0ec7ec529e7a5f19075895b95bed30dfa9e40c34a9597b23","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:31.247073Z","signature_b64":"JBOFjJNt9YE9Kh6HsycXn3NZ91bJyjtaPogcz04f1L+oK3hRyldElJ1eTUev3AHz1N7zX195Lsh1lqIkqSQiCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbf2b4c8bd492b2d0ec7ec529e7a5f19075895b95bed30dfa9e40c34a9597b23","last_reissued_at":"2026-05-18T04:04:31.246470Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:31.246470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.3043","source_version":2,"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:04:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2lsEOUx5XG7IIPVdByFsXXGMokfCLnR+BrmD8F1S9tBU0c8ebiSbw9+KG7F5enO2IRf70bvkBQbrkjEOEvtwAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:08:45.754410Z"},"content_sha256":"eb1d017a35295e03671946b1d4616de774316af8252ec1f57ddfbb2b65be7e74","schema_version":"1.0","event_id":"sha256:eb1d017a35295e03671946b1d4616de774316af8252ec1f57ddfbb2b65be7e74"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:3PZLJSF5JEVS2DWH5RJJ46S7DE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Functions of Few Arbitrary Linear Parameters in High Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LG","stat.ML"],"primary_cat":"math.NA","authors_text":"Jan Vybiral, Karin Schnass, Massimo Fornasier","submitted_at":"2010-08-18T08:36:21Z","abstract_excerpt":"Let us assume that $f$ is a continuous function defined on the unit ball of $\\mathbb R^d$, of the form $f(x) = g (A x)$, where $A$ is a $k \\times d$ matrix and $g$ is a function of $k$ variables for $k \\ll d$. We are given a budget $m \\in \\mathbb N$ of possible point evaluations $f(x_i)$, $i=1,...,m$, of $f$, which we are allowed to query in order to construct a uniform approximating function. Under certain smoothness and variation assumptions on the function $g$, and an {\\it arbitrary} choice of the matrix $A$, we present in this paper\n  1. a sampling choice of the points $\\{x_i\\}$ drawn at r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3043","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":""},"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:04:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zalba9QGNbBocr5wiMvQbc83gVfcnOwCYsJP+CxoOwRJuM44TH2IxnqXBKei7dgqLkiXIyuwXiy3fjiHJ9HZAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:08:45.754988Z"},"content_sha256":"411891740838c74ecebdb741e5d266ebe8f6e61659cf7728fba819fa7315772f","schema_version":"1.0","event_id":"sha256:411891740838c74ecebdb741e5d266ebe8f6e61659cf7728fba819fa7315772f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3PZLJSF5JEVS2DWH5RJJ46S7DE/bundle.json","state_url":"https://pith.science/pith/3PZLJSF5JEVS2DWH5RJJ46S7DE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3PZLJSF5JEVS2DWH5RJJ46S7DE/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-05-27T09:08:45Z","links":{"resolver":"https://pith.science/pith/3PZLJSF5JEVS2DWH5RJJ46S7DE","bundle":"https://pith.science/pith/3PZLJSF5JEVS2DWH5RJJ46S7DE/bundle.json","state":"https://pith.science/pith/3PZLJSF5JEVS2DWH5RJJ46S7DE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3PZLJSF5JEVS2DWH5RJJ46S7DE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:3PZLJSF5JEVS2DWH5RJJ46S7DE","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":"d2a2105860e289602bf1457ac00d2469048a27561dcaf237db740e34320d5a29","cross_cats_sorted":["cs.CC","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-08-18T08:36:21Z","title_canon_sha256":"735750f6bfb0e5ca2910cb688d71d68521529be8ebb151f9d8776a05649c6d13"},"schema_version":"1.0","source":{"id":"1008.3043","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.3043","created_at":"2026-05-18T04:04:31Z"},{"alias_kind":"arxiv_version","alias_value":"1008.3043v2","created_at":"2026-05-18T04:04:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3043","created_at":"2026-05-18T04:04:31Z"},{"alias_kind":"pith_short_12","alias_value":"3PZLJSF5JEVS","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"3PZLJSF5JEVS2DWH","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"3PZLJSF5","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:411891740838c74ecebdb741e5d266ebe8f6e61659cf7728fba819fa7315772f","target":"graph","created_at":"2026-05-18T04:04:31Z","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":"Let us assume that $f$ is a continuous function defined on the unit ball of $\\mathbb R^d$, of the form $f(x) = g (A x)$, where $A$ is a $k \\times d$ matrix and $g$ is a function of $k$ variables for $k \\ll d$. We are given a budget $m \\in \\mathbb N$ of possible point evaluations $f(x_i)$, $i=1,...,m$, of $f$, which we are allowed to query in order to construct a uniform approximating function. Under certain smoothness and variation assumptions on the function $g$, and an {\\it arbitrary} choice of the matrix $A$, we present in this paper\n  1. a sampling choice of the points $\\{x_i\\}$ drawn at r","authors_text":"Jan Vybiral, Karin Schnass, Massimo Fornasier","cross_cats":["cs.CC","cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-08-18T08:36:21Z","title":"Learning Functions of Few Arbitrary Linear Parameters in High Dimensions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3043","kind":"arxiv","version":2},"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:eb1d017a35295e03671946b1d4616de774316af8252ec1f57ddfbb2b65be7e74","target":"record","created_at":"2026-05-18T04:04:31Z","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":"d2a2105860e289602bf1457ac00d2469048a27561dcaf237db740e34320d5a29","cross_cats_sorted":["cs.CC","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-08-18T08:36:21Z","title_canon_sha256":"735750f6bfb0e5ca2910cb688d71d68521529be8ebb151f9d8776a05649c6d13"},"schema_version":"1.0","source":{"id":"1008.3043","kind":"arxiv","version":2}},"canonical_sha256":"dbf2b4c8bd492b2d0ec7ec529e7a5f19075895b95bed30dfa9e40c34a9597b23","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dbf2b4c8bd492b2d0ec7ec529e7a5f19075895b95bed30dfa9e40c34a9597b23","first_computed_at":"2026-05-18T04:04:31.246470Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:04:31.246470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JBOFjJNt9YE9Kh6HsycXn3NZ91bJyjtaPogcz04f1L+oK3hRyldElJ1eTUev3AHz1N7zX195Lsh1lqIkqSQiCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:04:31.247073Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.3043","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb1d017a35295e03671946b1d4616de774316af8252ec1f57ddfbb2b65be7e74","sha256:411891740838c74ecebdb741e5d266ebe8f6e61659cf7728fba819fa7315772f"],"state_sha256":"cfab1113117b6301aae4498a0bd55d92b868aab085c306e088869422e7d5bd16"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7ZsseU15Tb2kvZE6mtLYRZWVJ5rDOVYEnN5nG3YztbcXSlz9DmhtiFoupWgrAncEmgO5URo1C/Pbv4PSx31JCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:08:45.758192Z","bundle_sha256":"5db69f9d020e40f73325fe22dcba11573be54eca7227711345084a98f5f6aed0"}}