{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:FL4DJOA3H34AX32BFAMUYV7AJQ","short_pith_number":"pith:FL4DJOA3","schema_version":"1.0","canonical_sha256":"2af834b81b3ef80bef4128194c57e04c38496bbae77b36baaffeda5fdc08e3d4","source":{"kind":"arxiv","id":"1106.4744","version":2},"attestation_state":"computed","paper":{"title":"On the general additive divisor problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Aleksandar Ivic, Jie Wu (IECN)","submitted_at":"2011-06-23T14:46:35Z","abstract_excerpt":"We obtain a new upper bound for $\\sum_{h\\le H}\\Delta_k(N,h)$ for $1\\le H\\le N$, $k\\in \\N$, $k\\ge3$, where $\\Delta_k(N,h)$ is the (expected) error term in the asymptotic formula for $\\sum_{N < n\\le2N}d_k(n)d_k(n+h)$, and $d_k(n)$ is the divisor function generated by $\\zeta(s)^k$. When $k=3$ the result improves, for $H\\ge N^{1/2}$, the bound given in the recent work \\cite{[1]} of Baier, Browning, Marasingha and Zhao, who dealt with the case $k=3$."},"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":"1106.4744","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-06-23T14:46:35Z","cross_cats_sorted":[],"title_canon_sha256":"c6238f066d5eeaa69bfb7d8d33c61fd4e534938ce5e7a19ab2698f656aad9b46","abstract_canon_sha256":"9cfc5753fd74612f3731802e3032174c6b107ef20cd8108ee4936d189115be6d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:32.182856Z","signature_b64":"vC2IjxqNJ07UqVekxgtE0l5qjSQVEe2ofv+xXIEv25prsjSekuy6adgWEpSx4zVLVfutotGZNF8/kGaSNaY+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2af834b81b3ef80bef4128194c57e04c38496bbae77b36baaffeda5fdc08e3d4","last_reissued_at":"2026-05-18T04:07:32.182130Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:32.182130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the general additive divisor problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Aleksandar Ivic, Jie Wu (IECN)","submitted_at":"2011-06-23T14:46:35Z","abstract_excerpt":"We obtain a new upper bound for $\\sum_{h\\le H}\\Delta_k(N,h)$ for $1\\le H\\le N$, $k\\in \\N$, $k\\ge3$, where $\\Delta_k(N,h)$ is the (expected) error term in the asymptotic formula for $\\sum_{N < n\\le2N}d_k(n)d_k(n+h)$, and $d_k(n)$ is the divisor function generated by $\\zeta(s)^k$. When $k=3$ the result improves, for $H\\ge N^{1/2}$, the bound given in the recent work \\cite{[1]} of Baier, Browning, Marasingha and Zhao, who dealt with the case $k=3$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.4744","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":""},"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":"1106.4744","created_at":"2026-05-18T04:07:32.182244+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.4744v2","created_at":"2026-05-18T04:07:32.182244+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.4744","created_at":"2026-05-18T04:07:32.182244+00:00"},{"alias_kind":"pith_short_12","alias_value":"FL4DJOA3H34A","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"FL4DJOA3H34AX32B","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"FL4DJOA3","created_at":"2026-05-18T12:26:28.662955+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/FL4DJOA3H34AX32BFAMUYV7AJQ","json":"https://pith.science/pith/FL4DJOA3H34AX32BFAMUYV7AJQ.json","graph_json":"https://pith.science/api/pith-number/FL4DJOA3H34AX32BFAMUYV7AJQ/graph.json","events_json":"https://pith.science/api/pith-number/FL4DJOA3H34AX32BFAMUYV7AJQ/events.json","paper":"https://pith.science/paper/FL4DJOA3"},"agent_actions":{"view_html":"https://pith.science/pith/FL4DJOA3H34AX32BFAMUYV7AJQ","download_json":"https://pith.science/pith/FL4DJOA3H34AX32BFAMUYV7AJQ.json","view_paper":"https://pith.science/paper/FL4DJOA3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.4744&json=true","fetch_graph":"https://pith.science/api/pith-number/FL4DJOA3H34AX32BFAMUYV7AJQ/graph.json","fetch_events":"https://pith.science/api/pith-number/FL4DJOA3H34AX32BFAMUYV7AJQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FL4DJOA3H34AX32BFAMUYV7AJQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FL4DJOA3H34AX32BFAMUYV7AJQ/action/storage_attestation","attest_author":"https://pith.science/pith/FL4DJOA3H34AX32BFAMUYV7AJQ/action/author_attestation","sign_citation":"https://pith.science/pith/FL4DJOA3H34AX32BFAMUYV7AJQ/action/citation_signature","submit_replication":"https://pith.science/pith/FL4DJOA3H34AX32BFAMUYV7AJQ/action/replication_record"}},"created_at":"2026-05-18T04:07:32.182244+00:00","updated_at":"2026-05-18T04:07:32.182244+00:00"}