{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:COS77S6VRAABHYBXBA7Z6VSNSB","short_pith_number":"pith:COS77S6V","canonical_record":{"source":{"id":"1603.06553","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-03-21T19:37:20Z","cross_cats_sorted":[],"title_canon_sha256":"60159bef8d0860155b41ec6dbcca379ee91bb7bdc3d7547dab785f6982624385","abstract_canon_sha256":"bf1ad54eecb85769ac8ce969eb9d85c8c4c4b56fc91834210050b4e383fd328d"},"schema_version":"1.0"},"canonical_sha256":"13a5ffcbd5880013e037083f9f564d90686bd39bc34d6e9a7addffd7d54081eb","source":{"kind":"arxiv","id":"1603.06553","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.06553","created_at":"2026-05-18T01:18:48Z"},{"alias_kind":"arxiv_version","alias_value":"1603.06553v1","created_at":"2026-05-18T01:18:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06553","created_at":"2026-05-18T01:18:48Z"},{"alias_kind":"pith_short_12","alias_value":"COS77S6VRAAB","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"COS77S6VRAABHYBX","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"COS77S6V","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:COS77S6VRAABHYBXBA7Z6VSNSB","target":"record","payload":{"canonical_record":{"source":{"id":"1603.06553","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-03-21T19:37:20Z","cross_cats_sorted":[],"title_canon_sha256":"60159bef8d0860155b41ec6dbcca379ee91bb7bdc3d7547dab785f6982624385","abstract_canon_sha256":"bf1ad54eecb85769ac8ce969eb9d85c8c4c4b56fc91834210050b4e383fd328d"},"schema_version":"1.0"},"canonical_sha256":"13a5ffcbd5880013e037083f9f564d90686bd39bc34d6e9a7addffd7d54081eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:48.294168Z","signature_b64":"h6gwa7r0CnUXvCeTKpPniMDs+fCm8an0SE3sIyz+i6xWFhAAw8esLeX0ltTrSDM9KWw77+Y5yQqSZ1gWCTMvDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13a5ffcbd5880013e037083f9f564d90686bd39bc34d6e9a7addffd7d54081eb","last_reissued_at":"2026-05-18T01:18:48.293677Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:48.293677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.06553","source_version":1,"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-18T01:18:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c0NcfafzEhP/z5T//h/KOcwsefSF2g3NOpVTdUsn8yOf7Dfaba/WeZOg7scQ4RhNs/IWdzuj/6S5JXZ9FUjDDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:17:17.666540Z"},"content_sha256":"3e39293f2c285b27d613a0af486b284810d280d6db120a209eebc44c67848e95","schema_version":"1.0","event_id":"sha256:3e39293f2c285b27d613a0af486b284810d280d6db120a209eebc44c67848e95"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:COS77S6VRAABHYBXBA7Z6VSNSB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Asymptotic Approximate Groups of Integers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Bela Bajnok","submitted_at":"2016-03-21T19:37:20Z","abstract_excerpt":"Let $r$ be a positive integer, and let $A$ be a nonempty finite set of at least two integers. We let $\\tilde{C}_r(A)$ denote the {\\em asymptotic $r$-covering number} of $A$, that is, the smallest integer value of $l$ for which, for all sufficiently large positive integers $h$, the $rh$-fold sumset of $A$ is contained in at most $l$ translates of the $h$-fold sumset of $A$. Nathanson proved that $\\tilde{C}_r(A)$ is always at most $r+1$; here we extend this result to prove that $\\tilde{C}_r(A)$ is always at least $r$, and determine all sets $A$ for which $\\tilde{C}_r(A)=r$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06553","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"},"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-18T01:18:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c5qgSmAJJ7M7VxsnM7MF5k2Kt3QT7fbnaq/t0E7XnwvsN/uMo3fHJYcSJCXhLkwqwh8XJ3PwhSh8lSsDsyDFDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:17:17.667214Z"},"content_sha256":"584661713ec42fb9501306d5023f725bca164740465dd760838f18d414f73d62","schema_version":"1.0","event_id":"sha256:584661713ec42fb9501306d5023f725bca164740465dd760838f18d414f73d62"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/COS77S6VRAABHYBXBA7Z6VSNSB/bundle.json","state_url":"https://pith.science/pith/COS77S6VRAABHYBXBA7Z6VSNSB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/COS77S6VRAABHYBXBA7Z6VSNSB/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-06-06T15:17:17Z","links":{"resolver":"https://pith.science/pith/COS77S6VRAABHYBXBA7Z6VSNSB","bundle":"https://pith.science/pith/COS77S6VRAABHYBXBA7Z6VSNSB/bundle.json","state":"https://pith.science/pith/COS77S6VRAABHYBXBA7Z6VSNSB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/COS77S6VRAABHYBXBA7Z6VSNSB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:COS77S6VRAABHYBXBA7Z6VSNSB","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":"bf1ad54eecb85769ac8ce969eb9d85c8c4c4b56fc91834210050b4e383fd328d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-03-21T19:37:20Z","title_canon_sha256":"60159bef8d0860155b41ec6dbcca379ee91bb7bdc3d7547dab785f6982624385"},"schema_version":"1.0","source":{"id":"1603.06553","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.06553","created_at":"2026-05-18T01:18:48Z"},{"alias_kind":"arxiv_version","alias_value":"1603.06553v1","created_at":"2026-05-18T01:18:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06553","created_at":"2026-05-18T01:18:48Z"},{"alias_kind":"pith_short_12","alias_value":"COS77S6VRAAB","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"COS77S6VRAABHYBX","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"COS77S6V","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:584661713ec42fb9501306d5023f725bca164740465dd760838f18d414f73d62","target":"graph","created_at":"2026-05-18T01:18:48Z","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 $r$ be a positive integer, and let $A$ be a nonempty finite set of at least two integers. We let $\\tilde{C}_r(A)$ denote the {\\em asymptotic $r$-covering number} of $A$, that is, the smallest integer value of $l$ for which, for all sufficiently large positive integers $h$, the $rh$-fold sumset of $A$ is contained in at most $l$ translates of the $h$-fold sumset of $A$. Nathanson proved that $\\tilde{C}_r(A)$ is always at most $r+1$; here we extend this result to prove that $\\tilde{C}_r(A)$ is always at least $r$, and determine all sets $A$ for which $\\tilde{C}_r(A)=r$.","authors_text":"Bela Bajnok","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-03-21T19:37:20Z","title":"On Asymptotic Approximate Groups of Integers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06553","kind":"arxiv","version":1},"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:3e39293f2c285b27d613a0af486b284810d280d6db120a209eebc44c67848e95","target":"record","created_at":"2026-05-18T01:18:48Z","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":"bf1ad54eecb85769ac8ce969eb9d85c8c4c4b56fc91834210050b4e383fd328d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-03-21T19:37:20Z","title_canon_sha256":"60159bef8d0860155b41ec6dbcca379ee91bb7bdc3d7547dab785f6982624385"},"schema_version":"1.0","source":{"id":"1603.06553","kind":"arxiv","version":1}},"canonical_sha256":"13a5ffcbd5880013e037083f9f564d90686bd39bc34d6e9a7addffd7d54081eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13a5ffcbd5880013e037083f9f564d90686bd39bc34d6e9a7addffd7d54081eb","first_computed_at":"2026-05-18T01:18:48.293677Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:48.293677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h6gwa7r0CnUXvCeTKpPniMDs+fCm8an0SE3sIyz+i6xWFhAAw8esLeX0ltTrSDM9KWw77+Y5yQqSZ1gWCTMvDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:48.294168Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.06553","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e39293f2c285b27d613a0af486b284810d280d6db120a209eebc44c67848e95","sha256:584661713ec42fb9501306d5023f725bca164740465dd760838f18d414f73d62"],"state_sha256":"614286c8f4bcadfbc76b2004db8efd141e10c6ed2e6959f5ecc0c47d228f71fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pzn6+o9xWyLsCekCI2KUyNynx7RvlnRJ1DHBjY9UNudKSgQHAlX3iO72uN2iJpyvLaLdEerKOTadjQMwAVWjBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T15:17:17.670946Z","bundle_sha256":"0e8172e28cc28f8815015c8bf3d5892af181555cb46c644a07b4c8fa068455d3"}}