{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:RGLJIHTCCMGADANC5LNBCXXM5N","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":"5d46d1eb2b075a05e7acbc8ecb31125b78662423a8e084b1e196b8d8098eed79","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-11-28T23:07:10Z","title_canon_sha256":"f1f948c4519a060daff643050007104950599cad3bc17bb9eaeebb2846e3c67c"},"schema_version":"1.0","source":{"id":"2211.15819","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.15819","created_at":"2026-07-05T05:20:18Z"},{"alias_kind":"arxiv_version","alias_value":"2211.15819v1","created_at":"2026-07-05T05:20:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.15819","created_at":"2026-07-05T05:20:18Z"},{"alias_kind":"pith_short_12","alias_value":"RGLJIHTCCMGA","created_at":"2026-07-05T05:20:18Z"},{"alias_kind":"pith_short_16","alias_value":"RGLJIHTCCMGADANC","created_at":"2026-07-05T05:20:18Z"},{"alias_kind":"pith_short_8","alias_value":"RGLJIHTC","created_at":"2026-07-05T05:20:18Z"}],"graph_snapshots":[{"event_id":"sha256:2e063a7ab3f34282742f64a550ad07f016017898b20e04a288b159a0e85125f1","target":"graph","created_at":"2026-07-05T05:20:18Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2211.15819/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove asymptotically optimal bounds on the number of edges a graph $G$ must have in order that any $r$-colouring of $E(G)$ has a colour class which contains every $D$-degenerate graph on $n$ vertices with bounded maximum degree. We also improve the upper bounds on the number of edges $G$ must have in order that any $r$-colouring of $E(G)$ has a colour class which contains every $n$-vertex graph with maximum degree $\\Delta$, for each $\\Delta\\ge 4$. In both cases, we show that a binomial random graph with $Cn$ vertices and a suitable edge probability is likely to provide the desired $G$.","authors_text":"Julia B\\\"ottcher, Peter Allen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-11-28T23:07:10Z","title":"Partition universality for graphs of bounded degeneracy and degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.15819","kind":"arxiv","version":1},"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:cd6c47dcc5166ed8da8be35aff53ca5ac3304c30d7860e71cc6c1ab048f73e84","target":"record","created_at":"2026-07-05T05:20:18Z","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":"5d46d1eb2b075a05e7acbc8ecb31125b78662423a8e084b1e196b8d8098eed79","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-11-28T23:07:10Z","title_canon_sha256":"f1f948c4519a060daff643050007104950599cad3bc17bb9eaeebb2846e3c67c"},"schema_version":"1.0","source":{"id":"2211.15819","kind":"arxiv","version":1}},"canonical_sha256":"8996941e62130c0181a2eada115eeceb6ca88b30a9e032d4f6d2ad5927bb9933","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8996941e62130c0181a2eada115eeceb6ca88b30a9e032d4f6d2ad5927bb9933","first_computed_at":"2026-07-05T05:20:18.588673Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:20:18.588673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lqWdwaQ1788pRszJ0S/ZaTzb78M/cAuLl2iyyvGWSijnLB9izT+z3nILnoKjsogsZq8hNvkGRPvOqYluEes9CA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:20:18.589015Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.15819","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd6c47dcc5166ed8da8be35aff53ca5ac3304c30d7860e71cc6c1ab048f73e84","sha256:2e063a7ab3f34282742f64a550ad07f016017898b20e04a288b159a0e85125f1"],"state_sha256":"2876ea4658fc8a816d7f3c7150aa1604ab414bb2876f626dec0cbd631a6505bd"}