{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:JJEU5PAN5NZBHUXKNJ2DRAEDWC","short_pith_number":"pith:JJEU5PAN","schema_version":"1.0","canonical_sha256":"4a494ebc0deb7213d2ea6a74388083b0ba9ecf7b886b43f7130ee9f834afea28","source":{"kind":"arxiv","id":"1204.5415","version":2},"attestation_state":"computed","paper":{"title":"Asymptotic behavior of the least common multiple of consecutive arithmetic progression terms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Guoyou Qian, Shaofang Hong","submitted_at":"2012-04-24T15:41:02Z","abstract_excerpt":"Let $l$ and $m$ be two integers with $l>m\\ge 0$, and let $a$ and $b$ be integers with $a\\ge 1$ and $a+b\\ge 1$. In this paper, we prove that $\\log {\\rm lcm}_{mn<i\\le ln}\\{ai+b\\} =An+o(n)$, where $A$ is a constant depending on $l, m$ and $a$."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1204.5415","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-04-24T15:41:02Z","cross_cats_sorted":[],"title_canon_sha256":"24ec974a1aec66ad24042b1eee0bfd3aacbb42c0c0bef30678c70d25f3f9bc29","abstract_canon_sha256":"6ce2d00abfbdded3a5e12a92d7e86c8d537286db416a5c6dd9044b3ece2570b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:11.485783Z","signature_b64":"yGYqLKl3ArVIOr5r3jZI/U7Lf0NCFgnZvI8bfjb2UdgQh2MsxiRkLbCNDOwoIXv912R37MrEry6fq/AtyDClBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a494ebc0deb7213d2ea6a74388083b0ba9ecf7b886b43f7130ee9f834afea28","last_reissued_at":"2026-05-18T03:27:11.485248Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:11.485248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotic behavior of the least common multiple of consecutive arithmetic progression terms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Guoyou Qian, Shaofang Hong","submitted_at":"2012-04-24T15:41:02Z","abstract_excerpt":"Let $l$ and $m$ be two integers with $l>m\\ge 0$, and let $a$ and $b$ be integers with $a\\ge 1$ and $a+b\\ge 1$. In this paper, we prove that $\\log {\\rm lcm}_{mn<i\\le ln}\\{ai+b\\} =An+o(n)$, where $A$ is a constant depending on $l, m$ and $a$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5415","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1204.5415","created_at":"2026-05-18T03:27:11.485327+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.5415v2","created_at":"2026-05-18T03:27:11.485327+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5415","created_at":"2026-05-18T03:27:11.485327+00:00"},{"alias_kind":"pith_short_12","alias_value":"JJEU5PAN5NZB","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"JJEU5PAN5NZBHUXK","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"JJEU5PAN","created_at":"2026-05-18T12:27:11.947152+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JJEU5PAN5NZBHUXKNJ2DRAEDWC","json":"https://pith.science/pith/JJEU5PAN5NZBHUXKNJ2DRAEDWC.json","graph_json":"https://pith.science/api/pith-number/JJEU5PAN5NZBHUXKNJ2DRAEDWC/graph.json","events_json":"https://pith.science/api/pith-number/JJEU5PAN5NZBHUXKNJ2DRAEDWC/events.json","paper":"https://pith.science/paper/JJEU5PAN"},"agent_actions":{"view_html":"https://pith.science/pith/JJEU5PAN5NZBHUXKNJ2DRAEDWC","download_json":"https://pith.science/pith/JJEU5PAN5NZBHUXKNJ2DRAEDWC.json","view_paper":"https://pith.science/paper/JJEU5PAN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.5415&json=true","fetch_graph":"https://pith.science/api/pith-number/JJEU5PAN5NZBHUXKNJ2DRAEDWC/graph.json","fetch_events":"https://pith.science/api/pith-number/JJEU5PAN5NZBHUXKNJ2DRAEDWC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JJEU5PAN5NZBHUXKNJ2DRAEDWC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JJEU5PAN5NZBHUXKNJ2DRAEDWC/action/storage_attestation","attest_author":"https://pith.science/pith/JJEU5PAN5NZBHUXKNJ2DRAEDWC/action/author_attestation","sign_citation":"https://pith.science/pith/JJEU5PAN5NZBHUXKNJ2DRAEDWC/action/citation_signature","submit_replication":"https://pith.science/pith/JJEU5PAN5NZBHUXKNJ2DRAEDWC/action/replication_record"}},"created_at":"2026-05-18T03:27:11.485327+00:00","updated_at":"2026-05-18T03:27:11.485327+00:00"}