{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:F3VYWQQJD2PENKMY6JNOLAFNNM","short_pith_number":"pith:F3VYWQQJ","schema_version":"1.0","canonical_sha256":"2eeb8b42091e9e46a998f25ae580ad6b06d6c7428e7cf36c3f9e0954d07c1761","source":{"kind":"arxiv","id":"2509.20259","version":3},"attestation_state":"computed","paper":{"title":"Counting $2 \\times 2$ integer matrices with a given determinant","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-09-24T15:45:45Z","abstract_excerpt":"Given positive integers $h, N$ satisfying $1 \\leqslant h \\leqslant 2N^2$, we define $T(h,N)$ to be the number of $2\\times 2$ integer matrices with determinant equal to $h$ whose entries lie in $[-N,N]$. Our main result states that for any $\\varepsilon >0$, one has \\[ T(h,N) = \\frac{16}{\\zeta(2)} N^2 \\bigg( \\sum_{d |h} \\frac{1}{d} \\bigg) + O_{\\varepsilon}(N^{\\varepsilon} (N+ h)).\\] This quantitatively improves upon recent work of Afifurrahman and Ganguly--Guria, and delivers square-root cancellation estimates when $h \\leq N$. We further show that when $h$ is large, the error term is of approxim"},"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":"2509.20259","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2025-09-24T15:45:45Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"82836f7e15b9952540cf4ffa17fd70245774a472c4ab83b05498b8ce15889b10","abstract_canon_sha256":"62981bba230c34711cde900adacf9706cb3cb5b48e5bdfe70cdc90cdaefa154b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:33.711735Z","signature_b64":"EhhXvnwbCOoWsixYmP52DZTj0EwqypXW4t8Vovxyf+RKA2k9AjnhAPncKCLD7bLoYmqDB6jp82J8rlrn79+DCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2eeb8b42091e9e46a998f25ae580ad6b06d6c7428e7cf36c3f9e0954d07c1761","last_reissued_at":"2026-05-20T00:05:33.711030Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:33.711030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting $2 \\times 2$ integer matrices with a given determinant","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-09-24T15:45:45Z","abstract_excerpt":"Given positive integers $h, N$ satisfying $1 \\leqslant h \\leqslant 2N^2$, we define $T(h,N)$ to be the number of $2\\times 2$ integer matrices with determinant equal to $h$ whose entries lie in $[-N,N]$. Our main result states that for any $\\varepsilon >0$, one has \\[ T(h,N) = \\frac{16}{\\zeta(2)} N^2 \\bigg( \\sum_{d |h} \\frac{1}{d} \\bigg) + O_{\\varepsilon}(N^{\\varepsilon} (N+ h)).\\] This quantitatively improves upon recent work of Afifurrahman and Ganguly--Guria, and delivers square-root cancellation estimates when $h \\leq N$. We further show that when $h$ is large, the error term is of approxim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.20259","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2509.20259/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":"2509.20259","created_at":"2026-05-20T00:05:33.711163+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.20259v3","created_at":"2026-05-20T00:05:33.711163+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.20259","created_at":"2026-05-20T00:05:33.711163+00:00"},{"alias_kind":"pith_short_12","alias_value":"F3VYWQQJD2PE","created_at":"2026-05-20T00:05:33.711163+00:00"},{"alias_kind":"pith_short_16","alias_value":"F3VYWQQJD2PENKMY","created_at":"2026-05-20T00:05:33.711163+00:00"},{"alias_kind":"pith_short_8","alias_value":"F3VYWQQJ","created_at":"2026-05-20T00:05:33.711163+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.15434","citing_title":"Counting solutions to the quadratic determinant equation","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F3VYWQQJD2PENKMY6JNOLAFNNM","json":"https://pith.science/pith/F3VYWQQJD2PENKMY6JNOLAFNNM.json","graph_json":"https://pith.science/api/pith-number/F3VYWQQJD2PENKMY6JNOLAFNNM/graph.json","events_json":"https://pith.science/api/pith-number/F3VYWQQJD2PENKMY6JNOLAFNNM/events.json","paper":"https://pith.science/paper/F3VYWQQJ"},"agent_actions":{"view_html":"https://pith.science/pith/F3VYWQQJD2PENKMY6JNOLAFNNM","download_json":"https://pith.science/pith/F3VYWQQJD2PENKMY6JNOLAFNNM.json","view_paper":"https://pith.science/paper/F3VYWQQJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.20259&json=true","fetch_graph":"https://pith.science/api/pith-number/F3VYWQQJD2PENKMY6JNOLAFNNM/graph.json","fetch_events":"https://pith.science/api/pith-number/F3VYWQQJD2PENKMY6JNOLAFNNM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F3VYWQQJD2PENKMY6JNOLAFNNM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F3VYWQQJD2PENKMY6JNOLAFNNM/action/storage_attestation","attest_author":"https://pith.science/pith/F3VYWQQJD2PENKMY6JNOLAFNNM/action/author_attestation","sign_citation":"https://pith.science/pith/F3VYWQQJD2PENKMY6JNOLAFNNM/action/citation_signature","submit_replication":"https://pith.science/pith/F3VYWQQJD2PENKMY6JNOLAFNNM/action/replication_record"}},"created_at":"2026-05-20T00:05:33.711163+00:00","updated_at":"2026-05-20T00:05:33.711163+00:00"}