{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:RGLJIHTCCMGADANC5LNBCXXM5N","short_pith_number":"pith:RGLJIHTC","schema_version":"1.0","canonical_sha256":"8996941e62130c0181a2eada115eeceb6ca88b30a9e032d4f6d2ad5927bb9933","source":{"kind":"arxiv","id":"2211.15819","version":1},"attestation_state":"computed","paper":{"title":"Partition universality for graphs of bounded degeneracy and degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Julia B\\\"ottcher, Peter Allen","submitted_at":"2022-11-28T23:07:10Z","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$."},"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":"2211.15819","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-11-28T23:07:10Z","cross_cats_sorted":[],"title_canon_sha256":"f1f948c4519a060daff643050007104950599cad3bc17bb9eaeebb2846e3c67c","abstract_canon_sha256":"5d46d1eb2b075a05e7acbc8ecb31125b78662423a8e084b1e196b8d8098eed79"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:20:18.589015Z","signature_b64":"lqWdwaQ1788pRszJ0S/ZaTzb78M/cAuLl2iyyvGWSijnLB9izT+z3nILnoKjsogsZq8hNvkGRPvOqYluEes9CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8996941e62130c0181a2eada115eeceb6ca88b30a9e032d4f6d2ad5927bb9933","last_reissued_at":"2026-07-05T05:20:18.588673Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:20:18.588673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partition universality for graphs of bounded degeneracy and degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Julia B\\\"ottcher, Peter Allen","submitted_at":"2022-11-28T23:07:10Z","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$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.15819","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/2211.15819/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":"2211.15819","created_at":"2026-07-05T05:20:18.588729+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.15819v1","created_at":"2026-07-05T05:20:18.588729+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.15819","created_at":"2026-07-05T05:20:18.588729+00:00"},{"alias_kind":"pith_short_12","alias_value":"RGLJIHTCCMGA","created_at":"2026-07-05T05:20:18.588729+00:00"},{"alias_kind":"pith_short_16","alias_value":"RGLJIHTCCMGADANC","created_at":"2026-07-05T05:20:18.588729+00:00"},{"alias_kind":"pith_short_8","alias_value":"RGLJIHTC","created_at":"2026-07-05T05:20:18.588729+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.01525","citing_title":"Combinatorial theorems relative to sparse sets","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RGLJIHTCCMGADANC5LNBCXXM5N","json":"https://pith.science/pith/RGLJIHTCCMGADANC5LNBCXXM5N.json","graph_json":"https://pith.science/api/pith-number/RGLJIHTCCMGADANC5LNBCXXM5N/graph.json","events_json":"https://pith.science/api/pith-number/RGLJIHTCCMGADANC5LNBCXXM5N/events.json","paper":"https://pith.science/paper/RGLJIHTC"},"agent_actions":{"view_html":"https://pith.science/pith/RGLJIHTCCMGADANC5LNBCXXM5N","download_json":"https://pith.science/pith/RGLJIHTCCMGADANC5LNBCXXM5N.json","view_paper":"https://pith.science/paper/RGLJIHTC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.15819&json=true","fetch_graph":"https://pith.science/api/pith-number/RGLJIHTCCMGADANC5LNBCXXM5N/graph.json","fetch_events":"https://pith.science/api/pith-number/RGLJIHTCCMGADANC5LNBCXXM5N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RGLJIHTCCMGADANC5LNBCXXM5N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RGLJIHTCCMGADANC5LNBCXXM5N/action/storage_attestation","attest_author":"https://pith.science/pith/RGLJIHTCCMGADANC5LNBCXXM5N/action/author_attestation","sign_citation":"https://pith.science/pith/RGLJIHTCCMGADANC5LNBCXXM5N/action/citation_signature","submit_replication":"https://pith.science/pith/RGLJIHTCCMGADANC5LNBCXXM5N/action/replication_record"}},"created_at":"2026-07-05T05:20:18.588729+00:00","updated_at":"2026-07-05T05:20:18.588729+00:00"}