{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KRUDZY5IJKMODJPEDEKDDJOFRZ","short_pith_number":"pith:KRUDZY5I","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"},"canonical_sha256":"54683ce3a84a98e1a5e4191431a5c58e446cd17b1d7ebf6f3d74c20c0008bc4f","source":{"kind":"arxiv","id":"1501.06533","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.06533","created_at":"2026-05-18T02:19:52Z"},{"alias_kind":"arxiv_version","alias_value":"1501.06533v2","created_at":"2026-05-18T02:19:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06533","created_at":"2026-05-18T02:19:52Z"},{"alias_kind":"pith_short_12","alias_value":"KRUDZY5IJKMO","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KRUDZY5IJKMODJPE","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KRUDZY5I","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KRUDZY5IJKMODJPEDEKDDJOFRZ","target":"record","payload":{"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"},"canonical_sha256":"54683ce3a84a98e1a5e4191431a5c58e446cd17b1d7ebf6f3d74c20c0008bc4f","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"},"source_kind":"arxiv","source_id":"1501.06533","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:19:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G/aP2sklrxbrQLS49UzLfA53xjuBxh7z3cDCSUl19u9eahwrRNlKGI4l7Hug4IgWWWXFXfOWsbUEdU/Vk1aWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:29:19.718162Z"},"content_sha256":"dcb2e99a77dddf5144d69cb78a7b0aa6b2225fb58f147014ca2c721c474f5ca2","schema_version":"1.0","event_id":"sha256:dcb2e99a77dddf5144d69cb78a7b0aa6b2225fb58f147014ca2c721c474f5ca2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KRUDZY5IJKMODJPEDEKDDJOFRZ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:19:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zndeFusJys458+X/imAJjGQeiPK2T07hFMh63NtobX729+uSHwymsyc4pF1c6ag2lEm+Hcv0vmxJf7KLZmxaCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:29:19.718856Z"},"content_sha256":"7c13c35dee09a46cf54b07e049bcfd077718ff2cd4de964bdfbf1c701f32ff62","schema_version":"1.0","event_id":"sha256:7c13c35dee09a46cf54b07e049bcfd077718ff2cd4de964bdfbf1c701f32ff62"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KRUDZY5IJKMODJPEDEKDDJOFRZ/bundle.json","state_url":"https://pith.science/pith/KRUDZY5IJKMODJPEDEKDDJOFRZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KRUDZY5IJKMODJPEDEKDDJOFRZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T22:29:19Z","links":{"resolver":"https://pith.science/pith/KRUDZY5IJKMODJPEDEKDDJOFRZ","bundle":"https://pith.science/pith/KRUDZY5IJKMODJPEDEKDDJOFRZ/bundle.json","state":"https://pith.science/pith/KRUDZY5IJKMODJPEDEKDDJOFRZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KRUDZY5IJKMODJPEDEKDDJOFRZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KRUDZY5IJKMODJPEDEKDDJOFRZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"df512f38862911afedfb8f2389ffa6cd5780cff104ddfcefafe92857dcf128dd","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-01-26T19:29:13Z","title_canon_sha256":"494860c2b8283bf900a27dd3bde77c3fbc515cc9c40c7c784e8456307b3d18d9"},"schema_version":"1.0","source":{"id":"1501.06533","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.06533","created_at":"2026-05-18T02:19:52Z"},{"alias_kind":"arxiv_version","alias_value":"1501.06533v2","created_at":"2026-05-18T02:19:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06533","created_at":"2026-05-18T02:19:52Z"},{"alias_kind":"pith_short_12","alias_value":"KRUDZY5IJKMO","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KRUDZY5IJKMODJPE","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KRUDZY5I","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:7c13c35dee09a46cf54b07e049bcfd077718ff2cd4de964bdfbf1c701f32ff62","target":"graph","created_at":"2026-05-18T02:19:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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}$.","authors_text":"Francesco Monopoli","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-01-26T19:29:13Z","title":"A generalization of sumsets modulo a prime"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06533","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:dcb2e99a77dddf5144d69cb78a7b0aa6b2225fb58f147014ca2c721c474f5ca2","target":"record","created_at":"2026-05-18T02:19:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"df512f38862911afedfb8f2389ffa6cd5780cff104ddfcefafe92857dcf128dd","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-01-26T19:29:13Z","title_canon_sha256":"494860c2b8283bf900a27dd3bde77c3fbc515cc9c40c7c784e8456307b3d18d9"},"schema_version":"1.0","source":{"id":"1501.06533","kind":"arxiv","version":2}},"canonical_sha256":"54683ce3a84a98e1a5e4191431a5c58e446cd17b1d7ebf6f3d74c20c0008bc4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"54683ce3a84a98e1a5e4191431a5c58e446cd17b1d7ebf6f3d74c20c0008bc4f","first_computed_at":"2026-05-18T02:19:52.350250Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:52.350250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sdTecmePS91Z5tQjI3SZ2nMg40JGS74rHGo/QMBOKPj+ZDYS7VSY/8oZ/gioFP2lNVdaVvgHKTR1vijJIn3RAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:52.350993Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.06533","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dcb2e99a77dddf5144d69cb78a7b0aa6b2225fb58f147014ca2c721c474f5ca2","sha256:7c13c35dee09a46cf54b07e049bcfd077718ff2cd4de964bdfbf1c701f32ff62"],"state_sha256":"9fd2a5351eef91f4632228879f3a9145084d5b15700d6d8a179a5bd5da80b25d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"epUs5/wXBZ4sW/mD5WdnBio11wpFxi5ymhxniSRxE6dzPMh5O4C9DB2T4DBtNQtPTMS5uhu1u8HHo9bZpJjXCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T22:29:19.723048Z","bundle_sha256":"4d49f59e8d39a9e5f77539e0520bcd3557a2abc91f61542eb884d503f100dca0"}}