{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:YWAXGZM5452QNR6VUVP3VQ5AAT","short_pith_number":"pith:YWAXGZM5","schema_version":"1.0","canonical_sha256":"c58173659de77506c7d5a55fbac3a004d47f5507c72ff8d5f2f089dda55102d7","source":{"kind":"arxiv","id":"1207.3750","version":2},"attestation_state":"computed","paper":{"title":"Use of MAX-CUT for Ramsey Arrowing of Triangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Alexander Lange, Stanis{\\l}aw Radziszowski, Xiaodong Xu","submitted_at":"2012-07-16T18:20:32Z","abstract_excerpt":"In 1967, Erd\\H{o}s and Hajnal asked the question: Does there exist a $K_4$-free graph that is not the union of two triangle-free graphs? Finding such a graph involves solving a special case of the classical Ramsey arrowing operation. Folkman proved the existence of these graphs in 1970, and they are now called Folkman graphs. Erd\\H{o}s offered \\$100 for deciding if one exists with less than $10^{10}$ vertices. This problem remained open until 1988 when Spencer, in a seminal paper using probabilistic techniques, proved the existence of a Folkman graph of order $3\\times 10^9$ (after an erratum),"},"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":"1207.3750","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-16T18:20:32Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"009a7cfee13f51eaea3d48e01e1ffbfc140d4f71e2897aa57c457737028f9bf8","abstract_canon_sha256":"8a4627f93f934a7417a14eccf73c1718827517f94f413c2cc96dd2561f3bcbc4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:14.880136Z","signature_b64":"0YNfFoIt79iV3pyo2s0lIWlCf1Ivdx2IDGpBRhvW6quTKKxnBeeD2YJUzzz3iDIgKM7X6iCNQQzFCOavgekUAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c58173659de77506c7d5a55fbac3a004d47f5507c72ff8d5f2f089dda55102d7","last_reissued_at":"2026-05-18T03:30:14.879198Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:14.879198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Use of MAX-CUT for Ramsey Arrowing of Triangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Alexander Lange, Stanis{\\l}aw Radziszowski, Xiaodong Xu","submitted_at":"2012-07-16T18:20:32Z","abstract_excerpt":"In 1967, Erd\\H{o}s and Hajnal asked the question: Does there exist a $K_4$-free graph that is not the union of two triangle-free graphs? Finding such a graph involves solving a special case of the classical Ramsey arrowing operation. Folkman proved the existence of these graphs in 1970, and they are now called Folkman graphs. Erd\\H{o}s offered \\$100 for deciding if one exists with less than $10^{10}$ vertices. This problem remained open until 1988 when Spencer, in a seminal paper using probabilistic techniques, proved the existence of a Folkman graph of order $3\\times 10^9$ (after an erratum),"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3750","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1207.3750","created_at":"2026-05-18T03:30:14.879383+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.3750v2","created_at":"2026-05-18T03:30:14.879383+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3750","created_at":"2026-05-18T03:30:14.879383+00:00"},{"alias_kind":"pith_short_12","alias_value":"YWAXGZM5452Q","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"YWAXGZM5452QNR6V","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"YWAXGZM5","created_at":"2026-05-18T12:27:30.460161+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/YWAXGZM5452QNR6VUVP3VQ5AAT","json":"https://pith.science/pith/YWAXGZM5452QNR6VUVP3VQ5AAT.json","graph_json":"https://pith.science/api/pith-number/YWAXGZM5452QNR6VUVP3VQ5AAT/graph.json","events_json":"https://pith.science/api/pith-number/YWAXGZM5452QNR6VUVP3VQ5AAT/events.json","paper":"https://pith.science/paper/YWAXGZM5"},"agent_actions":{"view_html":"https://pith.science/pith/YWAXGZM5452QNR6VUVP3VQ5AAT","download_json":"https://pith.science/pith/YWAXGZM5452QNR6VUVP3VQ5AAT.json","view_paper":"https://pith.science/paper/YWAXGZM5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.3750&json=true","fetch_graph":"https://pith.science/api/pith-number/YWAXGZM5452QNR6VUVP3VQ5AAT/graph.json","fetch_events":"https://pith.science/api/pith-number/YWAXGZM5452QNR6VUVP3VQ5AAT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YWAXGZM5452QNR6VUVP3VQ5AAT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YWAXGZM5452QNR6VUVP3VQ5AAT/action/storage_attestation","attest_author":"https://pith.science/pith/YWAXGZM5452QNR6VUVP3VQ5AAT/action/author_attestation","sign_citation":"https://pith.science/pith/YWAXGZM5452QNR6VUVP3VQ5AAT/action/citation_signature","submit_replication":"https://pith.science/pith/YWAXGZM5452QNR6VUVP3VQ5AAT/action/replication_record"}},"created_at":"2026-05-18T03:30:14.879383+00:00","updated_at":"2026-05-18T03:30:14.879383+00:00"}