{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:67MTPOGKV2NYDUZM5XEW4SRKVA","short_pith_number":"pith:67MTPOGK","schema_version":"1.0","canonical_sha256":"f7d937b8caae9b81d32cedc96e4a2aa839bb1439055c9cf557388407d6526354","source":{"kind":"arxiv","id":"1809.01214","version":1},"attestation_state":"computed","paper":{"title":"Counting integers with a smooth totient","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"C. Pomerance, I. E. Shparlinski, J. B. Friedlander, W. D. Banks","submitted_at":"2018-09-04T19:27:12Z","abstract_excerpt":"We fix a gap in our proof of an upper bound for the number of positive integers $n\\le x$ for which the Euler function $\\varphi(n)$ has all prime factors at most $y$. While doing this we obtain a stronger, likely best-possible result."},"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":"1809.01214","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-09-04T19:27:12Z","cross_cats_sorted":[],"title_canon_sha256":"d2e3c566492054b584ccd2b4d513a1d5fe2ccd210ad7119ff1229beaf1b23783","abstract_canon_sha256":"819306b5b756a6f14a0fd9fec0056a3786da371c467ff797d3466b155f0c5ec9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:31.379187Z","signature_b64":"lqpG6jAcbLwti5FceuWEYAQAa3Vba44gyZoGY/iv3zq7+Zu+kpmsqIG6V+DZrMG8R6oQ9A6Gur8ihhhWMpUbCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7d937b8caae9b81d32cedc96e4a2aa839bb1439055c9cf557388407d6526354","last_reissued_at":"2026-05-18T00:06:31.378763Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:31.378763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting integers with a smooth totient","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"C. Pomerance, I. E. Shparlinski, J. B. Friedlander, W. D. Banks","submitted_at":"2018-09-04T19:27:12Z","abstract_excerpt":"We fix a gap in our proof of an upper bound for the number of positive integers $n\\le x$ for which the Euler function $\\varphi(n)$ has all prime factors at most $y$. While doing this we obtain a stronger, likely best-possible result."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01214","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":"1809.01214","created_at":"2026-05-18T00:06:31.378833+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.01214v1","created_at":"2026-05-18T00:06:31.378833+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01214","created_at":"2026-05-18T00:06:31.378833+00:00"},{"alias_kind":"pith_short_12","alias_value":"67MTPOGKV2NY","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"67MTPOGKV2NYDUZM","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"67MTPOGK","created_at":"2026-05-18T12:32:08.215937+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/67MTPOGKV2NYDUZM5XEW4SRKVA","json":"https://pith.science/pith/67MTPOGKV2NYDUZM5XEW4SRKVA.json","graph_json":"https://pith.science/api/pith-number/67MTPOGKV2NYDUZM5XEW4SRKVA/graph.json","events_json":"https://pith.science/api/pith-number/67MTPOGKV2NYDUZM5XEW4SRKVA/events.json","paper":"https://pith.science/paper/67MTPOGK"},"agent_actions":{"view_html":"https://pith.science/pith/67MTPOGKV2NYDUZM5XEW4SRKVA","download_json":"https://pith.science/pith/67MTPOGKV2NYDUZM5XEW4SRKVA.json","view_paper":"https://pith.science/paper/67MTPOGK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.01214&json=true","fetch_graph":"https://pith.science/api/pith-number/67MTPOGKV2NYDUZM5XEW4SRKVA/graph.json","fetch_events":"https://pith.science/api/pith-number/67MTPOGKV2NYDUZM5XEW4SRKVA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/67MTPOGKV2NYDUZM5XEW4SRKVA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/67MTPOGKV2NYDUZM5XEW4SRKVA/action/storage_attestation","attest_author":"https://pith.science/pith/67MTPOGKV2NYDUZM5XEW4SRKVA/action/author_attestation","sign_citation":"https://pith.science/pith/67MTPOGKV2NYDUZM5XEW4SRKVA/action/citation_signature","submit_replication":"https://pith.science/pith/67MTPOGKV2NYDUZM5XEW4SRKVA/action/replication_record"}},"created_at":"2026-05-18T00:06:31.378833+00:00","updated_at":"2026-05-18T00:06:31.378833+00:00"}