{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MJDDYXQS6XFUGVFXMYRY3NXPDC","short_pith_number":"pith:MJDDYXQS","canonical_record":{"source":{"id":"1308.3754","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.NT","submitted_at":"2013-08-17T05:11:28Z","cross_cats_sorted":[],"title_canon_sha256":"c03b7d9b89abb10d81f66d6b551f36b96ce320b8db9c01bba48e93601b2194b8","abstract_canon_sha256":"8ae03962aea9c9de549da8da2b7760ba9cfbd0623f47b7366f746d83c5f869de"},"schema_version":"1.0"},"canonical_sha256":"62463c5e12f5cb4354b766238db6ef18900b715fa6b172e17454dfe06e2ede0c","source":{"kind":"arxiv","id":"1308.3754","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3754","created_at":"2026-05-18T03:15:42Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3754v1","created_at":"2026-05-18T03:15:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3754","created_at":"2026-05-18T03:15:42Z"},{"alias_kind":"pith_short_12","alias_value":"MJDDYXQS6XFU","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MJDDYXQS6XFUGVFX","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MJDDYXQS","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MJDDYXQS6XFUGVFXMYRY3NXPDC","target":"record","payload":{"canonical_record":{"source":{"id":"1308.3754","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.NT","submitted_at":"2013-08-17T05:11:28Z","cross_cats_sorted":[],"title_canon_sha256":"c03b7d9b89abb10d81f66d6b551f36b96ce320b8db9c01bba48e93601b2194b8","abstract_canon_sha256":"8ae03962aea9c9de549da8da2b7760ba9cfbd0623f47b7366f746d83c5f869de"},"schema_version":"1.0"},"canonical_sha256":"62463c5e12f5cb4354b766238db6ef18900b715fa6b172e17454dfe06e2ede0c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:42.650890Z","signature_b64":"kHjYhaZM8PLzW3dhThcS5EkWXGG056/1SMIGNZFfkebkzx+S4g8bN+Ouse0nMjcuySns3xtiEkXw5fx6DkLiDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62463c5e12f5cb4354b766238db6ef18900b715fa6b172e17454dfe06e2ede0c","last_reissued_at":"2026-05-18T03:15:42.650127Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:42.650127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.3754","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-18T03:15:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tA8lbXzGYw4Ia/qM9XnwF5MZKaxnUyV5kPcVhh7FH4hSiwws5Vaig8AcUfePg5GC4TSRD64U3M4YZzFHkqEZDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:48:10.323273Z"},"content_sha256":"740e14b43d8c6a442e2082d596e2179150368e571dcdba372e9f03df7254799c","schema_version":"1.0","event_id":"sha256:740e14b43d8c6a442e2082d596e2179150368e571dcdba372e9f03df7254799c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MJDDYXQS6XFUGVFXMYRY3NXPDC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Discriminators of quadratic polynomials","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Soohyun Park","submitted_at":"2013-08-17T05:11:28Z","abstract_excerpt":"Given $f \\in \\mathbb{Z}[x]$ and $n \\in \\mathbb{Z^{+}}$, the $\\emph{discriminator}$ $D_f(n)$ is the smallest positive integer $m$ such that $f(1), \\ldots, f(n)$ are distinct mod $m$. In a recent paper, Z.-W. Sun proved that $D_f(n) = d^{\\lceil \\log_d n \\rceil}$ if $f(x) = x(dx - 1)$ for $d \\in \\{2, 3\\}$. We extend this result to $d = 2^r$ for any $r \\in \\mathbb{Z}^{+}$ and find that $D_f(n) = 2^{\\lceil \\log_2 n \\rceil}$ in this case. We also provide more general statements for $d = p^r$, where $p$ is a prime. In addition, we present a potential method for generating prime numbers with discrimin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3754","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-18T03:15:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BD4YxpL8GrXKwmg1fJFx9KczxkPtfQzqJEWiiqLiaFJNGGOBfxFokqbwwVqYzaxV11YSjYG/ybGKkyy3Ae2XAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:48:10.323869Z"},"content_sha256":"893c76184993ea2c5136dc5c0508521e9955ee3bec2342275b5d5a408ff8a43d","schema_version":"1.0","event_id":"sha256:893c76184993ea2c5136dc5c0508521e9955ee3bec2342275b5d5a408ff8a43d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MJDDYXQS6XFUGVFXMYRY3NXPDC/bundle.json","state_url":"https://pith.science/pith/MJDDYXQS6XFUGVFXMYRY3NXPDC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MJDDYXQS6XFUGVFXMYRY3NXPDC/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-05-31T20:48:10Z","links":{"resolver":"https://pith.science/pith/MJDDYXQS6XFUGVFXMYRY3NXPDC","bundle":"https://pith.science/pith/MJDDYXQS6XFUGVFXMYRY3NXPDC/bundle.json","state":"https://pith.science/pith/MJDDYXQS6XFUGVFXMYRY3NXPDC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MJDDYXQS6XFUGVFXMYRY3NXPDC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MJDDYXQS6XFUGVFXMYRY3NXPDC","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":"8ae03962aea9c9de549da8da2b7760ba9cfbd0623f47b7366f746d83c5f869de","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.NT","submitted_at":"2013-08-17T05:11:28Z","title_canon_sha256":"c03b7d9b89abb10d81f66d6b551f36b96ce320b8db9c01bba48e93601b2194b8"},"schema_version":"1.0","source":{"id":"1308.3754","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3754","created_at":"2026-05-18T03:15:42Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3754v1","created_at":"2026-05-18T03:15:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3754","created_at":"2026-05-18T03:15:42Z"},{"alias_kind":"pith_short_12","alias_value":"MJDDYXQS6XFU","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MJDDYXQS6XFUGVFX","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MJDDYXQS","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:893c76184993ea2c5136dc5c0508521e9955ee3bec2342275b5d5a408ff8a43d","target":"graph","created_at":"2026-05-18T03:15:42Z","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":"Given $f \\in \\mathbb{Z}[x]$ and $n \\in \\mathbb{Z^{+}}$, the $\\emph{discriminator}$ $D_f(n)$ is the smallest positive integer $m$ such that $f(1), \\ldots, f(n)$ are distinct mod $m$. In a recent paper, Z.-W. Sun proved that $D_f(n) = d^{\\lceil \\log_d n \\rceil}$ if $f(x) = x(dx - 1)$ for $d \\in \\{2, 3\\}$. We extend this result to $d = 2^r$ for any $r \\in \\mathbb{Z}^{+}$ and find that $D_f(n) = 2^{\\lceil \\log_2 n \\rceil}$ in this case. We also provide more general statements for $d = p^r$, where $p$ is a prime. In addition, we present a potential method for generating prime numbers with discrimin","authors_text":"Soohyun Park","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.NT","submitted_at":"2013-08-17T05:11:28Z","title":"Discriminators of quadratic polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3754","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:740e14b43d8c6a442e2082d596e2179150368e571dcdba372e9f03df7254799c","target":"record","created_at":"2026-05-18T03:15:42Z","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":"8ae03962aea9c9de549da8da2b7760ba9cfbd0623f47b7366f746d83c5f869de","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.NT","submitted_at":"2013-08-17T05:11:28Z","title_canon_sha256":"c03b7d9b89abb10d81f66d6b551f36b96ce320b8db9c01bba48e93601b2194b8"},"schema_version":"1.0","source":{"id":"1308.3754","kind":"arxiv","version":1}},"canonical_sha256":"62463c5e12f5cb4354b766238db6ef18900b715fa6b172e17454dfe06e2ede0c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62463c5e12f5cb4354b766238db6ef18900b715fa6b172e17454dfe06e2ede0c","first_computed_at":"2026-05-18T03:15:42.650127Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:42.650127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kHjYhaZM8PLzW3dhThcS5EkWXGG056/1SMIGNZFfkebkzx+S4g8bN+Ouse0nMjcuySns3xtiEkXw5fx6DkLiDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:42.650890Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.3754","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:740e14b43d8c6a442e2082d596e2179150368e571dcdba372e9f03df7254799c","sha256:893c76184993ea2c5136dc5c0508521e9955ee3bec2342275b5d5a408ff8a43d"],"state_sha256":"7011c3264998ce4e94a3b6055c899a518d5ad7eb10c067f6afc23366a3fbf4aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oGlvWU9NrjF/h/is7cCvMex3e4tCGfPFfrtvtLPNTdeOdV4nsH9IqG/Gu4BzpIopjkWOJDfJ5/u8f1j4//lmBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:48:10.327543Z","bundle_sha256":"7889a80969c803a29a9636f8e396cb68121f8242de6dc61feab3025b3573616a"}}