{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ZGN4CSX33DDI7B24CLTAZV4Z4J","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":"ac84bfaead790f1c0ca842edd99a70ba4a3a75aec2cc2e596d2500d5a2dbc92a","cross_cats_sorted":["cs.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2025-08-12T07:12:16Z","title_canon_sha256":"4090a0cf29bd0111f8da33347d6b347fc28cb3f0a872c80104673b503c73c555"},"schema_version":"1.0","source":{"id":"2508.08683","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.08683","created_at":"2026-07-05T11:52:32Z"},{"alias_kind":"arxiv_version","alias_value":"2508.08683v1","created_at":"2026-07-05T11:52:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.08683","created_at":"2026-07-05T11:52:32Z"},{"alias_kind":"pith_short_12","alias_value":"ZGN4CSX33DDI","created_at":"2026-07-05T11:52:32Z"},{"alias_kind":"pith_short_16","alias_value":"ZGN4CSX33DDI7B24","created_at":"2026-07-05T11:52:32Z"},{"alias_kind":"pith_short_8","alias_value":"ZGN4CSX3","created_at":"2026-07-05T11:52:32Z"}],"graph_snapshots":[{"event_id":"sha256:3e39e81c057de3e6e9fe815962a001628e8ecf5b5744879180038745137ea1a7","target":"graph","created_at":"2026-07-05T11:52:32Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2508.08683/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Approximating a function $f(x)$ on $[-1,1]$ based on $N+1$ samples is a classical problem in numerical analysis. If the samples come with heteroskedastic noise depending on $x$ of variance $\\sigma(x)^2$, an $O(N\\log N)$ algorithm for this problem has not yet been found in the current literature. In this paper, we propose a method called HeteroChebtrunc, adapted from an algorithm named NoisyChebtrunc. Using techniques in high-dimensional probability, we show that with high probability, HeteroChebtrunc achieves a tighter infinity-norm error bound than NoisyChebtrunc under heteroskedastic noise. ","authors_text":"Yifu Zhang, Yuji Nakatsukasa","cross_cats":["cs.NA"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2025-08-12T07:12:16Z","title":"Efficient Function Approximation Under Heteroskedastic Noise"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.08683","kind":"arxiv","version":1},"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:ab09ede6ec57b8ecb9e65da80a429528d06a6e01f8c529c62d4fc1364f94a0bc","target":"record","created_at":"2026-07-05T11:52:32Z","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":"ac84bfaead790f1c0ca842edd99a70ba4a3a75aec2cc2e596d2500d5a2dbc92a","cross_cats_sorted":["cs.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2025-08-12T07:12:16Z","title_canon_sha256":"4090a0cf29bd0111f8da33347d6b347fc28cb3f0a872c80104673b503c73c555"},"schema_version":"1.0","source":{"id":"2508.08683","kind":"arxiv","version":1}},"canonical_sha256":"c99bc14afbd8c68f875c12e60cd799e2724b7b0509cae664b1fbd4ff1ee1e33a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c99bc14afbd8c68f875c12e60cd799e2724b7b0509cae664b1fbd4ff1ee1e33a","first_computed_at":"2026-07-05T11:52:32.328896Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:52:32.328896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kt5q3EvqXMRENfGB2rFA9eoaIUJtFf0f9TVFCrRanIhY81Su9DyOwCQ0f+WF433PxodZ9jFUZkh0agv064LVCA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:52:32.329353Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.08683","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab09ede6ec57b8ecb9e65da80a429528d06a6e01f8c529c62d4fc1364f94a0bc","sha256:3e39e81c057de3e6e9fe815962a001628e8ecf5b5744879180038745137ea1a7"],"state_sha256":"08dca059f9ec23ec03c647abcc8151370cbe7be493a3b0fefedfe387ebb6216a"}