{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:N5Y3OOJNBYEBCRVEO7GLO6YGUQ","short_pith_number":"pith:N5Y3OOJN","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"},"canonical_sha256":"6f71b7392d0e081146a477ccb77b06a404c6b44c51c8b1b95b6951792c7bbb9b","source":{"kind":"arxiv","id":"2408.04350","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.04350","created_at":"2026-07-05T08:53:31Z"},{"alias_kind":"arxiv_version","alias_value":"2408.04350v1","created_at":"2026-07-05T08:53:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.04350","created_at":"2026-07-05T08:53:31Z"},{"alias_kind":"pith_short_12","alias_value":"N5Y3OOJNBYEB","created_at":"2026-07-05T08:53:31Z"},{"alias_kind":"pith_short_16","alias_value":"N5Y3OOJNBYEBCRVE","created_at":"2026-07-05T08:53:31Z"},{"alias_kind":"pith_short_8","alias_value":"N5Y3OOJN","created_at":"2026-07-05T08:53:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:N5Y3OOJNBYEBCRVEO7GLO6YGUQ","target":"record","payload":{"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"},"canonical_sha256":"6f71b7392d0e081146a477ccb77b06a404c6b44c51c8b1b95b6951792c7bbb9b","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"},"source_kind":"arxiv","source_id":"2408.04350","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:53:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8x+qlXz9nAvsPpZFlfI6Mk+32neqwobLULP75q4UhH/C97p/kbAYL5K4jKOsUWu46C8waYnMy5R3vugZ5Z8YBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T19:06:08.955868Z"},"content_sha256":"0a2d7305168b3378070c80ab5b9e050908320cd9d85def331416d206de819890","schema_version":"1.0","event_id":"sha256:0a2d7305168b3378070c80ab5b9e050908320cd9d85def331416d206de819890"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:N5Y3OOJNBYEBCRVEO7GLO6YGUQ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:53:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wVwlsCxLlNeZSAP0osKeZwh92vbOU9dpTVUAVTaO0ayCo4Uq14dS1vtot4vkGWQ8TVB5wRn4fREEWFhFgxGiAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T19:06:08.956699Z"},"content_sha256":"0e1f189f166da61bf39d4f4d9cdae18f0f5a643f88e1e722cc5f8d946c11a280","schema_version":"1.0","event_id":"sha256:0e1f189f166da61bf39d4f4d9cdae18f0f5a643f88e1e722cc5f8d946c11a280"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N5Y3OOJNBYEBCRVEO7GLO6YGUQ/bundle.json","state_url":"https://pith.science/pith/N5Y3OOJNBYEBCRVEO7GLO6YGUQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N5Y3OOJNBYEBCRVEO7GLO6YGUQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-09T19:06:08Z","links":{"resolver":"https://pith.science/pith/N5Y3OOJNBYEBCRVEO7GLO6YGUQ","bundle":"https://pith.science/pith/N5Y3OOJNBYEBCRVEO7GLO6YGUQ/bundle.json","state":"https://pith.science/pith/N5Y3OOJNBYEBCRVEO7GLO6YGUQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N5Y3OOJNBYEBCRVEO7GLO6YGUQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:N5Y3OOJNBYEBCRVEO7GLO6YGUQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c50075ee896b591bbb5b669201d6bb5a654ac20803ec5e66053a2dacb3519408","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2024-08-08T10:23:22Z","title_canon_sha256":"08d676099ea045adae932fd7fa55b7beda3a0e5d909a1b0b7ab245c5121db7da"},"schema_version":"1.0","source":{"id":"2408.04350","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.04350","created_at":"2026-07-05T08:53:31Z"},{"alias_kind":"arxiv_version","alias_value":"2408.04350v1","created_at":"2026-07-05T08:53:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.04350","created_at":"2026-07-05T08:53:31Z"},{"alias_kind":"pith_short_12","alias_value":"N5Y3OOJNBYEB","created_at":"2026-07-05T08:53:31Z"},{"alias_kind":"pith_short_16","alias_value":"N5Y3OOJNBYEBCRVE","created_at":"2026-07-05T08:53:31Z"},{"alias_kind":"pith_short_8","alias_value":"N5Y3OOJN","created_at":"2026-07-05T08:53:31Z"}],"graph_snapshots":[{"event_id":"sha256:0e1f189f166da61bf39d4f4d9cdae18f0f5a643f88e1e722cc5f8d946c11a280","target":"graph","created_at":"2026-07-05T08:53:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2408.04350/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Igor E. Shparlinski, Ilya D. Shkredov","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2024-08-08T10:23:22Z","title":"On the determinants of matrices with elements from arbitrary sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.04350","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0a2d7305168b3378070c80ab5b9e050908320cd9d85def331416d206de819890","target":"record","created_at":"2026-07-05T08:53:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c50075ee896b591bbb5b669201d6bb5a654ac20803ec5e66053a2dacb3519408","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2024-08-08T10:23:22Z","title_canon_sha256":"08d676099ea045adae932fd7fa55b7beda3a0e5d909a1b0b7ab245c5121db7da"},"schema_version":"1.0","source":{"id":"2408.04350","kind":"arxiv","version":1}},"canonical_sha256":"6f71b7392d0e081146a477ccb77b06a404c6b44c51c8b1b95b6951792c7bbb9b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f71b7392d0e081146a477ccb77b06a404c6b44c51c8b1b95b6951792c7bbb9b","first_computed_at":"2026-07-05T08:53:31.996159Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:53:31.996159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zPpONe85gzseJ7xfRffUH1JJQexaOIlZ8R673P/zWu3DXlxExdmcu60HB8Qo3D4tcxNVH+e81wLBUR8Xu43jCw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:53:31.996635Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.04350","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a2d7305168b3378070c80ab5b9e050908320cd9d85def331416d206de819890","sha256:0e1f189f166da61bf39d4f4d9cdae18f0f5a643f88e1e722cc5f8d946c11a280"],"state_sha256":"f22c4c4fb484e9886b4fd2b15868371c7ab016a5d8a5955707f2fd1805c76f82"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G1kMEWdfRwSyq9xdsBqlnMZ592zOcbqGjJuNKJavI8BypsasSbVptJSrXLf07vEltoFterVlox0Qg7XVs5kpCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T19:06:08.963317Z","bundle_sha256":"ec73767fb53be632acd37064d87a9b73092c3d80dd695070cc07bbec82ab7bae"}}