{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:F3OWNTXXNXVNMDU2KVQIZI6TKA","short_pith_number":"pith:F3OWNTXX","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"},"canonical_sha256":"2edd66cef76dead60e9a55608ca3d35025e7e6a9d253cc0de4508c73773c9581","source":{"kind":"arxiv","id":"1011.4310","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.4310","created_at":"2026-05-18T02:28:12Z"},{"alias_kind":"arxiv_version","alias_value":"1011.4310v2","created_at":"2026-05-18T02:28:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.4310","created_at":"2026-05-18T02:28:12Z"},{"alias_kind":"pith_short_12","alias_value":"F3OWNTXXNXVN","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"F3OWNTXXNXVNMDU2","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"F3OWNTXX","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:F3OWNTXXNXVNMDU2KVQIZI6TKA","target":"record","payload":{"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"},"canonical_sha256":"2edd66cef76dead60e9a55608ca3d35025e7e6a9d253cc0de4508c73773c9581","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"},"source_kind":"arxiv","source_id":"1011.4310","source_version":2,"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-05-18T02:28:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hhQ19gdpox/8l9C1haPU+1885y/WUlQWEKVKvuPUOLSW5D790KfvpHP9TfMlsAa/+od/0t8NPYTfk9fplJ+KAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:25:47.278967Z"},"content_sha256":"10a2450e2106da0442e7e765ce8aca68eaa1b6af1059ed92aa9f29f543049624","schema_version":"1.0","event_id":"sha256:10a2450e2106da0442e7e765ce8aca68eaa1b6af1059ed92aa9f29f543049624"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:F3OWNTXXNXVNMDU2KVQIZI6TKA","target":"graph","payload":{"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"},"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-05-18T02:28:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JJWt39JzMhrS7kNnvWpmfNmqN58BVF9qoMOhZLOKSaegvkzAWf1B2T4A3JFUnkftC9/Hv35MhVuBAfpPcrrGBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:25:47.279332Z"},"content_sha256":"9180a5c2d586117672f6a24fe06212c9c3a63c1836d44d79d2194d41c29437ae","schema_version":"1.0","event_id":"sha256:9180a5c2d586117672f6a24fe06212c9c3a63c1836d44d79d2194d41c29437ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F3OWNTXXNXVNMDU2KVQIZI6TKA/bundle.json","state_url":"https://pith.science/pith/F3OWNTXXNXVNMDU2KVQIZI6TKA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F3OWNTXXNXVNMDU2KVQIZI6TKA/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-03T02:25:47Z","links":{"resolver":"https://pith.science/pith/F3OWNTXXNXVNMDU2KVQIZI6TKA","bundle":"https://pith.science/pith/F3OWNTXXNXVNMDU2KVQIZI6TKA/bundle.json","state":"https://pith.science/pith/F3OWNTXXNXVNMDU2KVQIZI6TKA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F3OWNTXXNXVNMDU2KVQIZI6TKA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:F3OWNTXXNXVNMDU2KVQIZI6TKA","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":"bce10300a97b2632a46315f22480b4ae62077130e9f00f406c098e4e938f959b","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-18T21:32:51Z","title_canon_sha256":"a6cde2a5b850da1180b30fa566d4158f385b1f8ba2a62f59e25bba7c5e40668b"},"schema_version":"1.0","source":{"id":"1011.4310","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.4310","created_at":"2026-05-18T02:28:12Z"},{"alias_kind":"arxiv_version","alias_value":"1011.4310v2","created_at":"2026-05-18T02:28:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.4310","created_at":"2026-05-18T02:28:12Z"},{"alias_kind":"pith_short_12","alias_value":"F3OWNTXXNXVN","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"F3OWNTXXNXVNMDU2","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"F3OWNTXX","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:9180a5c2d586117672f6a24fe06212c9c3a63c1836d44d79d2194d41c29437ae","target":"graph","created_at":"2026-05-18T02:28:12Z","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"},"paper":{"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","authors_text":"D. Conlon, W.T. Gowers","cross_cats":["math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-18T21:32:51Z","title":"Combinatorial theorems in sparse random sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.4310","kind":"arxiv","version":2},"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:10a2450e2106da0442e7e765ce8aca68eaa1b6af1059ed92aa9f29f543049624","target":"record","created_at":"2026-05-18T02:28:12Z","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":"bce10300a97b2632a46315f22480b4ae62077130e9f00f406c098e4e938f959b","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-18T21:32:51Z","title_canon_sha256":"a6cde2a5b850da1180b30fa566d4158f385b1f8ba2a62f59e25bba7c5e40668b"},"schema_version":"1.0","source":{"id":"1011.4310","kind":"arxiv","version":2}},"canonical_sha256":"2edd66cef76dead60e9a55608ca3d35025e7e6a9d253cc0de4508c73773c9581","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2edd66cef76dead60e9a55608ca3d35025e7e6a9d253cc0de4508c73773c9581","first_computed_at":"2026-05-18T02:28:12.422681Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:12.422681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YKdGQJNcYHoJN7VccG4pTJUdz8bKcZbX5x4oQo7jM15ztiysn0S+So1V8fDbhwarTIclVRTnYhLyS+8835CuDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:12.423101Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.4310","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10a2450e2106da0442e7e765ce8aca68eaa1b6af1059ed92aa9f29f543049624","sha256:9180a5c2d586117672f6a24fe06212c9c3a63c1836d44d79d2194d41c29437ae"],"state_sha256":"c152b1b394747cc59f35fba08495dcc488d78c75fb6bd56e1cfd2fe4b3afde4d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kTgltv8ZDSLJB4j9cX1B8RHRwP5y7I3B5K/1SnJ/rz55tsP9nWQiS5zh861Xnzci58IWArPCq0l5e97WsunyDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:25:47.281279Z","bundle_sha256":"9275fa1f059a8cc0b878ca3dc17127e034c074ab3563f27197cf1cc735818269"}}