{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:4EKK2LLPDRLF44AEBZJAJ2WQRT","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":"18ba168d89d42a6e38f948275b2a0b2d6fd2c0cd7976609d67574bbadac0d215","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-15T18:37:43Z","title_canon_sha256":"45f531ad2a18bfd7cbd494c37cdaba725032153ad0707532bb880aefc99829e6"},"schema_version":"1.0","source":{"id":"2605.16542","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16542","created_at":"2026-05-20T00:02:28Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16542v1","created_at":"2026-05-20T00:02:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16542","created_at":"2026-05-20T00:02:28Z"},{"alias_kind":"pith_short_12","alias_value":"4EKK2LLPDRLF","created_at":"2026-05-20T00:02:28Z"},{"alias_kind":"pith_short_16","alias_value":"4EKK2LLPDRLF44AE","created_at":"2026-05-20T00:02:28Z"},{"alias_kind":"pith_short_8","alias_value":"4EKK2LLP","created_at":"2026-05-20T00:02:28Z"}],"graph_snapshots":[{"event_id":"sha256:2b6d821f6a37b54498b326885c6e1d5c7f9e735bafba6f95e5dc05b63e571c2d","target":"graph","created_at":"2026-05-20T00:02:28Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T19:21:56.914550Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.639584Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.16542/integrity.json","findings":[],"snapshot_sha256":"301be1fff96d9c7b80f5407e84fb997bc70fc2cd43e190e478da7a35f4d5224e","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For a graph $G$ and integers $a_i \\geq 1$, we say that $G \\xrightarrow[]{} (a_1, \\ldots, a_k)^v$ if in any $k$-coloring of $G$'s vertices there exists a monochromatic $a_i$-clique for some color $i \\in \\{1,\\ldots,k\\}$. $G \\xrightarrow[]{} (a_1, \\ldots, a_k)^e$ is defined similarly, but for edge colorings. The Folkman number $F_v(a_1, \\ldots, a_k; H)$ is the smallest number of vertices for which an $H$-free graph arrowing $(a_1, \\ldots, a_k)^v$ exists. $F_e(a_1, \\ldots, a_k; H)$ is defined similarly for edge-arrowing.\n  In this work, we present new bounds for Folkman numbers where $a_i \\in \\{2,","authors_text":"Stanis{\\l}aw Radziszowski, Steven Van Overberghe, Zohair Raza Hassan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-15T18:37:43Z","title":"On Small Folkman Graphs Arrowing $K_2$ or $K_3$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.16542","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:b534e2dc774312139709d4b9b86dffaa5efae81d00be5de381da282533db8e08","target":"record","created_at":"2026-05-20T00:02:28Z","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":"18ba168d89d42a6e38f948275b2a0b2d6fd2c0cd7976609d67574bbadac0d215","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-15T18:37:43Z","title_canon_sha256":"45f531ad2a18bfd7cbd494c37cdaba725032153ad0707532bb880aefc99829e6"},"schema_version":"1.0","source":{"id":"2605.16542","kind":"arxiv","version":1}},"canonical_sha256":"e114ad2d6f1c565e70040e5204ead08cccc29f5dc9efc7a22ce5dac0d5fd5024","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e114ad2d6f1c565e70040e5204ead08cccc29f5dc9efc7a22ce5dac0d5fd5024","first_computed_at":"2026-05-20T00:02:28.238376Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:02:28.238376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"99wvV2ISDSQKO2gsmmvLG9qkm5cI+uU5a7o7WR5szlJT/3OLcF0JpQsIpzldcz+0R5ml1QBpy/yGGEe5nDZfAg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:02:28.239106Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16542","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b534e2dc774312139709d4b9b86dffaa5efae81d00be5de381da282533db8e08","sha256:2b6d821f6a37b54498b326885c6e1d5c7f9e735bafba6f95e5dc05b63e571c2d"],"state_sha256":"dd0e8ac07e6609b4f125f454581409f46aba7f64c36c396076854bc17519740d"}