{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RFBEKMWJ2UWPXOFYGMSFBM3K3N","short_pith_number":"pith:RFBEKMWJ","schema_version":"1.0","canonical_sha256":"89424532c9d52cfbb8b8332450b36adb43a513fa542a247ee710a523049f77fd","source":{"kind":"arxiv","id":"1901.01063","version":1},"attestation_state":"computed","paper":{"title":"On members of Lucas sequences which are products of factorials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Florian Luca, Mark Sias, Shanta Laishram","submitted_at":"2019-01-04T11:45:46Z","abstract_excerpt":"Here, we show that if $\\{U_n\\}_{n\\ge 0}$ is a Lucas sequence, then the largest $n$ such that $|U_n|=m_1!m_2!\\cdots m_k!$ with $1<m_1\\le m_2\\le \\cdots\\le m_k$ satisfies $n<3\\times 10^5$. We also give better bounds in case the roots of the Lucas sequence are real."},"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":"1901.01063","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-01-04T11:45:46Z","cross_cats_sorted":[],"title_canon_sha256":"3a21d8dfbc5c59cc3ff284cf51dc4f9a4478a0608825b9715e7d3343e17442e8","abstract_canon_sha256":"8c2e466b72beecb013655538c5213dbec89d8b36d59f39d0a496ceb9d47c2f8a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:57.233560Z","signature_b64":"CeJVLnPmVAWvtPwvBTCxq8yrO9qJNh8N6EvwGsHhtPjXFQ0EHfGwpRWftsHwqfXz689NjJ9FWVvvWgn8oO/ECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89424532c9d52cfbb8b8332450b36adb43a513fa542a247ee710a523049f77fd","last_reissued_at":"2026-05-17T23:56:57.232918Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:57.232918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On members of Lucas sequences which are products of factorials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Florian Luca, Mark Sias, Shanta Laishram","submitted_at":"2019-01-04T11:45:46Z","abstract_excerpt":"Here, we show that if $\\{U_n\\}_{n\\ge 0}$ is a Lucas sequence, then the largest $n$ such that $|U_n|=m_1!m_2!\\cdots m_k!$ with $1<m_1\\le m_2\\le \\cdots\\le m_k$ satisfies $n<3\\times 10^5$. We also give better bounds in case the roots of the Lucas sequence are real."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.01063","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1901.01063","created_at":"2026-05-17T23:56:57.233010+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.01063v1","created_at":"2026-05-17T23:56:57.233010+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.01063","created_at":"2026-05-17T23:56:57.233010+00:00"},{"alias_kind":"pith_short_12","alias_value":"RFBEKMWJ2UWP","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"RFBEKMWJ2UWPXOFY","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"RFBEKMWJ","created_at":"2026-05-18T12:33:27.125529+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/RFBEKMWJ2UWPXOFYGMSFBM3K3N","json":"https://pith.science/pith/RFBEKMWJ2UWPXOFYGMSFBM3K3N.json","graph_json":"https://pith.science/api/pith-number/RFBEKMWJ2UWPXOFYGMSFBM3K3N/graph.json","events_json":"https://pith.science/api/pith-number/RFBEKMWJ2UWPXOFYGMSFBM3K3N/events.json","paper":"https://pith.science/paper/RFBEKMWJ"},"agent_actions":{"view_html":"https://pith.science/pith/RFBEKMWJ2UWPXOFYGMSFBM3K3N","download_json":"https://pith.science/pith/RFBEKMWJ2UWPXOFYGMSFBM3K3N.json","view_paper":"https://pith.science/paper/RFBEKMWJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.01063&json=true","fetch_graph":"https://pith.science/api/pith-number/RFBEKMWJ2UWPXOFYGMSFBM3K3N/graph.json","fetch_events":"https://pith.science/api/pith-number/RFBEKMWJ2UWPXOFYGMSFBM3K3N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RFBEKMWJ2UWPXOFYGMSFBM3K3N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RFBEKMWJ2UWPXOFYGMSFBM3K3N/action/storage_attestation","attest_author":"https://pith.science/pith/RFBEKMWJ2UWPXOFYGMSFBM3K3N/action/author_attestation","sign_citation":"https://pith.science/pith/RFBEKMWJ2UWPXOFYGMSFBM3K3N/action/citation_signature","submit_replication":"https://pith.science/pith/RFBEKMWJ2UWPXOFYGMSFBM3K3N/action/replication_record"}},"created_at":"2026-05-17T23:56:57.233010+00:00","updated_at":"2026-05-17T23:56:57.233010+00:00"}