{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ID72A2MUMPY4VURYWKSU62RP4X","short_pith_number":"pith:ID72A2MU","canonical_record":{"source":{"id":"2605.00816","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-01T17:55:19Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"24b2cdb0336d1ee2082c102eea03e8341e27444ed8ecdc5d5590d7c8851e32e1","abstract_canon_sha256":"b2c472b84b87b6f68f0a38c6713155e35083e26da8217737a927d525148d31ce"},"schema_version":"1.0"},"canonical_sha256":"40ffa0699463f1cad238b2a54f6a2fe5e3abec6df244410238a9e93144760191","source":{"kind":"arxiv","id":"2605.00816","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.00816","created_at":"2026-06-19T16:10:37Z"},{"alias_kind":"arxiv_version","alias_value":"2605.00816v2","created_at":"2026-06-19T16:10:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.00816","created_at":"2026-06-19T16:10:37Z"},{"alias_kind":"pith_short_12","alias_value":"ID72A2MUMPY4","created_at":"2026-06-19T16:10:37Z"},{"alias_kind":"pith_short_16","alias_value":"ID72A2MUMPY4VURY","created_at":"2026-06-19T16:10:37Z"},{"alias_kind":"pith_short_8","alias_value":"ID72A2MU","created_at":"2026-06-19T16:10:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ID72A2MUMPY4VURYWKSU62RP4X","target":"record","payload":{"canonical_record":{"source":{"id":"2605.00816","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-01T17:55:19Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"24b2cdb0336d1ee2082c102eea03e8341e27444ed8ecdc5d5590d7c8851e32e1","abstract_canon_sha256":"b2c472b84b87b6f68f0a38c6713155e35083e26da8217737a927d525148d31ce"},"schema_version":"1.0"},"canonical_sha256":"40ffa0699463f1cad238b2a54f6a2fe5e3abec6df244410238a9e93144760191","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:10:37.947581Z","signature_b64":"SfKzjzcwN6IcbJqayzNobIqH1Uhla4TGeVEViyrhOXdtPAoRdgSLvc6nUhyXuAQh1Rt2WrrIKyHCtX6bnlO5BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40ffa0699463f1cad238b2a54f6a2fe5e3abec6df244410238a9e93144760191","last_reissued_at":"2026-06-19T16:10:37.947116Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:10:37.947116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.00816","source_version":2,"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-06-19T16:10:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AnEPqIyi4oxr9cUvi7Jokr2gUvJOlkyT1x345sbjfyNb+iJYBn7Pvf7ExI/12SDyY0Ha8tp/sa90Ms5JDkFQBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T12:19:49.994907Z"},"content_sha256":"a1f2c0529086b014d4f514d32a3b1bcc6d925ebdb9bc8fd49dea20a0f541be66","schema_version":"1.0","event_id":"sha256:a1f2c0529086b014d4f514d32a3b1bcc6d925ebdb9bc8fd49dea20a0f541be66"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ID72A2MUMPY4VURYWKSU62RP4X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the largest sum-free subset of the lattice cube","license":"http://creativecommons.org/licenses/by/4.0/","headline":"The largest sum-free subset of the lattice cube {1,2,...,n}^d has limiting density given by two hyperplane slices for every dimension d.","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Jeck Lim, Peter Keevash","submitted_at":"2026-05-01T17:55:19Z","abstract_excerpt":"We determine the limiting density of the largest sum-free subset of the lattice cube $\\{1,2,\\ldots,n\\}^d$ for all $d$, thus resolving the natural conjecture that it is constructed by two appropriate hyperplane slices. Equivalently, we show that the largest measure of a sum-free subset of the hypercube $(0,1)^d\\subset \\mathbb{R}^d$ is attained by $\\setcond{x\\in (0,1)^d}{1\\leq L(x)<2}$ for some linear map $L:\\mathbb{R}^d\\to \\mathbb{R}$. It is natural to conjecture that the same phenomenon might hold if one replaces the hypercube by any convex set not containing the origin, but we give an example"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We determine the limiting density of the largest sum-free subset of the lattice cube {1,2,…,n}^d for all d, thus resolving the natural conjecture that it is constructed by two appropriate hyperplane slices.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the limiting density exists and is attained precisely by the two-hyperplane construction; the abstract provides no details on the proof techniques or any potential gaps in the argument.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The limiting density of the largest sum-free subset of {1,2,…,n}^d is achieved by two appropriate hyperplane slices for every dimension d.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The largest sum-free subset of the lattice cube {1,2,...,n}^d has limiting density given by two hyperplane slices for every dimension d.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"7336f13e37d6e0f8e5dd807c6c739da4ee3db3ec68ed694db64150980d722852"},"source":{"id":"2605.00816","kind":"arxiv","version":2},"verdict":{"id":"94df368d-8760-45ca-8dad-89852530ecd6","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-09T18:36:39.169989Z","strongest_claim":"We determine the limiting density of the largest sum-free subset of the lattice cube {1,2,…,n}^d for all d, thus resolving the natural conjecture that it is constructed by two appropriate hyperplane slices.","one_line_summary":"The limiting density of the largest sum-free subset of {1,2,…,n}^d is achieved by two appropriate hyperplane slices for every dimension d.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the limiting density exists and is attained precisely by the two-hyperplane construction; the abstract provides no details on the proof techniques or any potential gaps in the argument.","pith_extraction_headline":"The largest sum-free subset of the lattice cube {1,2,...,n}^d has limiting density given by two hyperplane slices for every dimension d."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.00816/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T18:41:01.900437Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T17:48:49.893924Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"0a93942065caf64e441b042e3334b635f55cf0d0d657a198745dba1d78b8645f"},"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":"94df368d-8760-45ca-8dad-89852530ecd6"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-19T16:10:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vqol/2yFfYpjEkrlm2RPUy/cCLWzVdjV2dpQzdp88BzIeRmofOLDnLTAXrP/OTyDALYTx2b8KK+0KlaCjBznDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T12:19:49.995444Z"},"content_sha256":"55633bfffd8ffe7c4204d11f86ce8227a031ea832d422444a509bd8fbc876090","schema_version":"1.0","event_id":"sha256:55633bfffd8ffe7c4204d11f86ce8227a031ea832d422444a509bd8fbc876090"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ID72A2MUMPY4VURYWKSU62RP4X/bundle.json","state_url":"https://pith.science/pith/ID72A2MUMPY4VURYWKSU62RP4X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ID72A2MUMPY4VURYWKSU62RP4X/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-07-05T12:19:49Z","links":{"resolver":"https://pith.science/pith/ID72A2MUMPY4VURYWKSU62RP4X","bundle":"https://pith.science/pith/ID72A2MUMPY4VURYWKSU62RP4X/bundle.json","state":"https://pith.science/pith/ID72A2MUMPY4VURYWKSU62RP4X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ID72A2MUMPY4VURYWKSU62RP4X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ID72A2MUMPY4VURYWKSU62RP4X","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":"b2c472b84b87b6f68f0a38c6713155e35083e26da8217737a927d525148d31ce","cross_cats_sorted":["math.NT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-01T17:55:19Z","title_canon_sha256":"24b2cdb0336d1ee2082c102eea03e8341e27444ed8ecdc5d5590d7c8851e32e1"},"schema_version":"1.0","source":{"id":"2605.00816","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.00816","created_at":"2026-06-19T16:10:37Z"},{"alias_kind":"arxiv_version","alias_value":"2605.00816v2","created_at":"2026-06-19T16:10:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.00816","created_at":"2026-06-19T16:10:37Z"},{"alias_kind":"pith_short_12","alias_value":"ID72A2MUMPY4","created_at":"2026-06-19T16:10:37Z"},{"alias_kind":"pith_short_16","alias_value":"ID72A2MUMPY4VURY","created_at":"2026-06-19T16:10:37Z"},{"alias_kind":"pith_short_8","alias_value":"ID72A2MU","created_at":"2026-06-19T16:10:37Z"}],"graph_snapshots":[{"event_id":"sha256:55633bfffd8ffe7c4204d11f86ce8227a031ea832d422444a509bd8fbc876090","target":"graph","created_at":"2026-06-19T16:10:37Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We determine the limiting density of the largest sum-free subset of the lattice cube {1,2,…,n}^d for all d, thus resolving the natural conjecture that it is constructed by two appropriate hyperplane slices."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the limiting density exists and is attained precisely by the two-hyperplane construction; the abstract provides no details on the proof techniques or any potential gaps in the argument."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The limiting density of the largest sum-free subset of {1,2,…,n}^d is achieved by two appropriate hyperplane slices for every dimension d."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The largest sum-free subset of the lattice cube {1,2,...,n}^d has limiting density given by two hyperplane slices for every dimension d."}],"snapshot_sha256":"7336f13e37d6e0f8e5dd807c6c739da4ee3db3ec68ed694db64150980d722852"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-20T18:41:01.900437Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T17:48:49.893924Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.00816/integrity.json","findings":[],"snapshot_sha256":"0a93942065caf64e441b042e3334b635f55cf0d0d657a198745dba1d78b8645f","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We determine the limiting density of the largest sum-free subset of the lattice cube $\\{1,2,\\ldots,n\\}^d$ for all $d$, thus resolving the natural conjecture that it is constructed by two appropriate hyperplane slices. Equivalently, we show that the largest measure of a sum-free subset of the hypercube $(0,1)^d\\subset \\mathbb{R}^d$ is attained by $\\setcond{x\\in (0,1)^d}{1\\leq L(x)<2}$ for some linear map $L:\\mathbb{R}^d\\to \\mathbb{R}$. It is natural to conjecture that the same phenomenon might hold if one replaces the hypercube by any convex set not containing the origin, but we give an example","authors_text":"Jeck Lim, Peter Keevash","cross_cats":["math.NT"],"headline":"The largest sum-free subset of the lattice cube {1,2,...,n}^d has limiting density given by two hyperplane slices for every dimension d.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-01T17:55:19Z","title":"On the largest sum-free subset of the lattice cube"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.00816","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-09T18:36:39.169989Z","id":"94df368d-8760-45ca-8dad-89852530ecd6","model_set":{"reader":"grok-4.3"},"one_line_summary":"The limiting density of the largest sum-free subset of {1,2,…,n}^d is achieved by two appropriate hyperplane slices for every dimension d.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The largest sum-free subset of the lattice cube {1,2,...,n}^d has limiting density given by two hyperplane slices for every dimension d.","strongest_claim":"We determine the limiting density of the largest sum-free subset of the lattice cube {1,2,…,n}^d for all d, thus resolving the natural conjecture that it is constructed by two appropriate hyperplane slices.","weakest_assumption":"That the limiting density exists and is attained precisely by the two-hyperplane construction; the abstract provides no details on the proof techniques or any potential gaps in the argument."}},"verdict_id":"94df368d-8760-45ca-8dad-89852530ecd6"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a1f2c0529086b014d4f514d32a3b1bcc6d925ebdb9bc8fd49dea20a0f541be66","target":"record","created_at":"2026-06-19T16:10:37Z","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":"b2c472b84b87b6f68f0a38c6713155e35083e26da8217737a927d525148d31ce","cross_cats_sorted":["math.NT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-01T17:55:19Z","title_canon_sha256":"24b2cdb0336d1ee2082c102eea03e8341e27444ed8ecdc5d5590d7c8851e32e1"},"schema_version":"1.0","source":{"id":"2605.00816","kind":"arxiv","version":2}},"canonical_sha256":"40ffa0699463f1cad238b2a54f6a2fe5e3abec6df244410238a9e93144760191","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"40ffa0699463f1cad238b2a54f6a2fe5e3abec6df244410238a9e93144760191","first_computed_at":"2026-06-19T16:10:37.947116Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:10:37.947116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SfKzjzcwN6IcbJqayzNobIqH1Uhla4TGeVEViyrhOXdtPAoRdgSLvc6nUhyXuAQh1Rt2WrrIKyHCtX6bnlO5BQ==","signature_status":"signed_v1","signed_at":"2026-06-19T16:10:37.947581Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.00816","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a1f2c0529086b014d4f514d32a3b1bcc6d925ebdb9bc8fd49dea20a0f541be66","sha256:55633bfffd8ffe7c4204d11f86ce8227a031ea832d422444a509bd8fbc876090"],"state_sha256":"00bc0f964ee46ffee33a84c7fbbed66c67e4edc54ee47c2d75b6880628927250"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TQGjLraEL4FV9pBhKJpzVJpzwdowcf5J5s7eXyAaqsUYlSUqpe25EYjiwVejU7kqVdcjdWVUSLDjMYdc5P+JAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T12:19:49.997958Z","bundle_sha256":"f1abb1b00a89a5ec291639f94b01584a0fd31dd38ee452ab2666e4f3dab1723f"}}