{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:M5USXFUGL2XM6DEODIDLFOV6JA","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":"06db27fdb712481c9279457a2776f9a2e1b05a8abb21df2c0b0dc7c55943a256","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-17T19:12:35Z","title_canon_sha256":"cb7546a0c5e1e8d1e563d4da831cfaf016e585db92edd67119fde5e3fca8618e"},"schema_version":"1.0","source":{"id":"1606.05628","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.05628","created_at":"2026-05-18T00:12:50Z"},{"alias_kind":"arxiv_version","alias_value":"1606.05628v2","created_at":"2026-05-18T00:12:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05628","created_at":"2026-05-18T00:12:50Z"},{"alias_kind":"pith_short_12","alias_value":"M5USXFUGL2XM","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"M5USXFUGL2XM6DEO","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"M5USXFUG","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:bbbac6fd31b8397a6856dee8722d95b88db050f5f54f0052ca79cd3671df5d6d","target":"graph","created_at":"2026-05-18T00:12:50Z","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":"An ordered graph is a pair $\\mathcal{G}=(G,\\prec)$ where $G$ is a graph and $\\prec$ is a total ordering of its vertices. The ordered Ramsey number $\\overline{R}(\\mathcal{G})$ is the minimum number $N$ such that every $2$-coloring of the edges of the ordered complete graph on $N$ vertices contains a monochromatic copy of $\\mathcal{G}$.\n  We show that for every integer $d \\geq 3$, almost every $d$-regular graph $G$ satisfies $\\overline{R}(\\mathcal{G}) \\geq \\frac{n^{3/2-1/d}}{4\\log{n}\\log{\\log{n}}}$ for every ordering $\\mathcal{G}$ of $G$. In particular, there are 3-regular graphs $G$ on $n$ vert","authors_text":"Martin Balko, Pavel Valtr, V\\'it Jel\\'inek","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-17T19:12:35Z","title":"On ordered Ramsey numbers of bounded-degree graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05628","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:a9913530ee5ff1d738a268091a7e17b5afbc83b4e7c13d6f791ad9d97cfd2914","target":"record","created_at":"2026-05-18T00:12:50Z","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":"06db27fdb712481c9279457a2776f9a2e1b05a8abb21df2c0b0dc7c55943a256","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-17T19:12:35Z","title_canon_sha256":"cb7546a0c5e1e8d1e563d4da831cfaf016e585db92edd67119fde5e3fca8618e"},"schema_version":"1.0","source":{"id":"1606.05628","kind":"arxiv","version":2}},"canonical_sha256":"67692b96865eaecf0c8e1a06b2babe48068a4ecc1084492455f7508c19262cac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67692b96865eaecf0c8e1a06b2babe48068a4ecc1084492455f7508c19262cac","first_computed_at":"2026-05-18T00:12:50.903703Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:50.903703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N6A7N8sG9hgj11XMmomfFz5Dv5mMvIrDePtIf2q6gOuB9o+5/YJIpOgGQjCeqjjadDLtJsPnh2dGZkGQaVTlBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:50.904113Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.05628","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9913530ee5ff1d738a268091a7e17b5afbc83b4e7c13d6f791ad9d97cfd2914","sha256:bbbac6fd31b8397a6856dee8722d95b88db050f5f54f0052ca79cd3671df5d6d"],"state_sha256":"cced248c5ceeac269516cbefa76b92179235683e12cfa72e8604f5bc2b514a09"}