{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:PH4NDWZ4ZOGOPEBT64PEJFTW4Q","short_pith_number":"pith:PH4NDWZ4","schema_version":"1.0","canonical_sha256":"79f8d1db3ccb8ce79033f71e449676e4161ddd9181ad40c57d21c1e93558a61c","source":{"kind":"arxiv","id":"0707.1108","version":3},"attestation_state":"computed","paper":{"title":"Permutation binomials over finite fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Ariane M. Masuda, Michael E. Zieve","submitted_at":"2007-07-07T19:43:00Z","abstract_excerpt":"We prove that if x^m + c*x^n permutes the prime field GF(p), where m>n>0 and c is in GF(p)^*, then gcd(m-n,p-1) > sqrt{p} - 1. Conversely, we prove that if q>=4 and m>n>0 are fixed and satisfy gcd(m-n,q-1) > 2q*(log log q)/(log q), then there exist permutation binomials over GF(q) of the form x^m + c*x^n if and only if gcd(m,n,q-1) = 1."},"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":"0707.1108","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2007-07-07T19:43:00Z","cross_cats_sorted":[],"title_canon_sha256":"811d99b3086373f2c2052da9b3d2a4a79d3f85a13d58cd44243e4949babd8cb2","abstract_canon_sha256":"54f000792fe348db74d908b177ca54be2b2f17ae07f7d6a3b8e5c312bd46bf28"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:22.506231Z","signature_b64":"5iB7Mjid/ne/2IvoiAmch3U9eBVMFYKYPfR/HZ5a0ppImTDME1HIs9t/ravK2fsprkY3lpRVC2ljlKuGvtpUCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79f8d1db3ccb8ce79033f71e449676e4161ddd9181ad40c57d21c1e93558a61c","last_reissued_at":"2026-05-18T03:11:22.505782Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:22.505782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Permutation binomials over finite fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Ariane M. Masuda, Michael E. Zieve","submitted_at":"2007-07-07T19:43:00Z","abstract_excerpt":"We prove that if x^m + c*x^n permutes the prime field GF(p), where m>n>0 and c is in GF(p)^*, then gcd(m-n,p-1) > sqrt{p} - 1. Conversely, we prove that if q>=4 and m>n>0 are fixed and satisfy gcd(m-n,q-1) > 2q*(log log q)/(log q), then there exist permutation binomials over GF(q) of the form x^m + c*x^n if and only if gcd(m,n,q-1) = 1."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0707.1108","kind":"arxiv","version":3},"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":"0707.1108","created_at":"2026-05-18T03:11:22.505849+00:00"},{"alias_kind":"arxiv_version","alias_value":"0707.1108v3","created_at":"2026-05-18T03:11:22.505849+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0707.1108","created_at":"2026-05-18T03:11:22.505849+00:00"},{"alias_kind":"pith_short_12","alias_value":"PH4NDWZ4ZOGO","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"PH4NDWZ4ZOGOPEBT","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"PH4NDWZ4","created_at":"2026-05-18T12:25:55.427421+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/PH4NDWZ4ZOGOPEBT64PEJFTW4Q","json":"https://pith.science/pith/PH4NDWZ4ZOGOPEBT64PEJFTW4Q.json","graph_json":"https://pith.science/api/pith-number/PH4NDWZ4ZOGOPEBT64PEJFTW4Q/graph.json","events_json":"https://pith.science/api/pith-number/PH4NDWZ4ZOGOPEBT64PEJFTW4Q/events.json","paper":"https://pith.science/paper/PH4NDWZ4"},"agent_actions":{"view_html":"https://pith.science/pith/PH4NDWZ4ZOGOPEBT64PEJFTW4Q","download_json":"https://pith.science/pith/PH4NDWZ4ZOGOPEBT64PEJFTW4Q.json","view_paper":"https://pith.science/paper/PH4NDWZ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0707.1108&json=true","fetch_graph":"https://pith.science/api/pith-number/PH4NDWZ4ZOGOPEBT64PEJFTW4Q/graph.json","fetch_events":"https://pith.science/api/pith-number/PH4NDWZ4ZOGOPEBT64PEJFTW4Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PH4NDWZ4ZOGOPEBT64PEJFTW4Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PH4NDWZ4ZOGOPEBT64PEJFTW4Q/action/storage_attestation","attest_author":"https://pith.science/pith/PH4NDWZ4ZOGOPEBT64PEJFTW4Q/action/author_attestation","sign_citation":"https://pith.science/pith/PH4NDWZ4ZOGOPEBT64PEJFTW4Q/action/citation_signature","submit_replication":"https://pith.science/pith/PH4NDWZ4ZOGOPEBT64PEJFTW4Q/action/replication_record"}},"created_at":"2026-05-18T03:11:22.505849+00:00","updated_at":"2026-05-18T03:11:22.505849+00:00"}