REVIEW 1 cited by
The asymptotic formulae of sums of two smooth squares for divisor function
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
A natural number $n$ is $y$-smooth if the greatest prime factor of $n$ does not exceed $y$. Let $s_{1}$ and $s_{2}$ are $y$-smooth numbers. We consider sums of smooth squares of the binary Titchmarsh divisor problem and give asymptotic formulae for $\sum_{s_{1}^{2}+s_{2}^{2}\le x}\tau(s_{1}^{2}+s_{2}^{2}+1)$ for $(\log x)^{K}\le y<x^{\frac{1}{2}}$, where $K$ is large enough.
Forward citations
Cited by 1 Pith paper
-
Towards a scalable AI-driven framework for data-independent Cyber Threat Intelligence Information Extraction
0-CTI is a modular system that extracts cybersecurity entities and relationships from threat reports in both supervised and zero-shot modes, reporting higher entity-extraction F1 than the STIXnet baseline.
Discussion (0). Continue with ORCID to comment.