{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HIRLWEKGV6DRJPLDM42PGOVNJ3","short_pith_number":"pith:HIRLWEKG","schema_version":"1.0","canonical_sha256":"3a22bb1146af8714bd636734f33aad4ed7db5e2a686849a2c4ffbffc7fc1fae3","source":{"kind":"arxiv","id":"1601.01493","version":2},"attestation_state":"computed","paper":{"title":"A note on induced Ramsey numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Conlon, Domingos Dellamonica Jr., Mathias Schacht, Steven La Fleur, Vojt\\v{e}ch R\\\"odl","submitted_at":"2016-01-07T11:37:21Z","abstract_excerpt":"The induced Ramsey number $r_{\\mathrm{ind}}(F)$ of a $k$-uniform hypergraph $F$ is the smallest natural number $n$ for which there exists a $k$-uniform hypergraph $G$ on $n$ vertices such that every two-coloring of the edges of $G$ contains an induced monochromatic copy of $F$. We study this function, showing that $r_{\\mathrm{ind}}(F)$ is bounded above by a reasonable power of $r(F)$. In particular, our result implies that $r_{\\mathrm{ind}}(F) \\leq 2^{2^{ct}}$ for any $3$-uniform hypergraph $F$ with $t$ vertices, mirroring the best known bound for the usual Ramsey number. The proof relies on a"},"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":"1601.01493","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-07T11:37:21Z","cross_cats_sorted":[],"title_canon_sha256":"468d7677ff0c22357e20d08b7b5dc7af6d9b568aaf1e26e6ebf140f0841940ed","abstract_canon_sha256":"db3429ce45fd909fe7bafd683b1d3e6e45cfe7f3304d17c5995510fe32bd524c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:45.496493Z","signature_b64":"n++nWCh2G3FuDlgMLGQiwiQt5jnCPpRN4e04G6/lS6ScwxyEjjpx3AqV2HotJ75bHc+aXYph86fKJaz4me4ZCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a22bb1146af8714bd636734f33aad4ed7db5e2a686849a2c4ffbffc7fc1fae3","last_reissued_at":"2026-05-18T00:31:45.495918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:45.495918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on induced Ramsey numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Conlon, Domingos Dellamonica Jr., Mathias Schacht, Steven La Fleur, Vojt\\v{e}ch R\\\"odl","submitted_at":"2016-01-07T11:37:21Z","abstract_excerpt":"The induced Ramsey number $r_{\\mathrm{ind}}(F)$ of a $k$-uniform hypergraph $F$ is the smallest natural number $n$ for which there exists a $k$-uniform hypergraph $G$ on $n$ vertices such that every two-coloring of the edges of $G$ contains an induced monochromatic copy of $F$. We study this function, showing that $r_{\\mathrm{ind}}(F)$ is bounded above by a reasonable power of $r(F)$. In particular, our result implies that $r_{\\mathrm{ind}}(F) \\leq 2^{2^{ct}}$ for any $3$-uniform hypergraph $F$ with $t$ vertices, mirroring the best known bound for the usual Ramsey number. The proof relies on a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01493","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":"1601.01493","created_at":"2026-05-18T00:31:45.496005+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.01493v2","created_at":"2026-05-18T00:31:45.496005+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01493","created_at":"2026-05-18T00:31:45.496005+00:00"},{"alias_kind":"pith_short_12","alias_value":"HIRLWEKGV6DR","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"HIRLWEKGV6DRJPLD","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"HIRLWEKG","created_at":"2026-05-18T12:30:19.053100+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/HIRLWEKGV6DRJPLDM42PGOVNJ3","json":"https://pith.science/pith/HIRLWEKGV6DRJPLDM42PGOVNJ3.json","graph_json":"https://pith.science/api/pith-number/HIRLWEKGV6DRJPLDM42PGOVNJ3/graph.json","events_json":"https://pith.science/api/pith-number/HIRLWEKGV6DRJPLDM42PGOVNJ3/events.json","paper":"https://pith.science/paper/HIRLWEKG"},"agent_actions":{"view_html":"https://pith.science/pith/HIRLWEKGV6DRJPLDM42PGOVNJ3","download_json":"https://pith.science/pith/HIRLWEKGV6DRJPLDM42PGOVNJ3.json","view_paper":"https://pith.science/paper/HIRLWEKG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.01493&json=true","fetch_graph":"https://pith.science/api/pith-number/HIRLWEKGV6DRJPLDM42PGOVNJ3/graph.json","fetch_events":"https://pith.science/api/pith-number/HIRLWEKGV6DRJPLDM42PGOVNJ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HIRLWEKGV6DRJPLDM42PGOVNJ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HIRLWEKGV6DRJPLDM42PGOVNJ3/action/storage_attestation","attest_author":"https://pith.science/pith/HIRLWEKGV6DRJPLDM42PGOVNJ3/action/author_attestation","sign_citation":"https://pith.science/pith/HIRLWEKGV6DRJPLDM42PGOVNJ3/action/citation_signature","submit_replication":"https://pith.science/pith/HIRLWEKGV6DRJPLDM42PGOVNJ3/action/replication_record"}},"created_at":"2026-05-18T00:31:45.496005+00:00","updated_at":"2026-05-18T00:31:45.496005+00:00"}