{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:43KULU4CLSSB4XLWWKWRXT332U","short_pith_number":"pith:43KULU4C","canonical_record":{"source":{"id":"1111.1224","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-11-04T19:42:06Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"5a65f2cb3affb17389efd886fc2c5eed7a50f09e0e91895d5af3a50e95e6ca4b","abstract_canon_sha256":"db44192cc1b3707a24363d196648060d07675c1128512a140be85f02cba1f8d7"},"schema_version":"1.0"},"canonical_sha256":"e6d545d3825ca41e5d76b2ad1bcf7bd505b73d39023621303a337f31b5f1b688","source":{"kind":"arxiv","id":"1111.1224","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.1224","created_at":"2026-05-18T04:09:35Z"},{"alias_kind":"arxiv_version","alias_value":"1111.1224v1","created_at":"2026-05-18T04:09:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.1224","created_at":"2026-05-18T04:09:35Z"},{"alias_kind":"pith_short_12","alias_value":"43KULU4CLSSB","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"43KULU4CLSSB4XLW","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"43KULU4C","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:43KULU4CLSSB4XLWWKWRXT332U","target":"record","payload":{"canonical_record":{"source":{"id":"1111.1224","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-11-04T19:42:06Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"5a65f2cb3affb17389efd886fc2c5eed7a50f09e0e91895d5af3a50e95e6ca4b","abstract_canon_sha256":"db44192cc1b3707a24363d196648060d07675c1128512a140be85f02cba1f8d7"},"schema_version":"1.0"},"canonical_sha256":"e6d545d3825ca41e5d76b2ad1bcf7bd505b73d39023621303a337f31b5f1b688","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:35.477144Z","signature_b64":"ayweMq1rkz8UuTuWx++CeVD/WOl4JLF0UKoth+hNH0CehvqaK7L/1CSzNk/CJHuY/EYxQ/DIWbYIijqllmqmAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6d545d3825ca41e5d76b2ad1bcf7bd505b73d39023621303a337f31b5f1b688","last_reissued_at":"2026-05-18T04:09:35.476618Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:35.476618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.1224","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-05-18T04:09:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ALG1pTNtzMHXxv2c3AME6gVQQmXNmc6KSUBoyh+xHYk7i1AmugGriXjbbEvS/Ib3+2k0Yo3fQ+Z7nUJEiEagCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T13:21:18.857193Z"},"content_sha256":"3f47c53e88c9dd021bf52713b8d32784a73c044b40c26dc0fdd30a666f878f52","schema_version":"1.0","event_id":"sha256:3f47c53e88c9dd021bf52713b8d32784a73c044b40c26dc0fdd30a666f878f52"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:43KULU4CLSSB4XLWWKWRXT332U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting Value Sets: Algorithm and Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.NT","authors_text":"Daqing Wan, Joshua E. Hill, Qi Cheng","submitted_at":"2011-11-04T19:42:06Z","abstract_excerpt":"Let $p$ be a prime. Given a polynomial in $\\F_{p^m}[x]$ of degree $d$ over the finite field $\\F_{p^m}$, one can view it as a map from $\\F_{p^m}$ to $\\F_{p^m}$, and examine the image of this map, also known as the value set. In this paper, we present the first non-trivial algorithm and the first complexity result on computing the cardinality of this value set. We show an elementary connection between this cardinality and the number of points on a family of varieties in affine space. We then apply Lauder and Wan's $p$-adic point-counting algorithm to count these points, resulting in a non-trivia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.1224","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"},"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-05-18T04:09:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hn9G/oSTHd6q7l/5KaDw6YisjX8N4bjq6RNh50L9KuXS76Yi7cVGzc/8jbIl5bnJECW/Af5Hayiuxz/VMQvRCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T13:21:18.857551Z"},"content_sha256":"d0f4c0effaf570e9828e6e29dc2ea8a317c9392d20e7b60d9bf695d7ff620f4e","schema_version":"1.0","event_id":"sha256:d0f4c0effaf570e9828e6e29dc2ea8a317c9392d20e7b60d9bf695d7ff620f4e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/43KULU4CLSSB4XLWWKWRXT332U/bundle.json","state_url":"https://pith.science/pith/43KULU4CLSSB4XLWWKWRXT332U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/43KULU4CLSSB4XLWWKWRXT332U/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-06-03T13:21:18Z","links":{"resolver":"https://pith.science/pith/43KULU4CLSSB4XLWWKWRXT332U","bundle":"https://pith.science/pith/43KULU4CLSSB4XLWWKWRXT332U/bundle.json","state":"https://pith.science/pith/43KULU4CLSSB4XLWWKWRXT332U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/43KULU4CLSSB4XLWWKWRXT332U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:43KULU4CLSSB4XLWWKWRXT332U","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":"db44192cc1b3707a24363d196648060d07675c1128512a140be85f02cba1f8d7","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-11-04T19:42:06Z","title_canon_sha256":"5a65f2cb3affb17389efd886fc2c5eed7a50f09e0e91895d5af3a50e95e6ca4b"},"schema_version":"1.0","source":{"id":"1111.1224","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.1224","created_at":"2026-05-18T04:09:35Z"},{"alias_kind":"arxiv_version","alias_value":"1111.1224v1","created_at":"2026-05-18T04:09:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.1224","created_at":"2026-05-18T04:09:35Z"},{"alias_kind":"pith_short_12","alias_value":"43KULU4CLSSB","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"43KULU4CLSSB4XLW","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"43KULU4C","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:d0f4c0effaf570e9828e6e29dc2ea8a317c9392d20e7b60d9bf695d7ff620f4e","target":"graph","created_at":"2026-05-18T04:09:35Z","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":"Let $p$ be a prime. Given a polynomial in $\\F_{p^m}[x]$ of degree $d$ over the finite field $\\F_{p^m}$, one can view it as a map from $\\F_{p^m}$ to $\\F_{p^m}$, and examine the image of this map, also known as the value set. In this paper, we present the first non-trivial algorithm and the first complexity result on computing the cardinality of this value set. We show an elementary connection between this cardinality and the number of points on a family of varieties in affine space. We then apply Lauder and Wan's $p$-adic point-counting algorithm to count these points, resulting in a non-trivia","authors_text":"Daqing Wan, Joshua E. Hill, Qi Cheng","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-11-04T19:42:06Z","title":"Counting Value Sets: Algorithm and Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.1224","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:3f47c53e88c9dd021bf52713b8d32784a73c044b40c26dc0fdd30a666f878f52","target":"record","created_at":"2026-05-18T04:09:35Z","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":"db44192cc1b3707a24363d196648060d07675c1128512a140be85f02cba1f8d7","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-11-04T19:42:06Z","title_canon_sha256":"5a65f2cb3affb17389efd886fc2c5eed7a50f09e0e91895d5af3a50e95e6ca4b"},"schema_version":"1.0","source":{"id":"1111.1224","kind":"arxiv","version":1}},"canonical_sha256":"e6d545d3825ca41e5d76b2ad1bcf7bd505b73d39023621303a337f31b5f1b688","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6d545d3825ca41e5d76b2ad1bcf7bd505b73d39023621303a337f31b5f1b688","first_computed_at":"2026-05-18T04:09:35.476618Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:09:35.476618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ayweMq1rkz8UuTuWx++CeVD/WOl4JLF0UKoth+hNH0CehvqaK7L/1CSzNk/CJHuY/EYxQ/DIWbYIijqllmqmAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:09:35.477144Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.1224","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f47c53e88c9dd021bf52713b8d32784a73c044b40c26dc0fdd30a666f878f52","sha256:d0f4c0effaf570e9828e6e29dc2ea8a317c9392d20e7b60d9bf695d7ff620f4e"],"state_sha256":"7304a5d22423443a1264abb6ad6947fb6383e375d5b95eb5324c5ddec66acf8a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/6Pt4AZtaLGOhPwM/TTdPWqI3uQ5zoR/eoCTHjXuvz6NV0NXCi/947lwd6cqcnOh/gnqj6KaBXQDxyMTOs7DCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T13:21:18.859529Z","bundle_sha256":"00051caf666dea75530e939f1fb817e087763e630dc31e9f022eec5957bbc8b3"}}