{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:3MTYQQSNXV2WXWEIG3GVYL3QAJ","short_pith_number":"pith:3MTYQQSN","schema_version":"1.0","canonical_sha256":"db2788424dbd756bd88836cd5c2f70025d724c3705844beb2f65d09c34be74f8","source":{"kind":"arxiv","id":"1309.6980","version":1},"attestation_state":"computed","paper":{"title":"Multiplicative decomposition of arithmetic progressions in prime fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"M. Z. Garaev, S. V. Konyagin","submitted_at":"2013-09-26T17:19:12Z","abstract_excerpt":"We prove that there exists an absolute constant $c>0$ such that if an arithmetic progression $\\cP$ modulo a prime number $p$ does not contain zero and has the cardinality less than $cp$, then it can not be represented as a product of two subsets of cardinality greater than 1, unless $\\cP=-\\cP$ or $\\cP=\\{-2r,r,4r\\}$ for some residue $r$ modulo $p$."},"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":"1309.6980","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-09-26T17:19:12Z","cross_cats_sorted":[],"title_canon_sha256":"1db0f1d116259bf86dbad03f4ab585a21e6cf2b22ca184d186d5cab9084a6c2a","abstract_canon_sha256":"48f448fd96e670ba470504e3ba363ff685289284e86045b059eb51000d9c8ed2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:09.587542Z","signature_b64":"BiusN4xb7trRZz3Kd+8Jei7CkfWfFpbssxAm+a11NzIJDcsu8Oc7C9fLaTOGzcJ/wBdfn1FKfZ4zzte5xKYHCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db2788424dbd756bd88836cd5c2f70025d724c3705844beb2f65d09c34be74f8","last_reissued_at":"2026-05-18T03:12:09.586805Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:09.586805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiplicative decomposition of arithmetic progressions in prime fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"M. Z. Garaev, S. V. Konyagin","submitted_at":"2013-09-26T17:19:12Z","abstract_excerpt":"We prove that there exists an absolute constant $c>0$ such that if an arithmetic progression $\\cP$ modulo a prime number $p$ does not contain zero and has the cardinality less than $cp$, then it can not be represented as a product of two subsets of cardinality greater than 1, unless $\\cP=-\\cP$ or $\\cP=\\{-2r,r,4r\\}$ for some residue $r$ modulo $p$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6980","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":"1309.6980","created_at":"2026-05-18T03:12:09.586924+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.6980v1","created_at":"2026-05-18T03:12:09.586924+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6980","created_at":"2026-05-18T03:12:09.586924+00:00"},{"alias_kind":"pith_short_12","alias_value":"3MTYQQSNXV2W","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"3MTYQQSNXV2WXWEI","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"3MTYQQSN","created_at":"2026-05-18T12:27:32.513160+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/3MTYQQSNXV2WXWEIG3GVYL3QAJ","json":"https://pith.science/pith/3MTYQQSNXV2WXWEIG3GVYL3QAJ.json","graph_json":"https://pith.science/api/pith-number/3MTYQQSNXV2WXWEIG3GVYL3QAJ/graph.json","events_json":"https://pith.science/api/pith-number/3MTYQQSNXV2WXWEIG3GVYL3QAJ/events.json","paper":"https://pith.science/paper/3MTYQQSN"},"agent_actions":{"view_html":"https://pith.science/pith/3MTYQQSNXV2WXWEIG3GVYL3QAJ","download_json":"https://pith.science/pith/3MTYQQSNXV2WXWEIG3GVYL3QAJ.json","view_paper":"https://pith.science/paper/3MTYQQSN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.6980&json=true","fetch_graph":"https://pith.science/api/pith-number/3MTYQQSNXV2WXWEIG3GVYL3QAJ/graph.json","fetch_events":"https://pith.science/api/pith-number/3MTYQQSNXV2WXWEIG3GVYL3QAJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3MTYQQSNXV2WXWEIG3GVYL3QAJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3MTYQQSNXV2WXWEIG3GVYL3QAJ/action/storage_attestation","attest_author":"https://pith.science/pith/3MTYQQSNXV2WXWEIG3GVYL3QAJ/action/author_attestation","sign_citation":"https://pith.science/pith/3MTYQQSNXV2WXWEIG3GVYL3QAJ/action/citation_signature","submit_replication":"https://pith.science/pith/3MTYQQSNXV2WXWEIG3GVYL3QAJ/action/replication_record"}},"created_at":"2026-05-18T03:12:09.586924+00:00","updated_at":"2026-05-18T03:12:09.586924+00:00"}