{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KR5TAHDO3S2CFXWPGR26JAPI6N","short_pith_number":"pith:KR5TAHDO","schema_version":"1.0","canonical_sha256":"547b301c6edcb422decf3475e481e8f3713d41e3345e292bb9e69a779d874a8d","source":{"kind":"arxiv","id":"1709.09589","version":2},"attestation_state":"computed","paper":{"title":"On the maximum number of integer colourings with forbidden monochromatic sums","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong Liu, Katherine Staden, Maryam Sharifzadeh","submitted_at":"2017-09-27T15:50:28Z","abstract_excerpt":"Let $f(n,r)$ denote the maximum number of colourings of $A \\subseteq \\lbrace 1,\\ldots,n\\rbrace$ with $r$ colours such that each colour class is sum-free. Here, a sum is a subset $\\lbrace x,y,z\\rbrace$ such that $x+y=z$. We show that $f(n,2) = 2^{\\lceil n/2\\rceil}$, and describe the extremal subsets. Further, using linear optimisation, we asymptotically determine the logarithm of $f(n,r)$ for $r \\leq 5$. Similar results were obtained by H\\`an and Jim\\'enez in the setting of finite abelian groups."},"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":"1709.09589","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-27T15:50:28Z","cross_cats_sorted":[],"title_canon_sha256":"b7de7997b4b9251756d5694633110ee1cd8fde8aee4c3fcfb07d0618550291cb","abstract_canon_sha256":"35ee596a69677878dd72ba4ca4fe3b7a4197b5491fa644b17d453257a3bd402c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:50.085690Z","signature_b64":"T8ngG8TY0ansk7FHXSSbR0TCAzNqZ57y8WJoTphgzzwh6Nd2q1bU2hWeERQVoIvEN4qmb25uXlGHS+UThRjCAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"547b301c6edcb422decf3475e481e8f3713d41e3345e292bb9e69a779d874a8d","last_reissued_at":"2026-05-18T00:32:50.085081Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:50.085081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the maximum number of integer colourings with forbidden monochromatic sums","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong Liu, Katherine Staden, Maryam Sharifzadeh","submitted_at":"2017-09-27T15:50:28Z","abstract_excerpt":"Let $f(n,r)$ denote the maximum number of colourings of $A \\subseteq \\lbrace 1,\\ldots,n\\rbrace$ with $r$ colours such that each colour class is sum-free. Here, a sum is a subset $\\lbrace x,y,z\\rbrace$ such that $x+y=z$. We show that $f(n,2) = 2^{\\lceil n/2\\rceil}$, and describe the extremal subsets. Further, using linear optimisation, we asymptotically determine the logarithm of $f(n,r)$ for $r \\leq 5$. Similar results were obtained by H\\`an and Jim\\'enez in the setting of finite abelian groups."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09589","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":"1709.09589","created_at":"2026-05-18T00:32:50.085173+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.09589v2","created_at":"2026-05-18T00:32:50.085173+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09589","created_at":"2026-05-18T00:32:50.085173+00:00"},{"alias_kind":"pith_short_12","alias_value":"KR5TAHDO3S2C","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"KR5TAHDO3S2CFXWP","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"KR5TAHDO","created_at":"2026-05-18T12:31:28.150371+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/KR5TAHDO3S2CFXWPGR26JAPI6N","json":"https://pith.science/pith/KR5TAHDO3S2CFXWPGR26JAPI6N.json","graph_json":"https://pith.science/api/pith-number/KR5TAHDO3S2CFXWPGR26JAPI6N/graph.json","events_json":"https://pith.science/api/pith-number/KR5TAHDO3S2CFXWPGR26JAPI6N/events.json","paper":"https://pith.science/paper/KR5TAHDO"},"agent_actions":{"view_html":"https://pith.science/pith/KR5TAHDO3S2CFXWPGR26JAPI6N","download_json":"https://pith.science/pith/KR5TAHDO3S2CFXWPGR26JAPI6N.json","view_paper":"https://pith.science/paper/KR5TAHDO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.09589&json=true","fetch_graph":"https://pith.science/api/pith-number/KR5TAHDO3S2CFXWPGR26JAPI6N/graph.json","fetch_events":"https://pith.science/api/pith-number/KR5TAHDO3S2CFXWPGR26JAPI6N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KR5TAHDO3S2CFXWPGR26JAPI6N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KR5TAHDO3S2CFXWPGR26JAPI6N/action/storage_attestation","attest_author":"https://pith.science/pith/KR5TAHDO3S2CFXWPGR26JAPI6N/action/author_attestation","sign_citation":"https://pith.science/pith/KR5TAHDO3S2CFXWPGR26JAPI6N/action/citation_signature","submit_replication":"https://pith.science/pith/KR5TAHDO3S2CFXWPGR26JAPI6N/action/replication_record"}},"created_at":"2026-05-18T00:32:50.085173+00:00","updated_at":"2026-05-18T00:32:50.085173+00:00"}