{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:R3KMGDP4YRFC653T6MCH4G65C4","short_pith_number":"pith:R3KMGDP4","schema_version":"1.0","canonical_sha256":"8ed4c30dfcc44a2f7773f3047e1bdd171179dbbd09e74fc7c938ebaefc1161bf","source":{"kind":"arxiv","id":"1003.5321","version":3},"attestation_state":"computed","paper":{"title":"Dynamics of tuples of matrices in Jordan form","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"math.FA","authors_text":"George Costakis, Ioannis Parissis","submitted_at":"2010-03-27T21:06:25Z","abstract_excerpt":"A tuple (T_1,...,T_k) of (n x n) matrices over R is called hypercyclic if for some x in R^n the set {T^{m_1} T^{m_2}...T^{m_k} x : m_1,m_2,...,m_k in N} is dense in R^n. We prove that the minimum number of (n x n) matrices in Jordan form over R which form a hypercyclic tuple is n+1. This answers a question of Costakis, Hadjiloucas and Manoussos."},"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":"1003.5321","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2010-03-27T21:06:25Z","cross_cats_sorted":["math.DS"],"title_canon_sha256":"ef5f35894bdab347620fe804935c71282cda280b40efba2221f77191b616fcab","abstract_canon_sha256":"697b324de7079a5ae458962a538c26b0f0460b59a6f1e8761ca7422ca991934d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:46.194162Z","signature_b64":"8d9ciiJTgZKWfk6Eo6FKimifeixpVUqkEdial9JcP9ih3eVNvSNk3UAcAwOidpeRx4ytaJNazflzYK9Am3KICA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ed4c30dfcc44a2f7773f3047e1bdd171179dbbd09e74fc7c938ebaefc1161bf","last_reissued_at":"2026-05-18T03:10:46.193596Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:46.193596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamics of tuples of matrices in Jordan form","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"math.FA","authors_text":"George Costakis, Ioannis Parissis","submitted_at":"2010-03-27T21:06:25Z","abstract_excerpt":"A tuple (T_1,...,T_k) of (n x n) matrices over R is called hypercyclic if for some x in R^n the set {T^{m_1} T^{m_2}...T^{m_k} x : m_1,m_2,...,m_k in N} is dense in R^n. We prove that the minimum number of (n x n) matrices in Jordan form over R which form a hypercyclic tuple is n+1. This answers a question of Costakis, Hadjiloucas and Manoussos."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.5321","kind":"arxiv","version":3},"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":"1003.5321","created_at":"2026-05-18T03:10:46.193689+00:00"},{"alias_kind":"arxiv_version","alias_value":"1003.5321v3","created_at":"2026-05-18T03:10:46.193689+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.5321","created_at":"2026-05-18T03:10:46.193689+00:00"},{"alias_kind":"pith_short_12","alias_value":"R3KMGDP4YRFC","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"R3KMGDP4YRFC653T","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"R3KMGDP4","created_at":"2026-05-18T12:26:13.927090+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/R3KMGDP4YRFC653T6MCH4G65C4","json":"https://pith.science/pith/R3KMGDP4YRFC653T6MCH4G65C4.json","graph_json":"https://pith.science/api/pith-number/R3KMGDP4YRFC653T6MCH4G65C4/graph.json","events_json":"https://pith.science/api/pith-number/R3KMGDP4YRFC653T6MCH4G65C4/events.json","paper":"https://pith.science/paper/R3KMGDP4"},"agent_actions":{"view_html":"https://pith.science/pith/R3KMGDP4YRFC653T6MCH4G65C4","download_json":"https://pith.science/pith/R3KMGDP4YRFC653T6MCH4G65C4.json","view_paper":"https://pith.science/paper/R3KMGDP4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1003.5321&json=true","fetch_graph":"https://pith.science/api/pith-number/R3KMGDP4YRFC653T6MCH4G65C4/graph.json","fetch_events":"https://pith.science/api/pith-number/R3KMGDP4YRFC653T6MCH4G65C4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R3KMGDP4YRFC653T6MCH4G65C4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R3KMGDP4YRFC653T6MCH4G65C4/action/storage_attestation","attest_author":"https://pith.science/pith/R3KMGDP4YRFC653T6MCH4G65C4/action/author_attestation","sign_citation":"https://pith.science/pith/R3KMGDP4YRFC653T6MCH4G65C4/action/citation_signature","submit_replication":"https://pith.science/pith/R3KMGDP4YRFC653T6MCH4G65C4/action/replication_record"}},"created_at":"2026-05-18T03:10:46.193689+00:00","updated_at":"2026-05-18T03:10:46.193689+00:00"}