{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EKNVQOWHEWL3MYZFAAYX7JKFKC","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":"fae33658b580058f3f14d75b2bf8696aa4069bfad284d0bf2a921ef8278d4338","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-29T09:35:24Z","title_canon_sha256":"d1a5407a82123065656f2bea277dbfe93a58b50689fb5e63ed128ad60669c545"},"schema_version":"1.0","source":{"id":"1405.7507","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.7507","created_at":"2026-05-18T02:50:51Z"},{"alias_kind":"arxiv_version","alias_value":"1405.7507v1","created_at":"2026-05-18T02:50:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7507","created_at":"2026-05-18T02:50:51Z"},{"alias_kind":"pith_short_12","alias_value":"EKNVQOWHEWL3","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EKNVQOWHEWL3MYZF","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EKNVQOWH","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:39afb6249faee797a09de126b753976640252f5f25ffdfb47b4173ad89af30be","target":"graph","created_at":"2026-05-18T02:50:51Z","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":"Let ${\\cal{F}}=\\{F_1,F_2,\\ldots\\}$ be a sequence of graphs such that $F_n$ is a graph on $n$ vertices with maximum degree at most $\\Delta$. We show that there exists an absolute constant $C$ such that the vertices of any 2-edge-colored complete graph can be partitioned into at most $2^{C\\Delta \\log{\\Delta}}$ vertex disjoint monochromatic copies of graphs from ${\\cal{F}}$. If each $F_n$ is bipartite, then we can improve this bound to $2^{C \\Delta}$; this result is optimal up to the constant $C$.","authors_text":"Andrey Grinshpun, Gabor N. Sarkozy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-29T09:35:24Z","title":"Monochromatic bounded degree subgraph partitions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7507","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:8fa09b4376b65a8354226c09df43a3b56a7d0e4db44618b69875f9ad5c1943c2","target":"record","created_at":"2026-05-18T02:50:51Z","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":"fae33658b580058f3f14d75b2bf8696aa4069bfad284d0bf2a921ef8278d4338","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-29T09:35:24Z","title_canon_sha256":"d1a5407a82123065656f2bea277dbfe93a58b50689fb5e63ed128ad60669c545"},"schema_version":"1.0","source":{"id":"1405.7507","kind":"arxiv","version":1}},"canonical_sha256":"229b583ac72597b6632500317fa54550a2ff5ec4d9ce1ddae304cb4bcebd864d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"229b583ac72597b6632500317fa54550a2ff5ec4d9ce1ddae304cb4bcebd864d","first_computed_at":"2026-05-18T02:50:51.094943Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:51.094943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"53RQNzBxjEXQriycQBKDnozavgM4/TxDrEClQlJa/BCAuMgAq4/hmUKP0TwpBNBcI3NMo0Pw4nUepb1DGpveCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:51.095410Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.7507","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8fa09b4376b65a8354226c09df43a3b56a7d0e4db44618b69875f9ad5c1943c2","sha256:39afb6249faee797a09de126b753976640252f5f25ffdfb47b4173ad89af30be"],"state_sha256":"ab6528e2990da6a0308823e5a765c33cd0e837c7b889fbb30a340f73caefcb81"}