{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:562KPEX3H4HKABTBQVETYNUHJA","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":"24a965a99b921f54b53e784c67b8595a96b9bce8f130a41d7bffe17dbdc6bdeb","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-03-23T04:07:07Z","title_canon_sha256":"fa2f80f0019d81d25fc0602d036cf8f9c8ee8b52315988def888b16f9f071449"},"schema_version":"1.0","source":{"id":"2003.10072","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.10072","created_at":"2026-07-05T02:26:11Z"},{"alias_kind":"arxiv_version","alias_value":"2003.10072v2","created_at":"2026-07-05T02:26:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.10072","created_at":"2026-07-05T02:26:11Z"},{"alias_kind":"pith_short_12","alias_value":"562KPEX3H4HK","created_at":"2026-07-05T02:26:11Z"},{"alias_kind":"pith_short_16","alias_value":"562KPEX3H4HKABTB","created_at":"2026-07-05T02:26:11Z"},{"alias_kind":"pith_short_8","alias_value":"562KPEX3","created_at":"2026-07-05T02:26:11Z"}],"graph_snapshots":[{"event_id":"sha256:bf556725b407ce38fc26b8a108a7fc78984a24a3a81980534de91bbbb1fa53af","target":"graph","created_at":"2026-07-05T02:26:11Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2003.10072/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider rational functions of the form $V(x)/U(x)$, where both $V(x)$ and $U(x)$ are polynomials over the finite field $\\mathbb{F}_q$. Polynomials that permute the elements of a field, called {\\it permutation polynomials ($PPs$)}, have been the subject of research for decades. Let ${\\mathcal P}^1(\\mathbb{F}_q)$ denote $\\mathbb{Z}_q \\cup \\{\\infty\\}$. If the rational function, $V(x)/U(x)$, permutes the elements of ${\\mathcal P}^1(\\mathbb{F}_q)$, it is called a {\\em permutation rational function (PRf)}. Let $N_d(q)$ denote the number of PPs of degree $d$ over $\\mathbb{F}_q$, and let $N_{v,u}(","authors_text":"Brian Malouf, I. Hal Sudborough, Linda Morales, Sergey Bereg, Thomas Stanley","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-03-23T04:07:07Z","title":"Improved Lower Bounds for Permutation Arrays Using Permutation Rational Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.10072","kind":"arxiv","version":2},"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:70d0e7cf18027e4a0e81b76e9ae7fca4829e15d4b0e4deb1d2662446bb9d9f34","target":"record","created_at":"2026-07-05T02:26:11Z","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":"24a965a99b921f54b53e784c67b8595a96b9bce8f130a41d7bffe17dbdc6bdeb","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-03-23T04:07:07Z","title_canon_sha256":"fa2f80f0019d81d25fc0602d036cf8f9c8ee8b52315988def888b16f9f071449"},"schema_version":"1.0","source":{"id":"2003.10072","kind":"arxiv","version":2}},"canonical_sha256":"efb4a792fb3f0ea0066185493c368748074eb509bcc992a029d3d8fc771e6e2c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"efb4a792fb3f0ea0066185493c368748074eb509bcc992a029d3d8fc771e6e2c","first_computed_at":"2026-07-05T02:26:11.600095Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:26:11.600095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L6ZgtzX/Bdqu8cYgYQRix2zOGXzgoDdEiru1A7nRjptuuj/9UckiC5fu0e73c0YZNZFS6DYxnYSYOp8ZObNzBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:26:11.600526Z","signed_message":"canonical_sha256_bytes"},"source_id":"2003.10072","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:70d0e7cf18027e4a0e81b76e9ae7fca4829e15d4b0e4deb1d2662446bb9d9f34","sha256:bf556725b407ce38fc26b8a108a7fc78984a24a3a81980534de91bbbb1fa53af"],"state_sha256":"c5ae80f1274ba3bd5e3de9a4b2c3e55f2b78af475d9ee0ea06d8fa2dc7e698b1"}