{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:62FFVHWIJI7D7UE7J4J6UYATUX","short_pith_number":"pith:62FFVHWI","schema_version":"1.0","canonical_sha256":"f68a5a9ec84a3e3fd09f4f13ea6013a5f074ffbcd71b0184a9c204692d601bab","source":{"kind":"arxiv","id":"2405.06423","version":2},"attestation_state":"computed","paper":{"title":"A blueprint for the formalization of Carleson's theorem on convergence of Fourier series","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CA","authors_text":"Asgar Jamneshan, Christoph Thiele, Edward van de Meent, Evgenia Karunus, Floris van Doorn, James Sundstrom, Jasper Mulder-Sohn, Jeremy Tan, Jim Portegies, Joris Roos, Lars Becker, Leo Diedering, Mar\\'ia In\\'es de Frutos-Fern\\'andez, Michael Rothgang, Pietro Monticone, Rajula Srivastava, S\\'ebastien Gou\\\"ezel","submitted_at":"2024-05-10T12:13:54Z","abstract_excerpt":"This paper is the blueprint underlying the Lean formalization of the proof of Carleson's classical result asserting almost everywhere convergence of Fourier series of continuous functions. We break up the proof into two steps, a reduction of the classical result to a new theorem that appears in a sibling communication and a proof of this new theorem, which is also detailed as blueprint in this paper. An early version of this blueprint was used to initiate the Lean formalization. During the formalization, many contributors elaborated the blueprint with minor corrections, modifications and exten"},"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":"2405.06423","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2024-05-10T12:13:54Z","cross_cats_sorted":[],"title_canon_sha256":"055be5411de4579049e0dd265d93ac3386d42c23701984b6308f0c3eed47dd14","abstract_canon_sha256":"5b7522d1d29a99fd66215ad909a2687e095f835c94ed06f1ec651e75d725b121"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:49:31.320265Z","signature_b64":"x87qxwrwzsrMgPSUEf9DW0J6fF5/Y4pGFqpNEd87xQZy95xqC/3KYuPONkhGFbA9Upo31OjB2Bm4IpGKqWSNCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f68a5a9ec84a3e3fd09f4f13ea6013a5f074ffbcd71b0184a9c204692d601bab","last_reissued_at":"2026-07-05T11:49:31.319812Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:49:31.319812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A blueprint for the formalization of Carleson's theorem on convergence of Fourier series","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CA","authors_text":"Asgar Jamneshan, Christoph Thiele, Edward van de Meent, Evgenia Karunus, Floris van Doorn, James Sundstrom, Jasper Mulder-Sohn, Jeremy Tan, Jim Portegies, Joris Roos, Lars Becker, Leo Diedering, Mar\\'ia In\\'es de Frutos-Fern\\'andez, Michael Rothgang, Pietro Monticone, Rajula Srivastava, S\\'ebastien Gou\\\"ezel","submitted_at":"2024-05-10T12:13:54Z","abstract_excerpt":"This paper is the blueprint underlying the Lean formalization of the proof of Carleson's classical result asserting almost everywhere convergence of Fourier series of continuous functions. We break up the proof into two steps, a reduction of the classical result to a new theorem that appears in a sibling communication and a proof of this new theorem, which is also detailed as blueprint in this paper. An early version of this blueprint was used to initiate the Lean formalization. During the formalization, many contributors elaborated the blueprint with minor corrections, modifications and exten"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.06423","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/2405.06423/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":"2405.06423","created_at":"2026-07-05T11:49:31.319869+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.06423v2","created_at":"2026-07-05T11:49:31.319869+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.06423","created_at":"2026-07-05T11:49:31.319869+00:00"},{"alias_kind":"pith_short_12","alias_value":"62FFVHWIJI7D","created_at":"2026-07-05T11:49:31.319869+00:00"},{"alias_kind":"pith_short_16","alias_value":"62FFVHWIJI7D7UE7","created_at":"2026-07-05T11:49:31.319869+00:00"},{"alias_kind":"pith_short_8","alias_value":"62FFVHWI","created_at":"2026-07-05T11:49:31.319869+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.27219","citing_title":"On the resonant Carleson-Radon transform in all dimensions. The degree one resonant case","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2606.05400","citing_title":"LeanMarathon: Toward Reliable AI Co-Mathematicians through Long-Horizon Lean Autoformalization","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2602.24273","citing_title":"A Minimal Agent for Automated Theorem Proving","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/62FFVHWIJI7D7UE7J4J6UYATUX","json":"https://pith.science/pith/62FFVHWIJI7D7UE7J4J6UYATUX.json","graph_json":"https://pith.science/api/pith-number/62FFVHWIJI7D7UE7J4J6UYATUX/graph.json","events_json":"https://pith.science/api/pith-number/62FFVHWIJI7D7UE7J4J6UYATUX/events.json","paper":"https://pith.science/paper/62FFVHWI"},"agent_actions":{"view_html":"https://pith.science/pith/62FFVHWIJI7D7UE7J4J6UYATUX","download_json":"https://pith.science/pith/62FFVHWIJI7D7UE7J4J6UYATUX.json","view_paper":"https://pith.science/paper/62FFVHWI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.06423&json=true","fetch_graph":"https://pith.science/api/pith-number/62FFVHWIJI7D7UE7J4J6UYATUX/graph.json","fetch_events":"https://pith.science/api/pith-number/62FFVHWIJI7D7UE7J4J6UYATUX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/62FFVHWIJI7D7UE7J4J6UYATUX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/62FFVHWIJI7D7UE7J4J6UYATUX/action/storage_attestation","attest_author":"https://pith.science/pith/62FFVHWIJI7D7UE7J4J6UYATUX/action/author_attestation","sign_citation":"https://pith.science/pith/62FFVHWIJI7D7UE7J4J6UYATUX/action/citation_signature","submit_replication":"https://pith.science/pith/62FFVHWIJI7D7UE7J4J6UYATUX/action/replication_record"}},"created_at":"2026-07-05T11:49:31.319869+00:00","updated_at":"2026-07-05T11:49:31.319869+00:00"}