{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QVJFTMSME7BL5J2PJWSB2R7TFG","short_pith_number":"pith:QVJFTMSM","schema_version":"1.0","canonical_sha256":"855259b24c27c2bea74f4da41d47f3299a20002b4fdd24ceb4e3530c5f0fd3f2","source":{"kind":"arxiv","id":"1612.01143","version":1},"attestation_state":"computed","paper":{"title":"A note on the binary additive divisor problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Dmitry Frolenkov, Olga Balkanova","submitted_at":"2016-12-04T17:02:08Z","abstract_excerpt":"In this note we show that the methods of Motohashi and Meurman yield the same upper bound on the error term in the binary additive divisor problem. With this goal, we improve an estimate in the proof of Motohashi."},"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":"1612.01143","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-12-04T17:02:08Z","cross_cats_sorted":[],"title_canon_sha256":"3027f1b5f711d511559a6817eff588654babda91e849133d687a69058d717c42","abstract_canon_sha256":"d7f8d3c47b69fc68e6a47c37570f8cd927eb2fea48d3d9b95dc03abc89c0cf2b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:53.265343Z","signature_b64":"deJQRHcO6i0IBzs2K6TkNWPhtwCldFmmeZJHKk0hOfnRKdgeiG0Ps0VUrkqqHUVmMounwi9ctXlzW5NcXeJgCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"855259b24c27c2bea74f4da41d47f3299a20002b4fdd24ceb4e3530c5f0fd3f2","last_reissued_at":"2026-05-18T00:55:53.264811Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:53.264811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on the binary additive divisor problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Dmitry Frolenkov, Olga Balkanova","submitted_at":"2016-12-04T17:02:08Z","abstract_excerpt":"In this note we show that the methods of Motohashi and Meurman yield the same upper bound on the error term in the binary additive divisor problem. With this goal, we improve an estimate in the proof of Motohashi."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01143","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":""},"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":"1612.01143","created_at":"2026-05-18T00:55:53.264880+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.01143v1","created_at":"2026-05-18T00:55:53.264880+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01143","created_at":"2026-05-18T00:55:53.264880+00:00"},{"alias_kind":"pith_short_12","alias_value":"QVJFTMSME7BL","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"QVJFTMSME7BL5J2P","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"QVJFTMSM","created_at":"2026-05-18T12:30:41.710351+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/QVJFTMSME7BL5J2PJWSB2R7TFG","json":"https://pith.science/pith/QVJFTMSME7BL5J2PJWSB2R7TFG.json","graph_json":"https://pith.science/api/pith-number/QVJFTMSME7BL5J2PJWSB2R7TFG/graph.json","events_json":"https://pith.science/api/pith-number/QVJFTMSME7BL5J2PJWSB2R7TFG/events.json","paper":"https://pith.science/paper/QVJFTMSM"},"agent_actions":{"view_html":"https://pith.science/pith/QVJFTMSME7BL5J2PJWSB2R7TFG","download_json":"https://pith.science/pith/QVJFTMSME7BL5J2PJWSB2R7TFG.json","view_paper":"https://pith.science/paper/QVJFTMSM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.01143&json=true","fetch_graph":"https://pith.science/api/pith-number/QVJFTMSME7BL5J2PJWSB2R7TFG/graph.json","fetch_events":"https://pith.science/api/pith-number/QVJFTMSME7BL5J2PJWSB2R7TFG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QVJFTMSME7BL5J2PJWSB2R7TFG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QVJFTMSME7BL5J2PJWSB2R7TFG/action/storage_attestation","attest_author":"https://pith.science/pith/QVJFTMSME7BL5J2PJWSB2R7TFG/action/author_attestation","sign_citation":"https://pith.science/pith/QVJFTMSME7BL5J2PJWSB2R7TFG/action/citation_signature","submit_replication":"https://pith.science/pith/QVJFTMSME7BL5J2PJWSB2R7TFG/action/replication_record"}},"created_at":"2026-05-18T00:55:53.264880+00:00","updated_at":"2026-05-18T00:55:53.264880+00:00"}