{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:JN3ZU2SF25J7BWJQT65GD6W6DN","short_pith_number":"pith:JN3ZU2SF","schema_version":"1.0","canonical_sha256":"4b779a6a45d753f0d9309fba61fade1b6b5977c9cc2edf204a094a1e729b696e","source":{"kind":"arxiv","id":"2306.13820","version":5},"attestation_state":"computed","paper":{"title":"Efficient equidistribution of periodic nilsequences and applications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CA","math.CO","math.DS"],"primary_cat":"math.NT","authors_text":"James Leng","submitted_at":"2023-06-24T00:08:39Z","abstract_excerpt":"This is a companion paper to arXiv:2312.10772. We deduce an equidistribution theorem for periodic nilsequences and use this theorem to give two applications in arithmetic combinatorics. The first application is quasi-polynomial bounds for a certain complexity one polynomial progression, improving the iterated logarithm bound previusly obtained. The second application is a proof of the quasi-polynomial $U^4[N]$ inverse theorem. In work with Sah and Sawhney, we obtain improved bounds for sets lacking nontrivial $5$-term arithmetic progressions."},"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.13820","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2023-06-24T00:08:39Z","cross_cats_sorted":["math.CA","math.CO","math.DS"],"title_canon_sha256":"11e2153e422e127f4896b76792b8cea861b0edd7484660a7d52b0b321c50d4b8","abstract_canon_sha256":"185b960eebf231de45d8239ad98e77b9203034a3ae93359168b7ac8d473d4a1f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:50:02.084355Z","signature_b64":"bSDM/knWmbXJhkypMIKUb+JjgI5f6/ZwbmNqkQsGQM6MTrsBqXbi36jVVuAIGDvS67KsZ4WQ2W9JSI4K2H8pCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b779a6a45d753f0d9309fba61fade1b6b5977c9cc2edf204a094a1e729b696e","last_reissued_at":"2026-07-05T07:50:02.083843Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:50:02.083843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient equidistribution of periodic nilsequences and applications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CA","math.CO","math.DS"],"primary_cat":"math.NT","authors_text":"James Leng","submitted_at":"2023-06-24T00:08:39Z","abstract_excerpt":"This is a companion paper to arXiv:2312.10772. We deduce an equidistribution theorem for periodic nilsequences and use this theorem to give two applications in arithmetic combinatorics. The first application is quasi-polynomial bounds for a certain complexity one polynomial progression, improving the iterated logarithm bound previusly obtained. The second application is a proof of the quasi-polynomial $U^4[N]$ inverse theorem. In work with Sah and Sawhney, we obtain improved bounds for sets lacking nontrivial $5$-term arithmetic progressions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.13820","kind":"arxiv","version":5},"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.13820/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.13820","created_at":"2026-07-05T07:50:02.083902+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.13820v5","created_at":"2026-07-05T07:50:02.083902+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.13820","created_at":"2026-07-05T07:50:02.083902+00:00"},{"alias_kind":"pith_short_12","alias_value":"JN3ZU2SF25J7","created_at":"2026-07-05T07:50:02.083902+00:00"},{"alias_kind":"pith_short_16","alias_value":"JN3ZU2SF25J7BWJQ","created_at":"2026-07-05T07:50:02.083902+00:00"},{"alias_kind":"pith_short_8","alias_value":"JN3ZU2SF","created_at":"2026-07-05T07:50:02.083902+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.13010","citing_title":"On polynomial progressions via transference","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JN3ZU2SF25J7BWJQT65GD6W6DN","json":"https://pith.science/pith/JN3ZU2SF25J7BWJQT65GD6W6DN.json","graph_json":"https://pith.science/api/pith-number/JN3ZU2SF25J7BWJQT65GD6W6DN/graph.json","events_json":"https://pith.science/api/pith-number/JN3ZU2SF25J7BWJQT65GD6W6DN/events.json","paper":"https://pith.science/paper/JN3ZU2SF"},"agent_actions":{"view_html":"https://pith.science/pith/JN3ZU2SF25J7BWJQT65GD6W6DN","download_json":"https://pith.science/pith/JN3ZU2SF25J7BWJQT65GD6W6DN.json","view_paper":"https://pith.science/paper/JN3ZU2SF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.13820&json=true","fetch_graph":"https://pith.science/api/pith-number/JN3ZU2SF25J7BWJQT65GD6W6DN/graph.json","fetch_events":"https://pith.science/api/pith-number/JN3ZU2SF25J7BWJQT65GD6W6DN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JN3ZU2SF25J7BWJQT65GD6W6DN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JN3ZU2SF25J7BWJQT65GD6W6DN/action/storage_attestation","attest_author":"https://pith.science/pith/JN3ZU2SF25J7BWJQT65GD6W6DN/action/author_attestation","sign_citation":"https://pith.science/pith/JN3ZU2SF25J7BWJQT65GD6W6DN/action/citation_signature","submit_replication":"https://pith.science/pith/JN3ZU2SF25J7BWJQT65GD6W6DN/action/replication_record"}},"created_at":"2026-07-05T07:50:02.083902+00:00","updated_at":"2026-07-05T07:50:02.083902+00:00"}