{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YSRP7KDOB5JTJOG5FX57FWNBAW","short_pith_number":"pith:YSRP7KDO","schema_version":"1.0","canonical_sha256":"c4a2ffa86e0f5334b8dd2dfbf2d9a105988964fb4a12479e7dafeb6f1ece90e3","source":{"kind":"arxiv","id":"1304.0871","version":1},"attestation_state":"computed","paper":{"title":"Coverings by few monochromatic pieces - a transition between two Ramsey problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andr\\'as Gy\\'arf\\'as, G\\'abor N. S\\'ark\\\"ozy, Stanley Selkow","submitted_at":"2013-04-03T08:47:37Z","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 "},"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":"1304.0871","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-03T08:47:37Z","cross_cats_sorted":[],"title_canon_sha256":"7f1426ace6315958e2611ac367a486e84d5e23fd6834db7a398e5a3151114767","abstract_canon_sha256":"2d92a0fa644a3e589e8b47a4b1174dc1a4511e854bdaa144c40efa2f068e8cd5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:05.894179Z","signature_b64":"U86laV2nNWHd91cFfO3+RujiXvL5fTOj7VIdM/mLB6+TaAJreVtq53cX4NCpRUXUNuZj7VUKX9G1PuO3J3XmCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4a2ffa86e0f5334b8dd2dfbf2d9a105988964fb4a12479e7dafeb6f1ece90e3","last_reissued_at":"2026-05-18T03:29:05.893720Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:05.893720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coverings by few monochromatic pieces - a transition between two Ramsey problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andr\\'as Gy\\'arf\\'as, G\\'abor N. S\\'ark\\\"ozy, Stanley Selkow","submitted_at":"2013-04-03T08:47:37Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0871","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":""},"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":"1304.0871","created_at":"2026-05-18T03:29:05.893784+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.0871v1","created_at":"2026-05-18T03:29:05.893784+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0871","created_at":"2026-05-18T03:29:05.893784+00:00"},{"alias_kind":"pith_short_12","alias_value":"YSRP7KDOB5JT","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"YSRP7KDOB5JTJOG5","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"YSRP7KDO","created_at":"2026-05-18T12:28:09.283467+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YSRP7KDOB5JTJOG5FX57FWNBAW","json":"https://pith.science/pith/YSRP7KDOB5JTJOG5FX57FWNBAW.json","graph_json":"https://pith.science/api/pith-number/YSRP7KDOB5JTJOG5FX57FWNBAW/graph.json","events_json":"https://pith.science/api/pith-number/YSRP7KDOB5JTJOG5FX57FWNBAW/events.json","paper":"https://pith.science/paper/YSRP7KDO"},"agent_actions":{"view_html":"https://pith.science/pith/YSRP7KDOB5JTJOG5FX57FWNBAW","download_json":"https://pith.science/pith/YSRP7KDOB5JTJOG5FX57FWNBAW.json","view_paper":"https://pith.science/paper/YSRP7KDO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.0871&json=true","fetch_graph":"https://pith.science/api/pith-number/YSRP7KDOB5JTJOG5FX57FWNBAW/graph.json","fetch_events":"https://pith.science/api/pith-number/YSRP7KDOB5JTJOG5FX57FWNBAW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YSRP7KDOB5JTJOG5FX57FWNBAW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YSRP7KDOB5JTJOG5FX57FWNBAW/action/storage_attestation","attest_author":"https://pith.science/pith/YSRP7KDOB5JTJOG5FX57FWNBAW/action/author_attestation","sign_citation":"https://pith.science/pith/YSRP7KDOB5JTJOG5FX57FWNBAW/action/citation_signature","submit_replication":"https://pith.science/pith/YSRP7KDOB5JTJOG5FX57FWNBAW/action/replication_record"}},"created_at":"2026-05-18T03:29:05.893784+00:00","updated_at":"2026-05-18T03:29:05.893784+00:00"}