{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:1991:JJILCT5KSBOLHWSCY7QSGYAVHS","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":"66a783f73b971d12e3ef9bdf3ae58e82744bbef5f1138f698c91cf8f588e6322","cross_cats_sorted":[],"license":"","primary_cat":"math.DS","submitted_at":"1991-07-12T00:00:00Z","title_canon_sha256":"f64434739f67444f2220890eb726a220c3f60cba970f8946d0a721c7e22ee9e4"},"schema_version":"1.0","source":{"id":"math/9201289","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/9201289","created_at":"2026-05-18T01:22:09Z"},{"alias_kind":"arxiv_version","alias_value":"math/9201289v1","created_at":"2026-05-18T01:22:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9201289","created_at":"2026-05-18T01:22:09Z"},{"alias_kind":"pith_short_12","alias_value":"JJILCT5KSBOL","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_16","alias_value":"JJILCT5KSBOLHWSC","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_8","alias_value":"JJILCT5K","created_at":"2026-05-18T12:25:47Z"}],"graph_snapshots":[{"event_id":"sha256:12940edae75a7b63cc62d41298b9831ac8ba5736382a8a3100c36ad57e1b95dc","target":"graph","created_at":"2026-05-18T01:22:09Z","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":"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","authors_text":"Alexander M. Blokh","cross_cats":[],"headline":"","license":"","primary_cat":"math.DS","submitted_at":"1991-07-12T00:00:00Z","title":"Periods implying almost all periods, trees with snowflakes, and zero entropy maps"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9201289","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:d81510dd2b9914d56066da730d6749d86916d61e1ba79a86e892e687c6a3b84a","target":"record","created_at":"2026-05-18T01:22:09Z","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":"66a783f73b971d12e3ef9bdf3ae58e82744bbef5f1138f698c91cf8f588e6322","cross_cats_sorted":[],"license":"","primary_cat":"math.DS","submitted_at":"1991-07-12T00:00:00Z","title_canon_sha256":"f64434739f67444f2220890eb726a220c3f60cba970f8946d0a721c7e22ee9e4"},"schema_version":"1.0","source":{"id":"math/9201289","kind":"arxiv","version":1}},"canonical_sha256":"4a50b14faa905cb3da42c7e12360153c8b3c26650d4e58b7584e8128daba5ef1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a50b14faa905cb3da42c7e12360153c8b3c26650d4e58b7584e8128daba5ef1","first_computed_at":"2026-05-18T01:22:09.105326Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:09.105326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ov/dB91VFjE4faU/wGoXd2LoSQsE8CwkiSPOXXHES6TWv379r3EV4aIlA1tVURz+6gG4/2boi8lVJXiwsLidCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:09.105964Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/9201289","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d81510dd2b9914d56066da730d6749d86916d61e1ba79a86e892e687c6a3b84a","sha256:12940edae75a7b63cc62d41298b9831ac8ba5736382a8a3100c36ad57e1b95dc"],"state_sha256":"473da628555dfe836fd9b7044946fd3de5a0234c3bcdcadbf87e7c3941967fee"}