{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QDJAESEFBNM5AELZM27KV6WRK5","short_pith_number":"pith:QDJAESEF","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"},"canonical_sha256":"80d20248850b59d0117966beaafad15747b2e6319d25b136d75fb15f4bd1eb0d","source":{"kind":"arxiv","id":"1609.08000","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.08000","created_at":"2026-05-18T01:03:54Z"},{"alias_kind":"arxiv_version","alias_value":"1609.08000v1","created_at":"2026-05-18T01:03:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08000","created_at":"2026-05-18T01:03:54Z"},{"alias_kind":"pith_short_12","alias_value":"QDJAESEFBNM5","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"QDJAESEFBNM5AELZ","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"QDJAESEF","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QDJAESEFBNM5AELZM27KV6WRK5","target":"record","payload":{"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"},"canonical_sha256":"80d20248850b59d0117966beaafad15747b2e6319d25b136d75fb15f4bd1eb0d","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"},"source_kind":"arxiv","source_id":"1609.08000","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:03:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z7HpD1kD0/YApSg73vx1z7cesu/oOdhDKysSmCed61HOgtFhyBGZA6YPuhQZITH4SFbx3UFbEUPXfYESLW+UDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:09:18.796430Z"},"content_sha256":"8f5a9d7cc32c15f892289afdb1ed4467cf102a6d78fa4cee5a37d78a764493be","schema_version":"1.0","event_id":"sha256:8f5a9d7cc32c15f892289afdb1ed4467cf102a6d78fa4cee5a37d78a764493be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QDJAESEFBNM5AELZM27KV6WRK5","target":"graph","payload":{"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"},"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:03:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2ZhIdi/eEEe23NDL5e2Sfa8PQaIi33xJhHe0rQflg3P1qkIJnMQzbycwE4J3t/wkK5BAeAdJydGFz28ASvfTCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:09:18.797024Z"},"content_sha256":"431638b4f7d47c6f3dfedf73cc4276c144d718102f1226c7f40147fe989e834e","schema_version":"1.0","event_id":"sha256:431638b4f7d47c6f3dfedf73cc4276c144d718102f1226c7f40147fe989e834e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QDJAESEFBNM5AELZM27KV6WRK5/bundle.json","state_url":"https://pith.science/pith/QDJAESEFBNM5AELZM27KV6WRK5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QDJAESEFBNM5AELZM27KV6WRK5/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-08T17:09:18Z","links":{"resolver":"https://pith.science/pith/QDJAESEFBNM5AELZM27KV6WRK5","bundle":"https://pith.science/pith/QDJAESEFBNM5AELZM27KV6WRK5/bundle.json","state":"https://pith.science/pith/QDJAESEFBNM5AELZM27KV6WRK5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QDJAESEFBNM5AELZM27KV6WRK5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QDJAESEFBNM5AELZM27KV6WRK5","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":"ba34cee40ecacfb5dba64b546ee467a564a83da8c85cd12377b3ba643001cd66","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2016-09-23T07:18:03Z","title_canon_sha256":"34792d6026ea7ef3ee4072e3c3e1b731a0107997c8ba77a1a7cdb3ac64cfcf99"},"schema_version":"1.0","source":{"id":"1609.08000","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.08000","created_at":"2026-05-18T01:03:54Z"},{"alias_kind":"arxiv_version","alias_value":"1609.08000v1","created_at":"2026-05-18T01:03:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08000","created_at":"2026-05-18T01:03:54Z"},{"alias_kind":"pith_short_12","alias_value":"QDJAESEFBNM5","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"QDJAESEFBNM5AELZ","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"QDJAESEF","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:431638b4f7d47c6f3dfedf73cc4276c144d718102f1226c7f40147fe989e834e","target":"graph","created_at":"2026-05-18T01:03:54Z","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":"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...","authors_text":"Jan Kristian Haugland","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2016-09-23T07:18:03Z","title":"The minimum overlap problem revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08000","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:8f5a9d7cc32c15f892289afdb1ed4467cf102a6d78fa4cee5a37d78a764493be","target":"record","created_at":"2026-05-18T01:03:54Z","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":"ba34cee40ecacfb5dba64b546ee467a564a83da8c85cd12377b3ba643001cd66","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2016-09-23T07:18:03Z","title_canon_sha256":"34792d6026ea7ef3ee4072e3c3e1b731a0107997c8ba77a1a7cdb3ac64cfcf99"},"schema_version":"1.0","source":{"id":"1609.08000","kind":"arxiv","version":1}},"canonical_sha256":"80d20248850b59d0117966beaafad15747b2e6319d25b136d75fb15f4bd1eb0d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"80d20248850b59d0117966beaafad15747b2e6319d25b136d75fb15f4bd1eb0d","first_computed_at":"2026-05-18T01:03:54.695293Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:54.695293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5Ss+xguHm8xqs6wKF1mRvSv6CDk/mPuj+zkPMlyBapJpkgnwl6drhC2k6wAL9LSqcLbqTpWYREABmotnTMPsDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:54.696000Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.08000","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f5a9d7cc32c15f892289afdb1ed4467cf102a6d78fa4cee5a37d78a764493be","sha256:431638b4f7d47c6f3dfedf73cc4276c144d718102f1226c7f40147fe989e834e"],"state_sha256":"3c28b541a03b1429842d8bc15c5f9a7774b869a45c83f0b7531d4f6b99558045"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gkO3zeYOFkxyyxpTFYLOkEHHbnY3r+aY+ErLEPzs1IEBK3i/Oe9BJPGMbaV4Tho3qLBBPCCwC7rAfeZxBIc+Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T17:09:18.800867Z","bundle_sha256":"9a8cc162d7f2608041ec108538a832a72b03211cbee4faac48b3469a112af186"}}