{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MQMCQIE6IQQDT7WDSUEHXXMTK4","short_pith_number":"pith:MQMCQIE6","schema_version":"1.0","canonical_sha256":"641828209e442039fec395087bdd935727dd2093c86095bc75f9646cd7d94281","source":{"kind":"arxiv","id":"1502.07605","version":2},"attestation_state":"computed","paper":{"title":"Sharp bound on the number of maximal sum-free subsets of integers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Andrew Treglown, Hong Liu, J\\'ozsef Balogh, Maryam Sharifzadeh","submitted_at":"2015-02-26T15:51:49Z","abstract_excerpt":"Cameron and Erd\\H{o}s asked whether the number of \\emph{maximal} sum-free sets in $\\{1, \\dots , n\\}$ is much smaller than the number of sum-free sets. In the same paper they gave a lower bound of $2^{\\lfloor n/4 \\rfloor }$ for the number of maximal sum-free sets. Here, we prove the following: For each $1\\leq i \\leq 4$, there is a constant $C_i$ such that, given any $n\\equiv i \\mod 4$, $\\{1, \\dots , n\\}$ contains $(C_i+o(1)) 2^{n/4}$ maximal sum-free sets. Our proof makes use of container and removal lemmas of Green, a structural result of Deshouillers, Freiman, S\\'os and Temkin and a recent bo"},"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":"1502.07605","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-26T15:51:49Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"46011ae42bf398c1756455af49870a17173742464c31514750339dc755fd1f6f","abstract_canon_sha256":"874aed5f02e02199023ca28016229a451499163aaf403e20a052b0a17db215f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:15.010386Z","signature_b64":"SVzemOMJn5cYQs5xjs6Nvgo9LCNIekv+bqZ5znRE2Qe9kTBLUhBSfZrHeMPx90xqCf4q3puczqudIRkJPiGyDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"641828209e442039fec395087bdd935727dd2093c86095bc75f9646cd7d94281","last_reissued_at":"2026-05-18T00:16:15.009669Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:15.009669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sharp bound on the number of maximal sum-free subsets of integers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Andrew Treglown, Hong Liu, J\\'ozsef Balogh, Maryam Sharifzadeh","submitted_at":"2015-02-26T15:51:49Z","abstract_excerpt":"Cameron and Erd\\H{o}s asked whether the number of \\emph{maximal} sum-free sets in $\\{1, \\dots , n\\}$ is much smaller than the number of sum-free sets. In the same paper they gave a lower bound of $2^{\\lfloor n/4 \\rfloor }$ for the number of maximal sum-free sets. Here, we prove the following: For each $1\\leq i \\leq 4$, there is a constant $C_i$ such that, given any $n\\equiv i \\mod 4$, $\\{1, \\dots , n\\}$ contains $(C_i+o(1)) 2^{n/4}$ maximal sum-free sets. Our proof makes use of container and removal lemmas of Green, a structural result of Deshouillers, Freiman, S\\'os and Temkin and a recent bo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.07605","kind":"arxiv","version":2},"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":"1502.07605","created_at":"2026-05-18T00:16:15.009794+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.07605v2","created_at":"2026-05-18T00:16:15.009794+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.07605","created_at":"2026-05-18T00:16:15.009794+00:00"},{"alias_kind":"pith_short_12","alias_value":"MQMCQIE6IQQD","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MQMCQIE6IQQDT7WD","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MQMCQIE6","created_at":"2026-05-18T12:29:32.376354+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/MQMCQIE6IQQDT7WDSUEHXXMTK4","json":"https://pith.science/pith/MQMCQIE6IQQDT7WDSUEHXXMTK4.json","graph_json":"https://pith.science/api/pith-number/MQMCQIE6IQQDT7WDSUEHXXMTK4/graph.json","events_json":"https://pith.science/api/pith-number/MQMCQIE6IQQDT7WDSUEHXXMTK4/events.json","paper":"https://pith.science/paper/MQMCQIE6"},"agent_actions":{"view_html":"https://pith.science/pith/MQMCQIE6IQQDT7WDSUEHXXMTK4","download_json":"https://pith.science/pith/MQMCQIE6IQQDT7WDSUEHXXMTK4.json","view_paper":"https://pith.science/paper/MQMCQIE6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.07605&json=true","fetch_graph":"https://pith.science/api/pith-number/MQMCQIE6IQQDT7WDSUEHXXMTK4/graph.json","fetch_events":"https://pith.science/api/pith-number/MQMCQIE6IQQDT7WDSUEHXXMTK4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MQMCQIE6IQQDT7WDSUEHXXMTK4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MQMCQIE6IQQDT7WDSUEHXXMTK4/action/storage_attestation","attest_author":"https://pith.science/pith/MQMCQIE6IQQDT7WDSUEHXXMTK4/action/author_attestation","sign_citation":"https://pith.science/pith/MQMCQIE6IQQDT7WDSUEHXXMTK4/action/citation_signature","submit_replication":"https://pith.science/pith/MQMCQIE6IQQDT7WDSUEHXXMTK4/action/replication_record"}},"created_at":"2026-05-18T00:16:15.009794+00:00","updated_at":"2026-05-18T00:16:15.009794+00:00"}