{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:XW35PALAXQ4OFEBZAUES6WUKFN","short_pith_number":"pith:XW35PALA","canonical_record":{"source":{"id":"1905.07798","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-05-19T19:41:43Z","cross_cats_sorted":[],"title_canon_sha256":"09503853e0969ca9d6c15ee6a216d6fade037f3165956e73dcdfbe0e556afabd","abstract_canon_sha256":"54bacf7dfb99ed848c2dda030020d5d473ce2792582ac81c84ffe8fce5406481"},"schema_version":"1.0"},"canonical_sha256":"bdb7d78160bc38e2903905092f5a8a2b6bf56b5d09dfc36f0ada9f3b6038c38f","source":{"kind":"arxiv","id":"1905.07798","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07798","created_at":"2026-05-17T23:45:48Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07798v1","created_at":"2026-05-17T23:45:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07798","created_at":"2026-05-17T23:45:48Z"},{"alias_kind":"pith_short_12","alias_value":"XW35PALAXQ4O","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XW35PALAXQ4OFEBZ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XW35PALA","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:XW35PALAXQ4OFEBZAUES6WUKFN","target":"record","payload":{"canonical_record":{"source":{"id":"1905.07798","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-05-19T19:41:43Z","cross_cats_sorted":[],"title_canon_sha256":"09503853e0969ca9d6c15ee6a216d6fade037f3165956e73dcdfbe0e556afabd","abstract_canon_sha256":"54bacf7dfb99ed848c2dda030020d5d473ce2792582ac81c84ffe8fce5406481"},"schema_version":"1.0"},"canonical_sha256":"bdb7d78160bc38e2903905092f5a8a2b6bf56b5d09dfc36f0ada9f3b6038c38f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:48.441739Z","signature_b64":"0jvuM9jJ6QnPylCnd9vQcfPlQaHmhZGViorVX89snqfx43y3jJzJ/KMMjkYOxWeg3Ei6cmo/CWQJA2OLNW3EBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdb7d78160bc38e2903905092f5a8a2b6bf56b5d09dfc36f0ada9f3b6038c38f","last_reissued_at":"2026-05-17T23:45:48.441038Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:48.441038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.07798","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-17T23:45:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R3V1FOJ9gkD1opUPj6W/v2H6IIF5uf4iR3Kuptw/r+iwwjYImSmBToRpDL3XUllZ//Icda8WbOr94o3HBHkrBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T12:19:28.178486Z"},"content_sha256":"854ce9edb82dd4e7ad02a20a9d4aadf8a4148e977b427cfe831236ffde16f7f3","schema_version":"1.0","event_id":"sha256:854ce9edb82dd4e7ad02a20a9d4aadf8a4148e977b427cfe831236ffde16f7f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:XW35PALAXQ4OFEBZAUES6WUKFN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Construction of irreducible polynomials through rational transformations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Daniel Panario, Lucas Reis, Qiang Wang","submitted_at":"2019-05-19T19:41:43Z","abstract_excerpt":"Let $\\mathbb F_q$ be the finite field with $q$ elements, where $q$ is a power of a prime. We discuss recursive methods for constructing irreducible polynomials over $\\mathbb F_q$ of high degree using rational transformations. In particular, given a divisor $D>2$ of $q+1$ and an irreducible polynomial $f\\in \\mathbb F_{q}[x]$ of degree $n$ such that $n$ is even or $D\\not \\equiv 2\\pmod 4$, we show how to obtain from $f$ a sequence $\\{f_i\\}_{i\\ge 0}$ of irreducible polynomials over $\\mathbb F_q$ with $\\mathrm{deg}(f_i)=n\\cdot D^{i}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07798","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-17T23:45:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fLpGqsi3tsdriQsfY+VbI+/WGWJO0/JwvEBdoWaXocAulAPNwwoZ+cuaUEaSzzhWTND3l8x/P07WIO3F7gwXAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T12:19:28.178820Z"},"content_sha256":"6bcb9eb7ec50e360f4aad6482fddc58709e8b63dfad30ecbd9743492e9022866","schema_version":"1.0","event_id":"sha256:6bcb9eb7ec50e360f4aad6482fddc58709e8b63dfad30ecbd9743492e9022866"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XW35PALAXQ4OFEBZAUES6WUKFN/bundle.json","state_url":"https://pith.science/pith/XW35PALAXQ4OFEBZAUES6WUKFN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XW35PALAXQ4OFEBZAUES6WUKFN/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-28T12:19:28Z","links":{"resolver":"https://pith.science/pith/XW35PALAXQ4OFEBZAUES6WUKFN","bundle":"https://pith.science/pith/XW35PALAXQ4OFEBZAUES6WUKFN/bundle.json","state":"https://pith.science/pith/XW35PALAXQ4OFEBZAUES6WUKFN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XW35PALAXQ4OFEBZAUES6WUKFN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:XW35PALAXQ4OFEBZAUES6WUKFN","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":"54bacf7dfb99ed848c2dda030020d5d473ce2792582ac81c84ffe8fce5406481","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-05-19T19:41:43Z","title_canon_sha256":"09503853e0969ca9d6c15ee6a216d6fade037f3165956e73dcdfbe0e556afabd"},"schema_version":"1.0","source":{"id":"1905.07798","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07798","created_at":"2026-05-17T23:45:48Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07798v1","created_at":"2026-05-17T23:45:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07798","created_at":"2026-05-17T23:45:48Z"},{"alias_kind":"pith_short_12","alias_value":"XW35PALAXQ4O","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XW35PALAXQ4OFEBZ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XW35PALA","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:6bcb9eb7ec50e360f4aad6482fddc58709e8b63dfad30ecbd9743492e9022866","target":"graph","created_at":"2026-05-17T23:45:48Z","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 $\\mathbb F_q$ be the finite field with $q$ elements, where $q$ is a power of a prime. We discuss recursive methods for constructing irreducible polynomials over $\\mathbb F_q$ of high degree using rational transformations. In particular, given a divisor $D>2$ of $q+1$ and an irreducible polynomial $f\\in \\mathbb F_{q}[x]$ of degree $n$ such that $n$ is even or $D\\not \\equiv 2\\pmod 4$, we show how to obtain from $f$ a sequence $\\{f_i\\}_{i\\ge 0}$ of irreducible polynomials over $\\mathbb F_q$ with $\\mathrm{deg}(f_i)=n\\cdot D^{i}$.","authors_text":"Daniel Panario, Lucas Reis, Qiang Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-05-19T19:41:43Z","title":"Construction of irreducible polynomials through rational transformations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07798","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:854ce9edb82dd4e7ad02a20a9d4aadf8a4148e977b427cfe831236ffde16f7f3","target":"record","created_at":"2026-05-17T23:45:48Z","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":"54bacf7dfb99ed848c2dda030020d5d473ce2792582ac81c84ffe8fce5406481","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-05-19T19:41:43Z","title_canon_sha256":"09503853e0969ca9d6c15ee6a216d6fade037f3165956e73dcdfbe0e556afabd"},"schema_version":"1.0","source":{"id":"1905.07798","kind":"arxiv","version":1}},"canonical_sha256":"bdb7d78160bc38e2903905092f5a8a2b6bf56b5d09dfc36f0ada9f3b6038c38f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bdb7d78160bc38e2903905092f5a8a2b6bf56b5d09dfc36f0ada9f3b6038c38f","first_computed_at":"2026-05-17T23:45:48.441038Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:48.441038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0jvuM9jJ6QnPylCnd9vQcfPlQaHmhZGViorVX89snqfx43y3jJzJ/KMMjkYOxWeg3Ei6cmo/CWQJA2OLNW3EBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:48.441739Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.07798","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:854ce9edb82dd4e7ad02a20a9d4aadf8a4148e977b427cfe831236ffde16f7f3","sha256:6bcb9eb7ec50e360f4aad6482fddc58709e8b63dfad30ecbd9743492e9022866"],"state_sha256":"4b7c4e7a62a0dd0d710bf571540d887f6dfb7456591c2a0012a4f7a02aa82ae1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vF1MbwTEKdB8BQfDjutZCfz9YOP3NiipVXtxpX2I93fmwss8Iyplb5WrRZCN0l3N8yKB0GlbgRQtXGmwBZ3DAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T12:19:28.180742Z","bundle_sha256":"5189eb570da72c7743f289bed1dabc174923709efc2fbe66880437057f21fcc1"}}