{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:H6FIRHLSANCFTZIYVAOJFZBXCF","short_pith_number":"pith:H6FIRHLS","schema_version":"1.0","canonical_sha256":"3f8a889d72034459e518a81c92e4371149616438374a5848889f2c4195558efb","source":{"kind":"arxiv","id":"1609.02771","version":3},"attestation_state":"computed","paper":{"title":"A numerical note on upper bounds for b 2 [g] sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Alain Plagne (CMLS), Laurent Habsieger (ICJ)","submitted_at":"2016-09-09T12:49:32Z","abstract_excerpt":"Sidon sets are those sets such that the sums of two of its elements never coincide. They go back to the 30s when Sidon asked for the maximal size of a subset of consecutive integers with that property. This question is now answered in a satisfactory way. Their natural generalization, called B 2 [g] sets and defined by the fact that there are at most g ways (up to reordering the summands) to represent a given integer as a sum of two elements of the set, are much more difficult to handle and not as well understood. In this article, using a numerical approach, we improve the best upper estimates "},"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":"1609.02771","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-09-09T12:49:32Z","cross_cats_sorted":[],"title_canon_sha256":"129fd54a8ccd1a994ac27799f4679633dee7e6f6fe8da197f3ca1440873098c6","abstract_canon_sha256":"de1a5fc74d4095f235b0194de36c66f8a5168f069eb7d6febd726de2673b0b04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:44.168499Z","signature_b64":"A2Xr+6kae4xPFaB1YtkynN2y1QxPN8nB0vtw5fL0xQ0S31G1ojwr5SIym+VfH6Iau9k5OLQNYqyfFsulCxk/DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f8a889d72034459e518a81c92e4371149616438374a5848889f2c4195558efb","last_reissued_at":"2026-05-18T00:59:44.167803Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:44.167803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A numerical note on upper bounds for b 2 [g] sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Alain Plagne (CMLS), Laurent Habsieger (ICJ)","submitted_at":"2016-09-09T12:49:32Z","abstract_excerpt":"Sidon sets are those sets such that the sums of two of its elements never coincide. They go back to the 30s when Sidon asked for the maximal size of a subset of consecutive integers with that property. This question is now answered in a satisfactory way. Their natural generalization, called B 2 [g] sets and defined by the fact that there are at most g ways (up to reordering the summands) to represent a given integer as a sum of two elements of the set, are much more difficult to handle and not as well understood. In this article, using a numerical approach, we improve the best upper estimates "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.02771","kind":"arxiv","version":3},"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":"1609.02771","created_at":"2026-05-18T00:59:44.167924+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.02771v3","created_at":"2026-05-18T00:59:44.167924+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.02771","created_at":"2026-05-18T00:59:44.167924+00:00"},{"alias_kind":"pith_short_12","alias_value":"H6FIRHLSANCF","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"H6FIRHLSANCFTZIY","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"H6FIRHLS","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/H6FIRHLSANCFTZIYVAOJFZBXCF","json":"https://pith.science/pith/H6FIRHLSANCFTZIYVAOJFZBXCF.json","graph_json":"https://pith.science/api/pith-number/H6FIRHLSANCFTZIYVAOJFZBXCF/graph.json","events_json":"https://pith.science/api/pith-number/H6FIRHLSANCFTZIYVAOJFZBXCF/events.json","paper":"https://pith.science/paper/H6FIRHLS"},"agent_actions":{"view_html":"https://pith.science/pith/H6FIRHLSANCFTZIYVAOJFZBXCF","download_json":"https://pith.science/pith/H6FIRHLSANCFTZIYVAOJFZBXCF.json","view_paper":"https://pith.science/paper/H6FIRHLS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.02771&json=true","fetch_graph":"https://pith.science/api/pith-number/H6FIRHLSANCFTZIYVAOJFZBXCF/graph.json","fetch_events":"https://pith.science/api/pith-number/H6FIRHLSANCFTZIYVAOJFZBXCF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H6FIRHLSANCFTZIYVAOJFZBXCF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H6FIRHLSANCFTZIYVAOJFZBXCF/action/storage_attestation","attest_author":"https://pith.science/pith/H6FIRHLSANCFTZIYVAOJFZBXCF/action/author_attestation","sign_citation":"https://pith.science/pith/H6FIRHLSANCFTZIYVAOJFZBXCF/action/citation_signature","submit_replication":"https://pith.science/pith/H6FIRHLSANCFTZIYVAOJFZBXCF/action/replication_record"}},"created_at":"2026-05-18T00:59:44.167924+00:00","updated_at":"2026-05-18T00:59:44.167924+00:00"}