{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:YSRP7KDOB5JTJOG5FX57FWNBAW","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":"2d92a0fa644a3e589e8b47a4b1174dc1a4511e854bdaa144c40efa2f068e8cd5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-03T08:47:37Z","title_canon_sha256":"7f1426ace6315958e2611ac367a486e84d5e23fd6834db7a398e5a3151114767"},"schema_version":"1.0","source":{"id":"1304.0871","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.0871","created_at":"2026-05-18T03:29:05Z"},{"alias_kind":"arxiv_version","alias_value":"1304.0871v1","created_at":"2026-05-18T03:29:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0871","created_at":"2026-05-18T03:29:05Z"},{"alias_kind":"pith_short_12","alias_value":"YSRP7KDOB5JT","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"YSRP7KDOB5JTJOG5","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"YSRP7KDO","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:8f3632836ca91584469412fb572bec38bd14c64eb5bd9d3b5fe0e870d477924a","target":"graph","created_at":"2026-05-18T03:29:05Z","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":"The typical problem in (generalized) Ramsey theory is to find the order of the largest monochromatic member of a family F (for example matchings, paths, cycles, connected subgraphs) that must be present in any edge coloring of a complete graph K_n with t colors. Another area is to find the minimum number of monochromatic members of F that partition or cover the vertex set of every edge colored complete graph. Here we propose a problem that connects these areas: for fixed positive integers s,t, at least how many vertices can be covered by the vertices of no more than s monochromatic members of ","authors_text":"Andr\\'as Gy\\'arf\\'as, G\\'abor N. S\\'ark\\\"ozy, Stanley Selkow","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-03T08:47:37Z","title":"Coverings by few monochromatic pieces - a transition between two Ramsey problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0871","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:bc6b832077799f644407fbad975e8537abcd4895d62f2bb4a0410528a7e52ca5","target":"record","created_at":"2026-05-18T03:29:05Z","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":"2d92a0fa644a3e589e8b47a4b1174dc1a4511e854bdaa144c40efa2f068e8cd5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-03T08:47:37Z","title_canon_sha256":"7f1426ace6315958e2611ac367a486e84d5e23fd6834db7a398e5a3151114767"},"schema_version":"1.0","source":{"id":"1304.0871","kind":"arxiv","version":1}},"canonical_sha256":"c4a2ffa86e0f5334b8dd2dfbf2d9a105988964fb4a12479e7dafeb6f1ece90e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4a2ffa86e0f5334b8dd2dfbf2d9a105988964fb4a12479e7dafeb6f1ece90e3","first_computed_at":"2026-05-18T03:29:05.893720Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:05.893720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U86laV2nNWHd91cFfO3+RujiXvL5fTOj7VIdM/mLB6+TaAJreVtq53cX4NCpRUXUNuZj7VUKX9G1PuO3J3XmCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:05.894179Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.0871","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc6b832077799f644407fbad975e8537abcd4895d62f2bb4a0410528a7e52ca5","sha256:8f3632836ca91584469412fb572bec38bd14c64eb5bd9d3b5fe0e870d477924a"],"state_sha256":"482db2e852354b31472a4efb59a51116025e9c548fe36588d67b30a687543779"}