{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:XHP25XRDWTZKO4S7TS4S2ZSBMG","short_pith_number":"pith:XHP25XRD","schema_version":"1.0","canonical_sha256":"b9dfaede23b4f2a7725f9cb92d6641619192fc4b33365339751ac7d2fe53ceb0","source":{"kind":"arxiv","id":"2412.14594","version":2},"attestation_state":"computed","paper":{"title":"On arithmetic terms expressing the prime-counting function and the n-th prime","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Joseph M. Shunia, Mihai Prunescu","submitted_at":"2024-12-19T07:30:46Z","abstract_excerpt":"We present the first fixed-length elementary closed-form expressions for the prime-counting function, $\\pi(n)$, and the $n$-th prime number, $p(n)$. These expressions are arithmetic terms, requiring only a finite and fixed number of elementary arithmetic operations from the set: addition, subtraction, multiplication, integer division, and exponentiation. Mazzanti proved that every Kalmar function can be represented as an arithmetic term. We develop an arithmetic term representing the prime omega function, $\\omega(n)$, which counts the number of distinct prime divisors of a positive integer $n$"},"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":"2412.14594","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NT","submitted_at":"2024-12-19T07:30:46Z","cross_cats_sorted":[],"title_canon_sha256":"335655feecd112ff073b42ad60ae9c1c0f4aa3d4287921280f1d94abf8081032","abstract_canon_sha256":"140a7f380f2b1a0aa86bd5bd5292e2ca635655a6f72bc9bafb1376f1f71101a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:47:59.127611Z","signature_b64":"UQgu7xOXCBdD9yXqj7CjeQkSlg0P2iin+DR603M0Vhr5vU3ujYlbsZbog9nJK9vDY3k6zy5sXco4D9flng6DBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9dfaede23b4f2a7725f9cb92d6641619192fc4b33365339751ac7d2fe53ceb0","last_reissued_at":"2026-07-05T11:47:59.127103Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:47:59.127103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On arithmetic terms expressing the prime-counting function and the n-th prime","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Joseph M. Shunia, Mihai Prunescu","submitted_at":"2024-12-19T07:30:46Z","abstract_excerpt":"We present the first fixed-length elementary closed-form expressions for the prime-counting function, $\\pi(n)$, and the $n$-th prime number, $p(n)$. These expressions are arithmetic terms, requiring only a finite and fixed number of elementary arithmetic operations from the set: addition, subtraction, multiplication, integer division, and exponentiation. Mazzanti proved that every Kalmar function can be represented as an arithmetic term. We develop an arithmetic term representing the prime omega function, $\\omega(n)$, which counts the number of distinct prime divisors of a positive integer $n$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.14594","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.14594/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2412.14594","created_at":"2026-07-05T11:47:59.127166+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.14594v2","created_at":"2026-07-05T11:47:59.127166+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.14594","created_at":"2026-07-05T11:47:59.127166+00:00"},{"alias_kind":"pith_short_12","alias_value":"XHP25XRDWTZK","created_at":"2026-07-05T11:47:59.127166+00:00"},{"alias_kind":"pith_short_16","alias_value":"XHP25XRDWTZKO4S7","created_at":"2026-07-05T11:47:59.127166+00:00"},{"alias_kind":"pith_short_8","alias_value":"XHP25XRD","created_at":"2026-07-05T11:47:59.127166+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.09336","citing_title":"Undecidability, Chaos and Universality in Arithmetic Terms","ref_index":24,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XHP25XRDWTZKO4S7TS4S2ZSBMG","json":"https://pith.science/pith/XHP25XRDWTZKO4S7TS4S2ZSBMG.json","graph_json":"https://pith.science/api/pith-number/XHP25XRDWTZKO4S7TS4S2ZSBMG/graph.json","events_json":"https://pith.science/api/pith-number/XHP25XRDWTZKO4S7TS4S2ZSBMG/events.json","paper":"https://pith.science/paper/XHP25XRD"},"agent_actions":{"view_html":"https://pith.science/pith/XHP25XRDWTZKO4S7TS4S2ZSBMG","download_json":"https://pith.science/pith/XHP25XRDWTZKO4S7TS4S2ZSBMG.json","view_paper":"https://pith.science/paper/XHP25XRD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.14594&json=true","fetch_graph":"https://pith.science/api/pith-number/XHP25XRDWTZKO4S7TS4S2ZSBMG/graph.json","fetch_events":"https://pith.science/api/pith-number/XHP25XRDWTZKO4S7TS4S2ZSBMG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XHP25XRDWTZKO4S7TS4S2ZSBMG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XHP25XRDWTZKO4S7TS4S2ZSBMG/action/storage_attestation","attest_author":"https://pith.science/pith/XHP25XRDWTZKO4S7TS4S2ZSBMG/action/author_attestation","sign_citation":"https://pith.science/pith/XHP25XRDWTZKO4S7TS4S2ZSBMG/action/citation_signature","submit_replication":"https://pith.science/pith/XHP25XRDWTZKO4S7TS4S2ZSBMG/action/replication_record"}},"created_at":"2026-07-05T11:47:59.127166+00:00","updated_at":"2026-07-05T11:47:59.127166+00:00"}