{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JBXCHY7VBFZGHBBUCPLVUEIY2X","short_pith_number":"pith:JBXCHY7V","schema_version":"1.0","canonical_sha256":"486e23e3f5097263843413d75a1118d5dd9c7a8f8f6cbb836fad50c5a36c2091","source":{"kind":"arxiv","id":"2504.15839","version":1},"attestation_state":"computed","paper":{"title":"On commuting integer matrices","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Akshat Mudgal, Jonathan Chapman","submitted_at":"2025-04-22T12:34:14Z","abstract_excerpt":"Given $d, N \\in \\mathbb{N}$, we define $\\mathfrak{C}_d(N)$ to be the number of pairs of $d\\times d$ matrices $A,B$ with entries in $[-N,N] \\cap \\mathbb{Z}$ such that $AB = BA$. We prove that $$ N^{10} \\ll \\mathfrak{C}_3(N) \\ll N^{10},$$ thus confirming a speculation of Browning-Sawin-Wang. We further establish that $$ \\mathfrak{C}_2(N) = K(2N+1)^5 (1 + o(1)),$$ where $K>0$ is an explicit constant. Our methods are completely elementary and rely on upper bounds of the correct order for restricted divisor correlations with high uniformity."},"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":"2504.15839","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2025-04-22T12:34:14Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"9ff6583c583db8c58ad5e0125c2de661f7a2e2691f266398ce4578c9ee073cde","abstract_canon_sha256":"65ad8586e3203e56dc1d597206c4a723d2515896decf0e99ccb1bf1c73e1804a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:52:30.833760Z","signature_b64":"qGf9t+i0OsKSDNpupeYoIBWHYW5CK58O/FsOPUFU3sAzA/3y8fBcWcjVnuT6CCRIqxJnlnZ0lPQ3G8uals0aBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"486e23e3f5097263843413d75a1118d5dd9c7a8f8f6cbb836fad50c5a36c2091","last_reissued_at":"2026-07-05T10:52:30.833313Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:52:30.833313Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On commuting integer matrices","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Akshat Mudgal, Jonathan Chapman","submitted_at":"2025-04-22T12:34:14Z","abstract_excerpt":"Given $d, N \\in \\mathbb{N}$, we define $\\mathfrak{C}_d(N)$ to be the number of pairs of $d\\times d$ matrices $A,B$ with entries in $[-N,N] \\cap \\mathbb{Z}$ such that $AB = BA$. We prove that $$ N^{10} \\ll \\mathfrak{C}_3(N) \\ll N^{10},$$ thus confirming a speculation of Browning-Sawin-Wang. We further establish that $$ \\mathfrak{C}_2(N) = K(2N+1)^5 (1 + o(1)),$$ where $K>0$ is an explicit constant. Our methods are completely elementary and rely on upper bounds of the correct order for restricted divisor correlations with high uniformity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.15839","kind":"arxiv","version":1},"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/2504.15839/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":"2504.15839","created_at":"2026-07-05T10:52:30.833378+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.15839v1","created_at":"2026-07-05T10:52:30.833378+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.15839","created_at":"2026-07-05T10:52:30.833378+00:00"},{"alias_kind":"pith_short_12","alias_value":"JBXCHY7VBFZG","created_at":"2026-07-05T10:52:30.833378+00:00"},{"alias_kind":"pith_short_16","alias_value":"JBXCHY7VBFZGHBBU","created_at":"2026-07-05T10:52:30.833378+00:00"},{"alias_kind":"pith_short_8","alias_value":"JBXCHY7V","created_at":"2026-07-05T10:52:30.833378+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2509.20259","citing_title":"Counting $2 \\times 2$ integer matrices with a given determinant","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15434","citing_title":"Counting solutions to the quadratic determinant equation","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JBXCHY7VBFZGHBBUCPLVUEIY2X","json":"https://pith.science/pith/JBXCHY7VBFZGHBBUCPLVUEIY2X.json","graph_json":"https://pith.science/api/pith-number/JBXCHY7VBFZGHBBUCPLVUEIY2X/graph.json","events_json":"https://pith.science/api/pith-number/JBXCHY7VBFZGHBBUCPLVUEIY2X/events.json","paper":"https://pith.science/paper/JBXCHY7V"},"agent_actions":{"view_html":"https://pith.science/pith/JBXCHY7VBFZGHBBUCPLVUEIY2X","download_json":"https://pith.science/pith/JBXCHY7VBFZGHBBUCPLVUEIY2X.json","view_paper":"https://pith.science/paper/JBXCHY7V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.15839&json=true","fetch_graph":"https://pith.science/api/pith-number/JBXCHY7VBFZGHBBUCPLVUEIY2X/graph.json","fetch_events":"https://pith.science/api/pith-number/JBXCHY7VBFZGHBBUCPLVUEIY2X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JBXCHY7VBFZGHBBUCPLVUEIY2X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JBXCHY7VBFZGHBBUCPLVUEIY2X/action/storage_attestation","attest_author":"https://pith.science/pith/JBXCHY7VBFZGHBBUCPLVUEIY2X/action/author_attestation","sign_citation":"https://pith.science/pith/JBXCHY7VBFZGHBBUCPLVUEIY2X/action/citation_signature","submit_replication":"https://pith.science/pith/JBXCHY7VBFZGHBBUCPLVUEIY2X/action/replication_record"}},"created_at":"2026-07-05T10:52:30.833378+00:00","updated_at":"2026-07-05T10:52:30.833378+00:00"}