{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:2BKQ7H6NG363DFIYMRJWJV5VDF","short_pith_number":"pith:2BKQ7H6N","schema_version":"1.0","canonical_sha256":"d0550f9fcd36fdb19518645364d7b5194c5863bf84f5cace5cb93cd67ca47d37","source":{"kind":"arxiv","id":"2410.08644","version":1},"attestation_state":"computed","paper":{"title":"Canonical Ramsey numbers of sparse graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aleksa Milojevi\\'c, Benny Sudakov, Lior Gishboliner, Yuval Wigderson","submitted_at":"2024-10-11T09:11:05Z","abstract_excerpt":"The canonical Ramsey theorem of Erd\\H{o}s and Rado implies that for any graph $H$, any edge-coloring (with an arbitrary number of colors) of a sufficiently large complete graph $K_N$ contains a monochromatic, lexicographic, or rainbow copy of $H$. The least such $N$ is called the Erd\\H{o}s-Rado number of $H$, denoted by $ER(H)$. Erd\\H{o}s-Rado numbers of cliques have received considerable attention, and in this paper we extend this line of research by studying Erd\\H{o}s-Rado numbers of sparse graphs. For example, we prove that if $H$ has bounded degree, then $ER(H)$ is polynomial in $|V(H)|$ i"},"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":"2410.08644","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-11T09:11:05Z","cross_cats_sorted":[],"title_canon_sha256":"02c08c04e849d5f50ad5330f3339731a5554955c9698b582122047a116fdde23","abstract_canon_sha256":"8fe4302a9962165b024fef7f05c572ab87e520a82a87c0a813e5dfae4c3d4ed9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:19:15.580772Z","signature_b64":"IMSr5E6NhtdxgUeH/q/3ymzeYL3oN9KRW231XqVml+mYR6wcG0qTDLhcXRdIZaZOphB75XJW/cw95Lb9GPzwDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0550f9fcd36fdb19518645364d7b5194c5863bf84f5cace5cb93cd67ca47d37","last_reissued_at":"2026-07-05T09:19:15.580402Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:19:15.580402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Canonical Ramsey numbers of sparse graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aleksa Milojevi\\'c, Benny Sudakov, Lior Gishboliner, Yuval Wigderson","submitted_at":"2024-10-11T09:11:05Z","abstract_excerpt":"The canonical Ramsey theorem of Erd\\H{o}s and Rado implies that for any graph $H$, any edge-coloring (with an arbitrary number of colors) of a sufficiently large complete graph $K_N$ contains a monochromatic, lexicographic, or rainbow copy of $H$. The least such $N$ is called the Erd\\H{o}s-Rado number of $H$, denoted by $ER(H)$. Erd\\H{o}s-Rado numbers of cliques have received considerable attention, and in this paper we extend this line of research by studying Erd\\H{o}s-Rado numbers of sparse graphs. For example, we prove that if $H$ has bounded degree, then $ER(H)$ is polynomial in $|V(H)|$ i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.08644","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.08644/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2410.08644","created_at":"2026-07-05T09:19:15.580458+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.08644v1","created_at":"2026-07-05T09:19:15.580458+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.08644","created_at":"2026-07-05T09:19:15.580458+00:00"},{"alias_kind":"pith_short_12","alias_value":"2BKQ7H6NG363","created_at":"2026-07-05T09:19:15.580458+00:00"},{"alias_kind":"pith_short_16","alias_value":"2BKQ7H6NG363DFIY","created_at":"2026-07-05T09:19:15.580458+00:00"},{"alias_kind":"pith_short_8","alias_value":"2BKQ7H6N","created_at":"2026-07-05T09:19:15.580458+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.16218","citing_title":"Canonical Ramsey numbers for partite hypergraphs","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2BKQ7H6NG363DFIYMRJWJV5VDF","json":"https://pith.science/pith/2BKQ7H6NG363DFIYMRJWJV5VDF.json","graph_json":"https://pith.science/api/pith-number/2BKQ7H6NG363DFIYMRJWJV5VDF/graph.json","events_json":"https://pith.science/api/pith-number/2BKQ7H6NG363DFIYMRJWJV5VDF/events.json","paper":"https://pith.science/paper/2BKQ7H6N"},"agent_actions":{"view_html":"https://pith.science/pith/2BKQ7H6NG363DFIYMRJWJV5VDF","download_json":"https://pith.science/pith/2BKQ7H6NG363DFIYMRJWJV5VDF.json","view_paper":"https://pith.science/paper/2BKQ7H6N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.08644&json=true","fetch_graph":"https://pith.science/api/pith-number/2BKQ7H6NG363DFIYMRJWJV5VDF/graph.json","fetch_events":"https://pith.science/api/pith-number/2BKQ7H6NG363DFIYMRJWJV5VDF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2BKQ7H6NG363DFIYMRJWJV5VDF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2BKQ7H6NG363DFIYMRJWJV5VDF/action/storage_attestation","attest_author":"https://pith.science/pith/2BKQ7H6NG363DFIYMRJWJV5VDF/action/author_attestation","sign_citation":"https://pith.science/pith/2BKQ7H6NG363DFIYMRJWJV5VDF/action/citation_signature","submit_replication":"https://pith.science/pith/2BKQ7H6NG363DFIYMRJWJV5VDF/action/replication_record"}},"created_at":"2026-07-05T09:19:15.580458+00:00","updated_at":"2026-07-05T09:19:15.580458+00:00"}