{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VOJYVJQ6EUXYY4UWUMQ3MFA3F6","short_pith_number":"pith:VOJYVJQ6","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"},"canonical_sha256":"ab938aa61e252f8c7296a321b6141b2fa30dd15e4f2f90b4c5385b5869704f06","source":{"kind":"arxiv","id":"1604.02791","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02791","created_at":"2026-05-18T01:17:22Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02791v1","created_at":"2026-05-18T01:17:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02791","created_at":"2026-05-18T01:17:22Z"},{"alias_kind":"pith_short_12","alias_value":"VOJYVJQ6EUXY","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VOJYVJQ6EUXYY4UW","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VOJYVJQ6","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VOJYVJQ6EUXYY4UWUMQ3MFA3F6","target":"record","payload":{"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"},"canonical_sha256":"ab938aa61e252f8c7296a321b6141b2fa30dd15e4f2f90b4c5385b5869704f06","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"},"source_kind":"arxiv","source_id":"1604.02791","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:17:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GIioQ3qAOk4X1NezYqWclC/ZdbzVXi7haMFrHtEoiO+OiW0h74dV3TJsKNAxYmlHnsupw4AdZCOuNRK1jB/lBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:00:03.791274Z"},"content_sha256":"8f94cf69e158efb412db3b96ca43871f5b5025608c8650927166f9c34070b5dd","schema_version":"1.0","event_id":"sha256:8f94cf69e158efb412db3b96ca43871f5b5025608c8650927166f9c34070b5dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VOJYVJQ6EUXYY4UWUMQ3MFA3F6","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:17:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"skjeV3cx6ZrknNokNqewPDxsUrHl3t8pEp8MkS2XPZC2O/Xp8v0nViiJzIV6mQ4PXpcSph3oYh8mco5NwUXgDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:00:03.792127Z"},"content_sha256":"5296dc8366ad79386c11fa58b528f8d1abf09718f3b745611896b330b4a85fd5","schema_version":"1.0","event_id":"sha256:5296dc8366ad79386c11fa58b528f8d1abf09718f3b745611896b330b4a85fd5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VOJYVJQ6EUXYY4UWUMQ3MFA3F6/bundle.json","state_url":"https://pith.science/pith/VOJYVJQ6EUXYY4UWUMQ3MFA3F6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VOJYVJQ6EUXYY4UWUMQ3MFA3F6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T23:00:03Z","links":{"resolver":"https://pith.science/pith/VOJYVJQ6EUXYY4UWUMQ3MFA3F6","bundle":"https://pith.science/pith/VOJYVJQ6EUXYY4UWUMQ3MFA3F6/bundle.json","state":"https://pith.science/pith/VOJYVJQ6EUXYY4UWUMQ3MFA3F6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VOJYVJQ6EUXYY4UWUMQ3MFA3F6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VOJYVJQ6EUXYY4UWUMQ3MFA3F6","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":"3f09dd02a6023e4e3dcc8e9ca1bf6eb0b16b3d7522789abf1b0dab45c91ba915","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-11T04:52:08Z","title_canon_sha256":"e664348aec7b56a8a7b3c2c7de5bb7990ba8dbf398e5621c1454e53ae343049d"},"schema_version":"1.0","source":{"id":"1604.02791","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02791","created_at":"2026-05-18T01:17:22Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02791v1","created_at":"2026-05-18T01:17:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02791","created_at":"2026-05-18T01:17:22Z"},{"alias_kind":"pith_short_12","alias_value":"VOJYVJQ6EUXY","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VOJYVJQ6EUXYY4UW","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VOJYVJQ6","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:5296dc8366ad79386c11fa58b528f8d1abf09718f3b745611896b330b4a85fd5","target":"graph","created_at":"2026-05-18T01:17:22Z","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":"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","authors_text":"Andr\\'as Gy\\'arf\\'as, Zolt\\'an Kir\\'aly","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-11T04:52:08Z","title":"Covering complete partite hypergraphs by monochromatic components"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02791","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:8f94cf69e158efb412db3b96ca43871f5b5025608c8650927166f9c34070b5dd","target":"record","created_at":"2026-05-18T01:17:22Z","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":"3f09dd02a6023e4e3dcc8e9ca1bf6eb0b16b3d7522789abf1b0dab45c91ba915","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-11T04:52:08Z","title_canon_sha256":"e664348aec7b56a8a7b3c2c7de5bb7990ba8dbf398e5621c1454e53ae343049d"},"schema_version":"1.0","source":{"id":"1604.02791","kind":"arxiv","version":1}},"canonical_sha256":"ab938aa61e252f8c7296a321b6141b2fa30dd15e4f2f90b4c5385b5869704f06","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab938aa61e252f8c7296a321b6141b2fa30dd15e4f2f90b4c5385b5869704f06","first_computed_at":"2026-05-18T01:17:22.155134Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:22.155134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2HhpcYmzFjMWUbuyZ/wwdaob6QTA1BzvKx8R2jT1rfLIVosbejbO1ZwD3Knx+P9lEPOsfz6CgfsY/6e3b6oHAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:22.155584Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.02791","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f94cf69e158efb412db3b96ca43871f5b5025608c8650927166f9c34070b5dd","sha256:5296dc8366ad79386c11fa58b528f8d1abf09718f3b745611896b330b4a85fd5"],"state_sha256":"3c9e93d14288740d981469c7ba37574d02db123c97b75f393e7d1581e0866101"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/taURcBEiLDKg19vBDMI2d74bn7qpnisE4+NIR+jDJJD5jk8KtnENEzsIVEGXkcTJxFPMCGkj+YgcNcy7pu/CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T23:00:03.796256Z","bundle_sha256":"6d0651e541cccab09236ccc5e66efa3b50f919d4f779d9f3a0124a2387747ef6"}}