{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:NUKT4WFETL4KIFE76CCPPYFD6J","short_pith_number":"pith:NUKT4WFE","schema_version":"1.0","canonical_sha256":"6d153e58a49af8a4149ff084f7e0a3f24d746740e6969f2fe7d55111a3c95c94","source":{"kind":"arxiv","id":"2607.29566","version":1},"attestation_state":"computed","paper":{"title":"The least quadratic residue and integers represented by quadratic forms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Jo\\~ao C. C. Vargas, Kannan Soundararajan","submitted_at":"2026-07-31T15:55:33Z","abstract_excerpt":"Let $\\ell(n)$ denote the least non-trivial reduced quadratic residue modulo $n$; that is, $\\ell(n)$ denotes the smallest square-free integer $r>1$ with $(r,n)=1$ and $r\\equiv x^2 \\bmod {n}$. We establish nearly optimal bounds for $\\ell(n)$, both in terms of the magnitude of $n$ and of its number of prime factors $\\omega(n)$. In particular, we construct moduli $n$ for which $\\ell(n)$ is unexpectedly large. As an application of our results, we prove bounds for the rate at which binary quadratic forms with bounded discriminant represent all positive integers up to $N$."},"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":"2607.29566","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2026-07-31T15:55:33Z","cross_cats_sorted":[],"title_canon_sha256":"ba7b3659de4e5b851177a6104b831d2133c6974fe3cc1acb22032883fff7b92b","abstract_canon_sha256":"fdd7042897b398ddd27487a77d0a807ddc1a44ea3e48031b1f5e30d04ae4a0c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-03T01:38:48.736475Z","signature_b64":"xvZVJQm2HxdiM/r7dqEJ2AMkxez0VM3BAqXNdQZACh0ccatPKjQIJ1f6uH1kAGFMFIl2jo4YsjdlYKxCUyS5Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d153e58a49af8a4149ff084f7e0a3f24d746740e6969f2fe7d55111a3c95c94","last_reissued_at":"2026-08-03T01:38:48.734883Z","signature_status":"signed_v1","first_computed_at":"2026-08-03T01:38:48.734883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The least quadratic residue and integers represented by quadratic forms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Jo\\~ao C. C. Vargas, Kannan Soundararajan","submitted_at":"2026-07-31T15:55:33Z","abstract_excerpt":"Let $\\ell(n)$ denote the least non-trivial reduced quadratic residue modulo $n$; that is, $\\ell(n)$ denotes the smallest square-free integer $r>1$ with $(r,n)=1$ and $r\\equiv x^2 \\bmod {n}$. We establish nearly optimal bounds for $\\ell(n)$, both in terms of the magnitude of $n$ and of its number of prime factors $\\omega(n)$. In particular, we construct moduli $n$ for which $\\ell(n)$ is unexpectedly large. As an application of our results, we prove bounds for the rate at which binary quadratic forms with bounded discriminant represent all positive integers up to $N$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.29566","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/2607.29566/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":"2607.29566","created_at":"2026-08-03T01:38:48.735801+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.29566v1","created_at":"2026-08-03T01:38:48.735801+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.29566","created_at":"2026-08-03T01:38:48.735801+00:00"},{"alias_kind":"pith_short_12","alias_value":"NUKT4WFETL4K","created_at":"2026-08-03T01:38:48.735801+00:00"},{"alias_kind":"pith_short_16","alias_value":"NUKT4WFETL4KIFE7","created_at":"2026-08-03T01:38:48.735801+00:00"},{"alias_kind":"pith_short_8","alias_value":"NUKT4WFE","created_at":"2026-08-03T01:38:48.735801+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NUKT4WFETL4KIFE76CCPPYFD6J","json":"https://pith.science/pith/NUKT4WFETL4KIFE76CCPPYFD6J.json","graph_json":"https://pith.science/api/pith-number/NUKT4WFETL4KIFE76CCPPYFD6J/graph.json","events_json":"https://pith.science/api/pith-number/NUKT4WFETL4KIFE76CCPPYFD6J/events.json","paper":"https://pith.science/paper/NUKT4WFE"},"agent_actions":{"view_html":"https://pith.science/pith/NUKT4WFETL4KIFE76CCPPYFD6J","download_json":"https://pith.science/pith/NUKT4WFETL4KIFE76CCPPYFD6J.json","view_paper":"https://pith.science/paper/NUKT4WFE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.29566&json=true","fetch_graph":"https://pith.science/api/pith-number/NUKT4WFETL4KIFE76CCPPYFD6J/graph.json","fetch_events":"https://pith.science/api/pith-number/NUKT4WFETL4KIFE76CCPPYFD6J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NUKT4WFETL4KIFE76CCPPYFD6J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NUKT4WFETL4KIFE76CCPPYFD6J/action/storage_attestation","attest_author":"https://pith.science/pith/NUKT4WFETL4KIFE76CCPPYFD6J/action/author_attestation","sign_citation":"https://pith.science/pith/NUKT4WFETL4KIFE76CCPPYFD6J/action/citation_signature","submit_replication":"https://pith.science/pith/NUKT4WFETL4KIFE76CCPPYFD6J/action/replication_record"}},"created_at":"2026-08-03T01:38:48.735801+00:00","updated_at":"2026-08-03T01:38:48.735801+00:00"}