{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:45LLBUF63EM5K4L527XXGFQ5IJ","short_pith_number":"pith:45LLBUF6","schema_version":"1.0","canonical_sha256":"e756b0d0bed919d5717dd7ef73161d424328d55e4e0e1f8a765ed6ff1733a3fc","source":{"kind":"arxiv","id":"1603.07863","version":2},"attestation_state":"computed","paper":{"title":"On the Lucas Property of Linear Recurrent Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Hao Zhong, Tianxin Cai","submitted_at":"2016-03-25T09:59:57Z","abstract_excerpt":"We say that an arithmetical function $S:\\mathbb{N}\\rightarrow\\mathbb{Z}$ has Lucas property if for any prime $p$, \\begin{equation*}\n  S(n)\\equiv S(n_{0})S(n_{1})\\ldots S(n_{r})\\pmod p, \\end{equation*} where $n=\\sum_{i=0}^{r}n_{i}p^{i}$, with $0 \\leq n_{i} \\leq p-1,n,n_{i}\\in\\mathbb{N}$.\n  In this note, we discuss the Lucas property of Fibonacci sequences and Lucas numbers. Meanwhile, we find some other interesting results."},"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":"1603.07863","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-03-25T09:59:57Z","cross_cats_sorted":[],"title_canon_sha256":"d202ff47b0c605e7f395669ad1f4a3cdc8660b35463f98e6d68fe0e3a3ead22a","abstract_canon_sha256":"748d86147f10445175380a699abfd3a1cafe4308b04c75ed9ef19e53090bfcc9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:15.732310Z","signature_b64":"pGriYeT+kUJDV761NFm3Ce4zQXH+HzIF4mes8w9sr50O8MclHpO6EIUVHuG+WG8Kb+aHI1yncSw3oAXi1Y3pDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e756b0d0bed919d5717dd7ef73161d424328d55e4e0e1f8a765ed6ff1733a3fc","last_reissued_at":"2026-05-18T00:54:15.731810Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:15.731810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Lucas Property of Linear Recurrent Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Hao Zhong, Tianxin Cai","submitted_at":"2016-03-25T09:59:57Z","abstract_excerpt":"We say that an arithmetical function $S:\\mathbb{N}\\rightarrow\\mathbb{Z}$ has Lucas property if for any prime $p$, \\begin{equation*}\n  S(n)\\equiv S(n_{0})S(n_{1})\\ldots S(n_{r})\\pmod p, \\end{equation*} where $n=\\sum_{i=0}^{r}n_{i}p^{i}$, with $0 \\leq n_{i} \\leq p-1,n,n_{i}\\in\\mathbb{N}$.\n  In this note, we discuss the Lucas property of Fibonacci sequences and Lucas numbers. Meanwhile, we find some other interesting results."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07863","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":"1603.07863","created_at":"2026-05-18T00:54:15.731891+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.07863v2","created_at":"2026-05-18T00:54:15.731891+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07863","created_at":"2026-05-18T00:54:15.731891+00:00"},{"alias_kind":"pith_short_12","alias_value":"45LLBUF63EM5","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"45LLBUF63EM5K4L5","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"45LLBUF6","created_at":"2026-05-18T12:29:58.707656+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/45LLBUF63EM5K4L527XXGFQ5IJ","json":"https://pith.science/pith/45LLBUF63EM5K4L527XXGFQ5IJ.json","graph_json":"https://pith.science/api/pith-number/45LLBUF63EM5K4L527XXGFQ5IJ/graph.json","events_json":"https://pith.science/api/pith-number/45LLBUF63EM5K4L527XXGFQ5IJ/events.json","paper":"https://pith.science/paper/45LLBUF6"},"agent_actions":{"view_html":"https://pith.science/pith/45LLBUF63EM5K4L527XXGFQ5IJ","download_json":"https://pith.science/pith/45LLBUF63EM5K4L527XXGFQ5IJ.json","view_paper":"https://pith.science/paper/45LLBUF6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.07863&json=true","fetch_graph":"https://pith.science/api/pith-number/45LLBUF63EM5K4L527XXGFQ5IJ/graph.json","fetch_events":"https://pith.science/api/pith-number/45LLBUF63EM5K4L527XXGFQ5IJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/45LLBUF63EM5K4L527XXGFQ5IJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/45LLBUF63EM5K4L527XXGFQ5IJ/action/storage_attestation","attest_author":"https://pith.science/pith/45LLBUF63EM5K4L527XXGFQ5IJ/action/author_attestation","sign_citation":"https://pith.science/pith/45LLBUF63EM5K4L527XXGFQ5IJ/action/citation_signature","submit_replication":"https://pith.science/pith/45LLBUF63EM5K4L527XXGFQ5IJ/action/replication_record"}},"created_at":"2026-05-18T00:54:15.731891+00:00","updated_at":"2026-05-18T00:54:15.731891+00:00"}