{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:5RQKRFAARZ63MGBSW2OXQIGV3U","short_pith_number":"pith:5RQKRFAA","schema_version":"1.0","canonical_sha256":"ec60a894008e7db61832b69d7820d5dd0679849c8777d8bf77d0883efd42bddf","source":{"kind":"arxiv","id":"1104.5235","version":1},"attestation_state":"computed","paper":{"title":"A note on the $\\Sopfr(n)$ function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Ruslan Sharipov","submitted_at":"2011-04-27T20:00:50Z","abstract_excerpt":"The $\\Sopfr(n)$ function is defined as the sum of prime factors of $n$ each of which is taken with its multiplicity. This function is studied numerically. The analogy between $\\Sopfr(n)$ and the primes distribution function is drawn and some conjectures for prime numbers formulated in terms of the $\\Sopfr(n)$ function are suggested."},"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":"1104.5235","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-04-27T20:00:50Z","cross_cats_sorted":[],"title_canon_sha256":"7d48f49a76c7f1ffe2b8acec9d3b19622fe2628c2a3b566ee9a4270fe067bfec","abstract_canon_sha256":"59b337bfff5169d54cd31d32abca117197091b3fdcf4562352c146362e2f5f78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:21.890247Z","signature_b64":"oBPaKY0tA8yBoafd6wpN3VO1+aibBm6NVzX9bzZCXsSH+3EqdLjASzorXEUiAyYj8lEt2MVgoHzCtbFM0+KlDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec60a894008e7db61832b69d7820d5dd0679849c8777d8bf77d0883efd42bddf","last_reissued_at":"2026-05-18T04:23:21.889491Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:21.889491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on the $\\Sopfr(n)$ function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Ruslan Sharipov","submitted_at":"2011-04-27T20:00:50Z","abstract_excerpt":"The $\\Sopfr(n)$ function is defined as the sum of prime factors of $n$ each of which is taken with its multiplicity. This function is studied numerically. The analogy between $\\Sopfr(n)$ and the primes distribution function is drawn and some conjectures for prime numbers formulated in terms of the $\\Sopfr(n)$ function are suggested."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.5235","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":"1104.5235","created_at":"2026-05-18T04:23:21.889589+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.5235v1","created_at":"2026-05-18T04:23:21.889589+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.5235","created_at":"2026-05-18T04:23:21.889589+00:00"},{"alias_kind":"pith_short_12","alias_value":"5RQKRFAARZ63","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"5RQKRFAARZ63MGBS","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"5RQKRFAA","created_at":"2026-05-18T12:26:20.644004+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/5RQKRFAARZ63MGBSW2OXQIGV3U","json":"https://pith.science/pith/5RQKRFAARZ63MGBSW2OXQIGV3U.json","graph_json":"https://pith.science/api/pith-number/5RQKRFAARZ63MGBSW2OXQIGV3U/graph.json","events_json":"https://pith.science/api/pith-number/5RQKRFAARZ63MGBSW2OXQIGV3U/events.json","paper":"https://pith.science/paper/5RQKRFAA"},"agent_actions":{"view_html":"https://pith.science/pith/5RQKRFAARZ63MGBSW2OXQIGV3U","download_json":"https://pith.science/pith/5RQKRFAARZ63MGBSW2OXQIGV3U.json","view_paper":"https://pith.science/paper/5RQKRFAA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.5235&json=true","fetch_graph":"https://pith.science/api/pith-number/5RQKRFAARZ63MGBSW2OXQIGV3U/graph.json","fetch_events":"https://pith.science/api/pith-number/5RQKRFAARZ63MGBSW2OXQIGV3U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5RQKRFAARZ63MGBSW2OXQIGV3U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5RQKRFAARZ63MGBSW2OXQIGV3U/action/storage_attestation","attest_author":"https://pith.science/pith/5RQKRFAARZ63MGBSW2OXQIGV3U/action/author_attestation","sign_citation":"https://pith.science/pith/5RQKRFAARZ63MGBSW2OXQIGV3U/action/citation_signature","submit_replication":"https://pith.science/pith/5RQKRFAARZ63MGBSW2OXQIGV3U/action/replication_record"}},"created_at":"2026-05-18T04:23:21.889589+00:00","updated_at":"2026-05-18T04:23:21.889589+00:00"}