{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GQKUIM4SZNRCXM7KQAX3DST4AJ","short_pith_number":"pith:GQKUIM4S","canonical_record":{"source":{"id":"1304.5988","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-04-22T15:39:13Z","cross_cats_sorted":[],"title_canon_sha256":"3beb8c2f50c0ff3b9f04d927e5e4a48c982de02a5dafb8acbfa17647c27c93ac","abstract_canon_sha256":"40967f4587826c9eac271870666cdc77b279fef3f19ea129474263536e35f27b"},"schema_version":"1.0"},"canonical_sha256":"3415443392cb622bb3ea802fb1ca7c027c7502cbf8419c516a9def763d2beff2","source":{"kind":"arxiv","id":"1304.5988","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5988","created_at":"2026-05-18T01:29:32Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5988v5","created_at":"2026-05-18T01:29:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5988","created_at":"2026-05-18T01:29:32Z"},{"alias_kind":"pith_short_12","alias_value":"GQKUIM4SZNRC","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GQKUIM4SZNRCXM7K","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GQKUIM4S","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GQKUIM4SZNRCXM7KQAX3DST4AJ","target":"record","payload":{"canonical_record":{"source":{"id":"1304.5988","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-04-22T15:39:13Z","cross_cats_sorted":[],"title_canon_sha256":"3beb8c2f50c0ff3b9f04d927e5e4a48c982de02a5dafb8acbfa17647c27c93ac","abstract_canon_sha256":"40967f4587826c9eac271870666cdc77b279fef3f19ea129474263536e35f27b"},"schema_version":"1.0"},"canonical_sha256":"3415443392cb622bb3ea802fb1ca7c027c7502cbf8419c516a9def763d2beff2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:32.160549Z","signature_b64":"A6fIKGYFCz2V8OH4LfIFVuvo4szayMf6CpileRuLPKA0yX0QREy7he3MhYGQ81xGIhpKQTCHS7WUrHz9RvIoAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3415443392cb622bb3ea802fb1ca7c027c7502cbf8419c516a9def763d2beff2","last_reissued_at":"2026-05-18T01:29:32.159815Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:32.159815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.5988","source_version":5,"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-18T01:29:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"obCUyfN+5NSyBzNCIR1EDQAbEP2cJ8q2K1w2ZPvrm0eidRzfuGzfNMPWEd5jHSWwCgGiZ6tTJNLAiTsFa1LcDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T20:27:36.578413Z"},"content_sha256":"bee81ae1d81795bb45d551dee9983f1c6d81fcedda2041e59f6bd0959dba59d3","schema_version":"1.0","event_id":"sha256:bee81ae1d81795bb45d551dee9983f1c6d81fcedda2041e59f6bd0959dba59d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GQKUIM4SZNRCXM7KQAX3DST4AJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The least modulus for which consecutive polynomial values are distinct","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Zhi-Wei Sun","submitted_at":"2013-04-22T15:39:13Z","abstract_excerpt":"Let $d\\ge4$ and $c\\in(-d,d)$ be relatively prime integers. We show that for any sufficiently large integer $n$ (in particular $n>24310$ suffices for $4\\le d\\le 36$), the smallest prime $p\\equiv c\\pmod d$ with $p\\ge(2dn-c)/(d-1)$ is the least positive integer $m$ with $2r(d)k(dk-c)\\ (k=1,\\ldots,n)$ pairwise distinct modulo $m$, where $r(d)$ is the radical of $d$. We also conjecture that for any integer $n>4$ the least positive integer $m$ such that $|\\{k(k-1)/2\\ \\mbox{mod}\\ m:\\ k=1,\\ldots,n\\}|= |\\{k(k-1)/2\\ \\mbox{mod}\\ m+2:\\ k=1,\\ldots,n\\}|=n$ is the least prime $p\\ge 2n-1$ with $p+2$ also prim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5988","kind":"arxiv","version":5},"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-18T01:29:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vPLRbQjkFh4Pp3Q+EhrNXceUfrh5T6hhozFS5Y0tc1D/kY3KNMU4XYSXPZ5x/uLgGuFJfhhAQcqEY65ElVbHDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T20:27:36.579093Z"},"content_sha256":"84bf46764a543d4b1ef83c3bd0904538de8f56b96082e4c9306cb37784f16480","schema_version":"1.0","event_id":"sha256:84bf46764a543d4b1ef83c3bd0904538de8f56b96082e4c9306cb37784f16480"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GQKUIM4SZNRCXM7KQAX3DST4AJ/bundle.json","state_url":"https://pith.science/pith/GQKUIM4SZNRCXM7KQAX3DST4AJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GQKUIM4SZNRCXM7KQAX3DST4AJ/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-23T20:27:36Z","links":{"resolver":"https://pith.science/pith/GQKUIM4SZNRCXM7KQAX3DST4AJ","bundle":"https://pith.science/pith/GQKUIM4SZNRCXM7KQAX3DST4AJ/bundle.json","state":"https://pith.science/pith/GQKUIM4SZNRCXM7KQAX3DST4AJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GQKUIM4SZNRCXM7KQAX3DST4AJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GQKUIM4SZNRCXM7KQAX3DST4AJ","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":"40967f4587826c9eac271870666cdc77b279fef3f19ea129474263536e35f27b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-04-22T15:39:13Z","title_canon_sha256":"3beb8c2f50c0ff3b9f04d927e5e4a48c982de02a5dafb8acbfa17647c27c93ac"},"schema_version":"1.0","source":{"id":"1304.5988","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5988","created_at":"2026-05-18T01:29:32Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5988v5","created_at":"2026-05-18T01:29:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5988","created_at":"2026-05-18T01:29:32Z"},{"alias_kind":"pith_short_12","alias_value":"GQKUIM4SZNRC","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GQKUIM4SZNRCXM7K","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GQKUIM4S","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:84bf46764a543d4b1ef83c3bd0904538de8f56b96082e4c9306cb37784f16480","target":"graph","created_at":"2026-05-18T01:29:32Z","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":"Let $d\\ge4$ and $c\\in(-d,d)$ be relatively prime integers. We show that for any sufficiently large integer $n$ (in particular $n>24310$ suffices for $4\\le d\\le 36$), the smallest prime $p\\equiv c\\pmod d$ with $p\\ge(2dn-c)/(d-1)$ is the least positive integer $m$ with $2r(d)k(dk-c)\\ (k=1,\\ldots,n)$ pairwise distinct modulo $m$, where $r(d)$ is the radical of $d$. We also conjecture that for any integer $n>4$ the least positive integer $m$ such that $|\\{k(k-1)/2\\ \\mbox{mod}\\ m:\\ k=1,\\ldots,n\\}|= |\\{k(k-1)/2\\ \\mbox{mod}\\ m+2:\\ k=1,\\ldots,n\\}|=n$ is the least prime $p\\ge 2n-1$ with $p+2$ also prim","authors_text":"Zhi-Wei Sun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-04-22T15:39:13Z","title":"The least modulus for which consecutive polynomial values are distinct"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5988","kind":"arxiv","version":5},"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:bee81ae1d81795bb45d551dee9983f1c6d81fcedda2041e59f6bd0959dba59d3","target":"record","created_at":"2026-05-18T01:29:32Z","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":"40967f4587826c9eac271870666cdc77b279fef3f19ea129474263536e35f27b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-04-22T15:39:13Z","title_canon_sha256":"3beb8c2f50c0ff3b9f04d927e5e4a48c982de02a5dafb8acbfa17647c27c93ac"},"schema_version":"1.0","source":{"id":"1304.5988","kind":"arxiv","version":5}},"canonical_sha256":"3415443392cb622bb3ea802fb1ca7c027c7502cbf8419c516a9def763d2beff2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3415443392cb622bb3ea802fb1ca7c027c7502cbf8419c516a9def763d2beff2","first_computed_at":"2026-05-18T01:29:32.159815Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:32.159815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A6fIKGYFCz2V8OH4LfIFVuvo4szayMf6CpileRuLPKA0yX0QREy7he3MhYGQ81xGIhpKQTCHS7WUrHz9RvIoAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:32.160549Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.5988","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bee81ae1d81795bb45d551dee9983f1c6d81fcedda2041e59f6bd0959dba59d3","sha256:84bf46764a543d4b1ef83c3bd0904538de8f56b96082e4c9306cb37784f16480"],"state_sha256":"7d9a42096b68af0c568db06ebb623255efaa9d4dacc448e4606f72e92d2e7f0f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A/DKVcwVfRaAEbOHbbTleu9PU9NVIeor7BlFPX5D+eG98h3kAOGQcHltXKWHrt8nBpa+WRVe5XyWxZsiu6vDDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T20:27:36.581738Z","bundle_sha256":"3e6360a302979f622905f1b91064c1e6b32b68e5a8310d0315dbe235b5a50102"}}