{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OCOZWF5DUWMWEQ26T62HYWMXZP","short_pith_number":"pith:OCOZWF5D","schema_version":"1.0","canonical_sha256":"709d9b17a3a59962435e9fb47c5997cbe0f731460bffd0db32798b7737b7433e","source":{"kind":"arxiv","id":"1803.10811","version":1},"attestation_state":"computed","paper":{"title":"Irreducibility of polynomials with a large gap","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Mark Shusterman, Michael Stoll, William Sawin","submitted_at":"2018-03-28T19:10:36Z","abstract_excerpt":"We generalize an approach from a 1960 paper by Ljunggren, leading to a practical algorithm that determines the set of $N > \\operatorname{deg}(c) + \\operatorname{deg}(d)$ such that the polynomial $$f_N(x) = x^N c(x^{-1}) + d(x)$$ is irreducible over $\\mathbb Q$, where $c, d \\in \\mathbb Z[x]$ are polynomials with nonzero constant terms and satisfying suitable conditions. As an application, we show that $x^N - k x^2 + 1$ is irreducible for all $N \\ge 5$ and $k \\in \\{3, 4, \\ldots, 24\\} \\setminus \\{9, 16\\}$. We also give a complete description of the factorization of polynomials of the form $x^N + "},"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":"1803.10811","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-03-28T19:10:36Z","cross_cats_sorted":[],"title_canon_sha256":"95e190ed3eb63789203d82d0ed3690d349c0a3f0a90dc3c8f111233bba3548c6","abstract_canon_sha256":"78f9bfd7c3f7b147289c70137db0c844c36ad0f8579726e4fda8c3453655db3f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:50.168621Z","signature_b64":"O3y6Sgczv5jQBMmzIRGh+jU8r3eGCMGMGNZtRLOe6yOQF4SvVEvPY1RgoTfE9lvklmRtiZDo8mEH1R3LQ6hZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"709d9b17a3a59962435e9fb47c5997cbe0f731460bffd0db32798b7737b7433e","last_reissued_at":"2026-05-18T00:19:50.167910Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:50.167910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Irreducibility of polynomials with a large gap","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Mark Shusterman, Michael Stoll, William Sawin","submitted_at":"2018-03-28T19:10:36Z","abstract_excerpt":"We generalize an approach from a 1960 paper by Ljunggren, leading to a practical algorithm that determines the set of $N > \\operatorname{deg}(c) + \\operatorname{deg}(d)$ such that the polynomial $$f_N(x) = x^N c(x^{-1}) + d(x)$$ is irreducible over $\\mathbb Q$, where $c, d \\in \\mathbb Z[x]$ are polynomials with nonzero constant terms and satisfying suitable conditions. As an application, we show that $x^N - k x^2 + 1$ is irreducible for all $N \\ge 5$ and $k \\in \\{3, 4, \\ldots, 24\\} \\setminus \\{9, 16\\}$. We also give a complete description of the factorization of polynomials of the form $x^N + "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10811","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1803.10811","created_at":"2026-05-18T00:19:50.168029+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.10811v1","created_at":"2026-05-18T00:19:50.168029+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10811","created_at":"2026-05-18T00:19:50.168029+00:00"},{"alias_kind":"pith_short_12","alias_value":"OCOZWF5DUWMW","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OCOZWF5DUWMWEQ26","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OCOZWF5D","created_at":"2026-05-18T12:32:43.782077+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/OCOZWF5DUWMWEQ26T62HYWMXZP","json":"https://pith.science/pith/OCOZWF5DUWMWEQ26T62HYWMXZP.json","graph_json":"https://pith.science/api/pith-number/OCOZWF5DUWMWEQ26T62HYWMXZP/graph.json","events_json":"https://pith.science/api/pith-number/OCOZWF5DUWMWEQ26T62HYWMXZP/events.json","paper":"https://pith.science/paper/OCOZWF5D"},"agent_actions":{"view_html":"https://pith.science/pith/OCOZWF5DUWMWEQ26T62HYWMXZP","download_json":"https://pith.science/pith/OCOZWF5DUWMWEQ26T62HYWMXZP.json","view_paper":"https://pith.science/paper/OCOZWF5D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.10811&json=true","fetch_graph":"https://pith.science/api/pith-number/OCOZWF5DUWMWEQ26T62HYWMXZP/graph.json","fetch_events":"https://pith.science/api/pith-number/OCOZWF5DUWMWEQ26T62HYWMXZP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OCOZWF5DUWMWEQ26T62HYWMXZP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OCOZWF5DUWMWEQ26T62HYWMXZP/action/storage_attestation","attest_author":"https://pith.science/pith/OCOZWF5DUWMWEQ26T62HYWMXZP/action/author_attestation","sign_citation":"https://pith.science/pith/OCOZWF5DUWMWEQ26T62HYWMXZP/action/citation_signature","submit_replication":"https://pith.science/pith/OCOZWF5DUWMWEQ26T62HYWMXZP/action/replication_record"}},"created_at":"2026-05-18T00:19:50.168029+00:00","updated_at":"2026-05-18T00:19:50.168029+00:00"}