{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:WGEH5YBMCUAPTSBC3HQVY4PY4Y","short_pith_number":"pith:WGEH5YBM","schema_version":"1.0","canonical_sha256":"b1887ee02c1500f9c822d9e15c71f8e611659ce5330d15ce65543ebfde93de62","source":{"kind":"arxiv","id":"math/0605024","version":1},"attestation_state":"computed","paper":{"title":"Mapping the Discrete Logarithm","license":"","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Daniel R. Cloutier, Joshua Holden","submitted_at":"2006-04-30T17:26:28Z","abstract_excerpt":"The discrete logarithm is a problem that surfaces frequently in the field of cryptography as a result of using the transformation g^a mod n. This paper focuses on a prime modulus, p, for which it is shown that the basic structure of the functional graph is largely dependent on an interaction between g and p-1. In fact, there are precisely as many different functional graph structures as there are divisors of p-1. This paper extracts two of these structures, permutations and binary functional graphs. Estimates exist for the shape of a random permutation, but similar estimates must be created fo"},"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/0605024","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.NT","submitted_at":"2006-04-30T17:26:28Z","cross_cats_sorted":[],"title_canon_sha256":"704084480fb5d2ba3fefcd9d5f0df333cb3745eef71370b488f0d333a1000942","abstract_canon_sha256":"d398de64ea2cca0d78e94a3019d00a3ca1d8bb7b4cb8c4c8caa592112c39c565"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:38.283409Z","signature_b64":"1Q0f/5qoZqydOhzPXUiQ3eIW/WCxR77ziv1E2GP6MIab1FdUGiByd67FwrUTNCWUIfTS2qIVoeHQn+2vIPF+Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1887ee02c1500f9c822d9e15c71f8e611659ce5330d15ce65543ebfde93de62","last_reissued_at":"2026-05-18T04:34:38.282759Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:38.282759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mapping the Discrete Logarithm","license":"","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Daniel R. Cloutier, Joshua Holden","submitted_at":"2006-04-30T17:26:28Z","abstract_excerpt":"The discrete logarithm is a problem that surfaces frequently in the field of cryptography as a result of using the transformation g^a mod n. This paper focuses on a prime modulus, p, for which it is shown that the basic structure of the functional graph is largely dependent on an interaction between g and p-1. In fact, there are precisely as many different functional graph structures as there are divisors of p-1. This paper extracts two of these structures, permutations and binary functional graphs. Estimates exist for the shape of a random permutation, but similar estimates must be created fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0605024","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/0605024","created_at":"2026-05-18T04:34:38.282862+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0605024v1","created_at":"2026-05-18T04:34:38.282862+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0605024","created_at":"2026-05-18T04:34:38.282862+00:00"},{"alias_kind":"pith_short_12","alias_value":"WGEH5YBMCUAP","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"WGEH5YBMCUAPTSBC","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"WGEH5YBM","created_at":"2026-05-18T12:25:54.717736+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/WGEH5YBMCUAPTSBC3HQVY4PY4Y","json":"https://pith.science/pith/WGEH5YBMCUAPTSBC3HQVY4PY4Y.json","graph_json":"https://pith.science/api/pith-number/WGEH5YBMCUAPTSBC3HQVY4PY4Y/graph.json","events_json":"https://pith.science/api/pith-number/WGEH5YBMCUAPTSBC3HQVY4PY4Y/events.json","paper":"https://pith.science/paper/WGEH5YBM"},"agent_actions":{"view_html":"https://pith.science/pith/WGEH5YBMCUAPTSBC3HQVY4PY4Y","download_json":"https://pith.science/pith/WGEH5YBMCUAPTSBC3HQVY4PY4Y.json","view_paper":"https://pith.science/paper/WGEH5YBM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0605024&json=true","fetch_graph":"https://pith.science/api/pith-number/WGEH5YBMCUAPTSBC3HQVY4PY4Y/graph.json","fetch_events":"https://pith.science/api/pith-number/WGEH5YBMCUAPTSBC3HQVY4PY4Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WGEH5YBMCUAPTSBC3HQVY4PY4Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WGEH5YBMCUAPTSBC3HQVY4PY4Y/action/storage_attestation","attest_author":"https://pith.science/pith/WGEH5YBMCUAPTSBC3HQVY4PY4Y/action/author_attestation","sign_citation":"https://pith.science/pith/WGEH5YBMCUAPTSBC3HQVY4PY4Y/action/citation_signature","submit_replication":"https://pith.science/pith/WGEH5YBMCUAPTSBC3HQVY4PY4Y/action/replication_record"}},"created_at":"2026-05-18T04:34:38.282862+00:00","updated_at":"2026-05-18T04:34:38.282862+00:00"}