{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GVLFBFVAOABMKUG4U5OAS56HCJ","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":"5a1e3a954b9a83063285c4b7299e26bc23feba2898ecbccc93d1f53cb23304d1","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-07-10T09:01:24Z","title_canon_sha256":"6b7855536dfeb452d9c7a1a999212c8ced868a3f002b9dc9b7d4a5e6e81a1e5f"},"schema_version":"1.0","source":{"id":"1307.2718","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.2718","created_at":"2026-05-18T02:03:38Z"},{"alias_kind":"arxiv_version","alias_value":"1307.2718v3","created_at":"2026-05-18T02:03:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2718","created_at":"2026-05-18T02:03:38Z"},{"alias_kind":"pith_short_12","alias_value":"GVLFBFVAOABM","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GVLFBFVAOABMKUG4","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GVLFBFVA","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:79c62db93cd7d01c93a50268670c7a7a749266e7cbeeeec1e71dfd2430e3418e","target":"graph","created_at":"2026-05-18T02:03:38Z","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"},"paper":{"abstract_excerpt":"Given a function $f$ in a finite field ${\\mathbb F}_q$ of $q$ elements, we define the functional graph of $f$ as a directed graph on $q$ nodes labelled by the elements of ${\\mathbb F}_q$ where there is an edge from $u$ to $v$ if and only if $f(u) = v$. We obtain some theoretic estimates on the number of non-isomorphic graphs generated by all polynomials of a given degree. We then develop a simple and practical algorithm to test the isomorphism of quadratic polynomials that has linear memory and time complexities. Furthermore, we extend this isomorphism testing algorithm to the general case of ","authors_text":"Bernard Mans, Florian Luca, Igor E. Shparlinski, Luke Mathieson, Min Sha, Sergei V. Konyagin","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-07-10T09:01:24Z","title":"Functional Graphs of Polynomials over Finite Fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2718","kind":"arxiv","version":3},"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:606726e9ad0b09de20d4110bf191c74adcd9bba54dcbadf6a606f658d6d52f48","target":"record","created_at":"2026-05-18T02:03:38Z","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":"5a1e3a954b9a83063285c4b7299e26bc23feba2898ecbccc93d1f53cb23304d1","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-07-10T09:01:24Z","title_canon_sha256":"6b7855536dfeb452d9c7a1a999212c8ced868a3f002b9dc9b7d4a5e6e81a1e5f"},"schema_version":"1.0","source":{"id":"1307.2718","kind":"arxiv","version":3}},"canonical_sha256":"35565096a07002c550dca75c0977c7127ec11af07d03a2245050ea43c9c1f133","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35565096a07002c550dca75c0977c7127ec11af07d03a2245050ea43c9c1f133","first_computed_at":"2026-05-18T02:03:38.210889Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:03:38.210889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h2j1U3l4PWxByLpHXDnUvxN01zZq30qYXFHXVpKhDMzzY6/FWTidFXDRtNnl8eUPBT0gPegd/wi11R7vgy4SCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:03:38.211520Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.2718","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:606726e9ad0b09de20d4110bf191c74adcd9bba54dcbadf6a606f658d6d52f48","sha256:79c62db93cd7d01c93a50268670c7a7a749266e7cbeeeec1e71dfd2430e3418e"],"state_sha256":"ca90c5c94cea84a58071809d8a3539a140e0a8edfe5bcc56424a8068860b0f10"}