{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:OLKS3JILBT4BVRUOV6QMDXZNOU","short_pith_number":"pith:OLKS3JIL","schema_version":"1.0","canonical_sha256":"72d52da50b0cf81ac68eafa0c1df2d7531054608370ce3a5f2ce45e770107d63","source":{"kind":"arxiv","id":"2509.21536","version":3},"attestation_state":"computed","paper":{"title":"A weak regularity lemma for polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.AC"],"primary_cat":"math.CO","authors_text":"Dora Woodruff, Guy Moshkovitz","submitted_at":"2025-09-25T20:22:43Z","abstract_excerpt":"A regularity lemma for polynomials provides a decomposition in terms of a bounded number of approximately independent polynomials. Such regularity lemmas play an important role in numerous results, yet suffer from the familiar shortcoming of having tower-type bounds or worse. In this paper we design a new, weaker regularity lemma with strong bounds. The new regularity lemma in particular provides means for quantitatively studying the curves contained in the image of a polynomial map, which is beyond the reach of standard methods.\n  The weak regularity lemma turns out to be powerful enough to y"},"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":"2509.21536","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-09-25T20:22:43Z","cross_cats_sorted":["cs.CC","math.AC"],"title_canon_sha256":"de6edb7e99a8bb0ead8467b15d5ac4b518477869471ece7e4175880b7541710f","abstract_canon_sha256":"4504ff638a6d94973fd3e498d2c769374cecd3ac42c96d70adb9a18828997387"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:05:02.266860Z","signature_b64":"/q2cYCuYoxU3pPkH9KEx7QFCaMeZexbecxUIxFVyg2lK/EOH7zCpUBw+pQdM+5qt45biMlEZxHdwCYK+azEVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72d52da50b0cf81ac68eafa0c1df2d7531054608370ce3a5f2ce45e770107d63","last_reissued_at":"2026-05-26T02:05:02.265952Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:05:02.265952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A weak regularity lemma for polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.AC"],"primary_cat":"math.CO","authors_text":"Dora Woodruff, Guy Moshkovitz","submitted_at":"2025-09-25T20:22:43Z","abstract_excerpt":"A regularity lemma for polynomials provides a decomposition in terms of a bounded number of approximately independent polynomials. Such regularity lemmas play an important role in numerous results, yet suffer from the familiar shortcoming of having tower-type bounds or worse. In this paper we design a new, weaker regularity lemma with strong bounds. The new regularity lemma in particular provides means for quantitatively studying the curves contained in the image of a polynomial map, which is beyond the reach of standard methods.\n  The weak regularity lemma turns out to be powerful enough to y"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.21536","kind":"arxiv","version":3},"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/2509.21536/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":"2509.21536","created_at":"2026-05-26T02:05:02.266075+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.21536v3","created_at":"2026-05-26T02:05:02.266075+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.21536","created_at":"2026-05-26T02:05:02.266075+00:00"},{"alias_kind":"pith_short_12","alias_value":"OLKS3JILBT4B","created_at":"2026-05-26T02:05:02.266075+00:00"},{"alias_kind":"pith_short_16","alias_value":"OLKS3JILBT4BVRUO","created_at":"2026-05-26T02:05:02.266075+00:00"},{"alias_kind":"pith_short_8","alias_value":"OLKS3JIL","created_at":"2026-05-26T02:05:02.266075+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/OLKS3JILBT4BVRUOV6QMDXZNOU","json":"https://pith.science/pith/OLKS3JILBT4BVRUOV6QMDXZNOU.json","graph_json":"https://pith.science/api/pith-number/OLKS3JILBT4BVRUOV6QMDXZNOU/graph.json","events_json":"https://pith.science/api/pith-number/OLKS3JILBT4BVRUOV6QMDXZNOU/events.json","paper":"https://pith.science/paper/OLKS3JIL"},"agent_actions":{"view_html":"https://pith.science/pith/OLKS3JILBT4BVRUOV6QMDXZNOU","download_json":"https://pith.science/pith/OLKS3JILBT4BVRUOV6QMDXZNOU.json","view_paper":"https://pith.science/paper/OLKS3JIL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.21536&json=true","fetch_graph":"https://pith.science/api/pith-number/OLKS3JILBT4BVRUOV6QMDXZNOU/graph.json","fetch_events":"https://pith.science/api/pith-number/OLKS3JILBT4BVRUOV6QMDXZNOU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OLKS3JILBT4BVRUOV6QMDXZNOU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OLKS3JILBT4BVRUOV6QMDXZNOU/action/storage_attestation","attest_author":"https://pith.science/pith/OLKS3JILBT4BVRUOV6QMDXZNOU/action/author_attestation","sign_citation":"https://pith.science/pith/OLKS3JILBT4BVRUOV6QMDXZNOU/action/citation_signature","submit_replication":"https://pith.science/pith/OLKS3JILBT4BVRUOV6QMDXZNOU/action/replication_record"}},"created_at":"2026-05-26T02:05:02.266075+00:00","updated_at":"2026-05-26T02:05:02.266075+00:00"}