{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:U3ODH7NI4UWKTHU6QU2TCG5KS3","short_pith_number":"pith:U3ODH7NI","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"},"canonical_sha256":"a6dc33fda8e52ca99e9e8535311baa96f5f62b02194ea3b74521a4cb89f83b04","source":{"kind":"arxiv","id":"1712.00104","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00104","created_at":"2026-05-18T00:11:32Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00104v2","created_at":"2026-05-18T00:11:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00104","created_at":"2026-05-18T00:11:32Z"},{"alias_kind":"pith_short_12","alias_value":"U3ODH7NI4UWK","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"U3ODH7NI4UWKTHU6","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"U3ODH7NI","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:U3ODH7NI4UWKTHU6QU2TCG5KS3","target":"record","payload":{"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"},"canonical_sha256":"a6dc33fda8e52ca99e9e8535311baa96f5f62b02194ea3b74521a4cb89f83b04","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"},"source_kind":"arxiv","source_id":"1712.00104","source_version":2,"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-18T00:11:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pgZ8442a1dHDZnR2GWwt2Ozql18yVkgQtcWfIM4UmRxCft1HPc0Ks3uaQdKhD50Mq5Z1AWxA6p/KULTMKbGODg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T22:07:24.423923Z"},"content_sha256":"c74293d20f2645cef6f932745e05dd36f726e442d02525aad722ea4174f8dc48","schema_version":"1.0","event_id":"sha256:c74293d20f2645cef6f932745e05dd36f726e442d02525aad722ea4174f8dc48"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:U3ODH7NI4UWKTHU6QU2TCG5KS3","target":"graph","payload":{"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"},"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-18T00:11:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ALgt4feUDHJQtKCSYXb6oIjFdD0gEPFSZbxgexeIo/8M/fGDtvDQue1aBCCJSZ7BMAYogQ+vtbC+vYpLW8I6Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T22:07:24.424263Z"},"content_sha256":"ec4051ac76959435c4564ddecc797977da0117b7a6eae101be14c28f7c365e82","schema_version":"1.0","event_id":"sha256:ec4051ac76959435c4564ddecc797977da0117b7a6eae101be14c28f7c365e82"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U3ODH7NI4UWKTHU6QU2TCG5KS3/bundle.json","state_url":"https://pith.science/pith/U3ODH7NI4UWKTHU6QU2TCG5KS3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U3ODH7NI4UWKTHU6QU2TCG5KS3/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-23T22:07:24Z","links":{"resolver":"https://pith.science/pith/U3ODH7NI4UWKTHU6QU2TCG5KS3","bundle":"https://pith.science/pith/U3ODH7NI4UWKTHU6QU2TCG5KS3/bundle.json","state":"https://pith.science/pith/U3ODH7NI4UWKTHU6QU2TCG5KS3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U3ODH7NI4UWKTHU6QU2TCG5KS3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:U3ODH7NI4UWKTHU6QU2TCG5KS3","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":"f0980b8296e1181d69981e4db38477438b05fdaa4a45fcc3af356825264f0130","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2017-11-30T22:25:34Z","title_canon_sha256":"fca7062614027af16b5843dae9d4116db6d75ea765ba0a0ae9c03b953fce823c"},"schema_version":"1.0","source":{"id":"1712.00104","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00104","created_at":"2026-05-18T00:11:32Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00104v2","created_at":"2026-05-18T00:11:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00104","created_at":"2026-05-18T00:11:32Z"},{"alias_kind":"pith_short_12","alias_value":"U3ODH7NI4UWK","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"U3ODH7NI4UWKTHU6","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"U3ODH7NI","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:ec4051ac76959435c4564ddecc797977da0117b7a6eae101be14c28f7c365e82","target":"graph","created_at":"2026-05-18T00:11:32Z","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":"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","authors_text":"Jorge Groisman, Liane Bordignon, Llu\\'is Alsed\\`a","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2017-11-30T22:25:34Z","title":"Topological entropy, sets of periods and transitivity for graph maps"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00104","kind":"arxiv","version":2},"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:c74293d20f2645cef6f932745e05dd36f726e442d02525aad722ea4174f8dc48","target":"record","created_at":"2026-05-18T00:11:32Z","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":"f0980b8296e1181d69981e4db38477438b05fdaa4a45fcc3af356825264f0130","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2017-11-30T22:25:34Z","title_canon_sha256":"fca7062614027af16b5843dae9d4116db6d75ea765ba0a0ae9c03b953fce823c"},"schema_version":"1.0","source":{"id":"1712.00104","kind":"arxiv","version":2}},"canonical_sha256":"a6dc33fda8e52ca99e9e8535311baa96f5f62b02194ea3b74521a4cb89f83b04","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6dc33fda8e52ca99e9e8535311baa96f5f62b02194ea3b74521a4cb89f83b04","first_computed_at":"2026-05-18T00:11:32.363600Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:32.363600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2NAj9H9h8uJTV/LINvyQtxoTqYIDGGzIFGCmwnLNk2xTmyHeSwjDeZorKoxDZwiPqcefEpFatx+ynl/hfs9iDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:32.364159Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.00104","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c74293d20f2645cef6f932745e05dd36f726e442d02525aad722ea4174f8dc48","sha256:ec4051ac76959435c4564ddecc797977da0117b7a6eae101be14c28f7c365e82"],"state_sha256":"1fe00d326a4cf311a3be112b7909e7bc35951edec6f06ad16bcde6f04a1977ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VCTJ48ScxELijZ1X1JAbwq7cNew+BWOVYvxvDOIRa/0hSqjC+/y/oH6kRFCkT6skjnmFn1UitcdxAzEBEDI2Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T22:07:24.426283Z","bundle_sha256":"86a856aa87c40f27923206095d9902a35bd7e562994fd236014b28ccb8cc998d"}}