{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KRUDZY5IJKMODJPEDEKDDJOFRZ","short_pith_number":"pith:KRUDZY5I","schema_version":"1.0","canonical_sha256":"54683ce3a84a98e1a5e4191431a5c58e446cd17b1d7ebf6f3d74c20c0008bc4f","source":{"kind":"arxiv","id":"1501.06533","version":2},"attestation_state":"computed","paper":{"title":"A generalization of sumsets modulo a prime","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Francesco Monopoli","submitted_at":"2015-01-26T19:29:13Z","abstract_excerpt":"Let $A$ be a set in an abelian group $G$. For integers $h,r \\geq 1$ the generalized $h$-fold sumset, denoted by $h^{(r)}A$, is the set of sums of $h$ elements of $A$, where each element appears in the sum at most $r$ times. If $G=\\mathbb{Z}$ lower bounds for $|h^{(r)}A|$ are known, as well as the structure of the sets of integers for which $|h^{(r)}A|$ is minimal. In this paper we generalize this result by giving a lower bound for $|h^{(r)}A|$ when $G=\\mathbb{Z}/p\\mathbb{Z}$ for a prime $p$, and show new proofs for the direct and inverse problems in $\\mathbb{Z}$."},"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":"1501.06533","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-01-26T19:29:13Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"494860c2b8283bf900a27dd3bde77c3fbc515cc9c40c7c784e8456307b3d18d9","abstract_canon_sha256":"df512f38862911afedfb8f2389ffa6cd5780cff104ddfcefafe92857dcf128dd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:52.350993Z","signature_b64":"sdTecmePS91Z5tQjI3SZ2nMg40JGS74rHGo/QMBOKPj+ZDYS7VSY/8oZ/gioFP2lNVdaVvgHKTR1vijJIn3RAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54683ce3a84a98e1a5e4191431a5c58e446cd17b1d7ebf6f3d74c20c0008bc4f","last_reissued_at":"2026-05-18T02:19:52.350250Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:52.350250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A generalization of sumsets modulo a prime","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Francesco Monopoli","submitted_at":"2015-01-26T19:29:13Z","abstract_excerpt":"Let $A$ be a set in an abelian group $G$. For integers $h,r \\geq 1$ the generalized $h$-fold sumset, denoted by $h^{(r)}A$, is the set of sums of $h$ elements of $A$, where each element appears in the sum at most $r$ times. If $G=\\mathbb{Z}$ lower bounds for $|h^{(r)}A|$ are known, as well as the structure of the sets of integers for which $|h^{(r)}A|$ is minimal. In this paper we generalize this result by giving a lower bound for $|h^{(r)}A|$ when $G=\\mathbb{Z}/p\\mathbb{Z}$ for a prime $p$, and show new proofs for the direct and inverse problems in $\\mathbb{Z}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06533","kind":"arxiv","version":2},"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":"1501.06533","created_at":"2026-05-18T02:19:52.350354+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.06533v2","created_at":"2026-05-18T02:19:52.350354+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06533","created_at":"2026-05-18T02:19:52.350354+00:00"},{"alias_kind":"pith_short_12","alias_value":"KRUDZY5IJKMO","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"KRUDZY5IJKMODJPE","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"KRUDZY5I","created_at":"2026-05-18T12:29:29.992203+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/KRUDZY5IJKMODJPEDEKDDJOFRZ","json":"https://pith.science/pith/KRUDZY5IJKMODJPEDEKDDJOFRZ.json","graph_json":"https://pith.science/api/pith-number/KRUDZY5IJKMODJPEDEKDDJOFRZ/graph.json","events_json":"https://pith.science/api/pith-number/KRUDZY5IJKMODJPEDEKDDJOFRZ/events.json","paper":"https://pith.science/paper/KRUDZY5I"},"agent_actions":{"view_html":"https://pith.science/pith/KRUDZY5IJKMODJPEDEKDDJOFRZ","download_json":"https://pith.science/pith/KRUDZY5IJKMODJPEDEKDDJOFRZ.json","view_paper":"https://pith.science/paper/KRUDZY5I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.06533&json=true","fetch_graph":"https://pith.science/api/pith-number/KRUDZY5IJKMODJPEDEKDDJOFRZ/graph.json","fetch_events":"https://pith.science/api/pith-number/KRUDZY5IJKMODJPEDEKDDJOFRZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KRUDZY5IJKMODJPEDEKDDJOFRZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KRUDZY5IJKMODJPEDEKDDJOFRZ/action/storage_attestation","attest_author":"https://pith.science/pith/KRUDZY5IJKMODJPEDEKDDJOFRZ/action/author_attestation","sign_citation":"https://pith.science/pith/KRUDZY5IJKMODJPEDEKDDJOFRZ/action/citation_signature","submit_replication":"https://pith.science/pith/KRUDZY5IJKMODJPEDEKDDJOFRZ/action/replication_record"}},"created_at":"2026-05-18T02:19:52.350354+00:00","updated_at":"2026-05-18T02:19:52.350354+00:00"}