{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UQCK7PJASYJDY4A4VG2RJDZ6RO","short_pith_number":"pith:UQCK7PJA","schema_version":"1.0","canonical_sha256":"a404afbd2096123c701ca9b5148f3e8b9ae550a252ca670ad1c366a71a0221f6","source":{"kind":"arxiv","id":"1507.08893","version":1},"attestation_state":"computed","paper":{"title":"On the Number of Divisors of $n^2 -1$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Adrian Dudek","submitted_at":"2015-07-30T02:51:01Z","abstract_excerpt":"We prove an asymptotic formula for the sum $\\sum_{n \\leq N} d(n^2 - 1)$, where $d(n)$ denotes the number of divisors of $n$. During the course of our proof, we also furnish an asymptotic formula for the sum $\\sum_{d \\leq N} g(d)$, where $g(d)$ denotes the number of solutions $x$ in $\\mathbb{Z}_d$ to the equation $x^2 \\equiv 1 \\mod d$."},"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":"1507.08893","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-07-30T02:51:01Z","cross_cats_sorted":[],"title_canon_sha256":"b83a1cdd3ba08c9b31bfd103d046eee876196adcae6b6c6ce781d64fe02f6828","abstract_canon_sha256":"f0ffd70ff5a50315bf6fc1f78955f9a11b96d6c7676886ca585dced666ac19d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:13.682028Z","signature_b64":"vwCYaNidpIJfv8TogHWDech4hazLIC6d949+rEvUA+WKl7PNqJPW+y7njwLzhU3lTPHLKRfrVAnhRbAWhmt5Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a404afbd2096123c701ca9b5148f3e8b9ae550a252ca670ad1c366a71a0221f6","last_reissued_at":"2026-05-17T23:53:13.681432Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:13.681432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Number of Divisors of $n^2 -1$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Adrian Dudek","submitted_at":"2015-07-30T02:51:01Z","abstract_excerpt":"We prove an asymptotic formula for the sum $\\sum_{n \\leq N} d(n^2 - 1)$, where $d(n)$ denotes the number of divisors of $n$. During the course of our proof, we also furnish an asymptotic formula for the sum $\\sum_{d \\leq N} g(d)$, where $g(d)$ denotes the number of solutions $x$ in $\\mathbb{Z}_d$ to the equation $x^2 \\equiv 1 \\mod d$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08893","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":"1507.08893","created_at":"2026-05-17T23:53:13.681512+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.08893v1","created_at":"2026-05-17T23:53:13.681512+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08893","created_at":"2026-05-17T23:53:13.681512+00:00"},{"alias_kind":"pith_short_12","alias_value":"UQCK7PJASYJD","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UQCK7PJASYJDY4A4","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UQCK7PJA","created_at":"2026-05-18T12:29:44.643036+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/UQCK7PJASYJDY4A4VG2RJDZ6RO","json":"https://pith.science/pith/UQCK7PJASYJDY4A4VG2RJDZ6RO.json","graph_json":"https://pith.science/api/pith-number/UQCK7PJASYJDY4A4VG2RJDZ6RO/graph.json","events_json":"https://pith.science/api/pith-number/UQCK7PJASYJDY4A4VG2RJDZ6RO/events.json","paper":"https://pith.science/paper/UQCK7PJA"},"agent_actions":{"view_html":"https://pith.science/pith/UQCK7PJASYJDY4A4VG2RJDZ6RO","download_json":"https://pith.science/pith/UQCK7PJASYJDY4A4VG2RJDZ6RO.json","view_paper":"https://pith.science/paper/UQCK7PJA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.08893&json=true","fetch_graph":"https://pith.science/api/pith-number/UQCK7PJASYJDY4A4VG2RJDZ6RO/graph.json","fetch_events":"https://pith.science/api/pith-number/UQCK7PJASYJDY4A4VG2RJDZ6RO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UQCK7PJASYJDY4A4VG2RJDZ6RO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UQCK7PJASYJDY4A4VG2RJDZ6RO/action/storage_attestation","attest_author":"https://pith.science/pith/UQCK7PJASYJDY4A4VG2RJDZ6RO/action/author_attestation","sign_citation":"https://pith.science/pith/UQCK7PJASYJDY4A4VG2RJDZ6RO/action/citation_signature","submit_replication":"https://pith.science/pith/UQCK7PJASYJDY4A4VG2RJDZ6RO/action/replication_record"}},"created_at":"2026-05-17T23:53:13.681512+00:00","updated_at":"2026-05-17T23:53:13.681512+00:00"}