{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:6WU5GDZXCKB45HKIYX2E7RVGHR","short_pith_number":"pith:6WU5GDZX","schema_version":"1.0","canonical_sha256":"f5a9d30f371283ce9d48c5f44fc6a63c4ea86c11147077999e2e3b15d35cc2f5","source":{"kind":"arxiv","id":"2307.12154","version":3},"attestation_state":"computed","paper":{"title":"Hitting sets and colorings of hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bal\\'azs Bursics, Bence Csonka, Luca Szepessy","submitted_at":"2023-07-22T19:58:09Z","abstract_excerpt":"In this paper we study the minimal size of edges in hypergraph families that guarantees the existence of a polychromatic coloring, that is, a $k$-coloring of a vertex set such that every hyperedge contains a vertex of all $k$ color classes. We also investigate the connection of this problem with $c$-shallow hitting sets: sets of vertices that intersect each hyperedge in at least one and at most $c$ vertices.\n  We determine for some hypergraph families the minimal $c$ for which a $c$-shallow hitting set exists.\n  We also study this problem for a special hypergraph family, which is induced by ar"},"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":"2307.12154","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-07-22T19:58:09Z","cross_cats_sorted":[],"title_canon_sha256":"79cf5f21379c2b15d1d1da3460c27e62bbcfd1494b8ee0f21f7c64427d6454b8","abstract_canon_sha256":"9d9783bead3a308e83803ce0b73ef4e5fde1fed5fa8c232548d44205213e3ded"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:04:48.306820Z","signature_b64":"4N9TYSnvb+LsA85MPCBIWvxxFpE0DKASp3Z6SZY29JQhcaL/pxnrkV/wP7ZTErtYq9NJUIWgRbcMLsHkBOqjCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5a9d30f371283ce9d48c5f44fc6a63c4ea86c11147077999e2e3b15d35cc2f5","last_reissued_at":"2026-05-20T01:04:48.306085Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:04:48.306085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hitting sets and colorings of hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bal\\'azs Bursics, Bence Csonka, Luca Szepessy","submitted_at":"2023-07-22T19:58:09Z","abstract_excerpt":"In this paper we study the minimal size of edges in hypergraph families that guarantees the existence of a polychromatic coloring, that is, a $k$-coloring of a vertex set such that every hyperedge contains a vertex of all $k$ color classes. We also investigate the connection of this problem with $c$-shallow hitting sets: sets of vertices that intersect each hyperedge in at least one and at most $c$ vertices.\n  We determine for some hypergraph families the minimal $c$ for which a $c$-shallow hitting set exists.\n  We also study this problem for a special hypergraph family, which is induced by ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.12154","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2307.12154/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2307.12154","created_at":"2026-05-20T01:04:48.306168+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.12154v3","created_at":"2026-05-20T01:04:48.306168+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.12154","created_at":"2026-05-20T01:04:48.306168+00:00"},{"alias_kind":"pith_short_12","alias_value":"6WU5GDZXCKB4","created_at":"2026-05-20T01:04:48.306168+00:00"},{"alias_kind":"pith_short_16","alias_value":"6WU5GDZXCKB45HKI","created_at":"2026-05-20T01:04:48.306168+00:00"},{"alias_kind":"pith_short_8","alias_value":"6WU5GDZX","created_at":"2026-05-20T01:04:48.306168+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/6WU5GDZXCKB45HKIYX2E7RVGHR","json":"https://pith.science/pith/6WU5GDZXCKB45HKIYX2E7RVGHR.json","graph_json":"https://pith.science/api/pith-number/6WU5GDZXCKB45HKIYX2E7RVGHR/graph.json","events_json":"https://pith.science/api/pith-number/6WU5GDZXCKB45HKIYX2E7RVGHR/events.json","paper":"https://pith.science/paper/6WU5GDZX"},"agent_actions":{"view_html":"https://pith.science/pith/6WU5GDZXCKB45HKIYX2E7RVGHR","download_json":"https://pith.science/pith/6WU5GDZXCKB45HKIYX2E7RVGHR.json","view_paper":"https://pith.science/paper/6WU5GDZX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.12154&json=true","fetch_graph":"https://pith.science/api/pith-number/6WU5GDZXCKB45HKIYX2E7RVGHR/graph.json","fetch_events":"https://pith.science/api/pith-number/6WU5GDZXCKB45HKIYX2E7RVGHR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6WU5GDZXCKB45HKIYX2E7RVGHR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6WU5GDZXCKB45HKIYX2E7RVGHR/action/storage_attestation","attest_author":"https://pith.science/pith/6WU5GDZXCKB45HKIYX2E7RVGHR/action/author_attestation","sign_citation":"https://pith.science/pith/6WU5GDZXCKB45HKIYX2E7RVGHR/action/citation_signature","submit_replication":"https://pith.science/pith/6WU5GDZXCKB45HKIYX2E7RVGHR/action/replication_record"}},"created_at":"2026-05-20T01:04:48.306168+00:00","updated_at":"2026-05-20T01:04:48.306168+00:00"}