{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:D4TZT47NUBUFV63GVGMMGBG5CC","short_pith_number":"pith:D4TZT47N","schema_version":"1.0","canonical_sha256":"1f2799f3eda0685afb66a998c304dd108e9a47a29a3df65af531c973ce33c1d6","source":{"kind":"arxiv","id":"1012.2857","version":4},"attestation_state":"computed","paper":{"title":"An iterative construction of irreducible polynomials reducible modulo every prime","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Rafe Jones","submitted_at":"2010-12-13T20:46:16Z","abstract_excerpt":"We give a method of constructing polynomials of arbitrarily large degree irreducible over a global field F but reducible modulo every prime of F. The method consists of finding quadratic f in F[x] whose iterates have the desired property, and it depends on new criteria ensuring all iterates of f are irreducible. In particular when F is a number field in which the ideal (2) is not a square, we construct infinitely many families of quadratic f such that every iterate f^n is irreducible over F, but f^n is reducible modulo all primes of F for n at least 2. We also give an example for each n of a q"},"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":"1012.2857","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-12-13T20:46:16Z","cross_cats_sorted":[],"title_canon_sha256":"42d896cd893dadebbf2c8e57d2cdb1249bda75f088df4f56c038dd18f1f8d39e","abstract_canon_sha256":"eb436d6e9eff8f65f8177599afb56dc9c01ca844e7198bf64ffbbee263f4354c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:04.059139Z","signature_b64":"v5KVFg2cf5g2w+QhiFkz5iaZ4LrTMZ7qGHFpqEpfmOqJNM8mzPT8Kvm2B+tLEs4DVZugVe+/XlTsUd2I2prnBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f2799f3eda0685afb66a998c304dd108e9a47a29a3df65af531c973ce33c1d6","last_reissued_at":"2026-05-18T03:46:04.058645Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:04.058645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An iterative construction of irreducible polynomials reducible modulo every prime","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Rafe Jones","submitted_at":"2010-12-13T20:46:16Z","abstract_excerpt":"We give a method of constructing polynomials of arbitrarily large degree irreducible over a global field F but reducible modulo every prime of F. The method consists of finding quadratic f in F[x] whose iterates have the desired property, and it depends on new criteria ensuring all iterates of f are irreducible. In particular when F is a number field in which the ideal (2) is not a square, we construct infinitely many families of quadratic f such that every iterate f^n is irreducible over F, but f^n is reducible modulo all primes of F for n at least 2. We also give an example for each n of a q"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.2857","kind":"arxiv","version":4},"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":"1012.2857","created_at":"2026-05-18T03:46:04.058727+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.2857v4","created_at":"2026-05-18T03:46:04.058727+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.2857","created_at":"2026-05-18T03:46:04.058727+00:00"},{"alias_kind":"pith_short_12","alias_value":"D4TZT47NUBUF","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"D4TZT47NUBUFV63G","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"D4TZT47N","created_at":"2026-05-18T12:26:06.534383+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/D4TZT47NUBUFV63GVGMMGBG5CC","json":"https://pith.science/pith/D4TZT47NUBUFV63GVGMMGBG5CC.json","graph_json":"https://pith.science/api/pith-number/D4TZT47NUBUFV63GVGMMGBG5CC/graph.json","events_json":"https://pith.science/api/pith-number/D4TZT47NUBUFV63GVGMMGBG5CC/events.json","paper":"https://pith.science/paper/D4TZT47N"},"agent_actions":{"view_html":"https://pith.science/pith/D4TZT47NUBUFV63GVGMMGBG5CC","download_json":"https://pith.science/pith/D4TZT47NUBUFV63GVGMMGBG5CC.json","view_paper":"https://pith.science/paper/D4TZT47N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.2857&json=true","fetch_graph":"https://pith.science/api/pith-number/D4TZT47NUBUFV63GVGMMGBG5CC/graph.json","fetch_events":"https://pith.science/api/pith-number/D4TZT47NUBUFV63GVGMMGBG5CC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D4TZT47NUBUFV63GVGMMGBG5CC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D4TZT47NUBUFV63GVGMMGBG5CC/action/storage_attestation","attest_author":"https://pith.science/pith/D4TZT47NUBUFV63GVGMMGBG5CC/action/author_attestation","sign_citation":"https://pith.science/pith/D4TZT47NUBUFV63GVGMMGBG5CC/action/citation_signature","submit_replication":"https://pith.science/pith/D4TZT47NUBUFV63GVGMMGBG5CC/action/replication_record"}},"created_at":"2026-05-18T03:46:04.058727+00:00","updated_at":"2026-05-18T03:46:04.058727+00:00"}