{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OEWDTDI2XHGRAZWF4RLF5T5ENR","short_pith_number":"pith:OEWDTDI2","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"},"canonical_sha256":"712c398d1ab9cd1066c5e4565ecfa46c44cc8c055ee13f7e1d837b616b83b63a","source":{"kind":"arxiv","id":"1605.04505","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04505","created_at":"2026-05-18T01:14:47Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04505v1","created_at":"2026-05-18T01:14:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04505","created_at":"2026-05-18T01:14:47Z"},{"alias_kind":"pith_short_12","alias_value":"OEWDTDI2XHGR","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OEWDTDI2XHGRAZWF","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OEWDTDI2","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OEWDTDI2XHGRAZWF4RLF5T5ENR","target":"record","payload":{"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"},"canonical_sha256":"712c398d1ab9cd1066c5e4565ecfa46c44cc8c055ee13f7e1d837b616b83b63a","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"},"source_kind":"arxiv","source_id":"1605.04505","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:14:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WKqnhKS/AFt4+toJmAcqxLzOn0QKGaJnbg8EoX9ZCnzIj7ozljomX4XWnbIclGw8IRISPQo9ebSG++bKRrFzDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:11:27.343375Z"},"content_sha256":"1783c1e77f716cdc959b2b0cc06a1072044d0ff02cb9ac094d652dbf86c4b448","schema_version":"1.0","event_id":"sha256:1783c1e77f716cdc959b2b0cc06a1072044d0ff02cb9ac094d652dbf86c4b448"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OEWDTDI2XHGRAZWF4RLF5T5ENR","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:14:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S+JhqITFIritZ45wEHiTSuJe4Y8GiL8tCu+MYdbkkpopYfAjZnqnWYC951483F5TKE70X6USpz6SLSQQvHl0DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:11:27.343725Z"},"content_sha256":"e2da070be2824fd46e09f97053628fd54e240c4eae57414b35b2b3b77226feef","schema_version":"1.0","event_id":"sha256:e2da070be2824fd46e09f97053628fd54e240c4eae57414b35b2b3b77226feef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OEWDTDI2XHGRAZWF4RLF5T5ENR/bundle.json","state_url":"https://pith.science/pith/OEWDTDI2XHGRAZWF4RLF5T5ENR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OEWDTDI2XHGRAZWF4RLF5T5ENR/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-24T19:11:27Z","links":{"resolver":"https://pith.science/pith/OEWDTDI2XHGRAZWF4RLF5T5ENR","bundle":"https://pith.science/pith/OEWDTDI2XHGRAZWF4RLF5T5ENR/bundle.json","state":"https://pith.science/pith/OEWDTDI2XHGRAZWF4RLF5T5ENR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OEWDTDI2XHGRAZWF4RLF5T5ENR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OEWDTDI2XHGRAZWF4RLF5T5ENR","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4f3b88599c2b82cc6cbc6f6ac68df99c7d7c5451a0b04c99a2599fdb2f644ef0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2016-05-15T07:41:05Z","title_canon_sha256":"66c97b959bef264e10f92d59ed27c26f22d4c4a585d436b76fa9c58384736302"},"schema_version":"1.0","source":{"id":"1605.04505","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04505","created_at":"2026-05-18T01:14:47Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04505v1","created_at":"2026-05-18T01:14:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04505","created_at":"2026-05-18T01:14:47Z"},{"alias_kind":"pith_short_12","alias_value":"OEWDTDI2XHGR","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OEWDTDI2XHGRAZWF","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OEWDTDI2","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:e2da070be2824fd46e09f97053628fd54e240c4eae57414b35b2b3b77226feef","target":"graph","created_at":"2026-05-18T01:14:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Yuke Huang, Zhiying Wen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2016-05-15T07:41:05Z","title":"The Square Trees in the Tribonacci Sequence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04505","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1783c1e77f716cdc959b2b0cc06a1072044d0ff02cb9ac094d652dbf86c4b448","target":"record","created_at":"2026-05-18T01:14:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4f3b88599c2b82cc6cbc6f6ac68df99c7d7c5451a0b04c99a2599fdb2f644ef0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2016-05-15T07:41:05Z","title_canon_sha256":"66c97b959bef264e10f92d59ed27c26f22d4c4a585d436b76fa9c58384736302"},"schema_version":"1.0","source":{"id":"1605.04505","kind":"arxiv","version":1}},"canonical_sha256":"712c398d1ab9cd1066c5e4565ecfa46c44cc8c055ee13f7e1d837b616b83b63a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"712c398d1ab9cd1066c5e4565ecfa46c44cc8c055ee13f7e1d837b616b83b63a","first_computed_at":"2026-05-18T01:14:47.010807Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:47.010807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kgdPApVb8n2YlKkvqjBRpN1pj4fGCHsbDj+qifC9ZJppe5xmJNiUzvGW7JyO51YgL2VceFADg0RGRW6VDb89DA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:47.011471Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.04505","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1783c1e77f716cdc959b2b0cc06a1072044d0ff02cb9ac094d652dbf86c4b448","sha256:e2da070be2824fd46e09f97053628fd54e240c4eae57414b35b2b3b77226feef"],"state_sha256":"76d011682e80f091a8985b629db39cf1f04bdf1de7dc69a51a01071e36b0eb3e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gNSIHuFCwfP2FnsE+rSPLjmFxrCJlhzlIAw8OtpIKJn3Ut/C2ntskpD8sFDH0zDiZcVI0bORufNRyBA7SbQdAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T19:11:27.345669Z","bundle_sha256":"d32c1e2e61775243681f5c8d11efe82d7f8e068990029bf763014e65db12eb65"}}