{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:U3ODH7NI4UWKTHU6QU2TCG5KS3","short_pith_number":"pith:U3ODH7NI","schema_version":"1.0","canonical_sha256":"a6dc33fda8e52ca99e9e8535311baa96f5f62b02194ea3b74521a4cb89f83b04","source":{"kind":"arxiv","id":"1712.00104","version":2},"attestation_state":"computed","paper":{"title":"Topological entropy, sets of periods and transitivity for graph maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Jorge Groisman, Liane Bordignon, Llu\\'is Alsed\\`a","submitted_at":"2017-11-30T22:25:34Z","abstract_excerpt":"Transitivity, the existence of periodic points and positive topological entropy can be used to characterize complexity in dynamical systems. It is known that for graphs that are not trees, for every $\\varepsilon>0,$ there exist (complicate) totally transitive maps (then with cofinite set of periods) such that the topological entropy is smaller than $\\varepsilon$ (simplicity). First we will show by means of three examples that for any graph that is not a tree the relatively simple maps (with small entropy) which are totally transitive (and hence robustly complicate) can be constructed so that t"},"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":"1712.00104","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2017-11-30T22:25:34Z","cross_cats_sorted":[],"title_canon_sha256":"fca7062614027af16b5843dae9d4116db6d75ea765ba0a0ae9c03b953fce823c","abstract_canon_sha256":"f0980b8296e1181d69981e4db38477438b05fdaa4a45fcc3af356825264f0130"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:32.364159Z","signature_b64":"2NAj9H9h8uJTV/LINvyQtxoTqYIDGGzIFGCmwnLNk2xTmyHeSwjDeZorKoxDZwiPqcefEpFatx+ynl/hfs9iDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6dc33fda8e52ca99e9e8535311baa96f5f62b02194ea3b74521a4cb89f83b04","last_reissued_at":"2026-05-18T00:11:32.363600Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:32.363600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Topological entropy, sets of periods and transitivity for graph maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Jorge Groisman, Liane Bordignon, Llu\\'is Alsed\\`a","submitted_at":"2017-11-30T22:25:34Z","abstract_excerpt":"Transitivity, the existence of periodic points and positive topological entropy can be used to characterize complexity in dynamical systems. It is known that for graphs that are not trees, for every $\\varepsilon>0,$ there exist (complicate) totally transitive maps (then with cofinite set of periods) such that the topological entropy is smaller than $\\varepsilon$ (simplicity). First we will show by means of three examples that for any graph that is not a tree the relatively simple maps (with small entropy) which are totally transitive (and hence robustly complicate) can be constructed so that t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00104","kind":"arxiv","version":2},"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":"1712.00104","created_at":"2026-05-18T00:11:32.363693+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.00104v2","created_at":"2026-05-18T00:11:32.363693+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00104","created_at":"2026-05-18T00:11:32.363693+00:00"},{"alias_kind":"pith_short_12","alias_value":"U3ODH7NI4UWK","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"U3ODH7NI4UWKTHU6","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"U3ODH7NI","created_at":"2026-05-18T12:31:46.661854+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/U3ODH7NI4UWKTHU6QU2TCG5KS3","json":"https://pith.science/pith/U3ODH7NI4UWKTHU6QU2TCG5KS3.json","graph_json":"https://pith.science/api/pith-number/U3ODH7NI4UWKTHU6QU2TCG5KS3/graph.json","events_json":"https://pith.science/api/pith-number/U3ODH7NI4UWKTHU6QU2TCG5KS3/events.json","paper":"https://pith.science/paper/U3ODH7NI"},"agent_actions":{"view_html":"https://pith.science/pith/U3ODH7NI4UWKTHU6QU2TCG5KS3","download_json":"https://pith.science/pith/U3ODH7NI4UWKTHU6QU2TCG5KS3.json","view_paper":"https://pith.science/paper/U3ODH7NI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.00104&json=true","fetch_graph":"https://pith.science/api/pith-number/U3ODH7NI4UWKTHU6QU2TCG5KS3/graph.json","fetch_events":"https://pith.science/api/pith-number/U3ODH7NI4UWKTHU6QU2TCG5KS3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U3ODH7NI4UWKTHU6QU2TCG5KS3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U3ODH7NI4UWKTHU6QU2TCG5KS3/action/storage_attestation","attest_author":"https://pith.science/pith/U3ODH7NI4UWKTHU6QU2TCG5KS3/action/author_attestation","sign_citation":"https://pith.science/pith/U3ODH7NI4UWKTHU6QU2TCG5KS3/action/citation_signature","submit_replication":"https://pith.science/pith/U3ODH7NI4UWKTHU6QU2TCG5KS3/action/replication_record"}},"created_at":"2026-05-18T00:11:32.363693+00:00","updated_at":"2026-05-18T00:11:32.363693+00:00"}