{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:N47WJNFQGEHIPBKWF4IDLTBOS3","short_pith_number":"pith:N47WJNFQ","schema_version":"1.0","canonical_sha256":"6f3f64b4b0310e8785562f1035cc2e96c0a0423756c194fa14e19ecc7f1f0dc9","source":{"kind":"arxiv","id":"1109.4472","version":2},"attestation_state":"computed","paper":{"title":"Some Exact Ramsey-Tur\\'an Numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"John Lenz, J\\'ozsef Balogh","submitted_at":"2011-09-21T04:25:59Z","abstract_excerpt":"Let r be an integer, f(n) a function, and H a graph. Introduced by Erd\\H{o}s, Hajnal, S\\'{o}s, and Szemer\\'edi, the r-Ramsey-Tur\\'{a}n number of H, RT_r(n, H, f(n)), is defined to be the maximum number of edges in an n-vertex, H-free graph G with \\alpha_r(G) <= f(n) where \\alpha_r(G) denotes the K_r-independence number of G. In this note, using isoperimetric properties of the high dimensional unit sphere, we construct graphs providing lower bounds for RT_r(n,K_{r+s},o(n)) for every 2 <= s <= r. These constructions are sharp for an infinite family of pairs of r and s. The only previous sharp co"},"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":"1109.4472","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-21T04:25:59Z","cross_cats_sorted":[],"title_canon_sha256":"20c9685b0601396a5ad09099979b484bb1fee913825b80ce880302754474266a","abstract_canon_sha256":"45d6778de701809deb62ec67333052f5f56a472ba0900ceceeb0f8da42032d9a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:34.418255Z","signature_b64":"AsOdX80nDBLJIDz/++M+/sTrD6T42k37McxwnNqUa13CpsDraFVn+gz7QqLiVYFZLaqK5SM+671b4eStB9EpCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f3f64b4b0310e8785562f1035cc2e96c0a0423756c194fa14e19ecc7f1f0dc9","last_reissued_at":"2026-05-18T03:17:34.417773Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:34.417773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Some Exact Ramsey-Tur\\'an Numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"John Lenz, J\\'ozsef Balogh","submitted_at":"2011-09-21T04:25:59Z","abstract_excerpt":"Let r be an integer, f(n) a function, and H a graph. Introduced by Erd\\H{o}s, Hajnal, S\\'{o}s, and Szemer\\'edi, the r-Ramsey-Tur\\'{a}n number of H, RT_r(n, H, f(n)), is defined to be the maximum number of edges in an n-vertex, H-free graph G with \\alpha_r(G) <= f(n) where \\alpha_r(G) denotes the K_r-independence number of G. In this note, using isoperimetric properties of the high dimensional unit sphere, we construct graphs providing lower bounds for RT_r(n,K_{r+s},o(n)) for every 2 <= s <= r. These constructions are sharp for an infinite family of pairs of r and s. The only previous sharp co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.4472","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":"1109.4472","created_at":"2026-05-18T03:17:34.417850+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.4472v2","created_at":"2026-05-18T03:17:34.417850+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4472","created_at":"2026-05-18T03:17:34.417850+00:00"},{"alias_kind":"pith_short_12","alias_value":"N47WJNFQGEHI","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"N47WJNFQGEHIPBKW","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"N47WJNFQ","created_at":"2026-05-18T12:26:37.096874+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/N47WJNFQGEHIPBKWF4IDLTBOS3","json":"https://pith.science/pith/N47WJNFQGEHIPBKWF4IDLTBOS3.json","graph_json":"https://pith.science/api/pith-number/N47WJNFQGEHIPBKWF4IDLTBOS3/graph.json","events_json":"https://pith.science/api/pith-number/N47WJNFQGEHIPBKWF4IDLTBOS3/events.json","paper":"https://pith.science/paper/N47WJNFQ"},"agent_actions":{"view_html":"https://pith.science/pith/N47WJNFQGEHIPBKWF4IDLTBOS3","download_json":"https://pith.science/pith/N47WJNFQGEHIPBKWF4IDLTBOS3.json","view_paper":"https://pith.science/paper/N47WJNFQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.4472&json=true","fetch_graph":"https://pith.science/api/pith-number/N47WJNFQGEHIPBKWF4IDLTBOS3/graph.json","fetch_events":"https://pith.science/api/pith-number/N47WJNFQGEHIPBKWF4IDLTBOS3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N47WJNFQGEHIPBKWF4IDLTBOS3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N47WJNFQGEHIPBKWF4IDLTBOS3/action/storage_attestation","attest_author":"https://pith.science/pith/N47WJNFQGEHIPBKWF4IDLTBOS3/action/author_attestation","sign_citation":"https://pith.science/pith/N47WJNFQGEHIPBKWF4IDLTBOS3/action/citation_signature","submit_replication":"https://pith.science/pith/N47WJNFQGEHIPBKWF4IDLTBOS3/action/replication_record"}},"created_at":"2026-05-18T03:17:34.417850+00:00","updated_at":"2026-05-18T03:17:34.417850+00:00"}