{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OLST5TMIFYGPOAAUCNELJRUGRL","short_pith_number":"pith:OLST5TMI","canonical_record":{"source":{"id":"1603.00521","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-01T22:59:04Z","cross_cats_sorted":[],"title_canon_sha256":"0cfdf5713e123ba1082bab0ca522d21f3c5c6fd9f8ddce92671ff1ff236659e0","abstract_canon_sha256":"be231d55ae04fe07e963742971651a5cd9f445003327fc5d58896fac43761992"},"schema_version":"1.0"},"canonical_sha256":"72e53ecd882e0cf700141348b4c6868aebded2fc8c58aa2a5e9a98232bc28b6c","source":{"kind":"arxiv","id":"1603.00521","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.00521","created_at":"2026-05-18T00:31:45Z"},{"alias_kind":"arxiv_version","alias_value":"1603.00521v1","created_at":"2026-05-18T00:31:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.00521","created_at":"2026-05-18T00:31:45Z"},{"alias_kind":"pith_short_12","alias_value":"OLST5TMIFYGP","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OLST5TMIFYGPOAAU","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OLST5TMI","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OLST5TMIFYGPOAAUCNELJRUGRL","target":"record","payload":{"canonical_record":{"source":{"id":"1603.00521","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-01T22:59:04Z","cross_cats_sorted":[],"title_canon_sha256":"0cfdf5713e123ba1082bab0ca522d21f3c5c6fd9f8ddce92671ff1ff236659e0","abstract_canon_sha256":"be231d55ae04fe07e963742971651a5cd9f445003327fc5d58896fac43761992"},"schema_version":"1.0"},"canonical_sha256":"72e53ecd882e0cf700141348b4c6868aebded2fc8c58aa2a5e9a98232bc28b6c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:45.465000Z","signature_b64":"EuB/LitEvwcFw41XU3h2JU/ZMjN4EFTyvzeLzoDj+ZRO81iEph0QByWWo/R0LCCAK4qBrZDxc9uRrz1M758sBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72e53ecd882e0cf700141348b4c6868aebded2fc8c58aa2a5e9a98232bc28b6c","last_reissued_at":"2026-05-18T00:31:45.464415Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:45.464415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.00521","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-18T00:31:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9hxkPYX+z73jUp/UrRtMeP/csq9E+0+t2bkea3Z8X4ZHNLvJOmkkJQvMpAmntBTh3Ikqg2U4DGPANZ/GKy9GCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:06:15.356984Z"},"content_sha256":"aa3a4a791ade88539df1eb661374b93d59ee4cd73fbf1ae4a658a4216c962687","schema_version":"1.0","event_id":"sha256:aa3a4a791ade88539df1eb661374b93d59ee4cd73fbf1ae4a658a4216c962687"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OLST5TMIFYGPOAAUCNELJRUGRL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An exponential-type upper bound for Folkman numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej Ruci\\'nski, Mathias Schacht, Vojt\\v{e}ch R\\\"odl","submitted_at":"2016-03-01T22:59:04Z","abstract_excerpt":"For given integers $k$ and $r$, the Folkman number $f(k;r)$ is the smallest number of vertices in a graph $G$ which contains no clique on $k+1$ vertices, yet for every partition of its edges into $r$ parts, some part contains a clique of order $k$. The existence (finiteness) of Folkman numbers was established by Folkman (1970) for $r=2$ and by Ne\\v{s}et\\v{r}il and R\\\"odl (1976) for arbitrary $r$, but these proofs led to very weak upper bounds on $f(k;r)$.\n  Recently, Conlon and Gowers and independently the authors obtained a doubly exponential bound on $f(k;2)$. Here, we establish a further im"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.00521","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-18T00:31:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z3Jrg5McCE+cnHWKWk3tCTY2yh/Lyk59PNnYp6zU28nZiMQrdExYf+O+GOqIoJaQhT5oTK2sj8XmVJ6Y5qABBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:06:15.357647Z"},"content_sha256":"35e7c94793b9e88c1a94ebd1384f788cfdd70717a4b0b8f41cbe7930bc3ae4cd","schema_version":"1.0","event_id":"sha256:35e7c94793b9e88c1a94ebd1384f788cfdd70717a4b0b8f41cbe7930bc3ae4cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OLST5TMIFYGPOAAUCNELJRUGRL/bundle.json","state_url":"https://pith.science/pith/OLST5TMIFYGPOAAUCNELJRUGRL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OLST5TMIFYGPOAAUCNELJRUGRL/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-27T09:06:15Z","links":{"resolver":"https://pith.science/pith/OLST5TMIFYGPOAAUCNELJRUGRL","bundle":"https://pith.science/pith/OLST5TMIFYGPOAAUCNELJRUGRL/bundle.json","state":"https://pith.science/pith/OLST5TMIFYGPOAAUCNELJRUGRL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OLST5TMIFYGPOAAUCNELJRUGRL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OLST5TMIFYGPOAAUCNELJRUGRL","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":"be231d55ae04fe07e963742971651a5cd9f445003327fc5d58896fac43761992","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-01T22:59:04Z","title_canon_sha256":"0cfdf5713e123ba1082bab0ca522d21f3c5c6fd9f8ddce92671ff1ff236659e0"},"schema_version":"1.0","source":{"id":"1603.00521","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.00521","created_at":"2026-05-18T00:31:45Z"},{"alias_kind":"arxiv_version","alias_value":"1603.00521v1","created_at":"2026-05-18T00:31:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.00521","created_at":"2026-05-18T00:31:45Z"},{"alias_kind":"pith_short_12","alias_value":"OLST5TMIFYGP","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OLST5TMIFYGPOAAU","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OLST5TMI","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:35e7c94793b9e88c1a94ebd1384f788cfdd70717a4b0b8f41cbe7930bc3ae4cd","target":"graph","created_at":"2026-05-18T00:31:45Z","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 given integers $k$ and $r$, the Folkman number $f(k;r)$ is the smallest number of vertices in a graph $G$ which contains no clique on $k+1$ vertices, yet for every partition of its edges into $r$ parts, some part contains a clique of order $k$. The existence (finiteness) of Folkman numbers was established by Folkman (1970) for $r=2$ and by Ne\\v{s}et\\v{r}il and R\\\"odl (1976) for arbitrary $r$, but these proofs led to very weak upper bounds on $f(k;r)$.\n  Recently, Conlon and Gowers and independently the authors obtained a doubly exponential bound on $f(k;2)$. Here, we establish a further im","authors_text":"Andrzej Ruci\\'nski, Mathias Schacht, Vojt\\v{e}ch R\\\"odl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-01T22:59:04Z","title":"An exponential-type upper bound for Folkman numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.00521","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:aa3a4a791ade88539df1eb661374b93d59ee4cd73fbf1ae4a658a4216c962687","target":"record","created_at":"2026-05-18T00:31:45Z","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":"be231d55ae04fe07e963742971651a5cd9f445003327fc5d58896fac43761992","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-01T22:59:04Z","title_canon_sha256":"0cfdf5713e123ba1082bab0ca522d21f3c5c6fd9f8ddce92671ff1ff236659e0"},"schema_version":"1.0","source":{"id":"1603.00521","kind":"arxiv","version":1}},"canonical_sha256":"72e53ecd882e0cf700141348b4c6868aebded2fc8c58aa2a5e9a98232bc28b6c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"72e53ecd882e0cf700141348b4c6868aebded2fc8c58aa2a5e9a98232bc28b6c","first_computed_at":"2026-05-18T00:31:45.464415Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:45.464415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EuB/LitEvwcFw41XU3h2JU/ZMjN4EFTyvzeLzoDj+ZRO81iEph0QByWWo/R0LCCAK4qBrZDxc9uRrz1M758sBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:45.465000Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.00521","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa3a4a791ade88539df1eb661374b93d59ee4cd73fbf1ae4a658a4216c962687","sha256:35e7c94793b9e88c1a94ebd1384f788cfdd70717a4b0b8f41cbe7930bc3ae4cd"],"state_sha256":"45efff0f56145adc9dc689fff5c849d5aae6c1ee9bd7ff44ecd5db04821ca50f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BILCHF/jTpBrNtT+mtV2vynqANo0cfHxyqaCZItHkY8mMUZZMBrwM49g+3urFQqmNc6ILar4jLFjeXY9TqbXCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:06:15.361292Z","bundle_sha256":"40c5a7b85b5a302ffded9694fc3feaae5248b32855786baef57d24d3de6e950f"}}