{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:N5Y3OOJNBYEBCRVEO7GLO6YGUQ","short_pith_number":"pith:N5Y3OOJN","schema_version":"1.0","canonical_sha256":"6f71b7392d0e081146a477ccb77b06a404c6b44c51c8b1b95b6951792c7bbb9b","source":{"kind":"arxiv","id":"2408.04350","version":1},"attestation_state":"computed","paper":{"title":"On the determinants of matrices with elements from arbitrary sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Igor E. Shparlinski, Ilya D. Shkredov","submitted_at":"2024-08-08T10:23:22Z","abstract_excerpt":"Recently there has been several works estimating the number of $n\\times n$ matrices with elements from some finite sets $\\mathcal X$ of arithmetic interest and of a given determinant. Typically such results are compared with the trivial upper bound $O(X^{n^2-1})$, where $X$ is the cardinality of $\\mathcal X$. Here we show that even for arbitrary sets $\\mathcal X\\subseteq \\mathbb R$,some recent results from additive combinatorics enable us to obtain a stronger bound with a power saving."},"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":"2408.04350","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2024-08-08T10:23:22Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"08d676099ea045adae932fd7fa55b7beda3a0e5d909a1b0b7ab245c5121db7da","abstract_canon_sha256":"c50075ee896b591bbb5b669201d6bb5a654ac20803ec5e66053a2dacb3519408"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:53:31.996635Z","signature_b64":"zPpONe85gzseJ7xfRffUH1JJQexaOIlZ8R673P/zWu3DXlxExdmcu60HB8Qo3D4tcxNVH+e81wLBUR8Xu43jCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f71b7392d0e081146a477ccb77b06a404c6b44c51c8b1b95b6951792c7bbb9b","last_reissued_at":"2026-07-05T08:53:31.996159Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:53:31.996159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the determinants of matrices with elements from arbitrary sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Igor E. Shparlinski, Ilya D. Shkredov","submitted_at":"2024-08-08T10:23:22Z","abstract_excerpt":"Recently there has been several works estimating the number of $n\\times n$ matrices with elements from some finite sets $\\mathcal X$ of arithmetic interest and of a given determinant. Typically such results are compared with the trivial upper bound $O(X^{n^2-1})$, where $X$ is the cardinality of $\\mathcal X$. Here we show that even for arbitrary sets $\\mathcal X\\subseteq \\mathbb R$,some recent results from additive combinatorics enable us to obtain a stronger bound with a power saving."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.04350","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/2408.04350/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":"2408.04350","created_at":"2026-07-05T08:53:31.996225+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.04350v1","created_at":"2026-07-05T08:53:31.996225+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.04350","created_at":"2026-07-05T08:53:31.996225+00:00"},{"alias_kind":"pith_short_12","alias_value":"N5Y3OOJNBYEB","created_at":"2026-07-05T08:53:31.996225+00:00"},{"alias_kind":"pith_short_16","alias_value":"N5Y3OOJNBYEBCRVE","created_at":"2026-07-05T08:53:31.996225+00:00"},{"alias_kind":"pith_short_8","alias_value":"N5Y3OOJN","created_at":"2026-07-05T08:53:31.996225+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.07100","citing_title":"Counting matrices over finite rank multiplicative groups","ref_index":49,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N5Y3OOJNBYEBCRVEO7GLO6YGUQ","json":"https://pith.science/pith/N5Y3OOJNBYEBCRVEO7GLO6YGUQ.json","graph_json":"https://pith.science/api/pith-number/N5Y3OOJNBYEBCRVEO7GLO6YGUQ/graph.json","events_json":"https://pith.science/api/pith-number/N5Y3OOJNBYEBCRVEO7GLO6YGUQ/events.json","paper":"https://pith.science/paper/N5Y3OOJN"},"agent_actions":{"view_html":"https://pith.science/pith/N5Y3OOJNBYEBCRVEO7GLO6YGUQ","download_json":"https://pith.science/pith/N5Y3OOJNBYEBCRVEO7GLO6YGUQ.json","view_paper":"https://pith.science/paper/N5Y3OOJN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.04350&json=true","fetch_graph":"https://pith.science/api/pith-number/N5Y3OOJNBYEBCRVEO7GLO6YGUQ/graph.json","fetch_events":"https://pith.science/api/pith-number/N5Y3OOJNBYEBCRVEO7GLO6YGUQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N5Y3OOJNBYEBCRVEO7GLO6YGUQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N5Y3OOJNBYEBCRVEO7GLO6YGUQ/action/storage_attestation","attest_author":"https://pith.science/pith/N5Y3OOJNBYEBCRVEO7GLO6YGUQ/action/author_attestation","sign_citation":"https://pith.science/pith/N5Y3OOJNBYEBCRVEO7GLO6YGUQ/action/citation_signature","submit_replication":"https://pith.science/pith/N5Y3OOJNBYEBCRVEO7GLO6YGUQ/action/replication_record"}},"created_at":"2026-07-05T08:53:31.996225+00:00","updated_at":"2026-07-05T08:53:31.996225+00:00"}