{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:X5SIMP5XTRR5AWES2Q5B27ZDX2","short_pith_number":"pith:X5SIMP5X","schema_version":"1.0","canonical_sha256":"bf64863fb79c63d05892d43a1d7f23be8d1747f78ce3c62af958feead45de7e1","source":{"kind":"arxiv","id":"1108.5254","version":3},"attestation_state":"computed","paper":{"title":"Tur\\'an numbers for $K_{s,t}$-free graphs: topological obstructions and algebraic constructions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG","math.AT"],"primary_cat":"math.CO","authors_text":"Boris Bukh, Pavle Blagojevi\\'c, Roman Karasev","submitted_at":"2011-08-26T08:14:56Z","abstract_excerpt":"We show that every hypersurface in $\\R^s\\times \\R^s$ contains a large grid, i.e., the set of the form $S\\times T$, with $S,T\\subset \\R^s$. We use this to deduce that the known constructions of extremal $K_{2,2}$-free and $K_{3,3}$-free graphs cannot be generalized to a similar construction of $K_{s,s}$-free graphs for any $s\\geq 4$. We also give new constructions of extremal $K_{s,t}$-free graphs for large $t$."},"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":"1108.5254","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-26T08:14:56Z","cross_cats_sorted":["math.AG","math.AT"],"title_canon_sha256":"9d018449cfd8b4b91499e78eaaa2f200b44b6478f4502f3568d9b14d08a1d4e5","abstract_canon_sha256":"2123834e823476088edfebac6b3b76d85d4aab9286bf50547841ab3aa5e4660e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:54.711687Z","signature_b64":"fAVPMNJsQy3lc4VdPcW80NWULZf+kP4PR8ZN9ruYdUO2T2FJBt3KWKmyhJ0ZJt3pKNpn5Wz0CHiQdH2So3gwCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf64863fb79c63d05892d43a1d7f23be8d1747f78ce3c62af958feead45de7e1","last_reissued_at":"2026-05-18T03:01:54.711225Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:54.711225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tur\\'an numbers for $K_{s,t}$-free graphs: topological obstructions and algebraic constructions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG","math.AT"],"primary_cat":"math.CO","authors_text":"Boris Bukh, Pavle Blagojevi\\'c, Roman Karasev","submitted_at":"2011-08-26T08:14:56Z","abstract_excerpt":"We show that every hypersurface in $\\R^s\\times \\R^s$ contains a large grid, i.e., the set of the form $S\\times T$, with $S,T\\subset \\R^s$. We use this to deduce that the known constructions of extremal $K_{2,2}$-free and $K_{3,3}$-free graphs cannot be generalized to a similar construction of $K_{s,s}$-free graphs for any $s\\geq 4$. We also give new constructions of extremal $K_{s,t}$-free graphs for large $t$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.5254","kind":"arxiv","version":3},"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":"1108.5254","created_at":"2026-05-18T03:01:54.711292+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.5254v3","created_at":"2026-05-18T03:01:54.711292+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.5254","created_at":"2026-05-18T03:01:54.711292+00:00"},{"alias_kind":"pith_short_12","alias_value":"X5SIMP5XTRR5","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"X5SIMP5XTRR5AWES","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"X5SIMP5X","created_at":"2026-05-18T12:26:44.992195+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/X5SIMP5XTRR5AWES2Q5B27ZDX2","json":"https://pith.science/pith/X5SIMP5XTRR5AWES2Q5B27ZDX2.json","graph_json":"https://pith.science/api/pith-number/X5SIMP5XTRR5AWES2Q5B27ZDX2/graph.json","events_json":"https://pith.science/api/pith-number/X5SIMP5XTRR5AWES2Q5B27ZDX2/events.json","paper":"https://pith.science/paper/X5SIMP5X"},"agent_actions":{"view_html":"https://pith.science/pith/X5SIMP5XTRR5AWES2Q5B27ZDX2","download_json":"https://pith.science/pith/X5SIMP5XTRR5AWES2Q5B27ZDX2.json","view_paper":"https://pith.science/paper/X5SIMP5X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.5254&json=true","fetch_graph":"https://pith.science/api/pith-number/X5SIMP5XTRR5AWES2Q5B27ZDX2/graph.json","fetch_events":"https://pith.science/api/pith-number/X5SIMP5XTRR5AWES2Q5B27ZDX2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X5SIMP5XTRR5AWES2Q5B27ZDX2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X5SIMP5XTRR5AWES2Q5B27ZDX2/action/storage_attestation","attest_author":"https://pith.science/pith/X5SIMP5XTRR5AWES2Q5B27ZDX2/action/author_attestation","sign_citation":"https://pith.science/pith/X5SIMP5XTRR5AWES2Q5B27ZDX2/action/citation_signature","submit_replication":"https://pith.science/pith/X5SIMP5XTRR5AWES2Q5B27ZDX2/action/replication_record"}},"created_at":"2026-05-18T03:01:54.711292+00:00","updated_at":"2026-05-18T03:01:54.711292+00:00"}