{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:SNC6FWOUVFZ3DLJJGSV6RN3BB5","short_pith_number":"pith:SNC6FWOU","canonical_record":{"source":{"id":"2606.31761","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NT","submitted_at":"2026-06-30T14:49:55Z","cross_cats_sorted":[],"title_canon_sha256":"7982f07f4b01860be4c1673c7b6213dc6eb8e91944ae1ea7ddee9c354a3c0eb1","abstract_canon_sha256":"725e76f96a60b4d08e03e377f5cd00196a06d8523b8b2758c476e9705b7a9240"},"schema_version":"1.0"},"canonical_sha256":"9345e2d9d4a973b1ad2934abe8b7610f7424bbc664cea75090b2692b3f280f60","source":{"kind":"arxiv","id":"2606.31761","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.31761","created_at":"2026-07-01T01:18:13Z"},{"alias_kind":"arxiv_version","alias_value":"2606.31761v1","created_at":"2026-07-01T01:18:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.31761","created_at":"2026-07-01T01:18:13Z"},{"alias_kind":"pith_short_12","alias_value":"SNC6FWOUVFZ3","created_at":"2026-07-01T01:18:13Z"},{"alias_kind":"pith_short_16","alias_value":"SNC6FWOUVFZ3DLJJ","created_at":"2026-07-01T01:18:13Z"},{"alias_kind":"pith_short_8","alias_value":"SNC6FWOU","created_at":"2026-07-01T01:18:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:SNC6FWOUVFZ3DLJJGSV6RN3BB5","target":"record","payload":{"canonical_record":{"source":{"id":"2606.31761","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NT","submitted_at":"2026-06-30T14:49:55Z","cross_cats_sorted":[],"title_canon_sha256":"7982f07f4b01860be4c1673c7b6213dc6eb8e91944ae1ea7ddee9c354a3c0eb1","abstract_canon_sha256":"725e76f96a60b4d08e03e377f5cd00196a06d8523b8b2758c476e9705b7a9240"},"schema_version":"1.0"},"canonical_sha256":"9345e2d9d4a973b1ad2934abe8b7610f7424bbc664cea75090b2692b3f280f60","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-01T01:18:13.975328Z","signature_b64":"nXQLoKCrfhjB7wHN0fEj+m7AJlHgQChq/QrfFbG5cTmFK0Z5YiAsetowqDflfw72Iv7ybTVrOhl+n0Rq5bUHAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9345e2d9d4a973b1ad2934abe8b7610f7424bbc664cea75090b2692b3f280f60","last_reissued_at":"2026-07-01T01:18:13.974882Z","signature_status":"signed_v1","first_computed_at":"2026-07-01T01:18:13.974882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.31761","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-01T01:18:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PwSBWizg5cbo5DdMUI5K7epaq0yNhiFCnZH5NI+WswsDzVEOLm8DkV8Hh539rrsXbjhEETOtFOduZHydwPoODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T05:58:22.767060Z"},"content_sha256":"447ada79ab35ac2353ecbe94a6a12045137764a9660fe23487db8059c12811f3","schema_version":"1.0","event_id":"sha256:447ada79ab35ac2353ecbe94a6a12045137764a9660fe23487db8059c12811f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:SNC6FWOUVFZ3DLJJGSV6RN3BB5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Algorithm for Estimating Prime Counts","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Artur Samojluk, Artur Siemaszko","submitted_at":"2026-06-30T14:49:55Z","abstract_excerpt":"We propose an efficient algorithm for approximating the prime counting function $\\pi(x)$ using a structured non-uniform partition derived from generalized triangular numbers. The method yields an incremental estimator whose updates require only local computations, resulting in amortized $O(1)$ update complexity and total complexity $O(\\sqrt x)$.\n  A correction term obtained through extensive numerical experimentation significantly improves the approximation accuracy. Computational tests for values up to $10^{19}$\n  show strong agreement with known values of $\\pi(x)$, with accuracy comparable t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.31761","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/2606.31761/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-01T01:18:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Auuiu+0fnPUUrfnZVhDHtPuZcc6eTbDtYuq7rVcesTnsjQo/UPK7jdB5QVC++iR9KlTGSGzgFQHlxIUEASBVBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T05:58:22.767582Z"},"content_sha256":"e9eef9b92da72080a9f85c5f6b22fde8a02f95755221327ff101607fe9bec19b","schema_version":"1.0","event_id":"sha256:e9eef9b92da72080a9f85c5f6b22fde8a02f95755221327ff101607fe9bec19b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SNC6FWOUVFZ3DLJJGSV6RN3BB5/bundle.json","state_url":"https://pith.science/pith/SNC6FWOUVFZ3DLJJGSV6RN3BB5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SNC6FWOUVFZ3DLJJGSV6RN3BB5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-04T05:58:22Z","links":{"resolver":"https://pith.science/pith/SNC6FWOUVFZ3DLJJGSV6RN3BB5","bundle":"https://pith.science/pith/SNC6FWOUVFZ3DLJJGSV6RN3BB5/bundle.json","state":"https://pith.science/pith/SNC6FWOUVFZ3DLJJGSV6RN3BB5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SNC6FWOUVFZ3DLJJGSV6RN3BB5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SNC6FWOUVFZ3DLJJGSV6RN3BB5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"725e76f96a60b4d08e03e377f5cd00196a06d8523b8b2758c476e9705b7a9240","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NT","submitted_at":"2026-06-30T14:49:55Z","title_canon_sha256":"7982f07f4b01860be4c1673c7b6213dc6eb8e91944ae1ea7ddee9c354a3c0eb1"},"schema_version":"1.0","source":{"id":"2606.31761","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.31761","created_at":"2026-07-01T01:18:13Z"},{"alias_kind":"arxiv_version","alias_value":"2606.31761v1","created_at":"2026-07-01T01:18:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.31761","created_at":"2026-07-01T01:18:13Z"},{"alias_kind":"pith_short_12","alias_value":"SNC6FWOUVFZ3","created_at":"2026-07-01T01:18:13Z"},{"alias_kind":"pith_short_16","alias_value":"SNC6FWOUVFZ3DLJJ","created_at":"2026-07-01T01:18:13Z"},{"alias_kind":"pith_short_8","alias_value":"SNC6FWOU","created_at":"2026-07-01T01:18:13Z"}],"graph_snapshots":[{"event_id":"sha256:e9eef9b92da72080a9f85c5f6b22fde8a02f95755221327ff101607fe9bec19b","target":"graph","created_at":"2026-07-01T01:18:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.31761/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose an efficient algorithm for approximating the prime counting function $\\pi(x)$ using a structured non-uniform partition derived from generalized triangular numbers. The method yields an incremental estimator whose updates require only local computations, resulting in amortized $O(1)$ update complexity and total complexity $O(\\sqrt x)$.\n  A correction term obtained through extensive numerical experimentation significantly improves the approximation accuracy. Computational tests for values up to $10^{19}$\n  show strong agreement with known values of $\\pi(x)$, with accuracy comparable t","authors_text":"Artur Samojluk, Artur Siemaszko","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NT","submitted_at":"2026-06-30T14:49:55Z","title":"An Efficient Algorithm for Estimating Prime Counts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.31761","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:447ada79ab35ac2353ecbe94a6a12045137764a9660fe23487db8059c12811f3","target":"record","created_at":"2026-07-01T01:18:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"725e76f96a60b4d08e03e377f5cd00196a06d8523b8b2758c476e9705b7a9240","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NT","submitted_at":"2026-06-30T14:49:55Z","title_canon_sha256":"7982f07f4b01860be4c1673c7b6213dc6eb8e91944ae1ea7ddee9c354a3c0eb1"},"schema_version":"1.0","source":{"id":"2606.31761","kind":"arxiv","version":1}},"canonical_sha256":"9345e2d9d4a973b1ad2934abe8b7610f7424bbc664cea75090b2692b3f280f60","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9345e2d9d4a973b1ad2934abe8b7610f7424bbc664cea75090b2692b3f280f60","first_computed_at":"2026-07-01T01:18:13.974882Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-01T01:18:13.974882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nXQLoKCrfhjB7wHN0fEj+m7AJlHgQChq/QrfFbG5cTmFK0Z5YiAsetowqDflfw72Iv7ybTVrOhl+n0Rq5bUHAQ==","signature_status":"signed_v1","signed_at":"2026-07-01T01:18:13.975328Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.31761","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:447ada79ab35ac2353ecbe94a6a12045137764a9660fe23487db8059c12811f3","sha256:e9eef9b92da72080a9f85c5f6b22fde8a02f95755221327ff101607fe9bec19b"],"state_sha256":"e5eb0b5086606aab62d070c015e5f2637349ebb2f97dd1efd769af515087dc94"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OKxuDzKQuF1ncK75VqK9h/TebksPOCwL0SGHv6naajIwlxtg+fvb/hotmEIRRnquARXO6qit/Utn2oUkLlS6Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T05:58:22.772529Z","bundle_sha256":"21b164012fa7d57a1f968426f16d88a05661b894db09be3aea35267b34c39a15"}}