{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3INQHR6MPH2V3CRKMQR6CJCZVX","short_pith_number":"pith:3INQHR6M","schema_version":"1.0","canonical_sha256":"da1b03c7cc79f55d8a2a6423e12459adda74863e158f19c597af120fbedaceba","source":{"kind":"arxiv","id":"1905.01166","version":1},"attestation_state":"computed","paper":{"title":"Algorithms and Complexity for some Multivariate Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"David Krieg","submitted_at":"2019-05-03T12:53:16Z","abstract_excerpt":"We study multivariate problems like function approximation, numerical integration, global optimization and dispersion. We obtain new results on the information complexity $n(\\varepsilon,d)$ of these problems. The information complexity is the amount of information (e.g. the number of function values) that is needed to solve the $d$-dimensional problem up to a prescribed error $\\varepsilon>0$. We present optimal algorithms for some of these problems.\n  An extended abstract can be found in the section \"Introduction and Results\"."},"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":"1905.01166","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-05-03T12:53:16Z","cross_cats_sorted":[],"title_canon_sha256":"8aee112e4007b0b1f27f07e573200c01f483ab0a2396735c4a9c060ec5fa24ca","abstract_canon_sha256":"abd23b23ff8c4dea63f8dbb8bb3f309d8f0020a0987140bd4543abf667cb60c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:06.585528Z","signature_b64":"qM7h3OHtBpyt+dTRKP7J6Gv6GyGs1ewrTKwX6fUrh1zO3P/SmGP2yOXhfDMOG0apupeC8roGp95oQNbmyWYtBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da1b03c7cc79f55d8a2a6423e12459adda74863e158f19c597af120fbedaceba","last_reissued_at":"2026-05-17T23:47:06.584901Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:06.584901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms and Complexity for some Multivariate Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"David Krieg","submitted_at":"2019-05-03T12:53:16Z","abstract_excerpt":"We study multivariate problems like function approximation, numerical integration, global optimization and dispersion. We obtain new results on the information complexity $n(\\varepsilon,d)$ of these problems. The information complexity is the amount of information (e.g. the number of function values) that is needed to solve the $d$-dimensional problem up to a prescribed error $\\varepsilon>0$. We present optimal algorithms for some of these problems.\n  An extended abstract can be found in the section \"Introduction and Results\"."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.01166","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":"1905.01166","created_at":"2026-05-17T23:47:06.584996+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.01166v1","created_at":"2026-05-17T23:47:06.584996+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01166","created_at":"2026-05-17T23:47:06.584996+00:00"},{"alias_kind":"pith_short_12","alias_value":"3INQHR6MPH2V","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"3INQHR6MPH2V3CRK","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"3INQHR6M","created_at":"2026-05-18T12:33:07.085635+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/3INQHR6MPH2V3CRKMQR6CJCZVX","json":"https://pith.science/pith/3INQHR6MPH2V3CRKMQR6CJCZVX.json","graph_json":"https://pith.science/api/pith-number/3INQHR6MPH2V3CRKMQR6CJCZVX/graph.json","events_json":"https://pith.science/api/pith-number/3INQHR6MPH2V3CRKMQR6CJCZVX/events.json","paper":"https://pith.science/paper/3INQHR6M"},"agent_actions":{"view_html":"https://pith.science/pith/3INQHR6MPH2V3CRKMQR6CJCZVX","download_json":"https://pith.science/pith/3INQHR6MPH2V3CRKMQR6CJCZVX.json","view_paper":"https://pith.science/paper/3INQHR6M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.01166&json=true","fetch_graph":"https://pith.science/api/pith-number/3INQHR6MPH2V3CRKMQR6CJCZVX/graph.json","fetch_events":"https://pith.science/api/pith-number/3INQHR6MPH2V3CRKMQR6CJCZVX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3INQHR6MPH2V3CRKMQR6CJCZVX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3INQHR6MPH2V3CRKMQR6CJCZVX/action/storage_attestation","attest_author":"https://pith.science/pith/3INQHR6MPH2V3CRKMQR6CJCZVX/action/author_attestation","sign_citation":"https://pith.science/pith/3INQHR6MPH2V3CRKMQR6CJCZVX/action/citation_signature","submit_replication":"https://pith.science/pith/3INQHR6MPH2V3CRKMQR6CJCZVX/action/replication_record"}},"created_at":"2026-05-17T23:47:06.584996+00:00","updated_at":"2026-05-17T23:47:06.584996+00:00"}