{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DBPB3XDEKRELWZXOZWPUS55CCU","short_pith_number":"pith:DBPB3XDE","schema_version":"1.0","canonical_sha256":"185e1ddc645448bb66eecd9f4977a2153aed169573531d2ba28fb28856b5b6d3","source":{"kind":"arxiv","id":"1610.01061","version":1},"attestation_state":"computed","paper":{"title":"On Some Multiple Character Sums","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Igor E. Shparlinski, Ilya D. Shkredov","submitted_at":"2016-10-04T16:07:22Z","abstract_excerpt":"We improve a recent result of B. Hanson (2015) on multiplicative character sums with expressions of the type $a + b +cd$ and variables $a,b,c,d$ from four distinct sets of a finite field. We also consider similar sums with $a + b(c+d)$. These bounds rely on some recent advances in additive combinatorics."},"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":"1610.01061","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-10-04T16:07:22Z","cross_cats_sorted":[],"title_canon_sha256":"3d16a6830454825e40ffeb2674685c7c4589d6dd35504dee0a4a8b2f3da8816e","abstract_canon_sha256":"ffffae1c88dd210d883afe696c178733a33bd16548dde89816431cefa9f9fc44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:39.588512Z","signature_b64":"uVzKjcQUD+mng6HxRUqRrc8l+yPlTVEWpyDoIqXB6fHI/l/FcsmYe2uIgRPtdV/zfoGJW2e53qLmY5Z2dl9oAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"185e1ddc645448bb66eecd9f4977a2153aed169573531d2ba28fb28856b5b6d3","last_reissued_at":"2026-05-18T00:46:39.587954Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:39.587954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Some Multiple Character Sums","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Igor E. Shparlinski, Ilya D. Shkredov","submitted_at":"2016-10-04T16:07:22Z","abstract_excerpt":"We improve a recent result of B. Hanson (2015) on multiplicative character sums with expressions of the type $a + b +cd$ and variables $a,b,c,d$ from four distinct sets of a finite field. We also consider similar sums with $a + b(c+d)$. These bounds rely on some recent advances in additive combinatorics."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.01061","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":""},"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":"1610.01061","created_at":"2026-05-18T00:46:39.588045+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.01061v1","created_at":"2026-05-18T00:46:39.588045+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01061","created_at":"2026-05-18T00:46:39.588045+00:00"},{"alias_kind":"pith_short_12","alias_value":"DBPB3XDEKREL","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"DBPB3XDEKRELWZXO","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"DBPB3XDE","created_at":"2026-05-18T12:30:09.641336+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/DBPB3XDEKRELWZXOZWPUS55CCU","json":"https://pith.science/pith/DBPB3XDEKRELWZXOZWPUS55CCU.json","graph_json":"https://pith.science/api/pith-number/DBPB3XDEKRELWZXOZWPUS55CCU/graph.json","events_json":"https://pith.science/api/pith-number/DBPB3XDEKRELWZXOZWPUS55CCU/events.json","paper":"https://pith.science/paper/DBPB3XDE"},"agent_actions":{"view_html":"https://pith.science/pith/DBPB3XDEKRELWZXOZWPUS55CCU","download_json":"https://pith.science/pith/DBPB3XDEKRELWZXOZWPUS55CCU.json","view_paper":"https://pith.science/paper/DBPB3XDE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.01061&json=true","fetch_graph":"https://pith.science/api/pith-number/DBPB3XDEKRELWZXOZWPUS55CCU/graph.json","fetch_events":"https://pith.science/api/pith-number/DBPB3XDEKRELWZXOZWPUS55CCU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DBPB3XDEKRELWZXOZWPUS55CCU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DBPB3XDEKRELWZXOZWPUS55CCU/action/storage_attestation","attest_author":"https://pith.science/pith/DBPB3XDEKRELWZXOZWPUS55CCU/action/author_attestation","sign_citation":"https://pith.science/pith/DBPB3XDEKRELWZXOZWPUS55CCU/action/citation_signature","submit_replication":"https://pith.science/pith/DBPB3XDEKRELWZXOZWPUS55CCU/action/replication_record"}},"created_at":"2026-05-18T00:46:39.588045+00:00","updated_at":"2026-05-18T00:46:39.588045+00:00"}