{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:XWTWYVVWYAKHFACD2SIKPTKMHO","short_pith_number":"pith:XWTWYVVW","schema_version":"1.0","canonical_sha256":"bda76c56b6c014728043d490a7cd4c3bba87e1efb44248c644ea6f158d720a38","source":{"kind":"arxiv","id":"2506.14942","version":4},"attestation_state":"computed","paper":{"title":"Some remarks on Folkman graphs for triangles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eion Mulrenin, Steven Van Overberghe","submitted_at":"2025-06-17T19:47:32Z","abstract_excerpt":"Folkman's theorem asserts the existence of graphs $G$ which are $K_4$-free, but which have the property that every two-coloring of $E(G)$ contains a monochromatic triangle. The quantitative aspects of $f(2,3,4)$, the least $n$ such that there exists an $n$-vertex graph with both properties above, are notoriously difficult; a series of improvements over the span of two decades witnessed the solution to two \\$100 Erd\\H{o}s problems, and the current record due to Lange, Radziszowski, and Xu now stands at $f(2,3,4) \\leq 786$,with another \\$100 problem of Graham asking for a proof that $f(2,3,4) < "},"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":"2506.14942","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-17T19:47:32Z","cross_cats_sorted":[],"title_canon_sha256":"45edcdb5bfde184a4ebf8c146e852a8a9cf49475f75485afed7fe2d5e992a053","abstract_canon_sha256":"2a443b23ad9dca86f9e20781ba4fffbdb6b66ecbe52c9fe0e5c7635f02b04068"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:12:46.232877Z","signature_b64":"PlNCMLJncJA+LzHLkeHo+wS+Ywq1HGNrqDdDG2Xm6xCs+cPuexLI1YvHWWlaslJSMphu7maYl+hEcsk8hFndCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bda76c56b6c014728043d490a7cd4c3bba87e1efb44248c644ea6f158d720a38","last_reissued_at":"2026-06-19T16:12:46.232422Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:12:46.232422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Some remarks on Folkman graphs for triangles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eion Mulrenin, Steven Van Overberghe","submitted_at":"2025-06-17T19:47:32Z","abstract_excerpt":"Folkman's theorem asserts the existence of graphs $G$ which are $K_4$-free, but which have the property that every two-coloring of $E(G)$ contains a monochromatic triangle. The quantitative aspects of $f(2,3,4)$, the least $n$ such that there exists an $n$-vertex graph with both properties above, are notoriously difficult; a series of improvements over the span of two decades witnessed the solution to two \\$100 Erd\\H{o}s problems, and the current record due to Lange, Radziszowski, and Xu now stands at $f(2,3,4) \\leq 786$,with another \\$100 problem of Graham asking for a proof that $f(2,3,4) < "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.14942","kind":"arxiv","version":4},"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/2506.14942/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2506.14942","created_at":"2026-06-19T16:12:46.232479+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.14942v4","created_at":"2026-06-19T16:12:46.232479+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.14942","created_at":"2026-06-19T16:12:46.232479+00:00"},{"alias_kind":"pith_short_12","alias_value":"XWTWYVVWYAKH","created_at":"2026-06-19T16:12:46.232479+00:00"},{"alias_kind":"pith_short_16","alias_value":"XWTWYVVWYAKHFACD","created_at":"2026-06-19T16:12:46.232479+00:00"},{"alias_kind":"pith_short_8","alias_value":"XWTWYVVW","created_at":"2026-06-19T16:12:46.232479+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/XWTWYVVWYAKHFACD2SIKPTKMHO","json":"https://pith.science/pith/XWTWYVVWYAKHFACD2SIKPTKMHO.json","graph_json":"https://pith.science/api/pith-number/XWTWYVVWYAKHFACD2SIKPTKMHO/graph.json","events_json":"https://pith.science/api/pith-number/XWTWYVVWYAKHFACD2SIKPTKMHO/events.json","paper":"https://pith.science/paper/XWTWYVVW"},"agent_actions":{"view_html":"https://pith.science/pith/XWTWYVVWYAKHFACD2SIKPTKMHO","download_json":"https://pith.science/pith/XWTWYVVWYAKHFACD2SIKPTKMHO.json","view_paper":"https://pith.science/paper/XWTWYVVW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.14942&json=true","fetch_graph":"https://pith.science/api/pith-number/XWTWYVVWYAKHFACD2SIKPTKMHO/graph.json","fetch_events":"https://pith.science/api/pith-number/XWTWYVVWYAKHFACD2SIKPTKMHO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XWTWYVVWYAKHFACD2SIKPTKMHO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XWTWYVVWYAKHFACD2SIKPTKMHO/action/storage_attestation","attest_author":"https://pith.science/pith/XWTWYVVWYAKHFACD2SIKPTKMHO/action/author_attestation","sign_citation":"https://pith.science/pith/XWTWYVVWYAKHFACD2SIKPTKMHO/action/citation_signature","submit_replication":"https://pith.science/pith/XWTWYVVWYAKHFACD2SIKPTKMHO/action/replication_record"}},"created_at":"2026-06-19T16:12:46.232479+00:00","updated_at":"2026-06-19T16:12:46.232479+00:00"}