{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:D4TZT47NUBUFV63GVGMMGBG5CC","short_pith_number":"pith:D4TZT47N","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"},"canonical_sha256":"1f2799f3eda0685afb66a998c304dd108e9a47a29a3df65af531c973ce33c1d6","source":{"kind":"arxiv","id":"1012.2857","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.2857","created_at":"2026-05-18T03:46:04Z"},{"alias_kind":"arxiv_version","alias_value":"1012.2857v4","created_at":"2026-05-18T03:46:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.2857","created_at":"2026-05-18T03:46:04Z"},{"alias_kind":"pith_short_12","alias_value":"D4TZT47NUBUF","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"D4TZT47NUBUFV63G","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"D4TZT47N","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:D4TZT47NUBUFV63GVGMMGBG5CC","target":"record","payload":{"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"},"canonical_sha256":"1f2799f3eda0685afb66a998c304dd108e9a47a29a3df65af531c973ce33c1d6","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"},"source_kind":"arxiv","source_id":"1012.2857","source_version":4,"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-18T03:46:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hxOE8ohbWcSdL5Cvatz0GPNf/c4PA9kwt8sQGDa4eAmeuMH3DAFOq0iOuXr31a+3e4fTWipGQmgyDcx7srIhAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:32:52.617083Z"},"content_sha256":"13faf81ce3627d551c40ce1e947ace565646e0967999c5b645142d0f8e3b1ff8","schema_version":"1.0","event_id":"sha256:13faf81ce3627d551c40ce1e947ace565646e0967999c5b645142d0f8e3b1ff8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:D4TZT47NUBUFV63GVGMMGBG5CC","target":"graph","payload":{"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"},"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-18T03:46:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fs7fmtbxO2l8LjSmKJw4PczzcM+FhoZ7tk13iNAY46G6ZnW5hah13U4vrwdtQNNRW57gEhGVb/eJJudLJZRiCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:32:52.617449Z"},"content_sha256":"86d9725bb55e002e0105f9c08b79e82ffcc0ca8147aab811790aa629ed34c9f5","schema_version":"1.0","event_id":"sha256:86d9725bb55e002e0105f9c08b79e82ffcc0ca8147aab811790aa629ed34c9f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D4TZT47NUBUFV63GVGMMGBG5CC/bundle.json","state_url":"https://pith.science/pith/D4TZT47NUBUFV63GVGMMGBG5CC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D4TZT47NUBUFV63GVGMMGBG5CC/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-22T13:32:52Z","links":{"resolver":"https://pith.science/pith/D4TZT47NUBUFV63GVGMMGBG5CC","bundle":"https://pith.science/pith/D4TZT47NUBUFV63GVGMMGBG5CC/bundle.json","state":"https://pith.science/pith/D4TZT47NUBUFV63GVGMMGBG5CC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D4TZT47NUBUFV63GVGMMGBG5CC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:D4TZT47NUBUFV63GVGMMGBG5CC","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":"eb436d6e9eff8f65f8177599afb56dc9c01ca844e7198bf64ffbbee263f4354c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-12-13T20:46:16Z","title_canon_sha256":"42d896cd893dadebbf2c8e57d2cdb1249bda75f088df4f56c038dd18f1f8d39e"},"schema_version":"1.0","source":{"id":"1012.2857","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.2857","created_at":"2026-05-18T03:46:04Z"},{"alias_kind":"arxiv_version","alias_value":"1012.2857v4","created_at":"2026-05-18T03:46:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.2857","created_at":"2026-05-18T03:46:04Z"},{"alias_kind":"pith_short_12","alias_value":"D4TZT47NUBUF","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"D4TZT47NUBUFV63G","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"D4TZT47N","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:86d9725bb55e002e0105f9c08b79e82ffcc0ca8147aab811790aa629ed34c9f5","target":"graph","created_at":"2026-05-18T03:46:04Z","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":"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","authors_text":"Rafe Jones","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-12-13T20:46:16Z","title":"An iterative construction of irreducible polynomials reducible modulo every prime"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.2857","kind":"arxiv","version":4},"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:13faf81ce3627d551c40ce1e947ace565646e0967999c5b645142d0f8e3b1ff8","target":"record","created_at":"2026-05-18T03:46:04Z","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":"eb436d6e9eff8f65f8177599afb56dc9c01ca844e7198bf64ffbbee263f4354c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-12-13T20:46:16Z","title_canon_sha256":"42d896cd893dadebbf2c8e57d2cdb1249bda75f088df4f56c038dd18f1f8d39e"},"schema_version":"1.0","source":{"id":"1012.2857","kind":"arxiv","version":4}},"canonical_sha256":"1f2799f3eda0685afb66a998c304dd108e9a47a29a3df65af531c973ce33c1d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f2799f3eda0685afb66a998c304dd108e9a47a29a3df65af531c973ce33c1d6","first_computed_at":"2026-05-18T03:46:04.058645Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:46:04.058645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v5KVFg2cf5g2w+QhiFkz5iaZ4LrTMZ7qGHFpqEpfmOqJNM8mzPT8Kvm2B+tLEs4DVZugVe+/XlTsUd2I2prnBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:46:04.059139Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.2857","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13faf81ce3627d551c40ce1e947ace565646e0967999c5b645142d0f8e3b1ff8","sha256:86d9725bb55e002e0105f9c08b79e82ffcc0ca8147aab811790aa629ed34c9f5"],"state_sha256":"463fe04438927b17bcf53811e59807fb9b7270b909331603f9ad702f0ffce83a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o1aPtK0JcLQk9fh0Vj6zHNDBfOVYZOGbMCvBsYBytCLl6mJozLP6PyNXGfxKExIBth8iFmQl8VEGFUViuf4XDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T13:32:52.619443Z","bundle_sha256":"27e2e102111d568259d0a031cb29290314c5abfec2be7293fe3bd2e44de9ea85"}}