{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:THTEIZHDKHWTQTRXYS7UARGUZY","short_pith_number":"pith:THTEIZHD","canonical_record":{"source":{"id":"1306.4941","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-20T17:40:26Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"6ccc70a8bd7c391c95e1c2e62b28b69ddf9aa191d24942956116b6666c2549b6","abstract_canon_sha256":"4ef537d38f95f92bb8fa5b5ffb78a946ed01ee4978117ae8e8735695237f7d3b"},"schema_version":"1.0"},"canonical_sha256":"99e64464e351ed384e37c4bf4044d4ce3e4b4a1f98c288a02414acf8f7e3d0b6","source":{"kind":"arxiv","id":"1306.4941","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.4941","created_at":"2026-05-18T03:20:21Z"},{"alias_kind":"arxiv_version","alias_value":"1306.4941v1","created_at":"2026-05-18T03:20:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.4941","created_at":"2026-05-18T03:20:21Z"},{"alias_kind":"pith_short_12","alias_value":"THTEIZHDKHWT","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"THTEIZHDKHWTQTRX","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"THTEIZHD","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:THTEIZHDKHWTQTRXYS7UARGUZY","target":"record","payload":{"canonical_record":{"source":{"id":"1306.4941","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-20T17:40:26Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"6ccc70a8bd7c391c95e1c2e62b28b69ddf9aa191d24942956116b6666c2549b6","abstract_canon_sha256":"4ef537d38f95f92bb8fa5b5ffb78a946ed01ee4978117ae8e8735695237f7d3b"},"schema_version":"1.0"},"canonical_sha256":"99e64464e351ed384e37c4bf4044d4ce3e4b4a1f98c288a02414acf8f7e3d0b6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:21.125734Z","signature_b64":"N036Wy1k+rurDVP7DO+As2Z9Wd+U1XQ29sw2KC5xMSlfDOpsRModuLzP3AWXuWTS1KzmNIwrHynP4q2mbdbVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99e64464e351ed384e37c4bf4044d4ce3e4b4a1f98c288a02414acf8f7e3d0b6","last_reissued_at":"2026-05-18T03:20:21.124994Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:21.124994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.4941","source_version":1,"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-18T03:20:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+89iwfhegd/OcS5ItJS0pBgrI3/LLxpkSY/sqEh2mfDwHpORT6t2sDT1c0q+8MKFaMMhQSVLgSLW07X6pdmPDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:28:59.677269Z"},"content_sha256":"63c35234d2080da48762b8aaeece684ebb73674a3d90c90d40dd5b0907750d2c","schema_version":"1.0","event_id":"sha256:63c35234d2080da48762b8aaeece684ebb73674a3d90c90d40dd5b0907750d2c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:THTEIZHDKHWTQTRXYS7UARGUZY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Upper and lower bounds on $B_k^+$-sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Craig Timmons","submitted_at":"2013-06-20T17:40:26Z","abstract_excerpt":"Let $G$ be an abelian group. A set $A \\subset G$ is a \\emph{$B_k^+$-set} if whenever $a_1 + \\dots + a_k = b_1 + \\dots + b_k$ with $a_i, b_j \\in A$ there is an $i$ and a $j$ such that $a_i = b_j$. If $A$ is a $B_k$-set then it is also a $B_k^+$-set but the converse is not true in general. Determining the largest size of a $B_k$-set in the interval $\\{1, 2, \\dots, N \\} \\subset \\integers$ or in the cyclic group $\\integers_N$ is a well studied problem. In this paper we investigate the corresponding problem for $B_k^+$-sets. We prove non-trivial upper bounds on the maximum size of a $B_k^+$-set con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.4941","kind":"arxiv","version":1},"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-18T03:20:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"suM9MKnHqnPVkCLMPJOEoTZDZIErx/1G0ui1Vq6MaAmZ35lPuuesPdioYJI94tIGYf8cCfpHFp8EZC2sD586Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:28:59.677619Z"},"content_sha256":"5e457000ef31e6a07b493bba7a6634f4869c488e6ef55c3a156691425372df3e","schema_version":"1.0","event_id":"sha256:5e457000ef31e6a07b493bba7a6634f4869c488e6ef55c3a156691425372df3e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/THTEIZHDKHWTQTRXYS7UARGUZY/bundle.json","state_url":"https://pith.science/pith/THTEIZHDKHWTQTRXYS7UARGUZY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/THTEIZHDKHWTQTRXYS7UARGUZY/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-02T13:28:59Z","links":{"resolver":"https://pith.science/pith/THTEIZHDKHWTQTRXYS7UARGUZY","bundle":"https://pith.science/pith/THTEIZHDKHWTQTRXYS7UARGUZY/bundle.json","state":"https://pith.science/pith/THTEIZHDKHWTQTRXYS7UARGUZY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/THTEIZHDKHWTQTRXYS7UARGUZY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:THTEIZHDKHWTQTRXYS7UARGUZY","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":"4ef537d38f95f92bb8fa5b5ffb78a946ed01ee4978117ae8e8735695237f7d3b","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-20T17:40:26Z","title_canon_sha256":"6ccc70a8bd7c391c95e1c2e62b28b69ddf9aa191d24942956116b6666c2549b6"},"schema_version":"1.0","source":{"id":"1306.4941","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.4941","created_at":"2026-05-18T03:20:21Z"},{"alias_kind":"arxiv_version","alias_value":"1306.4941v1","created_at":"2026-05-18T03:20:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.4941","created_at":"2026-05-18T03:20:21Z"},{"alias_kind":"pith_short_12","alias_value":"THTEIZHDKHWT","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"THTEIZHDKHWTQTRX","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"THTEIZHD","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:5e457000ef31e6a07b493bba7a6634f4869c488e6ef55c3a156691425372df3e","target":"graph","created_at":"2026-05-18T03:20:21Z","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 $G$ be an abelian group. A set $A \\subset G$ is a \\emph{$B_k^+$-set} if whenever $a_1 + \\dots + a_k = b_1 + \\dots + b_k$ with $a_i, b_j \\in A$ there is an $i$ and a $j$ such that $a_i = b_j$. If $A$ is a $B_k$-set then it is also a $B_k^+$-set but the converse is not true in general. Determining the largest size of a $B_k$-set in the interval $\\{1, 2, \\dots, N \\} \\subset \\integers$ or in the cyclic group $\\integers_N$ is a well studied problem. In this paper we investigate the corresponding problem for $B_k^+$-sets. We prove non-trivial upper bounds on the maximum size of a $B_k^+$-set con","authors_text":"Craig Timmons","cross_cats":["math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-20T17:40:26Z","title":"Upper and lower bounds on $B_k^+$-sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.4941","kind":"arxiv","version":1},"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:63c35234d2080da48762b8aaeece684ebb73674a3d90c90d40dd5b0907750d2c","target":"record","created_at":"2026-05-18T03:20:21Z","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":"4ef537d38f95f92bb8fa5b5ffb78a946ed01ee4978117ae8e8735695237f7d3b","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-20T17:40:26Z","title_canon_sha256":"6ccc70a8bd7c391c95e1c2e62b28b69ddf9aa191d24942956116b6666c2549b6"},"schema_version":"1.0","source":{"id":"1306.4941","kind":"arxiv","version":1}},"canonical_sha256":"99e64464e351ed384e37c4bf4044d4ce3e4b4a1f98c288a02414acf8f7e3d0b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"99e64464e351ed384e37c4bf4044d4ce3e4b4a1f98c288a02414acf8f7e3d0b6","first_computed_at":"2026-05-18T03:20:21.124994Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:20:21.124994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N036Wy1k+rurDVP7DO+As2Z9Wd+U1XQ29sw2KC5xMSlfDOpsRModuLzP3AWXuWTS1KzmNIwrHynP4q2mbdbVAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:20:21.125734Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.4941","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63c35234d2080da48762b8aaeece684ebb73674a3d90c90d40dd5b0907750d2c","sha256:5e457000ef31e6a07b493bba7a6634f4869c488e6ef55c3a156691425372df3e"],"state_sha256":"cf40ad2d9da49d848730224b703aa83655e95ce2a987eedb27829e4e5a8576f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3N2eTnnE80VUrxQAQ6kKxD+SkVuk3d3Hf9SmNVByzwPd5oDQnS9QBnFaDlDVpZCy2Y1o5XYky9CJloYZGdBTAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T13:28:59.679435Z","bundle_sha256":"aded718a226e670dfffd808f3f43337ef14b931c7d94ed253e7daeb5251e4c76"}}