{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VOJYVJQ6EUXYY4UWUMQ3MFA3F6","short_pith_number":"pith:VOJYVJQ6","schema_version":"1.0","canonical_sha256":"ab938aa61e252f8c7296a321b6141b2fa30dd15e4f2f90b4c5385b5869704f06","source":{"kind":"arxiv","id":"1604.02791","version":1},"attestation_state":"computed","paper":{"title":"Covering complete partite hypergraphs by monochromatic components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andr\\'as Gy\\'arf\\'as, Zolt\\'an Kir\\'aly","submitted_at":"2016-04-11T04:52:08Z","abstract_excerpt":"A well-known special case of a conjecture attributed to Ryser states that k-partite intersecting hypergraphs have transversals of at most k-1 vertices. An equivalent form was formulated by Gy\\'arf\\'as: if the edges of a complete graph K are colored with k colors then the vertex set of K can be covered by at most k-1 sets, each connected in some color. It turned out that the analogue of the conjecture for hypergraphs can be answered: Z. Kir\\'aly proved that in every k-coloring of the edges of the r-uniform complete hypergraph K^r (r >= 3), the vertex set of K^r can be covered by at most $\\lceil"},"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":"1604.02791","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-11T04:52:08Z","cross_cats_sorted":[],"title_canon_sha256":"e664348aec7b56a8a7b3c2c7de5bb7990ba8dbf398e5621c1454e53ae343049d","abstract_canon_sha256":"3f09dd02a6023e4e3dcc8e9ca1bf6eb0b16b3d7522789abf1b0dab45c91ba915"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:22.155584Z","signature_b64":"2HhpcYmzFjMWUbuyZ/wwdaob6QTA1BzvKx8R2jT1rfLIVosbejbO1ZwD3Knx+P9lEPOsfz6CgfsY/6e3b6oHAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab938aa61e252f8c7296a321b6141b2fa30dd15e4f2f90b4c5385b5869704f06","last_reissued_at":"2026-05-18T01:17:22.155134Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:22.155134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Covering complete partite hypergraphs by monochromatic components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andr\\'as Gy\\'arf\\'as, Zolt\\'an Kir\\'aly","submitted_at":"2016-04-11T04:52:08Z","abstract_excerpt":"A well-known special case of a conjecture attributed to Ryser states that k-partite intersecting hypergraphs have transversals of at most k-1 vertices. An equivalent form was formulated by Gy\\'arf\\'as: if the edges of a complete graph K are colored with k colors then the vertex set of K can be covered by at most k-1 sets, each connected in some color. It turned out that the analogue of the conjecture for hypergraphs can be answered: Z. Kir\\'aly proved that in every k-coloring of the edges of the r-uniform complete hypergraph K^r (r >= 3), the vertex set of K^r can be covered by at most $\\lceil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02791","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":"1604.02791","created_at":"2026-05-18T01:17:22.155203+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.02791v1","created_at":"2026-05-18T01:17:22.155203+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02791","created_at":"2026-05-18T01:17:22.155203+00:00"},{"alias_kind":"pith_short_12","alias_value":"VOJYVJQ6EUXY","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VOJYVJQ6EUXYY4UW","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VOJYVJQ6","created_at":"2026-05-18T12:30:48.956258+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/VOJYVJQ6EUXYY4UWUMQ3MFA3F6","json":"https://pith.science/pith/VOJYVJQ6EUXYY4UWUMQ3MFA3F6.json","graph_json":"https://pith.science/api/pith-number/VOJYVJQ6EUXYY4UWUMQ3MFA3F6/graph.json","events_json":"https://pith.science/api/pith-number/VOJYVJQ6EUXYY4UWUMQ3MFA3F6/events.json","paper":"https://pith.science/paper/VOJYVJQ6"},"agent_actions":{"view_html":"https://pith.science/pith/VOJYVJQ6EUXYY4UWUMQ3MFA3F6","download_json":"https://pith.science/pith/VOJYVJQ6EUXYY4UWUMQ3MFA3F6.json","view_paper":"https://pith.science/paper/VOJYVJQ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.02791&json=true","fetch_graph":"https://pith.science/api/pith-number/VOJYVJQ6EUXYY4UWUMQ3MFA3F6/graph.json","fetch_events":"https://pith.science/api/pith-number/VOJYVJQ6EUXYY4UWUMQ3MFA3F6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VOJYVJQ6EUXYY4UWUMQ3MFA3F6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VOJYVJQ6EUXYY4UWUMQ3MFA3F6/action/storage_attestation","attest_author":"https://pith.science/pith/VOJYVJQ6EUXYY4UWUMQ3MFA3F6/action/author_attestation","sign_citation":"https://pith.science/pith/VOJYVJQ6EUXYY4UWUMQ3MFA3F6/action/citation_signature","submit_replication":"https://pith.science/pith/VOJYVJQ6EUXYY4UWUMQ3MFA3F6/action/replication_record"}},"created_at":"2026-05-18T01:17:22.155203+00:00","updated_at":"2026-05-18T01:17:22.155203+00:00"}