{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VLBRNNPW3WNKFI4ZO63FZHRRMJ","short_pith_number":"pith:VLBRNNPW","schema_version":"1.0","canonical_sha256":"aac316b5f6dd9aa2a39977b65c9e3162657d21332165c55e7e06e2e3020746a2","source":{"kind":"arxiv","id":"1603.04211","version":1},"attestation_state":"computed","paper":{"title":"The number of distinct and repeated squares and cubes in the Fibonacci sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Yuke Huang, Zhiying Wen","submitted_at":"2016-03-14T11:23:59Z","abstract_excerpt":"The Fibonacci sequence $\\mathbb{F}$ is the fixed point beginning with $a$ of morphism $\\sigma(a,b)=(ab,a)$. In this paper, we get the explicit expressions of all squares and cubes, then we determine the number of distinct squares and cubes in $\\mathbb{F}[1,n]$ for all $n$, where $\\mathbb{F}[1,n]$ is the prefix of $\\mathbb{F}$ of length $n$. By establishing and discussing the recursive structure of squares and cubes, we give algorithms for counting the number of repeated squares and cubes in $\\mathbb{F}[1,n]$ for all $n$, and get explicit expressions for some special $n$ such as $n=f_m$ (the Fi"},"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.04211","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2016-03-14T11:23:59Z","cross_cats_sorted":[],"title_canon_sha256":"862174cb468faebf2528ac61c1085d134c5dfe64b0219c59c4ee9e23b649784e","abstract_canon_sha256":"454035885aa2ed9395072ad969e29bdba1d1fad3199c540ebad355fdb3feda1f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:09.092179Z","signature_b64":"kFLDm+vR2YVT28hiBkDUt9pRXqJReEbsXuppfLAK3rib7A70t/mnZvuqnsb9SVaNjToG/l2NU3IAzTz5oN2sBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aac316b5f6dd9aa2a39977b65c9e3162657d21332165c55e7e06e2e3020746a2","last_reissued_at":"2026-05-18T01:19:09.091623Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:09.091623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The number of distinct and repeated squares and cubes in the Fibonacci sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Yuke Huang, Zhiying Wen","submitted_at":"2016-03-14T11:23:59Z","abstract_excerpt":"The Fibonacci sequence $\\mathbb{F}$ is the fixed point beginning with $a$ of morphism $\\sigma(a,b)=(ab,a)$. In this paper, we get the explicit expressions of all squares and cubes, then we determine the number of distinct squares and cubes in $\\mathbb{F}[1,n]$ for all $n$, where $\\mathbb{F}[1,n]$ is the prefix of $\\mathbb{F}$ of length $n$. By establishing and discussing the recursive structure of squares and cubes, we give algorithms for counting the number of repeated squares and cubes in $\\mathbb{F}[1,n]$ for all $n$, and get explicit expressions for some special $n$ such as $n=f_m$ (the Fi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04211","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":"1603.04211","created_at":"2026-05-18T01:19:09.091721+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.04211v1","created_at":"2026-05-18T01:19:09.091721+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04211","created_at":"2026-05-18T01:19:09.091721+00:00"},{"alias_kind":"pith_short_12","alias_value":"VLBRNNPW3WNK","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VLBRNNPW3WNKFI4Z","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VLBRNNPW","created_at":"2026-05-18T12:30:48.956258+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/VLBRNNPW3WNKFI4ZO63FZHRRMJ","json":"https://pith.science/pith/VLBRNNPW3WNKFI4ZO63FZHRRMJ.json","graph_json":"https://pith.science/api/pith-number/VLBRNNPW3WNKFI4ZO63FZHRRMJ/graph.json","events_json":"https://pith.science/api/pith-number/VLBRNNPW3WNKFI4ZO63FZHRRMJ/events.json","paper":"https://pith.science/paper/VLBRNNPW"},"agent_actions":{"view_html":"https://pith.science/pith/VLBRNNPW3WNKFI4ZO63FZHRRMJ","download_json":"https://pith.science/pith/VLBRNNPW3WNKFI4ZO63FZHRRMJ.json","view_paper":"https://pith.science/paper/VLBRNNPW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.04211&json=true","fetch_graph":"https://pith.science/api/pith-number/VLBRNNPW3WNKFI4ZO63FZHRRMJ/graph.json","fetch_events":"https://pith.science/api/pith-number/VLBRNNPW3WNKFI4ZO63FZHRRMJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VLBRNNPW3WNKFI4ZO63FZHRRMJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VLBRNNPW3WNKFI4ZO63FZHRRMJ/action/storage_attestation","attest_author":"https://pith.science/pith/VLBRNNPW3WNKFI4ZO63FZHRRMJ/action/author_attestation","sign_citation":"https://pith.science/pith/VLBRNNPW3WNKFI4ZO63FZHRRMJ/action/citation_signature","submit_replication":"https://pith.science/pith/VLBRNNPW3WNKFI4ZO63FZHRRMJ/action/replication_record"}},"created_at":"2026-05-18T01:19:09.091721+00:00","updated_at":"2026-05-18T01:19:09.091721+00:00"}