{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:CF6N5EIAS6VVUTCV2XVUIGXE5E","short_pith_number":"pith:CF6N5EIA","schema_version":"1.0","canonical_sha256":"117cde910097ab5a4c55d5eb441ae4e93a6a4f645bce5879a97c1689dbf57054","source":{"kind":"arxiv","id":"math/0407421","version":1},"attestation_state":"computed","paper":{"title":"On primes p for which d divides ord_p(g)","license":"","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Pieter Moree","submitted_at":"2004-07-24T19:38:07Z","abstract_excerpt":"Let N_g(d) be the set of primes p such that the order of g modulo p is divisible by a prescribed integer d. Wiertelak showed that this set has a natural density and gave a rather involved explicit expression for it.\n Let N_g(d)(x) be the number of primes p<=x that are in N_g(d). A simple identity for N_g(d)(x) is established. It is used to derive a more compact expression for the natural density than known hitherto. A numerical demonstration, using a program of Y. Gallot, is presented."},"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":"math/0407421","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.NT","submitted_at":"2004-07-24T19:38:07Z","cross_cats_sorted":[],"title_canon_sha256":"8bd86a374b2f4b4e4acb1de7ed304f8d56a291328e74783d9aba11bb4f426dd0","abstract_canon_sha256":"8c06ef075877085ee35a2d181dd054de70bf75d1af68a23bbbe3ce9cf24503b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:26.158686Z","signature_b64":"8t3FfkOiWvzd4T//2qJIk76X0kK0xH43vkSKj9w5DZWBhG4WT9lkHXbA0TLgR1CVpeAoqOm1vfXdaLvZcHr5DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"117cde910097ab5a4c55d5eb441ae4e93a6a4f645bce5879a97c1689dbf57054","last_reissued_at":"2026-05-18T01:05:26.157964Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:26.157964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On primes p for which d divides ord_p(g)","license":"","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Pieter Moree","submitted_at":"2004-07-24T19:38:07Z","abstract_excerpt":"Let N_g(d) be the set of primes p such that the order of g modulo p is divisible by a prescribed integer d. Wiertelak showed that this set has a natural density and gave a rather involved explicit expression for it.\n Let N_g(d)(x) be the number of primes p<=x that are in N_g(d). A simple identity for N_g(d)(x) is established. It is used to derive a more compact expression for the natural density than known hitherto. A numerical demonstration, using a program of Y. Gallot, is presented."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0407421","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":"math/0407421","created_at":"2026-05-18T01:05:26.158074+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0407421v1","created_at":"2026-05-18T01:05:26.158074+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0407421","created_at":"2026-05-18T01:05:26.158074+00:00"},{"alias_kind":"pith_short_12","alias_value":"CF6N5EIAS6VV","created_at":"2026-05-18T12:25:52.051335+00:00"},{"alias_kind":"pith_short_16","alias_value":"CF6N5EIAS6VVUTCV","created_at":"2026-05-18T12:25:52.051335+00:00"},{"alias_kind":"pith_short_8","alias_value":"CF6N5EIA","created_at":"2026-05-18T12:25:52.051335+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/CF6N5EIAS6VVUTCV2XVUIGXE5E","json":"https://pith.science/pith/CF6N5EIAS6VVUTCV2XVUIGXE5E.json","graph_json":"https://pith.science/api/pith-number/CF6N5EIAS6VVUTCV2XVUIGXE5E/graph.json","events_json":"https://pith.science/api/pith-number/CF6N5EIAS6VVUTCV2XVUIGXE5E/events.json","paper":"https://pith.science/paper/CF6N5EIA"},"agent_actions":{"view_html":"https://pith.science/pith/CF6N5EIAS6VVUTCV2XVUIGXE5E","download_json":"https://pith.science/pith/CF6N5EIAS6VVUTCV2XVUIGXE5E.json","view_paper":"https://pith.science/paper/CF6N5EIA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0407421&json=true","fetch_graph":"https://pith.science/api/pith-number/CF6N5EIAS6VVUTCV2XVUIGXE5E/graph.json","fetch_events":"https://pith.science/api/pith-number/CF6N5EIAS6VVUTCV2XVUIGXE5E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CF6N5EIAS6VVUTCV2XVUIGXE5E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CF6N5EIAS6VVUTCV2XVUIGXE5E/action/storage_attestation","attest_author":"https://pith.science/pith/CF6N5EIAS6VVUTCV2XVUIGXE5E/action/author_attestation","sign_citation":"https://pith.science/pith/CF6N5EIAS6VVUTCV2XVUIGXE5E/action/citation_signature","submit_replication":"https://pith.science/pith/CF6N5EIAS6VVUTCV2XVUIGXE5E/action/replication_record"}},"created_at":"2026-05-18T01:05:26.158074+00:00","updated_at":"2026-05-18T01:05:26.158074+00:00"}