{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:UTKEQASG45E3QZTPR32IXBQJ7B","short_pith_number":"pith:UTKEQASG","canonical_record":{"source":{"id":"1308.6458","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-08-29T13:23:07Z","cross_cats_sorted":[],"title_canon_sha256":"e5d8b60748a6192dfcc08b824f247549ec865e6f89af1086d7a409e34851be0d","abstract_canon_sha256":"33da840cea659cb06562b99aa9eb74124340fa24874a6236bfd43a13bd4ba3d7"},"schema_version":"1.0"},"canonical_sha256":"a4d4480246e749b8666f8ef48b8609f86830e3462e08e51d68c9fd054db1c1be","source":{"kind":"arxiv","id":"1308.6458","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.6458","created_at":"2026-05-18T03:06:32Z"},{"alias_kind":"arxiv_version","alias_value":"1308.6458v2","created_at":"2026-05-18T03:06:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.6458","created_at":"2026-05-18T03:06:32Z"},{"alias_kind":"pith_short_12","alias_value":"UTKEQASG45E3","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UTKEQASG45E3QZTP","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UTKEQASG","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:UTKEQASG45E3QZTPR32IXBQJ7B","target":"record","payload":{"canonical_record":{"source":{"id":"1308.6458","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-08-29T13:23:07Z","cross_cats_sorted":[],"title_canon_sha256":"e5d8b60748a6192dfcc08b824f247549ec865e6f89af1086d7a409e34851be0d","abstract_canon_sha256":"33da840cea659cb06562b99aa9eb74124340fa24874a6236bfd43a13bd4ba3d7"},"schema_version":"1.0"},"canonical_sha256":"a4d4480246e749b8666f8ef48b8609f86830e3462e08e51d68c9fd054db1c1be","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:32.384482Z","signature_b64":"yQt7iIkzy/89Yglt9E4h8dvaghqwDys+s+bEKMSmmeuBKpn+CojolgNMkp4kGrBaWIzSketEocZpuKaVLrvOCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4d4480246e749b8666f8ef48b8609f86830e3462e08e51d68c9fd054db1c1be","last_reissued_at":"2026-05-18T03:06:32.383854Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:32.383854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.6458","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-05-18T03:06:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S7hdB4Sza31aVGUUHE7HkM1qndBgDlZP95Zdbz5eIh/IWgsSmMObLS2sUwg7BiyGYo0xm1DOtwpkoPFMO6HzDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:16:03.925483Z"},"content_sha256":"0598a221d7c5732baefc278cdee0108cb8300d9b1c74258352170d95adf84b60","schema_version":"1.0","event_id":"sha256:0598a221d7c5732baefc278cdee0108cb8300d9b1c74258352170d95adf84b60"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:UTKEQASG45E3QZTPR32IXBQJ7B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Uniform lower bound for the least common multiple of a polynomial sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Chunlin Wang, Guoyou Qian, Shaofang Hong, Yuanyuan Luo","submitted_at":"2013-08-29T13:23:07Z","abstract_excerpt":"Let $n$ be a positive integer and $f(x)$ be a polynomial with nonnegative integer coefficients. We prove that ${\\rm lcm}_{\\lceil n/2\\rceil \\le i\\le n} \\{f(i)\\}\\ge 2^n$ except that $f(x)=x$ and $n=1, 2, 3, 4, 6$ and that $f(x)=x^s$ with $s\\ge 2$ being an integer and $n=1$, where $\\lceil n/2\\rceil$ denotes the smallest integer which is not less than $n/2$. This improves and extends the lower bounds obtained by Nair in 1982, Farhi in 2007 and Oon in 2013."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.6458","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":""},"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:06:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ET3SnF8p8QxtMStqjTauS+9VdJL2JRA/2B1Bb4ZgRwwh5XBRiRICxeab9CCj9V0Ht0IU6Stt0tHvohCqEzJODg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:16:03.925824Z"},"content_sha256":"f6362591f78848a06bfade60151175628271af3e07df2f2bc861b24a68dff81d","schema_version":"1.0","event_id":"sha256:f6362591f78848a06bfade60151175628271af3e07df2f2bc861b24a68dff81d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UTKEQASG45E3QZTPR32IXBQJ7B/bundle.json","state_url":"https://pith.science/pith/UTKEQASG45E3QZTPR32IXBQJ7B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UTKEQASG45E3QZTPR32IXBQJ7B/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-20T07:16:03Z","links":{"resolver":"https://pith.science/pith/UTKEQASG45E3QZTPR32IXBQJ7B","bundle":"https://pith.science/pith/UTKEQASG45E3QZTPR32IXBQJ7B/bundle.json","state":"https://pith.science/pith/UTKEQASG45E3QZTPR32IXBQJ7B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UTKEQASG45E3QZTPR32IXBQJ7B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:UTKEQASG45E3QZTPR32IXBQJ7B","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":"33da840cea659cb06562b99aa9eb74124340fa24874a6236bfd43a13bd4ba3d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-08-29T13:23:07Z","title_canon_sha256":"e5d8b60748a6192dfcc08b824f247549ec865e6f89af1086d7a409e34851be0d"},"schema_version":"1.0","source":{"id":"1308.6458","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.6458","created_at":"2026-05-18T03:06:32Z"},{"alias_kind":"arxiv_version","alias_value":"1308.6458v2","created_at":"2026-05-18T03:06:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.6458","created_at":"2026-05-18T03:06:32Z"},{"alias_kind":"pith_short_12","alias_value":"UTKEQASG45E3","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UTKEQASG45E3QZTP","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UTKEQASG","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:f6362591f78848a06bfade60151175628271af3e07df2f2bc861b24a68dff81d","target":"graph","created_at":"2026-05-18T03:06: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 $n$ be a positive integer and $f(x)$ be a polynomial with nonnegative integer coefficients. We prove that ${\\rm lcm}_{\\lceil n/2\\rceil \\le i\\le n} \\{f(i)\\}\\ge 2^n$ except that $f(x)=x$ and $n=1, 2, 3, 4, 6$ and that $f(x)=x^s$ with $s\\ge 2$ being an integer and $n=1$, where $\\lceil n/2\\rceil$ denotes the smallest integer which is not less than $n/2$. This improves and extends the lower bounds obtained by Nair in 1982, Farhi in 2007 and Oon in 2013.","authors_text":"Chunlin Wang, Guoyou Qian, Shaofang Hong, Yuanyuan Luo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-08-29T13:23:07Z","title":"Uniform lower bound for the least common multiple of a polynomial sequence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.6458","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:0598a221d7c5732baefc278cdee0108cb8300d9b1c74258352170d95adf84b60","target":"record","created_at":"2026-05-18T03:06: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":"33da840cea659cb06562b99aa9eb74124340fa24874a6236bfd43a13bd4ba3d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-08-29T13:23:07Z","title_canon_sha256":"e5d8b60748a6192dfcc08b824f247549ec865e6f89af1086d7a409e34851be0d"},"schema_version":"1.0","source":{"id":"1308.6458","kind":"arxiv","version":2}},"canonical_sha256":"a4d4480246e749b8666f8ef48b8609f86830e3462e08e51d68c9fd054db1c1be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4d4480246e749b8666f8ef48b8609f86830e3462e08e51d68c9fd054db1c1be","first_computed_at":"2026-05-18T03:06:32.383854Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:32.383854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yQt7iIkzy/89Yglt9E4h8dvaghqwDys+s+bEKMSmmeuBKpn+CojolgNMkp4kGrBaWIzSketEocZpuKaVLrvOCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:32.384482Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.6458","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0598a221d7c5732baefc278cdee0108cb8300d9b1c74258352170d95adf84b60","sha256:f6362591f78848a06bfade60151175628271af3e07df2f2bc861b24a68dff81d"],"state_sha256":"97282d778eb2ab61d1773fb9b3fe2a5dd1a0ccf8384bb5255d0cc22e861943a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wOmPJYROttYH+Cjkk/Ypq2mzJ3yHBs04/A4/IUdFArdM4LOkpC/CDIC8rLbanCNJqFrErpIj3jmyaZwx9ANsAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T07:16:03.927764Z","bundle_sha256":"0a1180035ab3bc0bc2144e415a249aa85a135d2ce2bc9a8cade56601e140251f"}}