{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KMXA23TLGP5H2HJ53PXJMYVMRW","short_pith_number":"pith:KMXA23TL","canonical_record":{"source":{"id":"1909.00135","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-08-31T05:44:09Z","cross_cats_sorted":[],"title_canon_sha256":"ebba8162ef0ccaddd862ca1cc862968a94f262b90bca4b46f614f0d8739ea28d","abstract_canon_sha256":"39de710308d41d7f958298431238e9d3c0bafbdfb2efe754424f5a2bacbdcf3d"},"schema_version":"1.0"},"canonical_sha256":"532e0d6e6b33fa7d1d3ddbee9662ac8d8c6ee0d16e2590f736e66337e2081b0c","source":{"kind":"arxiv","id":"1909.00135","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.00135","created_at":"2026-07-05T03:32:48Z"},{"alias_kind":"arxiv_version","alias_value":"1909.00135v2","created_at":"2026-07-05T03:32:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.00135","created_at":"2026-07-05T03:32:48Z"},{"alias_kind":"pith_short_12","alias_value":"KMXA23TLGP5H","created_at":"2026-07-05T03:32:48Z"},{"alias_kind":"pith_short_16","alias_value":"KMXA23TLGP5H2HJ5","created_at":"2026-07-05T03:32:48Z"},{"alias_kind":"pith_short_8","alias_value":"KMXA23TL","created_at":"2026-07-05T03:32:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KMXA23TLGP5H2HJ53PXJMYVMRW","target":"record","payload":{"canonical_record":{"source":{"id":"1909.00135","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-08-31T05:44:09Z","cross_cats_sorted":[],"title_canon_sha256":"ebba8162ef0ccaddd862ca1cc862968a94f262b90bca4b46f614f0d8739ea28d","abstract_canon_sha256":"39de710308d41d7f958298431238e9d3c0bafbdfb2efe754424f5a2bacbdcf3d"},"schema_version":"1.0"},"canonical_sha256":"532e0d6e6b33fa7d1d3ddbee9662ac8d8c6ee0d16e2590f736e66337e2081b0c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:32:48.120363Z","signature_b64":"+lVxGSIUWfltF6rTsx6J9OdgcQr07P1QVbusjP06ELLq1IaprAU9/rtCWg3iJxn1qW+qsqEdUagS7Ld6tYt+Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"532e0d6e6b33fa7d1d3ddbee9662ac8d8c6ee0d16e2590f736e66337e2081b0c","last_reissued_at":"2026-07-05T03:32:48.119893Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:32:48.119893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1909.00135","source_version":2,"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-07-05T03:32:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jonv0h3ktBJDnTmhl/Kf/wOX9RXW59SOiAZkQ9z7cabDxRpa/mVjSL3RP4/n+l82GjwFXOS0QExPMDS9K97gAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T13:48:30.379320Z"},"content_sha256":"59855e2a82bf876bebf329af476bc572b376a4e03e57c551a990bf1dae5b702c","schema_version":"1.0","event_id":"sha256:59855e2a82bf876bebf329af476bc572b376a4e03e57c551a990bf1dae5b702c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KMXA23TLGP5H2HJ53PXJMYVMRW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Discriminants of Fields Generated by Polynomials of Given Height","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Alina Ostafe, Igor E. Shparlinski, Rainer Dietmann","submitted_at":"2019-08-31T05:44:09Z","abstract_excerpt":"We obtain upper bounds for the number of monic irreducible polynomials over $\\mathbb Z$ of a fixed degree $n$ and a growing height $H$ for which the field generated by one of its roots has a given discriminant. We approach it via counting square-free parts of polynomial discriminants via two complementing approaches. In turn, this leads to a lower bound on the number of distinct discriminants of fields generated by roots of polynomials of degree $n$ and height at most $H$. We also give an upper bound for the number of trinomials of bounded height with given square-free part of the discriminant"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.00135","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1909.00135/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:32:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Lid9Fc9862OI8glDWOMBORZnxI9rsFXP5WoUsA3i/5w0kg3Sqphaj9yJQC2FZ6a3/5bzEntE6NOGRzwGJd9AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T13:48:30.379810Z"},"content_sha256":"0a89b20a6653865099fc35fedddc90eba41fcbb935b4244289b3b50a6cb05dd8","schema_version":"1.0","event_id":"sha256:0a89b20a6653865099fc35fedddc90eba41fcbb935b4244289b3b50a6cb05dd8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KMXA23TLGP5H2HJ53PXJMYVMRW/bundle.json","state_url":"https://pith.science/pith/KMXA23TLGP5H2HJ53PXJMYVMRW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KMXA23TLGP5H2HJ53PXJMYVMRW/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-08-16T13:48:30Z","links":{"resolver":"https://pith.science/pith/KMXA23TLGP5H2HJ53PXJMYVMRW","bundle":"https://pith.science/pith/KMXA23TLGP5H2HJ53PXJMYVMRW/bundle.json","state":"https://pith.science/pith/KMXA23TLGP5H2HJ53PXJMYVMRW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KMXA23TLGP5H2HJ53PXJMYVMRW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KMXA23TLGP5H2HJ53PXJMYVMRW","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":"39de710308d41d7f958298431238e9d3c0bafbdfb2efe754424f5a2bacbdcf3d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-08-31T05:44:09Z","title_canon_sha256":"ebba8162ef0ccaddd862ca1cc862968a94f262b90bca4b46f614f0d8739ea28d"},"schema_version":"1.0","source":{"id":"1909.00135","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.00135","created_at":"2026-07-05T03:32:48Z"},{"alias_kind":"arxiv_version","alias_value":"1909.00135v2","created_at":"2026-07-05T03:32:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.00135","created_at":"2026-07-05T03:32:48Z"},{"alias_kind":"pith_short_12","alias_value":"KMXA23TLGP5H","created_at":"2026-07-05T03:32:48Z"},{"alias_kind":"pith_short_16","alias_value":"KMXA23TLGP5H2HJ5","created_at":"2026-07-05T03:32:48Z"},{"alias_kind":"pith_short_8","alias_value":"KMXA23TL","created_at":"2026-07-05T03:32:48Z"}],"graph_snapshots":[{"event_id":"sha256:0a89b20a6653865099fc35fedddc90eba41fcbb935b4244289b3b50a6cb05dd8","target":"graph","created_at":"2026-07-05T03:32: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1909.00135/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We obtain upper bounds for the number of monic irreducible polynomials over $\\mathbb Z$ of a fixed degree $n$ and a growing height $H$ for which the field generated by one of its roots has a given discriminant. We approach it via counting square-free parts of polynomial discriminants via two complementing approaches. In turn, this leads to a lower bound on the number of distinct discriminants of fields generated by roots of polynomials of degree $n$ and height at most $H$. We also give an upper bound for the number of trinomials of bounded height with given square-free part of the discriminant","authors_text":"Alina Ostafe, Igor E. Shparlinski, Rainer Dietmann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-08-31T05:44:09Z","title":"Discriminants of Fields Generated by Polynomials of Given Height"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.00135","kind":"arxiv","version":2},"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:59855e2a82bf876bebf329af476bc572b376a4e03e57c551a990bf1dae5b702c","target":"record","created_at":"2026-07-05T03:32: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":"39de710308d41d7f958298431238e9d3c0bafbdfb2efe754424f5a2bacbdcf3d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-08-31T05:44:09Z","title_canon_sha256":"ebba8162ef0ccaddd862ca1cc862968a94f262b90bca4b46f614f0d8739ea28d"},"schema_version":"1.0","source":{"id":"1909.00135","kind":"arxiv","version":2}},"canonical_sha256":"532e0d6e6b33fa7d1d3ddbee9662ac8d8c6ee0d16e2590f736e66337e2081b0c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"532e0d6e6b33fa7d1d3ddbee9662ac8d8c6ee0d16e2590f736e66337e2081b0c","first_computed_at":"2026-07-05T03:32:48.119893Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:32:48.119893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+lVxGSIUWfltF6rTsx6J9OdgcQr07P1QVbusjP06ELLq1IaprAU9/rtCWg3iJxn1qW+qsqEdUagS7Ld6tYt+Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:32:48.120363Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.00135","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59855e2a82bf876bebf329af476bc572b376a4e03e57c551a990bf1dae5b702c","sha256:0a89b20a6653865099fc35fedddc90eba41fcbb935b4244289b3b50a6cb05dd8"],"state_sha256":"570567b934f720137f77a2d6ad89929e69a460cb8a5bc96bade859db1b500a87"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZPg5F8FnwUGCkftot2kj/yfP7pYdSwt58PixXJr5lFcy4C/hZS4WUsZ9hm0uhtPQY8KvqPl8rONnnsDa4d1VCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T13:48:30.384485Z","bundle_sha256":"46a25756ca6f769f3e758eb25a9b9101c35d06d4d2a878d0a9ea375c2f34c595"}}