{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ZZJFDQRQRB6AU6CLDKFZM3BYOY","short_pith_number":"pith:ZZJFDQRQ","schema_version":"1.0","canonical_sha256":"ce5251c230887c0a784b1a8b966c38762cf31f47ca341a5e601bd7927f0f6b6c","source":{"kind":"arxiv","id":"2606.17399","version":1},"attestation_state":"computed","paper":{"title":"The Discrete-Log Clock: How a Transformer Learns Modular Multiplication","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Huu Danh Nguyen (Stanford University)","submitted_at":"2026-06-16T01:16:26Z","abstract_excerpt":"When small transformers grok modular multiplication, prior work reports that the learned embedding has a \"dense\" Fourier spectrum requiring all frequencies. This contrasts with modular addition, where only a sparse set of key frequencies suffices. We show this density is an artifact of analyzing in the wrong basis. The natural Fourier transform for multiplication is not the standard additive DFT but the multiplicative character transform, which decomposes functions on the multiplicative group $(\\mathbb{Z}/p\\mathbb{Z})^*$ into its irreducible representations. Applying this transform to a grokke"},"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":"2606.17399","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-16T01:16:26Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"6a43b224ddbf16d99267fd5de4edf060fab9a67a14c9a051d3af24219acaafe9","abstract_canon_sha256":"3727543b4c13be5db3c1c912f7364063b153d4eb74b2a2bef49aa9eeb64e70d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:10:11.881300Z","signature_b64":"OugBBKENbGU96nvjiymhT5rv8L7vKt81EbevZlwbi6iGLDwJI8HtOxPFyPgd0KRNeLiobR3tDnWDUFOor33lDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce5251c230887c0a784b1a8b966c38762cf31f47ca341a5e601bd7927f0f6b6c","last_reissued_at":"2026-06-19T16:10:11.880975Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:10:11.880975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Discrete-Log Clock: How a Transformer Learns Modular Multiplication","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Huu Danh Nguyen (Stanford University)","submitted_at":"2026-06-16T01:16:26Z","abstract_excerpt":"When small transformers grok modular multiplication, prior work reports that the learned embedding has a \"dense\" Fourier spectrum requiring all frequencies. This contrasts with modular addition, where only a sparse set of key frequencies suffices. We show this density is an artifact of analyzing in the wrong basis. The natural Fourier transform for multiplication is not the standard additive DFT but the multiplicative character transform, which decomposes functions on the multiplicative group $(\\mathbb{Z}/p\\mathbb{Z})^*$ into its irreducible representations. Applying this transform to a grokke"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.17399","kind":"arxiv","version":1},"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/2606.17399/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":"2606.17399","created_at":"2026-06-19T16:10:11.881030+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.17399v1","created_at":"2026-06-19T16:10:11.881030+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.17399","created_at":"2026-06-19T16:10:11.881030+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZZJFDQRQRB6A","created_at":"2026-06-19T16:10:11.881030+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZZJFDQRQRB6AU6CL","created_at":"2026-06-19T16:10:11.881030+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZZJFDQRQ","created_at":"2026-06-19T16:10:11.881030+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/ZZJFDQRQRB6AU6CLDKFZM3BYOY","json":"https://pith.science/pith/ZZJFDQRQRB6AU6CLDKFZM3BYOY.json","graph_json":"https://pith.science/api/pith-number/ZZJFDQRQRB6AU6CLDKFZM3BYOY/graph.json","events_json":"https://pith.science/api/pith-number/ZZJFDQRQRB6AU6CLDKFZM3BYOY/events.json","paper":"https://pith.science/paper/ZZJFDQRQ"},"agent_actions":{"view_html":"https://pith.science/pith/ZZJFDQRQRB6AU6CLDKFZM3BYOY","download_json":"https://pith.science/pith/ZZJFDQRQRB6AU6CLDKFZM3BYOY.json","view_paper":"https://pith.science/paper/ZZJFDQRQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.17399&json=true","fetch_graph":"https://pith.science/api/pith-number/ZZJFDQRQRB6AU6CLDKFZM3BYOY/graph.json","fetch_events":"https://pith.science/api/pith-number/ZZJFDQRQRB6AU6CLDKFZM3BYOY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZZJFDQRQRB6AU6CLDKFZM3BYOY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZZJFDQRQRB6AU6CLDKFZM3BYOY/action/storage_attestation","attest_author":"https://pith.science/pith/ZZJFDQRQRB6AU6CLDKFZM3BYOY/action/author_attestation","sign_citation":"https://pith.science/pith/ZZJFDQRQRB6AU6CLDKFZM3BYOY/action/citation_signature","submit_replication":"https://pith.science/pith/ZZJFDQRQRB6AU6CLDKFZM3BYOY/action/replication_record"}},"created_at":"2026-06-19T16:10:11.881030+00:00","updated_at":"2026-06-19T16:10:11.881030+00:00"}