{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:N2T7O7CBHSHLUJLPCVNXNUA2PX","short_pith_number":"pith:N2T7O7CB","schema_version":"1.0","canonical_sha256":"6ea7f77c413c8eba256f155b76d01a7dd560374dedbe0e5e43f2519bb23ff7fb","source":{"kind":"arxiv","id":"2605.15067","version":1},"attestation_state":"computed","paper":{"title":"On Vu's restricted box estimate in Waring's problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"The restricted box estimate in Waring's problem holds with power-saving error for s at least k squared minus k plus order square root of k, improving on the prior exponential threshold.","cross_cats":[],"primary_cat":"math.NT","authors_text":"Christian T\\'afula","submitted_at":"2026-05-14T16:57:00Z","abstract_excerpt":"In 2000, Vu proved that the number of solutions of $x_1^k + \\cdots + x_s^k = N$ in an arbitrary box satisfies the expected Hardy--Littlewood upper bound with a power-saving error term, for $s \\geq O(8^k k^3)$. We show that one may take $s\\geq k^2 - k + O(\\sqrt{k})$."},"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":"2605.15067","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-05-14T16:57:00Z","cross_cats_sorted":[],"title_canon_sha256":"7e398b6090f3542d58485a651e196b37c7b098c3870d5893c0d901e14e132b77","abstract_canon_sha256":"637879a39ffc08d81760414e8d13cd0a73890e228adc95eb8b4bb68611e88108"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.2","canonical_sha256":"6ea7f77c413c8eba256f155b76d01a7dd560374dedbe0e5e43f2519bb23ff7fb","last_reissued_at":"2026-05-17T21:57:19.355495Z","signature_status":"unsigned_v0","first_computed_at":"2026-05-17T21:40:26.054547Z"},"graph_snapshot":{"paper":{"title":"On Vu's restricted box estimate in Waring's problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"The restricted box estimate in Waring's problem holds with power-saving error for s at least k squared minus k plus order square root of k, improving on the prior exponential threshold.","cross_cats":[],"primary_cat":"math.NT","authors_text":"Christian T\\'afula","submitted_at":"2026-05-14T16:57:00Z","abstract_excerpt":"In 2000, Vu proved that the number of solutions of $x_1^k + \\cdots + x_s^k = N$ in an arbitrary box satisfies the expected Hardy--Littlewood upper bound with a power-saving error term, for $s \\geq O(8^k k^3)$. We show that one may take $s\\geq k^2 - k + O(\\sqrt{k})$."},"claims":{"count":3,"items":[{"kind":"strongest_claim","text":"We show that one may take s ≥ k² - k + O(√k).","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The minor-arc estimates or box-restriction handling in the circle method continue to deliver a power-saving error once s reaches the new quadratic threshold; this is not verified from the abstract alone.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The restricted box estimate in Waring's problem holds with power-saving error for s at least k squared minus k plus order square root of k, improving on the prior exponential threshold.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"}],"snapshot_sha256":"109d41c00341564e7c44effd4c3df43df4669e797b2902750d1ef288d976f9e7"},"source":{"id":"2605.15067","kind":"arxiv","version":1},"verdict":{"id":"e50f3cd3-f7f2-4ea9-aa0f-c405687d7662","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T03:20:45.546698Z","strongest_claim":"We show that one may take s ≥ k² - k + O(√k).","one_line_summary":"The restricted box estimate in Waring's problem holds with power-saving error for s at least k squared minus k plus order square root of k, improving on the prior exponential threshold.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The minor-arc estimates or box-restriction handling in the circle method continue to deliver a power-saving error once s reaches the new quadratic threshold; this is not verified from the abstract alone.","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":"2605.15067","created_at":"2026-05-17T21:18:33.574796+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.15067v1","created_at":"2026-05-17T21:18:33.574796+00:00"},{"alias_kind":"pith_short_12","alias_value":"N2T7O7CBHSHL","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"N2T7O7CBHSHLUJLP","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"N2T7O7CB","created_at":"2026-05-18T12:33:37.589309+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/N2T7O7CBHSHLUJLPCVNXNUA2PX","json":"https://pith.science/pith/N2T7O7CBHSHLUJLPCVNXNUA2PX.json","graph_json":"https://pith.science/api/pith-number/N2T7O7CBHSHLUJLPCVNXNUA2PX/graph.json","events_json":"https://pith.science/api/pith-number/N2T7O7CBHSHLUJLPCVNXNUA2PX/events.json","paper":"https://pith.science/paper/N2T7O7CB"},"agent_actions":{"view_html":"https://pith.science/pith/N2T7O7CBHSHLUJLPCVNXNUA2PX","download_json":"https://pith.science/pith/N2T7O7CBHSHLUJLPCVNXNUA2PX.json","view_paper":"https://pith.science/paper/N2T7O7CB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.15067&json=true","fetch_graph":"https://pith.science/api/pith-number/N2T7O7CBHSHLUJLPCVNXNUA2PX/graph.json","fetch_events":"https://pith.science/api/pith-number/N2T7O7CBHSHLUJLPCVNXNUA2PX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N2T7O7CBHSHLUJLPCVNXNUA2PX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N2T7O7CBHSHLUJLPCVNXNUA2PX/action/storage_attestation","attest_author":"https://pith.science/pith/N2T7O7CBHSHLUJLPCVNXNUA2PX/action/author_attestation","sign_citation":"https://pith.science/pith/N2T7O7CBHSHLUJLPCVNXNUA2PX/action/citation_signature","submit_replication":"https://pith.science/pith/N2T7O7CBHSHLUJLPCVNXNUA2PX/action/replication_record"}},"created_at":"2026-05-17T21:18:33.574796+00:00","updated_at":"2026-05-17T21:57:19.355581+00:00"}