{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:VNIHCJOMVWISGB5QCCVMAAUZMG","short_pith_number":"pith:VNIHCJOM","canonical_record":{"source":{"id":"1903.04132","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-11T05:40:13Z","cross_cats_sorted":[],"title_canon_sha256":"f873c0d7394a6cace473fe3918876f2c82f01582c0383d8502dacf6deeae104c","abstract_canon_sha256":"0c3a8c002a400bbda859cc67e57cfa9dbd38191d2402b2c3f4b8569b200dd18e"},"schema_version":"1.0"},"canonical_sha256":"ab507125ccad912307b010aac0029961bfd9f3abf2cebc85a4c0899e0c1b00a7","source":{"kind":"arxiv","id":"1903.04132","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.04132","created_at":"2026-05-17T23:51:29Z"},{"alias_kind":"arxiv_version","alias_value":"1903.04132v2","created_at":"2026-05-17T23:51:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.04132","created_at":"2026-05-17T23:51:29Z"},{"alias_kind":"pith_short_12","alias_value":"VNIHCJOMVWIS","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VNIHCJOMVWISGB5Q","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VNIHCJOM","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:VNIHCJOMVWISGB5QCCVMAAUZMG","target":"record","payload":{"canonical_record":{"source":{"id":"1903.04132","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-11T05:40:13Z","cross_cats_sorted":[],"title_canon_sha256":"f873c0d7394a6cace473fe3918876f2c82f01582c0383d8502dacf6deeae104c","abstract_canon_sha256":"0c3a8c002a400bbda859cc67e57cfa9dbd38191d2402b2c3f4b8569b200dd18e"},"schema_version":"1.0"},"canonical_sha256":"ab507125ccad912307b010aac0029961bfd9f3abf2cebc85a4c0899e0c1b00a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:29.487345Z","signature_b64":"DbTqYHHsslE40df0+ZMk/O1TlaTr6ZtyTExcWDvLMX8l0rh43Pvw1WLY/Vbm3z1GffNo7/8ZNAE+r5klUgViAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab507125ccad912307b010aac0029961bfd9f3abf2cebc85a4c0899e0c1b00a7","last_reissued_at":"2026-05-17T23:51:29.486955Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:29.486955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.04132","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-17T23:51:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QS9hG8dQylKF3QW56bUriacIgrAzOHmU8pBC8oF1iTBeLPIMivfwsK/esyOioaGcGK97Fzz1t4adNx6vPggIAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T20:54:40.165883Z"},"content_sha256":"7a3dd3e34e9185c2de477993726403306e865229931fff784d4a5bad0fce4381","schema_version":"1.0","event_id":"sha256:7a3dd3e34e9185c2de477993726403306e865229931fff784d4a5bad0fce4381"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:VNIHCJOMVWISGB5QCCVMAAUZMG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum $k$-sum $\\mathbf{n}$-free sets of the 2-dimensional integer lattice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boram Park, Ilkyoo Choi, Ringi Kim","submitted_at":"2019-03-11T05:40:13Z","abstract_excerpt":"For a positive integer $n$, let $[n]$ denote $\\{1, \\ldots, n\\}$. For a 2-dimensional integer lattice point $\\mathbf{b}$ and positive integers $k\\geq 2$ and $n$, a \\textit{$k$-sum $\\mathbf{b}$-free set} of $[n]\\times [n]$ is a subset $S$ of $[n]\\times [n]$ such that there are no elements ${\\mathbf{a}}_1, \\ldots, {\\mathbf{a}}_k$ in $S$ satisfying ${\\mathbf{a}}_1+\\cdots+{\\mathbf{a}}_k =\\mathbf{b}$. For a 2-dimensional integer lattice point $\\mathbf{b}$ and positive integers $k\\geq 2$ and $n$, we determine the maximum density of a {$k$-sum $\\mathbf{b}$-free set} of $[n]\\times [n]$. This is the fir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.04132","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-17T23:51:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6LqMq0pC8VwSQpaflu9QQdebYtKPqqogdXMtrDndgbirP+MCBAlgiP1+zQwY64EnJ5tHB0UFBeIy79+0S90uBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T20:54:40.166642Z"},"content_sha256":"28d09cf10410676484b5f9e0f52eac79ccdd686faa14722624639da876d5f97c","schema_version":"1.0","event_id":"sha256:28d09cf10410676484b5f9e0f52eac79ccdd686faa14722624639da876d5f97c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VNIHCJOMVWISGB5QCCVMAAUZMG/bundle.json","state_url":"https://pith.science/pith/VNIHCJOMVWISGB5QCCVMAAUZMG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VNIHCJOMVWISGB5QCCVMAAUZMG/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-11T20:54:40Z","links":{"resolver":"https://pith.science/pith/VNIHCJOMVWISGB5QCCVMAAUZMG","bundle":"https://pith.science/pith/VNIHCJOMVWISGB5QCCVMAAUZMG/bundle.json","state":"https://pith.science/pith/VNIHCJOMVWISGB5QCCVMAAUZMG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VNIHCJOMVWISGB5QCCVMAAUZMG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VNIHCJOMVWISGB5QCCVMAAUZMG","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":"0c3a8c002a400bbda859cc67e57cfa9dbd38191d2402b2c3f4b8569b200dd18e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-11T05:40:13Z","title_canon_sha256":"f873c0d7394a6cace473fe3918876f2c82f01582c0383d8502dacf6deeae104c"},"schema_version":"1.0","source":{"id":"1903.04132","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.04132","created_at":"2026-05-17T23:51:29Z"},{"alias_kind":"arxiv_version","alias_value":"1903.04132v2","created_at":"2026-05-17T23:51:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.04132","created_at":"2026-05-17T23:51:29Z"},{"alias_kind":"pith_short_12","alias_value":"VNIHCJOMVWIS","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VNIHCJOMVWISGB5Q","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VNIHCJOM","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:28d09cf10410676484b5f9e0f52eac79ccdd686faa14722624639da876d5f97c","target":"graph","created_at":"2026-05-17T23:51:29Z","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 positive integer $n$, let $[n]$ denote $\\{1, \\ldots, n\\}$. For a 2-dimensional integer lattice point $\\mathbf{b}$ and positive integers $k\\geq 2$ and $n$, a \\textit{$k$-sum $\\mathbf{b}$-free set} of $[n]\\times [n]$ is a subset $S$ of $[n]\\times [n]$ such that there are no elements ${\\mathbf{a}}_1, \\ldots, {\\mathbf{a}}_k$ in $S$ satisfying ${\\mathbf{a}}_1+\\cdots+{\\mathbf{a}}_k =\\mathbf{b}$. For a 2-dimensional integer lattice point $\\mathbf{b}$ and positive integers $k\\geq 2$ and $n$, we determine the maximum density of a {$k$-sum $\\mathbf{b}$-free set} of $[n]\\times [n]$. This is the fir","authors_text":"Boram Park, Ilkyoo Choi, Ringi Kim","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-11T05:40:13Z","title":"Maximum $k$-sum $\\mathbf{n}$-free sets of the 2-dimensional integer lattice"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.04132","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:7a3dd3e34e9185c2de477993726403306e865229931fff784d4a5bad0fce4381","target":"record","created_at":"2026-05-17T23:51:29Z","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":"0c3a8c002a400bbda859cc67e57cfa9dbd38191d2402b2c3f4b8569b200dd18e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-11T05:40:13Z","title_canon_sha256":"f873c0d7394a6cace473fe3918876f2c82f01582c0383d8502dacf6deeae104c"},"schema_version":"1.0","source":{"id":"1903.04132","kind":"arxiv","version":2}},"canonical_sha256":"ab507125ccad912307b010aac0029961bfd9f3abf2cebc85a4c0899e0c1b00a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab507125ccad912307b010aac0029961bfd9f3abf2cebc85a4c0899e0c1b00a7","first_computed_at":"2026-05-17T23:51:29.486955Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:29.486955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DbTqYHHsslE40df0+ZMk/O1TlaTr6ZtyTExcWDvLMX8l0rh43Pvw1WLY/Vbm3z1GffNo7/8ZNAE+r5klUgViAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:29.487345Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.04132","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a3dd3e34e9185c2de477993726403306e865229931fff784d4a5bad0fce4381","sha256:28d09cf10410676484b5f9e0f52eac79ccdd686faa14722624639da876d5f97c"],"state_sha256":"609a642827d02cfee1781ceac7adb77d61561802482530445437486226606d27"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YNeOv/UuVdktOs4zh6T63A+iLvP8mI8gU/R1wtyQ0OBzgMZZm+6EeUkr/EUAKAtKSeLjOuMidUfiEp3xJf/5Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T20:54:40.170586Z","bundle_sha256":"3286d34cbd2cd0103c36db137327b6ff3d4edfb8a0e3b55390897b6ab701a81e"}}