{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:UVLMEFCXFMNNTIQIIITCZEH75Q","short_pith_number":"pith:UVLMEFCX","schema_version":"1.0","canonical_sha256":"a556c214572b1ad9a20842262c90ffec02510c8b5e4d1dacef26806765949524","source":{"kind":"arxiv","id":"1911.12823","version":2},"attestation_state":"computed","paper":{"title":"Equivalence Relations for Computing Permutation Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Wong, Brian Malouf, I. Hal Sudborough, Linda Morales, Sergey Bereg, Thomas Stanley","submitted_at":"2019-11-28T18:33:18Z","abstract_excerpt":"We present a new technique for computing permutation polynomials based on equivalence relations. The equivalence relations are defined by expanded normalization operations and new functions that map permutation polynomials (PPs) to other PPs. Our expanded normalization applies to almost all PPs, including when the characteristic of the finite field divides the degree of the polynomial. The equivalence relations make it possible to reduce the size of the space, when doing an exhaustive search. As a result, we have been able to compute almost all permutation polynomials of degree $d$ at most 10 "},"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":"1911.12823","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-11-28T18:33:18Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"ad421608e36b65ea0d9a01357b2e63b62b7f615edbc6920c7d19bd3ac86be055","abstract_canon_sha256":"ec7cf33ef219a95cb36e1f8458837e9003af1e669a6e0ab534de2019ddafac5d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:29:21.314248Z","signature_b64":"uHbWZCeBiOD6Av+6Alv/eBrrxVyH2Q7plaAURgMt4QWmvZaHMMEXlGX3ZV0Nfe+6jCk701inEKUtbSh6UC34BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a556c214572b1ad9a20842262c90ffec02510c8b5e4d1dacef26806765949524","last_reissued_at":"2026-07-05T00:29:21.313873Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:29:21.313873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Equivalence Relations for Computing Permutation Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Wong, Brian Malouf, I. Hal Sudborough, Linda Morales, Sergey Bereg, Thomas Stanley","submitted_at":"2019-11-28T18:33:18Z","abstract_excerpt":"We present a new technique for computing permutation polynomials based on equivalence relations. The equivalence relations are defined by expanded normalization operations and new functions that map permutation polynomials (PPs) to other PPs. Our expanded normalization applies to almost all PPs, including when the characteristic of the finite field divides the degree of the polynomial. The equivalence relations make it possible to reduce the size of the space, when doing an exhaustive search. As a result, we have been able to compute almost all permutation polynomials of degree $d$ at most 10 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.12823","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1911.12823/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1911.12823","created_at":"2026-07-05T00:29:21.313927+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.12823v2","created_at":"2026-07-05T00:29:21.313927+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.12823","created_at":"2026-07-05T00:29:21.313927+00:00"},{"alias_kind":"pith_short_12","alias_value":"UVLMEFCXFMNN","created_at":"2026-07-05T00:29:21.313927+00:00"},{"alias_kind":"pith_short_16","alias_value":"UVLMEFCXFMNNTIQI","created_at":"2026-07-05T00:29:21.313927+00:00"},{"alias_kind":"pith_short_8","alias_value":"UVLMEFCX","created_at":"2026-07-05T00:29:21.313927+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/UVLMEFCXFMNNTIQIIITCZEH75Q","json":"https://pith.science/pith/UVLMEFCXFMNNTIQIIITCZEH75Q.json","graph_json":"https://pith.science/api/pith-number/UVLMEFCXFMNNTIQIIITCZEH75Q/graph.json","events_json":"https://pith.science/api/pith-number/UVLMEFCXFMNNTIQIIITCZEH75Q/events.json","paper":"https://pith.science/paper/UVLMEFCX"},"agent_actions":{"view_html":"https://pith.science/pith/UVLMEFCXFMNNTIQIIITCZEH75Q","download_json":"https://pith.science/pith/UVLMEFCXFMNNTIQIIITCZEH75Q.json","view_paper":"https://pith.science/paper/UVLMEFCX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.12823&json=true","fetch_graph":"https://pith.science/api/pith-number/UVLMEFCXFMNNTIQIIITCZEH75Q/graph.json","fetch_events":"https://pith.science/api/pith-number/UVLMEFCXFMNNTIQIIITCZEH75Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UVLMEFCXFMNNTIQIIITCZEH75Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UVLMEFCXFMNNTIQIIITCZEH75Q/action/storage_attestation","attest_author":"https://pith.science/pith/UVLMEFCXFMNNTIQIIITCZEH75Q/action/author_attestation","sign_citation":"https://pith.science/pith/UVLMEFCXFMNNTIQIIITCZEH75Q/action/citation_signature","submit_replication":"https://pith.science/pith/UVLMEFCXFMNNTIQIIITCZEH75Q/action/replication_record"}},"created_at":"2026-07-05T00:29:21.313927+00:00","updated_at":"2026-07-05T00:29:21.313927+00:00"}