{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HMJU6RPSTFM5MNZIGQQLQIBURB","short_pith_number":"pith:HMJU6RPS","schema_version":"1.0","canonical_sha256":"3b134f45f29959d637283420b82034885eab13d204880601816f3c4f6dd84a6e","source":{"kind":"arxiv","id":"1604.00661","version":1},"attestation_state":"computed","paper":{"title":"Upper bounds for $B_h[g]$-sets with small $h$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Craig Timmons","submitted_at":"2016-04-03T17:38:48Z","abstract_excerpt":"For $g \\geq 2$ and $h \\geq 3$, we give small improvements on the maximum size of a $B_h[g]$-set contained in the interval $\\{1,2, \\dots , N \\}$. In particular, we show that a $B_3[g]$-set in $\\{1,2, \\dots , N \\}$ has at most $(14.3 g N)^{1/3}$ elements. The previously best known bound was $(16 gN)^{1/3}$ proved by Cilleruelo, Ruzsa, and Trujillo. We also introduce a related optimization problem that may be of independent interest."},"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":"1604.00661","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-03T17:38:48Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"17f7ac9738ad3968668b3e59d4ac068fd3b2b80b515e76979df0397fe0699208","abstract_canon_sha256":"dec1cbfb303653cbbd52d27cfb116c9705e18081b75127e240bbf98338849dbb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:48.753633Z","signature_b64":"1+2KgOvk9eIibDU29piPjHifrb0bOfCEGkheLuGWaxFJUZ+4FfzDWJu5DrfBnrYDgBu1T/aRWF1gTyf7dMVQCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b134f45f29959d637283420b82034885eab13d204880601816f3c4f6dd84a6e","last_reissued_at":"2026-05-18T01:17:48.752973Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:48.752973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Upper bounds for $B_h[g]$-sets with small $h$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Craig Timmons","submitted_at":"2016-04-03T17:38:48Z","abstract_excerpt":"For $g \\geq 2$ and $h \\geq 3$, we give small improvements on the maximum size of a $B_h[g]$-set contained in the interval $\\{1,2, \\dots , N \\}$. In particular, we show that a $B_3[g]$-set in $\\{1,2, \\dots , N \\}$ has at most $(14.3 g N)^{1/3}$ elements. The previously best known bound was $(16 gN)^{1/3}$ proved by Cilleruelo, Ruzsa, and Trujillo. We also introduce a related optimization problem that may be of independent interest."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00661","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":"1604.00661","created_at":"2026-05-18T01:17:48.753067+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.00661v1","created_at":"2026-05-18T01:17:48.753067+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00661","created_at":"2026-05-18T01:17:48.753067+00:00"},{"alias_kind":"pith_short_12","alias_value":"HMJU6RPSTFM5","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"HMJU6RPSTFM5MNZI","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"HMJU6RPS","created_at":"2026-05-18T12:30:19.053100+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/HMJU6RPSTFM5MNZIGQQLQIBURB","json":"https://pith.science/pith/HMJU6RPSTFM5MNZIGQQLQIBURB.json","graph_json":"https://pith.science/api/pith-number/HMJU6RPSTFM5MNZIGQQLQIBURB/graph.json","events_json":"https://pith.science/api/pith-number/HMJU6RPSTFM5MNZIGQQLQIBURB/events.json","paper":"https://pith.science/paper/HMJU6RPS"},"agent_actions":{"view_html":"https://pith.science/pith/HMJU6RPSTFM5MNZIGQQLQIBURB","download_json":"https://pith.science/pith/HMJU6RPSTFM5MNZIGQQLQIBURB.json","view_paper":"https://pith.science/paper/HMJU6RPS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.00661&json=true","fetch_graph":"https://pith.science/api/pith-number/HMJU6RPSTFM5MNZIGQQLQIBURB/graph.json","fetch_events":"https://pith.science/api/pith-number/HMJU6RPSTFM5MNZIGQQLQIBURB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HMJU6RPSTFM5MNZIGQQLQIBURB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HMJU6RPSTFM5MNZIGQQLQIBURB/action/storage_attestation","attest_author":"https://pith.science/pith/HMJU6RPSTFM5MNZIGQQLQIBURB/action/author_attestation","sign_citation":"https://pith.science/pith/HMJU6RPSTFM5MNZIGQQLQIBURB/action/citation_signature","submit_replication":"https://pith.science/pith/HMJU6RPSTFM5MNZIGQQLQIBURB/action/replication_record"}},"created_at":"2026-05-18T01:17:48.753067+00:00","updated_at":"2026-05-18T01:17:48.753067+00:00"}