{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:4EKK2LLPDRLF44AEBZJAJ2WQRT","short_pith_number":"pith:4EKK2LLP","schema_version":"1.0","canonical_sha256":"e114ad2d6f1c565e70040e5204ead08cccc29f5dc9efc7a22ce5dac0d5fd5024","source":{"kind":"arxiv","id":"2605.16542","version":1},"attestation_state":"computed","paper":{"title":"On Small Folkman Graphs Arrowing $K_2$ or $K_3$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Stanis{\\l}aw Radziszowski, Steven Van Overberghe, Zohair Raza Hassan","submitted_at":"2026-05-15T18:37:43Z","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,"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.16542","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-15T18:37:43Z","cross_cats_sorted":[],"title_canon_sha256":"45f531ad2a18bfd7cbd494c37cdaba725032153ad0707532bb880aefc99829e6","abstract_canon_sha256":"18ba168d89d42a6e38f948275b2a0b2d6fd2c0cd7976609d67574bbadac0d215"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:02:28.239106Z","signature_b64":"99wvV2ISDSQKO2gsmmvLG9qkm5cI+uU5a7o7WR5szlJT/3OLcF0JpQsIpzldcz+0R5ml1QBpy/yGGEe5nDZfAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e114ad2d6f1c565e70040e5204ead08cccc29f5dc9efc7a22ce5dac0d5fd5024","last_reissued_at":"2026-05-20T00:02:28.238376Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:02:28.238376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Small Folkman Graphs Arrowing $K_2$ or $K_3$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Stanis{\\l}aw Radziszowski, Steven Van Overberghe, Zohair Raza Hassan","submitted_at":"2026-05-15T18:37:43Z","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,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.16542","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16542/integrity.json","findings":[],"available":true,"detectors_run":[{"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","findings_count":0}],"snapshot_sha256":"301be1fff96d9c7b80f5407e84fb997bc70fc2cd43e190e478da7a35f4d5224e"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.16542","created_at":"2026-05-20T00:02:28.238501+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.16542v1","created_at":"2026-05-20T00:02:28.238501+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16542","created_at":"2026-05-20T00:02:28.238501+00:00"},{"alias_kind":"pith_short_12","alias_value":"4EKK2LLPDRLF","created_at":"2026-05-20T00:02:28.238501+00:00"},{"alias_kind":"pith_short_16","alias_value":"4EKK2LLPDRLF44AE","created_at":"2026-05-20T00:02:28.238501+00:00"},{"alias_kind":"pith_short_8","alias_value":"4EKK2LLP","created_at":"2026-05-20T00:02:28.238501+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4EKK2LLPDRLF44AEBZJAJ2WQRT","json":"https://pith.science/pith/4EKK2LLPDRLF44AEBZJAJ2WQRT.json","graph_json":"https://pith.science/api/pith-number/4EKK2LLPDRLF44AEBZJAJ2WQRT/graph.json","events_json":"https://pith.science/api/pith-number/4EKK2LLPDRLF44AEBZJAJ2WQRT/events.json","paper":"https://pith.science/paper/4EKK2LLP"},"agent_actions":{"view_html":"https://pith.science/pith/4EKK2LLPDRLF44AEBZJAJ2WQRT","download_json":"https://pith.science/pith/4EKK2LLPDRLF44AEBZJAJ2WQRT.json","view_paper":"https://pith.science/paper/4EKK2LLP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.16542&json=true","fetch_graph":"https://pith.science/api/pith-number/4EKK2LLPDRLF44AEBZJAJ2WQRT/graph.json","fetch_events":"https://pith.science/api/pith-number/4EKK2LLPDRLF44AEBZJAJ2WQRT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4EKK2LLPDRLF44AEBZJAJ2WQRT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4EKK2LLPDRLF44AEBZJAJ2WQRT/action/storage_attestation","attest_author":"https://pith.science/pith/4EKK2LLPDRLF44AEBZJAJ2WQRT/action/author_attestation","sign_citation":"https://pith.science/pith/4EKK2LLPDRLF44AEBZJAJ2WQRT/action/citation_signature","submit_replication":"https://pith.science/pith/4EKK2LLPDRLF44AEBZJAJ2WQRT/action/replication_record"}},"created_at":"2026-05-20T00:02:28.238501+00:00","updated_at":"2026-05-20T00:02:28.238501+00:00"}