{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QDJAESEFBNM5AELZM27KV6WRK5","short_pith_number":"pith:QDJAESEF","schema_version":"1.0","canonical_sha256":"80d20248850b59d0117966beaafad15747b2e6319d25b136d75fb15f4bd1eb0d","source":{"kind":"arxiv","id":"1609.08000","version":1},"attestation_state":"computed","paper":{"title":"The minimum overlap problem revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Jan Kristian Haugland","submitted_at":"2016-09-23T07:18:03Z","abstract_excerpt":"For a given partition of (1, 2, ..., 2n) into two disjoint subsets A and B with n elements in each, consider the maximum number of times any integer occurs as the difference between an element of A and an element of B. The minimum value of this maximum (over all partitions) is denoted by M(n). By a result of Swinnerton-Dyer, one way to estimate lim M(n)/n from above is to give step functions that describe the density of A, say, throughout the interval [1, 2n] for a large n rather than looking for explicit partitions. A step function that improves the upper bound from 0.382002... to 0.380926..."},"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.08000","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2016-09-23T07:18:03Z","cross_cats_sorted":[],"title_canon_sha256":"34792d6026ea7ef3ee4072e3c3e1b731a0107997c8ba77a1a7cdb3ac64cfcf99","abstract_canon_sha256":"ba34cee40ecacfb5dba64b546ee467a564a83da8c85cd12377b3ba643001cd66"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:54.696000Z","signature_b64":"5Ss+xguHm8xqs6wKF1mRvSv6CDk/mPuj+zkPMlyBapJpkgnwl6drhC2k6wAL9LSqcLbqTpWYREABmotnTMPsDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80d20248850b59d0117966beaafad15747b2e6319d25b136d75fb15f4bd1eb0d","last_reissued_at":"2026-05-18T01:03:54.695293Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:54.695293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The minimum overlap problem revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Jan Kristian Haugland","submitted_at":"2016-09-23T07:18:03Z","abstract_excerpt":"For a given partition of (1, 2, ..., 2n) into two disjoint subsets A and B with n elements in each, consider the maximum number of times any integer occurs as the difference between an element of A and an element of B. The minimum value of this maximum (over all partitions) is denoted by M(n). By a result of Swinnerton-Dyer, one way to estimate lim M(n)/n from above is to give step functions that describe the density of A, say, throughout the interval [1, 2n] for a large n rather than looking for explicit partitions. A step function that improves the upper bound from 0.382002... to 0.380926..."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08000","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":"1609.08000","created_at":"2026-05-18T01:03:54.695412+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.08000v1","created_at":"2026-05-18T01:03:54.695412+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08000","created_at":"2026-05-18T01:03:54.695412+00:00"},{"alias_kind":"pith_short_12","alias_value":"QDJAESEFBNM5","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"QDJAESEFBNM5AELZ","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"QDJAESEF","created_at":"2026-05-18T12:30:39.010887+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2104.05258","citing_title":"On the Gap sequence and the Gilbreath conjecture","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2511.02864","citing_title":"Mathematical exploration and discovery at scale","ref_index":166,"is_internal_anchor":true},{"citing_arxiv_id":"2601.16175","citing_title":"Learning to Discover at Test Time","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2604.19341","citing_title":"Evaluation-driven Scaling for Scientific Discovery","ref_index":46,"is_internal_anchor":false},{"citing_arxiv_id":"2506.13131","citing_title":"AlphaEvolve: A coding agent for scientific and algorithmic discovery","ref_index":40,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QDJAESEFBNM5AELZM27KV6WRK5","json":"https://pith.science/pith/QDJAESEFBNM5AELZM27KV6WRK5.json","graph_json":"https://pith.science/api/pith-number/QDJAESEFBNM5AELZM27KV6WRK5/graph.json","events_json":"https://pith.science/api/pith-number/QDJAESEFBNM5AELZM27KV6WRK5/events.json","paper":"https://pith.science/paper/QDJAESEF"},"agent_actions":{"view_html":"https://pith.science/pith/QDJAESEFBNM5AELZM27KV6WRK5","download_json":"https://pith.science/pith/QDJAESEFBNM5AELZM27KV6WRK5.json","view_paper":"https://pith.science/paper/QDJAESEF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.08000&json=true","fetch_graph":"https://pith.science/api/pith-number/QDJAESEFBNM5AELZM27KV6WRK5/graph.json","fetch_events":"https://pith.science/api/pith-number/QDJAESEFBNM5AELZM27KV6WRK5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QDJAESEFBNM5AELZM27KV6WRK5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QDJAESEFBNM5AELZM27KV6WRK5/action/storage_attestation","attest_author":"https://pith.science/pith/QDJAESEFBNM5AELZM27KV6WRK5/action/author_attestation","sign_citation":"https://pith.science/pith/QDJAESEFBNM5AELZM27KV6WRK5/action/citation_signature","submit_replication":"https://pith.science/pith/QDJAESEFBNM5AELZM27KV6WRK5/action/replication_record"}},"created_at":"2026-05-18T01:03:54.695412+00:00","updated_at":"2026-05-18T01:03:54.695412+00:00"}