{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5AC2SRD5RVIRXEPHWW2HG365X2","short_pith_number":"pith:5AC2SRD5","schema_version":"1.0","canonical_sha256":"e805a9447d8d511b91e7b5b4736fddbea38245c8b3ef7ee4f054989d8caeda3a","source":{"kind":"arxiv","id":"2506.22634","version":1},"attestation_state":"computed","paper":{"title":"A Rigorous Error Bound for the TG Kernel in Prime Counting","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DS","cs.NA","math.NA"],"primary_cat":"math.NT","authors_text":"Bugra Kilictas, Faruk Alpay","submitted_at":"2025-06-27T20:54:06Z","abstract_excerpt":"We establish rigorous error bounds for prime counting using a truncated Gaussian (TG) kernel in the explicit formula framework. Our main theorem proves that the approximation error remains globally below 1/2 for all sufficiently large arguments, guaranteeing exact computation of {\\pi}(x) through simple rounding, without relying on unproven hypotheses.\n  The TG kernel construction employs Gaussian-like test functions with compact support, engineered with vanishing moments to eliminate main terms. For x with 10^8 decimal digits, we demonstrate that only ~1200 nontrivial zeta zeros suffice to ach"},"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":"2506.22634","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.NT","submitted_at":"2025-06-27T20:54:06Z","cross_cats_sorted":["cs.DS","cs.NA","math.NA"],"title_canon_sha256":"0c271c10f14c151c18f8c1f95414c986aac5fa263ea37321874d63b7df2aa3b9","abstract_canon_sha256":"5347cd77d3c6bba87664e944f02001f672b024876455f0574a12b223906cbae2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:28:42.225333Z","signature_b64":"fiIgPK2y52R875PdxLikAmi2la/Ibh3by4Ev7UMJx8uz3HY4EimRZB42p57o02gac9REVesMQl92cQLQVWOzBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e805a9447d8d511b91e7b5b4736fddbea38245c8b3ef7ee4f054989d8caeda3a","last_reissued_at":"2026-07-05T11:28:42.224844Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:28:42.224844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Rigorous Error Bound for the TG Kernel in Prime Counting","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DS","cs.NA","math.NA"],"primary_cat":"math.NT","authors_text":"Bugra Kilictas, Faruk Alpay","submitted_at":"2025-06-27T20:54:06Z","abstract_excerpt":"We establish rigorous error bounds for prime counting using a truncated Gaussian (TG) kernel in the explicit formula framework. Our main theorem proves that the approximation error remains globally below 1/2 for all sufficiently large arguments, guaranteeing exact computation of {\\pi}(x) through simple rounding, without relying on unproven hypotheses.\n  The TG kernel construction employs Gaussian-like test functions with compact support, engineered with vanishing moments to eliminate main terms. For x with 10^8 decimal digits, we demonstrate that only ~1200 nontrivial zeta zeros suffice to ach"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.22634","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.22634/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":"2506.22634","created_at":"2026-07-05T11:28:42.224900+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.22634v1","created_at":"2026-07-05T11:28:42.224900+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.22634","created_at":"2026-07-05T11:28:42.224900+00:00"},{"alias_kind":"pith_short_12","alias_value":"5AC2SRD5RVIR","created_at":"2026-07-05T11:28:42.224900+00:00"},{"alias_kind":"pith_short_16","alias_value":"5AC2SRD5RVIRXEPH","created_at":"2026-07-05T11:28:42.224900+00:00"},{"alias_kind":"pith_short_8","alias_value":"5AC2SRD5","created_at":"2026-07-05T11:28:42.224900+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/5AC2SRD5RVIRXEPHWW2HG365X2","json":"https://pith.science/pith/5AC2SRD5RVIRXEPHWW2HG365X2.json","graph_json":"https://pith.science/api/pith-number/5AC2SRD5RVIRXEPHWW2HG365X2/graph.json","events_json":"https://pith.science/api/pith-number/5AC2SRD5RVIRXEPHWW2HG365X2/events.json","paper":"https://pith.science/paper/5AC2SRD5"},"agent_actions":{"view_html":"https://pith.science/pith/5AC2SRD5RVIRXEPHWW2HG365X2","download_json":"https://pith.science/pith/5AC2SRD5RVIRXEPHWW2HG365X2.json","view_paper":"https://pith.science/paper/5AC2SRD5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.22634&json=true","fetch_graph":"https://pith.science/api/pith-number/5AC2SRD5RVIRXEPHWW2HG365X2/graph.json","fetch_events":"https://pith.science/api/pith-number/5AC2SRD5RVIRXEPHWW2HG365X2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5AC2SRD5RVIRXEPHWW2HG365X2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5AC2SRD5RVIRXEPHWW2HG365X2/action/storage_attestation","attest_author":"https://pith.science/pith/5AC2SRD5RVIRXEPHWW2HG365X2/action/author_attestation","sign_citation":"https://pith.science/pith/5AC2SRD5RVIRXEPHWW2HG365X2/action/citation_signature","submit_replication":"https://pith.science/pith/5AC2SRD5RVIRXEPHWW2HG365X2/action/replication_record"}},"created_at":"2026-07-05T11:28:42.224900+00:00","updated_at":"2026-07-05T11:28:42.224900+00:00"}