{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KQNV3LR74CKNRGDO67GITB5AY3","short_pith_number":"pith:KQNV3LR7","schema_version":"1.0","canonical_sha256":"541b5dae3fe094d8986ef7cc8987a0c6df4f6c24b7e363e029c04b60501b7099","source":{"kind":"arxiv","id":"1606.00358","version":1},"attestation_state":"computed","paper":{"title":"Sums of multiplicative characters with additive convolutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Aleksei S. Volostnov, Ilya D. Shkredov","submitted_at":"2016-06-01T17:01:10Z","abstract_excerpt":"In the paper we obtain new estimates for binary and ternary sums of multiplicative characters with additive convolutions of characteristic functions of sets, having small additive doubling. In particular, we improve a result of M.-C. Chang. The proof uses Croot-Sisask almost periodicity lemma."},"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":"1606.00358","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-06-01T17:01:10Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d7dc1db64aca545150af968cad8479ffedeafd21cbce63304af2004ab1f4790f","abstract_canon_sha256":"3b9a94fce88f622e78df3e64487b8a42bbf4afed930b79cd2cd105dd9939424b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:05.477135Z","signature_b64":"UmN7fLzAcIEcu+C6mcARdYNNrZ3RfrQ3Im/AMy6fX/zqcgmyQQMnrNjyiLWrqWKw4y7e2T+Dg42DnDckGjlhDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"541b5dae3fe094d8986ef7cc8987a0c6df4f6c24b7e363e029c04b60501b7099","last_reissued_at":"2026-05-18T01:13:05.476761Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:05.476761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sums of multiplicative characters with additive convolutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Aleksei S. Volostnov, Ilya D. Shkredov","submitted_at":"2016-06-01T17:01:10Z","abstract_excerpt":"In the paper we obtain new estimates for binary and ternary sums of multiplicative characters with additive convolutions of characteristic functions of sets, having small additive doubling. In particular, we improve a result of M.-C. Chang. The proof uses Croot-Sisask almost periodicity lemma."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00358","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":"1606.00358","created_at":"2026-05-18T01:13:05.476829+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.00358v1","created_at":"2026-05-18T01:13:05.476829+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00358","created_at":"2026-05-18T01:13:05.476829+00:00"},{"alias_kind":"pith_short_12","alias_value":"KQNV3LR74CKN","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"KQNV3LR74CKNRGDO","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"KQNV3LR7","created_at":"2026-05-18T12:30:25.849896+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/KQNV3LR74CKNRGDO67GITB5AY3","json":"https://pith.science/pith/KQNV3LR74CKNRGDO67GITB5AY3.json","graph_json":"https://pith.science/api/pith-number/KQNV3LR74CKNRGDO67GITB5AY3/graph.json","events_json":"https://pith.science/api/pith-number/KQNV3LR74CKNRGDO67GITB5AY3/events.json","paper":"https://pith.science/paper/KQNV3LR7"},"agent_actions":{"view_html":"https://pith.science/pith/KQNV3LR74CKNRGDO67GITB5AY3","download_json":"https://pith.science/pith/KQNV3LR74CKNRGDO67GITB5AY3.json","view_paper":"https://pith.science/paper/KQNV3LR7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.00358&json=true","fetch_graph":"https://pith.science/api/pith-number/KQNV3LR74CKNRGDO67GITB5AY3/graph.json","fetch_events":"https://pith.science/api/pith-number/KQNV3LR74CKNRGDO67GITB5AY3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KQNV3LR74CKNRGDO67GITB5AY3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KQNV3LR74CKNRGDO67GITB5AY3/action/storage_attestation","attest_author":"https://pith.science/pith/KQNV3LR74CKNRGDO67GITB5AY3/action/author_attestation","sign_citation":"https://pith.science/pith/KQNV3LR74CKNRGDO67GITB5AY3/action/citation_signature","submit_replication":"https://pith.science/pith/KQNV3LR74CKNRGDO67GITB5AY3/action/replication_record"}},"created_at":"2026-05-18T01:13:05.476829+00:00","updated_at":"2026-05-18T01:13:05.476829+00:00"}