{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KR5TAHDO3S2CFXWPGR26JAPI6N","short_pith_number":"pith:KR5TAHDO","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"},"canonical_sha256":"547b301c6edcb422decf3475e481e8f3713d41e3345e292bb9e69a779d874a8d","source":{"kind":"arxiv","id":"1709.09589","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.09589","created_at":"2026-05-18T00:32:50Z"},{"alias_kind":"arxiv_version","alias_value":"1709.09589v2","created_at":"2026-05-18T00:32:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09589","created_at":"2026-05-18T00:32:50Z"},{"alias_kind":"pith_short_12","alias_value":"KR5TAHDO3S2C","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"KR5TAHDO3S2CFXWP","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"KR5TAHDO","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KR5TAHDO3S2CFXWPGR26JAPI6N","target":"record","payload":{"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"},"canonical_sha256":"547b301c6edcb422decf3475e481e8f3713d41e3345e292bb9e69a779d874a8d","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"},"source_kind":"arxiv","source_id":"1709.09589","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-05-18T00:32:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LxtxPPzXaXoS90jr25LQiC9fhUe4eVFDgxvaKTf/kYleG+P6zvSVYHu0Hds8KNxea5tIGipQm8U9tEAtDrjQDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:22:16.222649Z"},"content_sha256":"93b2eca7c41097bf3abf81c5ce9a0bda319bfbc83610ea31321803bd650af7d3","schema_version":"1.0","event_id":"sha256:93b2eca7c41097bf3abf81c5ce9a0bda319bfbc83610ea31321803bd650af7d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KR5TAHDO3S2CFXWPGR26JAPI6N","target":"graph","payload":{"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"},"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-18T00:32:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kIkq3RxgIdrUN59CiqnRS6FYdq7PaGlQYcR62GAC919o34/Lt0Ra0Nns8nFEpLoqRNJ40VKIuQm7xmbUIDgwDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:22:16.223062Z"},"content_sha256":"aabd691c63b446e2b773790cf43c3763e65a5533db4099332b59f1302111c1c2","schema_version":"1.0","event_id":"sha256:aabd691c63b446e2b773790cf43c3763e65a5533db4099332b59f1302111c1c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KR5TAHDO3S2CFXWPGR26JAPI6N/bundle.json","state_url":"https://pith.science/pith/KR5TAHDO3S2CFXWPGR26JAPI6N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KR5TAHDO3S2CFXWPGR26JAPI6N/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-05-28T18:22:16Z","links":{"resolver":"https://pith.science/pith/KR5TAHDO3S2CFXWPGR26JAPI6N","bundle":"https://pith.science/pith/KR5TAHDO3S2CFXWPGR26JAPI6N/bundle.json","state":"https://pith.science/pith/KR5TAHDO3S2CFXWPGR26JAPI6N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KR5TAHDO3S2CFXWPGR26JAPI6N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KR5TAHDO3S2CFXWPGR26JAPI6N","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":"35ee596a69677878dd72ba4ca4fe3b7a4197b5491fa644b17d453257a3bd402c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-27T15:50:28Z","title_canon_sha256":"b7de7997b4b9251756d5694633110ee1cd8fde8aee4c3fcfb07d0618550291cb"},"schema_version":"1.0","source":{"id":"1709.09589","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.09589","created_at":"2026-05-18T00:32:50Z"},{"alias_kind":"arxiv_version","alias_value":"1709.09589v2","created_at":"2026-05-18T00:32:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09589","created_at":"2026-05-18T00:32:50Z"},{"alias_kind":"pith_short_12","alias_value":"KR5TAHDO3S2C","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"KR5TAHDO3S2CFXWP","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"KR5TAHDO","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:aabd691c63b446e2b773790cf43c3763e65a5533db4099332b59f1302111c1c2","target":"graph","created_at":"2026-05-18T00:32:50Z","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":"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.","authors_text":"Hong Liu, Katherine Staden, Maryam Sharifzadeh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-27T15:50:28Z","title":"On the maximum number of integer colourings with forbidden monochromatic sums"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09589","kind":"arxiv","version":2},"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:93b2eca7c41097bf3abf81c5ce9a0bda319bfbc83610ea31321803bd650af7d3","target":"record","created_at":"2026-05-18T00:32:50Z","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":"35ee596a69677878dd72ba4ca4fe3b7a4197b5491fa644b17d453257a3bd402c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-27T15:50:28Z","title_canon_sha256":"b7de7997b4b9251756d5694633110ee1cd8fde8aee4c3fcfb07d0618550291cb"},"schema_version":"1.0","source":{"id":"1709.09589","kind":"arxiv","version":2}},"canonical_sha256":"547b301c6edcb422decf3475e481e8f3713d41e3345e292bb9e69a779d874a8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"547b301c6edcb422decf3475e481e8f3713d41e3345e292bb9e69a779d874a8d","first_computed_at":"2026-05-18T00:32:50.085081Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:50.085081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T8ngG8TY0ansk7FHXSSbR0TCAzNqZ57y8WJoTphgzzwh6Nd2q1bU2hWeERQVoIvEN4qmb25uXlGHS+UThRjCAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:50.085690Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.09589","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:93b2eca7c41097bf3abf81c5ce9a0bda319bfbc83610ea31321803bd650af7d3","sha256:aabd691c63b446e2b773790cf43c3763e65a5533db4099332b59f1302111c1c2"],"state_sha256":"ad96b03a2a4be71cde716d957144f1346337c987184d0a3539c5a31f04ec6d04"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5LMLJsp6r1zPVSs5YZqjIXSSrFVRgfN1kIVYcMeSECElnqWO2PJWLTE7ShS23s9ac3+9kww7zS3RTYGEhYCuAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T18:22:16.226310Z","bundle_sha256":"d042dbf4d12c17af964a888b92882f4bcf0749d85086545ccf26be1c86c35f00"}}