{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1991:JJILCT5KSBOLHWSCY7QSGYAVHS","short_pith_number":"pith:JJILCT5K","schema_version":"1.0","canonical_sha256":"4a50b14faa905cb3da42c7e12360153c8b3c26650d4e58b7584e8128daba5ef1","source":{"kind":"arxiv","id":"math/9201289","version":1},"attestation_state":"computed","paper":{"title":"Periods implying almost all periods, trees with snowflakes, and zero entropy maps","license":"","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Alexander M. Blokh","submitted_at":"1991-07-12T00:00:00Z","abstract_excerpt":"Let $X$ be a compact tree, $f$ be a continuous map from $X$ to itself, $End(X)$ be the number of endpoints and $Edg(X)$ be the number of edges of $X$. We show that if $n>1$ has no prime divisors less than $End(X)+1$ and $f$ has a cycle of period $n$, then $f$ has cycles of all periods greater than $2End(X)(n-1)$ and topological entropy $h(f)>0$; so if $p$ is the least prime number greater than $End(X)$ and $f$ has cycles of all periods from 1 to $2End(X)(p-1)$, then $f$ has cycles of all periods (this verifies a conjecture of Misiurewicz for tree maps). Together with the spectral decomposition"},"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":"math/9201289","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.DS","submitted_at":"1991-07-12T00:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"f64434739f67444f2220890eb726a220c3f60cba970f8946d0a721c7e22ee9e4","abstract_canon_sha256":"66a783f73b971d12e3ef9bdf3ae58e82744bbef5f1138f698c91cf8f588e6322"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:09.105964Z","signature_b64":"Ov/dB91VFjE4faU/wGoXd2LoSQsE8CwkiSPOXXHES6TWv379r3EV4aIlA1tVURz+6gG4/2boi8lVJXiwsLidCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a50b14faa905cb3da42c7e12360153c8b3c26650d4e58b7584e8128daba5ef1","last_reissued_at":"2026-05-18T01:22:09.105326Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:09.105326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Periods implying almost all periods, trees with snowflakes, and zero entropy maps","license":"","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Alexander M. Blokh","submitted_at":"1991-07-12T00:00:00Z","abstract_excerpt":"Let $X$ be a compact tree, $f$ be a continuous map from $X$ to itself, $End(X)$ be the number of endpoints and $Edg(X)$ be the number of edges of $X$. We show that if $n>1$ has no prime divisors less than $End(X)+1$ and $f$ has a cycle of period $n$, then $f$ has cycles of all periods greater than $2End(X)(n-1)$ and topological entropy $h(f)>0$; so if $p$ is the least prime number greater than $End(X)$ and $f$ has cycles of all periods from 1 to $2End(X)(p-1)$, then $f$ has cycles of all periods (this verifies a conjecture of Misiurewicz for tree maps). Together with the spectral decomposition"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9201289","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":"math/9201289","created_at":"2026-05-18T01:22:09.105410+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/9201289v1","created_at":"2026-05-18T01:22:09.105410+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9201289","created_at":"2026-05-18T01:22:09.105410+00:00"},{"alias_kind":"pith_short_12","alias_value":"JJILCT5KSBOL","created_at":"2026-05-18T12:25:47.102015+00:00"},{"alias_kind":"pith_short_16","alias_value":"JJILCT5KSBOLHWSC","created_at":"2026-05-18T12:25:47.102015+00:00"},{"alias_kind":"pith_short_8","alias_value":"JJILCT5K","created_at":"2026-05-18T12:25:47.102015+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/JJILCT5KSBOLHWSCY7QSGYAVHS","json":"https://pith.science/pith/JJILCT5KSBOLHWSCY7QSGYAVHS.json","graph_json":"https://pith.science/api/pith-number/JJILCT5KSBOLHWSCY7QSGYAVHS/graph.json","events_json":"https://pith.science/api/pith-number/JJILCT5KSBOLHWSCY7QSGYAVHS/events.json","paper":"https://pith.science/paper/JJILCT5K"},"agent_actions":{"view_html":"https://pith.science/pith/JJILCT5KSBOLHWSCY7QSGYAVHS","download_json":"https://pith.science/pith/JJILCT5KSBOLHWSCY7QSGYAVHS.json","view_paper":"https://pith.science/paper/JJILCT5K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/9201289&json=true","fetch_graph":"https://pith.science/api/pith-number/JJILCT5KSBOLHWSCY7QSGYAVHS/graph.json","fetch_events":"https://pith.science/api/pith-number/JJILCT5KSBOLHWSCY7QSGYAVHS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JJILCT5KSBOLHWSCY7QSGYAVHS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JJILCT5KSBOLHWSCY7QSGYAVHS/action/storage_attestation","attest_author":"https://pith.science/pith/JJILCT5KSBOLHWSCY7QSGYAVHS/action/author_attestation","sign_citation":"https://pith.science/pith/JJILCT5KSBOLHWSCY7QSGYAVHS/action/citation_signature","submit_replication":"https://pith.science/pith/JJILCT5KSBOLHWSCY7QSGYAVHS/action/replication_record"}},"created_at":"2026-05-18T01:22:09.105410+00:00","updated_at":"2026-05-18T01:22:09.105410+00:00"}