{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:F3OWNTXXNXVNMDU2KVQIZI6TKA","short_pith_number":"pith:F3OWNTXX","schema_version":"1.0","canonical_sha256":"2edd66cef76dead60e9a55608ca3d35025e7e6a9d253cc0de4508c73773c9581","source":{"kind":"arxiv","id":"1011.4310","version":2},"attestation_state":"computed","paper":{"title":"Combinatorial theorems in sparse random sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"D. Conlon, W.T. Gowers","submitted_at":"2010-11-18T21:32:51Z","abstract_excerpt":"We develop a new technique that allows us to show in a unified way that many well-known combinatorial theorems, including Tur\\'an's theorem, Szemer\\'edi's theorem and Ramsey's theorem, hold almost surely inside sparse random sets. For instance, we extend Tur\\'an's theorem to the random setting by showing that for every $\\epsilon > 0$ and every positive integer $t \\geq 3$ there exists a constant $C$ such that, if $G$ is a random graph on $n$ vertices where each edge is chosen independently with probability at least $C n^{-2/(t+1)}$, then, with probability tending to $1$ as $n$ tends to infinity"},"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":"1011.4310","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-18T21:32:51Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"a6cde2a5b850da1180b30fa566d4158f385b1f8ba2a62f59e25bba7c5e40668b","abstract_canon_sha256":"bce10300a97b2632a46315f22480b4ae62077130e9f00f406c098e4e938f959b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:12.423101Z","signature_b64":"YKdGQJNcYHoJN7VccG4pTJUdz8bKcZbX5x4oQo7jM15ztiysn0S+So1V8fDbhwarTIclVRTnYhLyS+8835CuDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2edd66cef76dead60e9a55608ca3d35025e7e6a9d253cc0de4508c73773c9581","last_reissued_at":"2026-05-18T02:28:12.422681Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:12.422681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorial theorems in sparse random sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"D. Conlon, W.T. Gowers","submitted_at":"2010-11-18T21:32:51Z","abstract_excerpt":"We develop a new technique that allows us to show in a unified way that many well-known combinatorial theorems, including Tur\\'an's theorem, Szemer\\'edi's theorem and Ramsey's theorem, hold almost surely inside sparse random sets. For instance, we extend Tur\\'an's theorem to the random setting by showing that for every $\\epsilon > 0$ and every positive integer $t \\geq 3$ there exists a constant $C$ such that, if $G$ is a random graph on $n$ vertices where each edge is chosen independently with probability at least $C n^{-2/(t+1)}$, then, with probability tending to $1$ as $n$ tends to infinity"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.4310","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":"1011.4310","created_at":"2026-05-18T02:28:12.422747+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.4310v2","created_at":"2026-05-18T02:28:12.422747+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.4310","created_at":"2026-05-18T02:28:12.422747+00:00"},{"alias_kind":"pith_short_12","alias_value":"F3OWNTXXNXVN","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"F3OWNTXXNXVNMDU2","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"F3OWNTXX","created_at":"2026-05-18T12:26:06.534383+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/F3OWNTXXNXVNMDU2KVQIZI6TKA","json":"https://pith.science/pith/F3OWNTXXNXVNMDU2KVQIZI6TKA.json","graph_json":"https://pith.science/api/pith-number/F3OWNTXXNXVNMDU2KVQIZI6TKA/graph.json","events_json":"https://pith.science/api/pith-number/F3OWNTXXNXVNMDU2KVQIZI6TKA/events.json","paper":"https://pith.science/paper/F3OWNTXX"},"agent_actions":{"view_html":"https://pith.science/pith/F3OWNTXXNXVNMDU2KVQIZI6TKA","download_json":"https://pith.science/pith/F3OWNTXXNXVNMDU2KVQIZI6TKA.json","view_paper":"https://pith.science/paper/F3OWNTXX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.4310&json=true","fetch_graph":"https://pith.science/api/pith-number/F3OWNTXXNXVNMDU2KVQIZI6TKA/graph.json","fetch_events":"https://pith.science/api/pith-number/F3OWNTXXNXVNMDU2KVQIZI6TKA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F3OWNTXXNXVNMDU2KVQIZI6TKA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F3OWNTXXNXVNMDU2KVQIZI6TKA/action/storage_attestation","attest_author":"https://pith.science/pith/F3OWNTXXNXVNMDU2KVQIZI6TKA/action/author_attestation","sign_citation":"https://pith.science/pith/F3OWNTXXNXVNMDU2KVQIZI6TKA/action/citation_signature","submit_replication":"https://pith.science/pith/F3OWNTXXNXVNMDU2KVQIZI6TKA/action/replication_record"}},"created_at":"2026-05-18T02:28:12.422747+00:00","updated_at":"2026-05-18T02:28:12.422747+00:00"}