{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:6MRKGWBO2GEBYCVXIBGVPTEJ6D","short_pith_number":"pith:6MRKGWBO","schema_version":"1.0","canonical_sha256":"f322a3582ed1881c0ab7404d57cc89f0f4ea53ef14554a5f7ce6289c49f89c55","source":{"kind":"arxiv","id":"2203.03880","version":5},"attestation_state":"computed","paper":{"title":"Integer matrices with a given characteristic polynomial and multiplicative dependence of matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Alina Ostafe, Igor E. Shparlinski, Philipp Habegger","submitted_at":"2022-03-08T06:56:26Z","abstract_excerpt":"We consider the set $\\mathcal{M}_n(\\mathbb Z; H)$ of $n\\times n$-matrices with integer elements of size at most $H$ and obtain a new upper bound on the number of matrices from $\\mathcal{M}_n(\\mathbb Z; H)$ with a given characteristic polynomial $f \\in \\mathbb Z[X]$, which is uniform with respect to $f$. This complements the asymptotic formula of A. Eskin, S. Mozes and N. Shah (1996) in which $f$ has to be fixed and irreducible.\n  Using this result, among others, we obtain upper and lower bounds on the number of $s$-tuples of matrices from $\\mathcal{M}_n(\\mathbb Z; H)$, satisfying various multi"},"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":"2203.03880","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2022-03-08T06:56:26Z","cross_cats_sorted":[],"title_canon_sha256":"ea58270defeeb86de72065f89032ec3c1729d71482caee8f4a56354de35aeb5c","abstract_canon_sha256":"d0f1ebd07021e0b23512df072251a044ddc23590920db4fc717ff1dbf8a3cdbc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:02:38.980765Z","signature_b64":"7v5yKD/2IWmKjPeU5BFnJTDyVH8IHHbgi1aPmTT+eWqYea+xsyCMN1MD7l/UBOO9aqwpWDGjG20wsfk498HlCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f322a3582ed1881c0ab7404d57cc89f0f4ea53ef14554a5f7ce6289c49f89c55","last_reissued_at":"2026-07-05T09:02:38.980252Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:02:38.980252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Integer matrices with a given characteristic polynomial and multiplicative dependence of matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Alina Ostafe, Igor E. Shparlinski, Philipp Habegger","submitted_at":"2022-03-08T06:56:26Z","abstract_excerpt":"We consider the set $\\mathcal{M}_n(\\mathbb Z; H)$ of $n\\times n$-matrices with integer elements of size at most $H$ and obtain a new upper bound on the number of matrices from $\\mathcal{M}_n(\\mathbb Z; H)$ with a given characteristic polynomial $f \\in \\mathbb Z[X]$, which is uniform with respect to $f$. This complements the asymptotic formula of A. Eskin, S. Mozes and N. Shah (1996) in which $f$ has to be fixed and irreducible.\n  Using this result, among others, we obtain upper and lower bounds on the number of $s$-tuples of matrices from $\\mathcal{M}_n(\\mathbb Z; H)$, satisfying various multi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.03880","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2203.03880/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2203.03880","created_at":"2026-07-05T09:02:38.980321+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.03880v5","created_at":"2026-07-05T09:02:38.980321+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.03880","created_at":"2026-07-05T09:02:38.980321+00:00"},{"alias_kind":"pith_short_12","alias_value":"6MRKGWBO2GEB","created_at":"2026-07-05T09:02:38.980321+00:00"},{"alias_kind":"pith_short_16","alias_value":"6MRKGWBO2GEBYCVX","created_at":"2026-07-05T09:02:38.980321+00:00"},{"alias_kind":"pith_short_8","alias_value":"6MRKGWBO","created_at":"2026-07-05T09:02:38.980321+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.06463","citing_title":"Galois groups of random integer matrices","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6MRKGWBO2GEBYCVXIBGVPTEJ6D","json":"https://pith.science/pith/6MRKGWBO2GEBYCVXIBGVPTEJ6D.json","graph_json":"https://pith.science/api/pith-number/6MRKGWBO2GEBYCVXIBGVPTEJ6D/graph.json","events_json":"https://pith.science/api/pith-number/6MRKGWBO2GEBYCVXIBGVPTEJ6D/events.json","paper":"https://pith.science/paper/6MRKGWBO"},"agent_actions":{"view_html":"https://pith.science/pith/6MRKGWBO2GEBYCVXIBGVPTEJ6D","download_json":"https://pith.science/pith/6MRKGWBO2GEBYCVXIBGVPTEJ6D.json","view_paper":"https://pith.science/paper/6MRKGWBO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.03880&json=true","fetch_graph":"https://pith.science/api/pith-number/6MRKGWBO2GEBYCVXIBGVPTEJ6D/graph.json","fetch_events":"https://pith.science/api/pith-number/6MRKGWBO2GEBYCVXIBGVPTEJ6D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6MRKGWBO2GEBYCVXIBGVPTEJ6D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6MRKGWBO2GEBYCVXIBGVPTEJ6D/action/storage_attestation","attest_author":"https://pith.science/pith/6MRKGWBO2GEBYCVXIBGVPTEJ6D/action/author_attestation","sign_citation":"https://pith.science/pith/6MRKGWBO2GEBYCVXIBGVPTEJ6D/action/citation_signature","submit_replication":"https://pith.science/pith/6MRKGWBO2GEBYCVXIBGVPTEJ6D/action/replication_record"}},"created_at":"2026-07-05T09:02:38.980321+00:00","updated_at":"2026-07-05T09:02:38.980321+00:00"}