{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OEWDTDI2XHGRAZWF4RLF5T5ENR","short_pith_number":"pith:OEWDTDI2","schema_version":"1.0","canonical_sha256":"712c398d1ab9cd1066c5e4565ecfa46c44cc8c055ee13f7e1d837b616b83b63a","source":{"kind":"arxiv","id":"1605.04505","version":1},"attestation_state":"computed","paper":{"title":"The Square Trees in the Tribonacci 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-05-15T07:41:05Z","abstract_excerpt":"The Tribonacci sequence $\\mathbb{T}$ is the fixed point of the substitution $\\sigma(a,b,c)=(ab,ac,a)$. In this note, we get the explicit expressions of all squares, and then establish the tree structure of the positions of repeated squares in $\\mathbb{T}$, called square trees. Using the square trees, we give a fast algorithm for counting the number of repeated squares in $\\mathbb{T}[1,n]$ for all $n$, where $\\mathbb{T}[1,n]$ is the prefix of $\\mathbb{T}$ of length $n$. Moreover we get explicit expressions for some special $n$ such as $n=t_m$ (the Tribonacci number) etc."},"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":"1605.04505","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2016-05-15T07:41:05Z","cross_cats_sorted":[],"title_canon_sha256":"66c97b959bef264e10f92d59ed27c26f22d4c4a585d436b76fa9c58384736302","abstract_canon_sha256":"4f3b88599c2b82cc6cbc6f6ac68df99c7d7c5451a0b04c99a2599fdb2f644ef0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:47.011471Z","signature_b64":"kgdPApVb8n2YlKkvqjBRpN1pj4fGCHsbDj+qifC9ZJppe5xmJNiUzvGW7JyO51YgL2VceFADg0RGRW6VDb89DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"712c398d1ab9cd1066c5e4565ecfa46c44cc8c055ee13f7e1d837b616b83b63a","last_reissued_at":"2026-05-18T01:14:47.010807Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:47.010807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Square Trees in the Tribonacci 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-05-15T07:41:05Z","abstract_excerpt":"The Tribonacci sequence $\\mathbb{T}$ is the fixed point of the substitution $\\sigma(a,b,c)=(ab,ac,a)$. In this note, we get the explicit expressions of all squares, and then establish the tree structure of the positions of repeated squares in $\\mathbb{T}$, called square trees. Using the square trees, we give a fast algorithm for counting the number of repeated squares in $\\mathbb{T}[1,n]$ for all $n$, where $\\mathbb{T}[1,n]$ is the prefix of $\\mathbb{T}$ of length $n$. Moreover we get explicit expressions for some special $n$ such as $n=t_m$ (the Tribonacci number) etc."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04505","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":"1605.04505","created_at":"2026-05-18T01:14:47.010913+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.04505v1","created_at":"2026-05-18T01:14:47.010913+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04505","created_at":"2026-05-18T01:14:47.010913+00:00"},{"alias_kind":"pith_short_12","alias_value":"OEWDTDI2XHGR","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OEWDTDI2XHGRAZWF","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OEWDTDI2","created_at":"2026-05-18T12:30:36.002864+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/OEWDTDI2XHGRAZWF4RLF5T5ENR","json":"https://pith.science/pith/OEWDTDI2XHGRAZWF4RLF5T5ENR.json","graph_json":"https://pith.science/api/pith-number/OEWDTDI2XHGRAZWF4RLF5T5ENR/graph.json","events_json":"https://pith.science/api/pith-number/OEWDTDI2XHGRAZWF4RLF5T5ENR/events.json","paper":"https://pith.science/paper/OEWDTDI2"},"agent_actions":{"view_html":"https://pith.science/pith/OEWDTDI2XHGRAZWF4RLF5T5ENR","download_json":"https://pith.science/pith/OEWDTDI2XHGRAZWF4RLF5T5ENR.json","view_paper":"https://pith.science/paper/OEWDTDI2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.04505&json=true","fetch_graph":"https://pith.science/api/pith-number/OEWDTDI2XHGRAZWF4RLF5T5ENR/graph.json","fetch_events":"https://pith.science/api/pith-number/OEWDTDI2XHGRAZWF4RLF5T5ENR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OEWDTDI2XHGRAZWF4RLF5T5ENR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OEWDTDI2XHGRAZWF4RLF5T5ENR/action/storage_attestation","attest_author":"https://pith.science/pith/OEWDTDI2XHGRAZWF4RLF5T5ENR/action/author_attestation","sign_citation":"https://pith.science/pith/OEWDTDI2XHGRAZWF4RLF5T5ENR/action/citation_signature","submit_replication":"https://pith.science/pith/OEWDTDI2XHGRAZWF4RLF5T5ENR/action/replication_record"}},"created_at":"2026-05-18T01:14:47.010913+00:00","updated_at":"2026-05-18T01:14:47.010913+00:00"}