{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:PYYVPZZO7FQPCHKZWZFOPKUGAY","short_pith_number":"pith:PYYVPZZO","schema_version":"1.0","canonical_sha256":"7e3157e72ef960f11d59b64ae7aa86062e4727255fdf4bc3b889f6f249dccda9","source":{"kind":"arxiv","id":"2505.16105","version":1},"attestation_state":"computed","paper":{"title":"Sums and differences of sets (improvement over AlphaEvolve)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Robert Gerbicz","submitted_at":"2025-05-22T01:19:35Z","abstract_excerpt":"On May 14, 2025, DeepMind announced that AlphaEvolve, a large language model applied to a set of mathematical problems, had matched or exceeded the best known bounds on several problems. In the case of the sum and difference of sets problem, AlphaEvolve, using a set of $54265$ integers, improved the known lower bound of $\\theta=1.14465$ to $\\theta=1.1584$. In this paper, we present an improved bound $\\theta=1.173050$ using an explicit construction of a U set that contains more than $10^{43546}$ elements. For fast integer and floating-point arithmetic, we used the (free) GMP library."},"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":"2505.16105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2025-05-22T01:19:35Z","cross_cats_sorted":[],"title_canon_sha256":"e11eccb891ea73e7ff50fc16f8824fd353ee5be587550fe3a48731476d6f7ba8","abstract_canon_sha256":"83e9568e73a283bd6ea50cf4676c40727bdd0b438d48bbdda547b5f06fb601f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:07:29.990657Z","signature_b64":"qVUPf4OGPh5z3dEF88cOyMHk1LkgFoORqvn5nQcXl5A/s8+j8QjzJsLffoHt26OaCHtvLRZlKUJg7j5hGLHiDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e3157e72ef960f11d59b64ae7aa86062e4727255fdf4bc3b889f6f249dccda9","last_reissued_at":"2026-07-05T11:07:29.990188Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:07:29.990188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sums and differences of sets (improvement over AlphaEvolve)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Robert Gerbicz","submitted_at":"2025-05-22T01:19:35Z","abstract_excerpt":"On May 14, 2025, DeepMind announced that AlphaEvolve, a large language model applied to a set of mathematical problems, had matched or exceeded the best known bounds on several problems. In the case of the sum and difference of sets problem, AlphaEvolve, using a set of $54265$ integers, improved the known lower bound of $\\theta=1.14465$ to $\\theta=1.1584$. In this paper, we present an improved bound $\\theta=1.173050$ using an explicit construction of a U set that contains more than $10^{43546}$ elements. For fast integer and floating-point arithmetic, we used the (free) GMP library."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.16105","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.16105/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2505.16105","created_at":"2026-07-05T11:07:29.990242+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.16105v1","created_at":"2026-07-05T11:07:29.990242+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.16105","created_at":"2026-07-05T11:07:29.990242+00:00"},{"alias_kind":"pith_short_12","alias_value":"PYYVPZZO7FQP","created_at":"2026-07-05T11:07:29.990242+00:00"},{"alias_kind":"pith_short_16","alias_value":"PYYVPZZO7FQPCHKZ","created_at":"2026-07-05T11:07:29.990242+00:00"},{"alias_kind":"pith_short_8","alias_value":"PYYVPZZO","created_at":"2026-07-05T11:07:29.990242+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2511.02864","citing_title":"Mathematical exploration and discovery at scale","ref_index":140,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PYYVPZZO7FQPCHKZWZFOPKUGAY","json":"https://pith.science/pith/PYYVPZZO7FQPCHKZWZFOPKUGAY.json","graph_json":"https://pith.science/api/pith-number/PYYVPZZO7FQPCHKZWZFOPKUGAY/graph.json","events_json":"https://pith.science/api/pith-number/PYYVPZZO7FQPCHKZWZFOPKUGAY/events.json","paper":"https://pith.science/paper/PYYVPZZO"},"agent_actions":{"view_html":"https://pith.science/pith/PYYVPZZO7FQPCHKZWZFOPKUGAY","download_json":"https://pith.science/pith/PYYVPZZO7FQPCHKZWZFOPKUGAY.json","view_paper":"https://pith.science/paper/PYYVPZZO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.16105&json=true","fetch_graph":"https://pith.science/api/pith-number/PYYVPZZO7FQPCHKZWZFOPKUGAY/graph.json","fetch_events":"https://pith.science/api/pith-number/PYYVPZZO7FQPCHKZWZFOPKUGAY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PYYVPZZO7FQPCHKZWZFOPKUGAY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PYYVPZZO7FQPCHKZWZFOPKUGAY/action/storage_attestation","attest_author":"https://pith.science/pith/PYYVPZZO7FQPCHKZWZFOPKUGAY/action/author_attestation","sign_citation":"https://pith.science/pith/PYYVPZZO7FQPCHKZWZFOPKUGAY/action/citation_signature","submit_replication":"https://pith.science/pith/PYYVPZZO7FQPCHKZWZFOPKUGAY/action/replication_record"}},"created_at":"2026-07-05T11:07:29.990242+00:00","updated_at":"2026-07-05T11:07:29.990242+00:00"}