{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:7H3WFQK2XUWYVBZKYFG3ELCJQR","short_pith_number":"pith:7H3WFQK2","schema_version":"1.0","canonical_sha256":"f9f762c15abd2d8a872ac14db22c498450ee075dc49e0e2e05fd08ab9a5a01b4","source":{"kind":"arxiv","id":"2306.04550","version":2},"attestation_state":"computed","paper":{"title":"From dense to sparse design: Optimal rates under the supremum norm for estimating the mean function in functional data analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Hajo Holzmann, Max Berger, Philipp Hermann","submitted_at":"2023-06-07T15:55:33Z","abstract_excerpt":"We derive optimal rates of convergence in the supremum norm for estimating the H\\\"older-smooth mean function of a stochastic process which is repeatedly and discretely observed with additional errors at fixed, multivariate, synchronous design points, the typical scenario for machine recorded functional data. Similarly to the optimal rates in $L_2$ obtained in \\citet{cai2011optimal}, for sparse design a discretization term dominates, while in the dense case the parametric $\\sqrt n$ rate can be achieved as if the $n$ processes were continuously observed without errors. The supremum norm is of pr"},"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":"2306.04550","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2023-06-07T15:55:33Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"5ce642ff6c5fdbf541fa3c3067c68d8a6c6eef69b4e369a4924f7b801e689321","abstract_canon_sha256":"154e342ed313707f5da2403fbc544ff59cac346be334d68cffa7b194c6092d06"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:16:41.525212Z","signature_b64":"O1AgrmYkYAuZogR8AZ65txhFzjtISLVP3LoAcm/55QBYQ9CMXnMmcKXTe6qYJrIcDYFto9MNHv4QBThj8A/mAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9f762c15abd2d8a872ac14db22c498450ee075dc49e0e2e05fd08ab9a5a01b4","last_reissued_at":"2026-07-05T08:16:41.524746Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:16:41.524746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"From dense to sparse design: Optimal rates under the supremum norm for estimating the mean function in functional data analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Hajo Holzmann, Max Berger, Philipp Hermann","submitted_at":"2023-06-07T15:55:33Z","abstract_excerpt":"We derive optimal rates of convergence in the supremum norm for estimating the H\\\"older-smooth mean function of a stochastic process which is repeatedly and discretely observed with additional errors at fixed, multivariate, synchronous design points, the typical scenario for machine recorded functional data. Similarly to the optimal rates in $L_2$ obtained in \\citet{cai2011optimal}, for sparse design a discretization term dominates, while in the dense case the parametric $\\sqrt n$ rate can be achieved as if the $n$ processes were continuously observed without errors. The supremum norm is of pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.04550","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/2306.04550/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":"2306.04550","created_at":"2026-07-05T08:16:41.524805+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.04550v2","created_at":"2026-07-05T08:16:41.524805+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.04550","created_at":"2026-07-05T08:16:41.524805+00:00"},{"alias_kind":"pith_short_12","alias_value":"7H3WFQK2XUWY","created_at":"2026-07-05T08:16:41.524805+00:00"},{"alias_kind":"pith_short_16","alias_value":"7H3WFQK2XUWYVBZK","created_at":"2026-07-05T08:16:41.524805+00:00"},{"alias_kind":"pith_short_8","alias_value":"7H3WFQK2","created_at":"2026-07-05T08:16:41.524805+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.21172","citing_title":"Prokhorov Metric Convergence of the Partial Sum Process for Reconstructed Functional Data","ref_index":38,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7H3WFQK2XUWYVBZKYFG3ELCJQR","json":"https://pith.science/pith/7H3WFQK2XUWYVBZKYFG3ELCJQR.json","graph_json":"https://pith.science/api/pith-number/7H3WFQK2XUWYVBZKYFG3ELCJQR/graph.json","events_json":"https://pith.science/api/pith-number/7H3WFQK2XUWYVBZKYFG3ELCJQR/events.json","paper":"https://pith.science/paper/7H3WFQK2"},"agent_actions":{"view_html":"https://pith.science/pith/7H3WFQK2XUWYVBZKYFG3ELCJQR","download_json":"https://pith.science/pith/7H3WFQK2XUWYVBZKYFG3ELCJQR.json","view_paper":"https://pith.science/paper/7H3WFQK2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.04550&json=true","fetch_graph":"https://pith.science/api/pith-number/7H3WFQK2XUWYVBZKYFG3ELCJQR/graph.json","fetch_events":"https://pith.science/api/pith-number/7H3WFQK2XUWYVBZKYFG3ELCJQR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7H3WFQK2XUWYVBZKYFG3ELCJQR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7H3WFQK2XUWYVBZKYFG3ELCJQR/action/storage_attestation","attest_author":"https://pith.science/pith/7H3WFQK2XUWYVBZKYFG3ELCJQR/action/author_attestation","sign_citation":"https://pith.science/pith/7H3WFQK2XUWYVBZKYFG3ELCJQR/action/citation_signature","submit_replication":"https://pith.science/pith/7H3WFQK2XUWYVBZKYFG3ELCJQR/action/replication_record"}},"created_at":"2026-07-05T08:16:41.524805+00:00","updated_at":"2026-07-05T08:16:41.524805+00:00"}