{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VJBLLXK44Y7MAKL22U7V5ZXGND","short_pith_number":"pith:VJBLLXK4","schema_version":"1.0","canonical_sha256":"aa42b5dd5ce63ec0297ad53f5ee6e668d080b9b56db99b0ac578658bb10dcfed","source":{"kind":"arxiv","id":"1712.09355","version":1},"attestation_state":"computed","paper":{"title":"On some double sums with multiplicative characters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Aleksei S. Volostnov","submitted_at":"2017-12-26T12:10:58Z","abstract_excerpt":"We obtain a new upper bound for binary sums with multiplicative characters over variables belong to some sets, having small additive doubling."},"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":"1712.09355","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-12-26T12:10:58Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2cb724c97d9c348a7d6031f07718c0723b0dcf806fd142a73d3fa66903f5d049","abstract_canon_sha256":"4f318ec30e70d7cd420b6c9dab069cd1996965b6dcb5027ea1c111014b0e208c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:08.649283Z","signature_b64":"QheliZ9VPOOq+DaMC6STnU/NWeLQ628qGyYGcbSHP9/cHhNMF75/rXt3G7cRBiMfJXKwLOboB7Te0YZEKD8kDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa42b5dd5ce63ec0297ad53f5ee6e668d080b9b56db99b0ac578658bb10dcfed","last_reissued_at":"2026-05-18T00:27:08.648655Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:08.648655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On some double sums with multiplicative characters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Aleksei S. Volostnov","submitted_at":"2017-12-26T12:10:58Z","abstract_excerpt":"We obtain a new upper bound for binary sums with multiplicative characters over variables belong to some sets, having small additive doubling."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09355","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":"1712.09355","created_at":"2026-05-18T00:27:08.648738+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.09355v1","created_at":"2026-05-18T00:27:08.648738+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09355","created_at":"2026-05-18T00:27:08.648738+00:00"},{"alias_kind":"pith_short_12","alias_value":"VJBLLXK44Y7M","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VJBLLXK44Y7MAKL2","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VJBLLXK4","created_at":"2026-05-18T12:31:49.984773+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/VJBLLXK44Y7MAKL22U7V5ZXGND","json":"https://pith.science/pith/VJBLLXK44Y7MAKL22U7V5ZXGND.json","graph_json":"https://pith.science/api/pith-number/VJBLLXK44Y7MAKL22U7V5ZXGND/graph.json","events_json":"https://pith.science/api/pith-number/VJBLLXK44Y7MAKL22U7V5ZXGND/events.json","paper":"https://pith.science/paper/VJBLLXK4"},"agent_actions":{"view_html":"https://pith.science/pith/VJBLLXK44Y7MAKL22U7V5ZXGND","download_json":"https://pith.science/pith/VJBLLXK44Y7MAKL22U7V5ZXGND.json","view_paper":"https://pith.science/paper/VJBLLXK4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.09355&json=true","fetch_graph":"https://pith.science/api/pith-number/VJBLLXK44Y7MAKL22U7V5ZXGND/graph.json","fetch_events":"https://pith.science/api/pith-number/VJBLLXK44Y7MAKL22U7V5ZXGND/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VJBLLXK44Y7MAKL22U7V5ZXGND/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VJBLLXK44Y7MAKL22U7V5ZXGND/action/storage_attestation","attest_author":"https://pith.science/pith/VJBLLXK44Y7MAKL22U7V5ZXGND/action/author_attestation","sign_citation":"https://pith.science/pith/VJBLLXK44Y7MAKL22U7V5ZXGND/action/citation_signature","submit_replication":"https://pith.science/pith/VJBLLXK44Y7MAKL22U7V5ZXGND/action/replication_record"}},"created_at":"2026-05-18T00:27:08.648738+00:00","updated_at":"2026-05-18T00:27:08.648738+00:00"}