{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4OF6MJRSCFFUGD5ML4VVVFGIB4","short_pith_number":"pith:4OF6MJRS","schema_version":"1.0","canonical_sha256":"e38be62632114b430fac5f2b5a94c80f3aac7f7651a9addff0adb8a7bb2dbbaa","source":{"kind":"arxiv","id":"1607.08521","version":3},"attestation_state":"computed","paper":{"title":"On sums of prime factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Aristos Tzavellas, Dimitris Vartziotis","submitted_at":"2016-07-22T12:26:44Z","abstract_excerpt":"We study the arithmetic function sopfr$(n)$ (OEIS A001414) which gives the sum of prime factors (with repetition) of a number $n$. In particular we obtain the asymptotic formula $$ \\sum_{n \\leq x} \\rm{sopfr}(n) \\sim \\frac{\\pi^2}{12} \\frac{x^2}{\\log x},$$ which holds as well for the function sopf$(n)$ (OEIS A008472) that just gives the sum of distinct prime factors of $n$. This asymptotic formula was already stated by R. Jakimcyuk \\cite{rj12} which was brought to our attention after the completion of the first version of this manuscript."},"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":"1607.08521","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-07-22T12:26:44Z","cross_cats_sorted":[],"title_canon_sha256":"b82f11ee656ea8865adca1fc80cc565cfb3da9d4dac4a30cf954b3740b56e18a","abstract_canon_sha256":"9c25ff4362dc9a33d8cb6d6fcefba88fd4d59c3ecf109e6a77ad875c0d98dd4e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:57.869741Z","signature_b64":"nCtZpFCPcWcnW8Yx3YhYEUN5wqmNe6+5fckx2BJ3rhxIp+hodvfUmripWJ75KkXRrR2NnhVCfyy+xSRgb//qDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e38be62632114b430fac5f2b5a94c80f3aac7f7651a9addff0adb8a7bb2dbbaa","last_reissued_at":"2026-05-18T00:44:57.869125Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:57.869125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On sums of prime factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Aristos Tzavellas, Dimitris Vartziotis","submitted_at":"2016-07-22T12:26:44Z","abstract_excerpt":"We study the arithmetic function sopfr$(n)$ (OEIS A001414) which gives the sum of prime factors (with repetition) of a number $n$. In particular we obtain the asymptotic formula $$ \\sum_{n \\leq x} \\rm{sopfr}(n) \\sim \\frac{\\pi^2}{12} \\frac{x^2}{\\log x},$$ which holds as well for the function sopf$(n)$ (OEIS A008472) that just gives the sum of distinct prime factors of $n$. This asymptotic formula was already stated by R. Jakimcyuk \\cite{rj12} which was brought to our attention after the completion of the first version of this manuscript."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08521","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":"1607.08521","created_at":"2026-05-18T00:44:57.869225+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.08521v3","created_at":"2026-05-18T00:44:57.869225+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08521","created_at":"2026-05-18T00:44:57.869225+00:00"},{"alias_kind":"pith_short_12","alias_value":"4OF6MJRSCFFU","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4OF6MJRSCFFUGD5M","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4OF6MJRS","created_at":"2026-05-18T12:29:58.707656+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/4OF6MJRSCFFUGD5ML4VVVFGIB4","json":"https://pith.science/pith/4OF6MJRSCFFUGD5ML4VVVFGIB4.json","graph_json":"https://pith.science/api/pith-number/4OF6MJRSCFFUGD5ML4VVVFGIB4/graph.json","events_json":"https://pith.science/api/pith-number/4OF6MJRSCFFUGD5ML4VVVFGIB4/events.json","paper":"https://pith.science/paper/4OF6MJRS"},"agent_actions":{"view_html":"https://pith.science/pith/4OF6MJRSCFFUGD5ML4VVVFGIB4","download_json":"https://pith.science/pith/4OF6MJRSCFFUGD5ML4VVVFGIB4.json","view_paper":"https://pith.science/paper/4OF6MJRS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.08521&json=true","fetch_graph":"https://pith.science/api/pith-number/4OF6MJRSCFFUGD5ML4VVVFGIB4/graph.json","fetch_events":"https://pith.science/api/pith-number/4OF6MJRSCFFUGD5ML4VVVFGIB4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4OF6MJRSCFFUGD5ML4VVVFGIB4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4OF6MJRSCFFUGD5ML4VVVFGIB4/action/storage_attestation","attest_author":"https://pith.science/pith/4OF6MJRSCFFUGD5ML4VVVFGIB4/action/author_attestation","sign_citation":"https://pith.science/pith/4OF6MJRSCFFUGD5ML4VVVFGIB4/action/citation_signature","submit_replication":"https://pith.science/pith/4OF6MJRSCFFUGD5ML4VVVFGIB4/action/replication_record"}},"created_at":"2026-05-18T00:44:57.869225+00:00","updated_at":"2026-05-18T00:44:57.869225+00:00"}