{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:XD3JAML44VM36AERGFJWUWGIMZ","short_pith_number":"pith:XD3JAML4","schema_version":"1.0","canonical_sha256":"b8f690317ce559bf009131536a58c8667de8de9fb4aa69bfb3b814bd9d1eb753","source":{"kind":"arxiv","id":"1510.03377","version":3},"attestation_state":"computed","paper":{"title":"The divisor function in arithmetic progressions modulo prime powers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Rizwanur Khan","submitted_at":"2015-10-12T17:57:41Z","abstract_excerpt":"We study the average value of the divisor function $\\tau(n)$ for $n\\le x$ with $n \\equiv a \\bmod q$. The divisor function is known to be evenly distributed over arithmetic progressions for all $q$ that are a little smaller than $x^{2/3}$. We show how to go past this barrier when $q=p^k$ for odd primes $p$ and any fixed integer $k\\ge 7$."},"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":"1510.03377","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-10-12T17:57:41Z","cross_cats_sorted":[],"title_canon_sha256":"56968c44869c5273d7ef0442b8e3374e3933a0ba7bdf12c8bacd3705f70f6708","abstract_canon_sha256":"07ebcfcebadef8a661b69afa73a2f25460db29010ed2027e1d1b707c0db57aaa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:03.046539Z","signature_b64":"XKWbW+98xgAiUFYuzlks9iK8EI7q8BLWbm4nw6iTAYC0eKVjidcmgfgE/3wL1Mghqf6nfP5vpFMVzijT7u90Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8f690317ce559bf009131536a58c8667de8de9fb4aa69bfb3b814bd9d1eb753","last_reissued_at":"2026-05-18T01:14:03.045932Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:03.045932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The divisor function in arithmetic progressions modulo prime powers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Rizwanur Khan","submitted_at":"2015-10-12T17:57:41Z","abstract_excerpt":"We study the average value of the divisor function $\\tau(n)$ for $n\\le x$ with $n \\equiv a \\bmod q$. The divisor function is known to be evenly distributed over arithmetic progressions for all $q$ that are a little smaller than $x^{2/3}$. We show how to go past this barrier when $q=p^k$ for odd primes $p$ and any fixed integer $k\\ge 7$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03377","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":""},"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":"1510.03377","created_at":"2026-05-18T01:14:03.046041+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.03377v3","created_at":"2026-05-18T01:14:03.046041+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03377","created_at":"2026-05-18T01:14:03.046041+00:00"},{"alias_kind":"pith_short_12","alias_value":"XD3JAML44VM3","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"XD3JAML44VM36AER","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"XD3JAML4","created_at":"2026-05-18T12:29:50.041715+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/XD3JAML44VM36AERGFJWUWGIMZ","json":"https://pith.science/pith/XD3JAML44VM36AERGFJWUWGIMZ.json","graph_json":"https://pith.science/api/pith-number/XD3JAML44VM36AERGFJWUWGIMZ/graph.json","events_json":"https://pith.science/api/pith-number/XD3JAML44VM36AERGFJWUWGIMZ/events.json","paper":"https://pith.science/paper/XD3JAML4"},"agent_actions":{"view_html":"https://pith.science/pith/XD3JAML44VM36AERGFJWUWGIMZ","download_json":"https://pith.science/pith/XD3JAML44VM36AERGFJWUWGIMZ.json","view_paper":"https://pith.science/paper/XD3JAML4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.03377&json=true","fetch_graph":"https://pith.science/api/pith-number/XD3JAML44VM36AERGFJWUWGIMZ/graph.json","fetch_events":"https://pith.science/api/pith-number/XD3JAML44VM36AERGFJWUWGIMZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XD3JAML44VM36AERGFJWUWGIMZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XD3JAML44VM36AERGFJWUWGIMZ/action/storage_attestation","attest_author":"https://pith.science/pith/XD3JAML44VM36AERGFJWUWGIMZ/action/author_attestation","sign_citation":"https://pith.science/pith/XD3JAML44VM36AERGFJWUWGIMZ/action/citation_signature","submit_replication":"https://pith.science/pith/XD3JAML44VM36AERGFJWUWGIMZ/action/replication_record"}},"created_at":"2026-05-18T01:14:03.046041+00:00","updated_at":"2026-05-18T01:14:03.046041+00:00"}