{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:XWTWYVVWYAKHFACD2SIKPTKMHO","short_pith_number":"pith:XWTWYVVW","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"},"canonical_sha256":"bda76c56b6c014728043d490a7cd4c3bba87e1efb44248c644ea6f158d720a38","source":{"kind":"arxiv","id":"2506.14942","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.14942","created_at":"2026-06-19T16:12:46Z"},{"alias_kind":"arxiv_version","alias_value":"2506.14942v4","created_at":"2026-06-19T16:12:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.14942","created_at":"2026-06-19T16:12:46Z"},{"alias_kind":"pith_short_12","alias_value":"XWTWYVVWYAKH","created_at":"2026-06-19T16:12:46Z"},{"alias_kind":"pith_short_16","alias_value":"XWTWYVVWYAKHFACD","created_at":"2026-06-19T16:12:46Z"},{"alias_kind":"pith_short_8","alias_value":"XWTWYVVW","created_at":"2026-06-19T16:12:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:XWTWYVVWYAKHFACD2SIKPTKMHO","target":"record","payload":{"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"},"canonical_sha256":"bda76c56b6c014728043d490a7cd4c3bba87e1efb44248c644ea6f158d720a38","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"},"source_kind":"arxiv","source_id":"2506.14942","source_version":4,"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-06-19T16:12:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0sQqGJdoKpVKiXzLQ7Y2qkNXVhvnGX+l9MXQTQDX26Ub1zCYXBBCxXgu6QRW+k9FjbSftEzOxs9qnQM6k10qDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T19:54:41.103081Z"},"content_sha256":"7af7075bb0b32069b11ef7d57d6303c0ba07cf29bbf9a9afc5989bd5c8b86ca8","schema_version":"1.0","event_id":"sha256:7af7075bb0b32069b11ef7d57d6303c0ba07cf29bbf9a9afc5989bd5c8b86ca8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:XWTWYVVWYAKHFACD2SIKPTKMHO","target":"graph","payload":{"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"},"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-06-19T16:12:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I6SulHE7qKzV8+X6VmY2aHDPxcpuTK1kITuQYZZeIVTyjUBzF6DbFcgIZ2IQ/Hg+lQMIH0SODDMtbeZx3QTQDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T19:54:41.103464Z"},"content_sha256":"b558074e011c89d3e8b2dd20d5b9af65b38568b0b8a59f603d35d91210723076","schema_version":"1.0","event_id":"sha256:b558074e011c89d3e8b2dd20d5b9af65b38568b0b8a59f603d35d91210723076"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XWTWYVVWYAKHFACD2SIKPTKMHO/bundle.json","state_url":"https://pith.science/pith/XWTWYVVWYAKHFACD2SIKPTKMHO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XWTWYVVWYAKHFACD2SIKPTKMHO/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-28T19:54:41Z","links":{"resolver":"https://pith.science/pith/XWTWYVVWYAKHFACD2SIKPTKMHO","bundle":"https://pith.science/pith/XWTWYVVWYAKHFACD2SIKPTKMHO/bundle.json","state":"https://pith.science/pith/XWTWYVVWYAKHFACD2SIKPTKMHO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XWTWYVVWYAKHFACD2SIKPTKMHO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:XWTWYVVWYAKHFACD2SIKPTKMHO","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":"2a443b23ad9dca86f9e20781ba4fffbdb6b66ecbe52c9fe0e5c7635f02b04068","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-17T19:47:32Z","title_canon_sha256":"45edcdb5bfde184a4ebf8c146e852a8a9cf49475f75485afed7fe2d5e992a053"},"schema_version":"1.0","source":{"id":"2506.14942","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.14942","created_at":"2026-06-19T16:12:46Z"},{"alias_kind":"arxiv_version","alias_value":"2506.14942v4","created_at":"2026-06-19T16:12:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.14942","created_at":"2026-06-19T16:12:46Z"},{"alias_kind":"pith_short_12","alias_value":"XWTWYVVWYAKH","created_at":"2026-06-19T16:12:46Z"},{"alias_kind":"pith_short_16","alias_value":"XWTWYVVWYAKHFACD","created_at":"2026-06-19T16:12:46Z"},{"alias_kind":"pith_short_8","alias_value":"XWTWYVVW","created_at":"2026-06-19T16:12:46Z"}],"graph_snapshots":[{"event_id":"sha256:b558074e011c89d3e8b2dd20d5b9af65b38568b0b8a59f603d35d91210723076","target":"graph","created_at":"2026-06-19T16:12:46Z","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":[],"endpoint":"/pith/2506.14942/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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) < ","authors_text":"Eion Mulrenin, Steven Van Overberghe","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-17T19:47:32Z","title":"Some remarks on Folkman graphs for triangles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.14942","kind":"arxiv","version":4},"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:7af7075bb0b32069b11ef7d57d6303c0ba07cf29bbf9a9afc5989bd5c8b86ca8","target":"record","created_at":"2026-06-19T16:12:46Z","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":"2a443b23ad9dca86f9e20781ba4fffbdb6b66ecbe52c9fe0e5c7635f02b04068","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-17T19:47:32Z","title_canon_sha256":"45edcdb5bfde184a4ebf8c146e852a8a9cf49475f75485afed7fe2d5e992a053"},"schema_version":"1.0","source":{"id":"2506.14942","kind":"arxiv","version":4}},"canonical_sha256":"bda76c56b6c014728043d490a7cd4c3bba87e1efb44248c644ea6f158d720a38","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bda76c56b6c014728043d490a7cd4c3bba87e1efb44248c644ea6f158d720a38","first_computed_at":"2026-06-19T16:12:46.232422Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:12:46.232422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PlNCMLJncJA+LzHLkeHo+wS+Ywq1HGNrqDdDG2Xm6xCs+cPuexLI1YvHWWlaslJSMphu7maYl+hEcsk8hFndCQ==","signature_status":"signed_v1","signed_at":"2026-06-19T16:12:46.232877Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.14942","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7af7075bb0b32069b11ef7d57d6303c0ba07cf29bbf9a9afc5989bd5c8b86ca8","sha256:b558074e011c89d3e8b2dd20d5b9af65b38568b0b8a59f603d35d91210723076"],"state_sha256":"969ca3d3cdc5a82166f27afa0ffa2f1df9a4a40ff6a63ae406ef95fc91885935"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sA1ZbUotAUhDdngX4Lr67wrnX29AfE5jTkeCjD3KBWC/4M18mEk6+TVSGg6rODNfvHKdJ7eTguflIStZqMALAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T19:54:41.105512Z","bundle_sha256":"923974ebda2be25448cca5f7248c17eee2c65a2a465e1594a4d03490d882727c"}}