{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7LO2N6LTZLQ2F2IYUMQXCUSMU5","short_pith_number":"pith:7LO2N6LT","schema_version":"1.0","canonical_sha256":"fadda6f973cae1a2e918a32171524ca75dfc7e3e443003b7113938e0bb05d75b","source":{"kind":"arxiv","id":"1710.10865","version":1},"attestation_state":"computed","paper":{"title":"Asymptotic analysis of average case approximation complexity of additive random fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"A. A. Khartov, M. Zani","submitted_at":"2017-10-30T11:00:43Z","abstract_excerpt":"We study approximation properties of sequences of centered additive random fields $Y_d$, $d\\in\\mathbb{N}$. The average case approximation complexity $n^{Y_d}(\\varepsilon)$ is defined as the minimal number of evaluations of arbitrary linear functionals that is needed to approximate $Y_d$ with relative $2$-average error not exceeding a given threshold $\\varepsilon\\in(0,1)$. We investigate the growth of $n^{Y_d}(\\varepsilon)$ for arbitrary fixed $\\varepsilon\\in(0,1)$ and $d\\to\\infty$. Under natural assumptions we obtain general results concerning asymptotics of $n^{Y_d}(\\varepsilon)$. We apply ou"},"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":"1710.10865","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-10-30T11:00:43Z","cross_cats_sorted":[],"title_canon_sha256":"3f540b55567820b80ec2b3557b2d3efb0b6780fbd1091843d1acbdcc974670f5","abstract_canon_sha256":"867d65e34a86a14df99bf5cfaf3f236d5381ad97d990ee82daeb37b67b527295"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:46.246599Z","signature_b64":"ifuYzOf8HmBU+8QX0QJ5vBr11jek/y+UJMHZecSLtAGyGlY/xxdon9exHM4uMboNhcLmu6SeQWD7EwRiTow6CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fadda6f973cae1a2e918a32171524ca75dfc7e3e443003b7113938e0bb05d75b","last_reissued_at":"2026-05-18T00:31:46.246125Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:46.246125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotic analysis of average case approximation complexity of additive random fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"A. A. Khartov, M. Zani","submitted_at":"2017-10-30T11:00:43Z","abstract_excerpt":"We study approximation properties of sequences of centered additive random fields $Y_d$, $d\\in\\mathbb{N}$. The average case approximation complexity $n^{Y_d}(\\varepsilon)$ is defined as the minimal number of evaluations of arbitrary linear functionals that is needed to approximate $Y_d$ with relative $2$-average error not exceeding a given threshold $\\varepsilon\\in(0,1)$. We investigate the growth of $n^{Y_d}(\\varepsilon)$ for arbitrary fixed $\\varepsilon\\in(0,1)$ and $d\\to\\infty$. Under natural assumptions we obtain general results concerning asymptotics of $n^{Y_d}(\\varepsilon)$. We apply ou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10865","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":"1710.10865","created_at":"2026-05-18T00:31:46.246198+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.10865v1","created_at":"2026-05-18T00:31:46.246198+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10865","created_at":"2026-05-18T00:31:46.246198+00:00"},{"alias_kind":"pith_short_12","alias_value":"7LO2N6LTZLQ2","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7LO2N6LTZLQ2F2IY","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7LO2N6LT","created_at":"2026-05-18T12:31:05.417338+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/7LO2N6LTZLQ2F2IYUMQXCUSMU5","json":"https://pith.science/pith/7LO2N6LTZLQ2F2IYUMQXCUSMU5.json","graph_json":"https://pith.science/api/pith-number/7LO2N6LTZLQ2F2IYUMQXCUSMU5/graph.json","events_json":"https://pith.science/api/pith-number/7LO2N6LTZLQ2F2IYUMQXCUSMU5/events.json","paper":"https://pith.science/paper/7LO2N6LT"},"agent_actions":{"view_html":"https://pith.science/pith/7LO2N6LTZLQ2F2IYUMQXCUSMU5","download_json":"https://pith.science/pith/7LO2N6LTZLQ2F2IYUMQXCUSMU5.json","view_paper":"https://pith.science/paper/7LO2N6LT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.10865&json=true","fetch_graph":"https://pith.science/api/pith-number/7LO2N6LTZLQ2F2IYUMQXCUSMU5/graph.json","fetch_events":"https://pith.science/api/pith-number/7LO2N6LTZLQ2F2IYUMQXCUSMU5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7LO2N6LTZLQ2F2IYUMQXCUSMU5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7LO2N6LTZLQ2F2IYUMQXCUSMU5/action/storage_attestation","attest_author":"https://pith.science/pith/7LO2N6LTZLQ2F2IYUMQXCUSMU5/action/author_attestation","sign_citation":"https://pith.science/pith/7LO2N6LTZLQ2F2IYUMQXCUSMU5/action/citation_signature","submit_replication":"https://pith.science/pith/7LO2N6LTZLQ2F2IYUMQXCUSMU5/action/replication_record"}},"created_at":"2026-05-18T00:31:46.246198+00:00","updated_at":"2026-05-18T00:31:46.246198+00:00"}