{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YU47HQBKOYMTKQLHH5XJMGWZNK","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":"2fa6c03d3c2f538107bbdb6ef1a0949ce79c92dd977ea4217af5ba50bb829454","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-04-20T20:39:09Z","title_canon_sha256":"0cd306bb115eb76ef2854329938414547dca4ecca412bf77d1905f759925c490"},"schema_version":"1.0","source":{"id":"1404.5070","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5070","created_at":"2026-05-18T01:17:44Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5070v2","created_at":"2026-05-18T01:17:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5070","created_at":"2026-05-18T01:17:44Z"},{"alias_kind":"pith_short_12","alias_value":"YU47HQBKOYMT","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YU47HQBKOYMTKQLH","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YU47HQBK","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:6e14ef1197451480755023b7cc1b52ea89547d0e1782ece63e8b8206dc19dc38","target":"graph","created_at":"2026-05-18T01:17:44Z","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"},"paper":{"abstract_excerpt":"In the present paper we obtain new upper bound estimates for the number of solutions of the congruence $$ x\\equiv y r\\pmod p;\\quad x,y\\in \\mathbb{N},\\quad x,y\\le H,\\quad r\\in\\cU, $$ for certain ranges of $H$ and $|\\cU|$, where $\\cU$ is a subset of the field of residue classes modulo $p$ having small multiplicative doubling. We then use this estimate to show that the number of solutions of the congruence $$ x^n\\equiv \\lambda\\pmod p; \\quad x\\in \\N, \\quad L<x<L+p/n, $$ is at most $p^{\\frac{1}{3}-c}$ uniformly over positive integers $n, \\lambda$ and $L$, for some absolute constant $c>0$. This impl","authors_text":"J. Cilleruelo, M. Z. Garaev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-04-20T20:39:09Z","title":"Congruences involving product of intervals and sets with small multiplicative doubling modulo a prime and applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5070","kind":"arxiv","version":2},"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:cd2a70a052f83b09bc5e8b085f9da404f5deb12433346c76132d319e72ecb11f","target":"record","created_at":"2026-05-18T01:17:44Z","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":"2fa6c03d3c2f538107bbdb6ef1a0949ce79c92dd977ea4217af5ba50bb829454","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-04-20T20:39:09Z","title_canon_sha256":"0cd306bb115eb76ef2854329938414547dca4ecca412bf77d1905f759925c490"},"schema_version":"1.0","source":{"id":"1404.5070","kind":"arxiv","version":2}},"canonical_sha256":"c539f3c02a76193541673f6e961ad96a984360ebea74428aed77e017384a28ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c539f3c02a76193541673f6e961ad96a984360ebea74428aed77e017384a28ec","first_computed_at":"2026-05-18T01:17:44.328947Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:44.328947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2JxpqhY6oVYLnRGICtrCZDUOWLS2aRhlP5sAWUcM49SEyaFSCYiXiGQSwHe6U7t/VgeA0TbvZGPWm1NZYYEoBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:44.329663Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.5070","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd2a70a052f83b09bc5e8b085f9da404f5deb12433346c76132d319e72ecb11f","sha256:6e14ef1197451480755023b7cc1b52ea89547d0e1782ece63e8b8206dc19dc38"],"state_sha256":"b11e550a1d85ac2c5ecbe63970c30ec087dba8d70680ab912a46789541c5fd11"}