{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:S2ZLX7A3JGVKY2MB7QEXFCR5WB","short_pith_number":"pith:S2ZLX7A3","schema_version":"1.0","canonical_sha256":"96b2bbfc1b49aaac6981fc09728a3db07d90026b7f98f3b3c59ddf8ea0cdf977","source":{"kind":"arxiv","id":"1009.6144","version":3},"attestation_state":"computed","paper":{"title":"Cover-Decomposition and Polychromatic Numbers","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Alex Scott, B\\'ela Bollob\\'as, David Pritchard, Thomas Rothvo{\\ss}","submitted_at":"2010-09-30T14:13:19Z","abstract_excerpt":"A colouring of a hypergraph's vertices is polychromatic if every hyperedge contains at least one vertex of each colour; the polychromatic number is the maximum number of colours in such a colouring. Its dual, the cover-decomposition number, is the maximum number of disjoint hyperedge-covers. In geometric hypergraphs, there is extensive work on lower-bounding these numbers in terms of their trivial upper bounds (minimum hyperedge size and degree); our goal here is to broaden the study beyond geometric settings. We obtain algorithms yielding near-tight bounds for three families of hypergraphs: b"},"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":"1009.6144","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2010-09-30T14:13:19Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"cec341128182bb429150a55924b0a6d248de04b979c8f4a60063f1de179960ce","abstract_canon_sha256":"2b473ef03afe77fb64181dad7985546e7aee38b244d5cfe723cf3174fabfc521"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:39.618850Z","signature_b64":"trfTRQKOWCCBIM5LIAfqgb0kRY+2DxKAtqx5l4w464kOK2TXOXQBHBm3tshwKGkAC/2r7Ojmmf+qCqW+DwNjBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96b2bbfc1b49aaac6981fc09728a3db07d90026b7f98f3b3c59ddf8ea0cdf977","last_reissued_at":"2026-05-18T03:54:39.618153Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:39.618153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cover-Decomposition and Polychromatic Numbers","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Alex Scott, B\\'ela Bollob\\'as, David Pritchard, Thomas Rothvo{\\ss}","submitted_at":"2010-09-30T14:13:19Z","abstract_excerpt":"A colouring of a hypergraph's vertices is polychromatic if every hyperedge contains at least one vertex of each colour; the polychromatic number is the maximum number of colours in such a colouring. Its dual, the cover-decomposition number, is the maximum number of disjoint hyperedge-covers. In geometric hypergraphs, there is extensive work on lower-bounding these numbers in terms of their trivial upper bounds (minimum hyperedge size and degree); our goal here is to broaden the study beyond geometric settings. We obtain algorithms yielding near-tight bounds for three families of hypergraphs: b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.6144","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":""},"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":"1009.6144","created_at":"2026-05-18T03:54:39.618271+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.6144v3","created_at":"2026-05-18T03:54:39.618271+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.6144","created_at":"2026-05-18T03:54:39.618271+00:00"},{"alias_kind":"pith_short_12","alias_value":"S2ZLX7A3JGVK","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"S2ZLX7A3JGVKY2MB","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"S2ZLX7A3","created_at":"2026-05-18T12:26:13.927090+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/S2ZLX7A3JGVKY2MB7QEXFCR5WB","json":"https://pith.science/pith/S2ZLX7A3JGVKY2MB7QEXFCR5WB.json","graph_json":"https://pith.science/api/pith-number/S2ZLX7A3JGVKY2MB7QEXFCR5WB/graph.json","events_json":"https://pith.science/api/pith-number/S2ZLX7A3JGVKY2MB7QEXFCR5WB/events.json","paper":"https://pith.science/paper/S2ZLX7A3"},"agent_actions":{"view_html":"https://pith.science/pith/S2ZLX7A3JGVKY2MB7QEXFCR5WB","download_json":"https://pith.science/pith/S2ZLX7A3JGVKY2MB7QEXFCR5WB.json","view_paper":"https://pith.science/paper/S2ZLX7A3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.6144&json=true","fetch_graph":"https://pith.science/api/pith-number/S2ZLX7A3JGVKY2MB7QEXFCR5WB/graph.json","fetch_events":"https://pith.science/api/pith-number/S2ZLX7A3JGVKY2MB7QEXFCR5WB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S2ZLX7A3JGVKY2MB7QEXFCR5WB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S2ZLX7A3JGVKY2MB7QEXFCR5WB/action/storage_attestation","attest_author":"https://pith.science/pith/S2ZLX7A3JGVKY2MB7QEXFCR5WB/action/author_attestation","sign_citation":"https://pith.science/pith/S2ZLX7A3JGVKY2MB7QEXFCR5WB/action/citation_signature","submit_replication":"https://pith.science/pith/S2ZLX7A3JGVKY2MB7QEXFCR5WB/action/replication_record"}},"created_at":"2026-05-18T03:54:39.618271+00:00","updated_at":"2026-05-18T03:54:39.618271+00:00"}