{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:HACBHJSFS5IDO2PA2L5U3RFQLB","short_pith_number":"pith:HACBHJSF","schema_version":"1.0","canonical_sha256":"380413a64597503769e0d2fb4dc4b0586ae7b8260332139d24cc4fef85b5cd35","source":{"kind":"arxiv","id":"1112.3013","version":2},"attestation_state":"computed","paper":{"title":"The least common multiple of random sets of positive integers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Ana Zumalac\\'arregui, Javier Cilleruelo, Juanjo Ru\\'e, Paulius \\v{S}arka","submitted_at":"2011-12-13T20:12:18Z","abstract_excerpt":"We study the typical behavior of the least common multiple of the elements of a random subset $A\\subset \\{1,\\dots, n\\}$. For example we prove that $\\text{lcm}\\{a:\\ a\\in A\\}=2^{n(1+o(1))}$ for almost all subsets $A\\subset\\{1,\\dots,n\\}$."},"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":"1112.3013","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-12-13T20:12:18Z","cross_cats_sorted":[],"title_canon_sha256":"354e974c2173955c6ec7a0645f3776510645f2ff8bc5ea120a41688459d1cc25","abstract_canon_sha256":"3aae60c88ba4bf1de24bf5584412f7d86379c013f61c19f64e4630bf9701e5ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:50.158409Z","signature_b64":"St7aOUmXfdgSF/tK9CR+Ov/sTrFqWnh1jD4/+b79K8jv3uNWu8IfdpFOryS5RTwofM0jzkbNX86AcLBMiT7iCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"380413a64597503769e0d2fb4dc4b0586ae7b8260332139d24cc4fef85b5cd35","last_reissued_at":"2026-05-18T03:04:50.157696Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:50.157696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The least common multiple of random sets of positive integers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Ana Zumalac\\'arregui, Javier Cilleruelo, Juanjo Ru\\'e, Paulius \\v{S}arka","submitted_at":"2011-12-13T20:12:18Z","abstract_excerpt":"We study the typical behavior of the least common multiple of the elements of a random subset $A\\subset \\{1,\\dots, n\\}$. For example we prove that $\\text{lcm}\\{a:\\ a\\in A\\}=2^{n(1+o(1))}$ for almost all subsets $A\\subset\\{1,\\dots,n\\}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.3013","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":"1112.3013","created_at":"2026-05-18T03:04:50.157813+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.3013v2","created_at":"2026-05-18T03:04:50.157813+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.3013","created_at":"2026-05-18T03:04:50.157813+00:00"},{"alias_kind":"pith_short_12","alias_value":"HACBHJSFS5ID","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"HACBHJSFS5IDO2PA","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"HACBHJSF","created_at":"2026-05-18T12:26:30.835961+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/HACBHJSFS5IDO2PA2L5U3RFQLB","json":"https://pith.science/pith/HACBHJSFS5IDO2PA2L5U3RFQLB.json","graph_json":"https://pith.science/api/pith-number/HACBHJSFS5IDO2PA2L5U3RFQLB/graph.json","events_json":"https://pith.science/api/pith-number/HACBHJSFS5IDO2PA2L5U3RFQLB/events.json","paper":"https://pith.science/paper/HACBHJSF"},"agent_actions":{"view_html":"https://pith.science/pith/HACBHJSFS5IDO2PA2L5U3RFQLB","download_json":"https://pith.science/pith/HACBHJSFS5IDO2PA2L5U3RFQLB.json","view_paper":"https://pith.science/paper/HACBHJSF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.3013&json=true","fetch_graph":"https://pith.science/api/pith-number/HACBHJSFS5IDO2PA2L5U3RFQLB/graph.json","fetch_events":"https://pith.science/api/pith-number/HACBHJSFS5IDO2PA2L5U3RFQLB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HACBHJSFS5IDO2PA2L5U3RFQLB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HACBHJSFS5IDO2PA2L5U3RFQLB/action/storage_attestation","attest_author":"https://pith.science/pith/HACBHJSFS5IDO2PA2L5U3RFQLB/action/author_attestation","sign_citation":"https://pith.science/pith/HACBHJSFS5IDO2PA2L5U3RFQLB/action/citation_signature","submit_replication":"https://pith.science/pith/HACBHJSFS5IDO2PA2L5U3RFQLB/action/replication_record"}},"created_at":"2026-05-18T03:04:50.157813+00:00","updated_at":"2026-05-18T03:04:50.157813+00:00"}