{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:S2ZLX7A3JGVKY2MB7QEXFCR5WB","short_pith_number":"pith:S2ZLX7A3","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"},"canonical_sha256":"96b2bbfc1b49aaac6981fc09728a3db07d90026b7f98f3b3c59ddf8ea0cdf977","source":{"kind":"arxiv","id":"1009.6144","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.6144","created_at":"2026-05-18T03:54:39Z"},{"alias_kind":"arxiv_version","alias_value":"1009.6144v3","created_at":"2026-05-18T03:54:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.6144","created_at":"2026-05-18T03:54:39Z"},{"alias_kind":"pith_short_12","alias_value":"S2ZLX7A3JGVK","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"S2ZLX7A3JGVKY2MB","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"S2ZLX7A3","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:S2ZLX7A3JGVKY2MB7QEXFCR5WB","target":"record","payload":{"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"},"canonical_sha256":"96b2bbfc1b49aaac6981fc09728a3db07d90026b7f98f3b3c59ddf8ea0cdf977","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"},"source_kind":"arxiv","source_id":"1009.6144","source_version":3,"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-18T03:54:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sf3OsfCfIYmtzR5NoRKcfKlo9A8Gj/pnqff7U42uul9Ah93kLsTlQg9gJG5kkJLgzdsJiqsr69FUaZzL/VHdBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:25:06.482712Z"},"content_sha256":"be6097cfbf2073caf59f7f0fe50beb27ad469b363f03ff7a9fd46a8037f7b43f","schema_version":"1.0","event_id":"sha256:be6097cfbf2073caf59f7f0fe50beb27ad469b363f03ff7a9fd46a8037f7b43f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:S2ZLX7A3JGVKY2MB7QEXFCR5WB","target":"graph","payload":{"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"},"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-18T03:54:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pynT/gz4S8eu/2mJ7ToQ9z71qg1IknzFdqshGSK2lEbrxv3IBAvOnTyIdOH8gw+N7CbzaxGMxJJDUU70R/u0Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:25:06.483062Z"},"content_sha256":"0cf603e1702ace27f4b48eb2d55c5103e166a39ce70807043f34ecfeeb8aabe4","schema_version":"1.0","event_id":"sha256:0cf603e1702ace27f4b48eb2d55c5103e166a39ce70807043f34ecfeeb8aabe4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S2ZLX7A3JGVKY2MB7QEXFCR5WB/bundle.json","state_url":"https://pith.science/pith/S2ZLX7A3JGVKY2MB7QEXFCR5WB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S2ZLX7A3JGVKY2MB7QEXFCR5WB/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-02T05:25:06Z","links":{"resolver":"https://pith.science/pith/S2ZLX7A3JGVKY2MB7QEXFCR5WB","bundle":"https://pith.science/pith/S2ZLX7A3JGVKY2MB7QEXFCR5WB/bundle.json","state":"https://pith.science/pith/S2ZLX7A3JGVKY2MB7QEXFCR5WB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S2ZLX7A3JGVKY2MB7QEXFCR5WB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:S2ZLX7A3JGVKY2MB7QEXFCR5WB","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":"2b473ef03afe77fb64181dad7985546e7aee38b244d5cfe723cf3174fabfc521","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2010-09-30T14:13:19Z","title_canon_sha256":"cec341128182bb429150a55924b0a6d248de04b979c8f4a60063f1de179960ce"},"schema_version":"1.0","source":{"id":"1009.6144","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.6144","created_at":"2026-05-18T03:54:39Z"},{"alias_kind":"arxiv_version","alias_value":"1009.6144v3","created_at":"2026-05-18T03:54:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.6144","created_at":"2026-05-18T03:54:39Z"},{"alias_kind":"pith_short_12","alias_value":"S2ZLX7A3JGVK","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"S2ZLX7A3JGVKY2MB","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"S2ZLX7A3","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:0cf603e1702ace27f4b48eb2d55c5103e166a39ce70807043f34ecfeeb8aabe4","target":"graph","created_at":"2026-05-18T03:54:39Z","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 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","authors_text":"Alex Scott, B\\'ela Bollob\\'as, David Pritchard, Thomas Rothvo{\\ss}","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2010-09-30T14:13:19Z","title":"Cover-Decomposition and Polychromatic Numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.6144","kind":"arxiv","version":3},"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:be6097cfbf2073caf59f7f0fe50beb27ad469b363f03ff7a9fd46a8037f7b43f","target":"record","created_at":"2026-05-18T03:54:39Z","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":"2b473ef03afe77fb64181dad7985546e7aee38b244d5cfe723cf3174fabfc521","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2010-09-30T14:13:19Z","title_canon_sha256":"cec341128182bb429150a55924b0a6d248de04b979c8f4a60063f1de179960ce"},"schema_version":"1.0","source":{"id":"1009.6144","kind":"arxiv","version":3}},"canonical_sha256":"96b2bbfc1b49aaac6981fc09728a3db07d90026b7f98f3b3c59ddf8ea0cdf977","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96b2bbfc1b49aaac6981fc09728a3db07d90026b7f98f3b3c59ddf8ea0cdf977","first_computed_at":"2026-05-18T03:54:39.618153Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:54:39.618153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"trfTRQKOWCCBIM5LIAfqgb0kRY+2DxKAtqx5l4w464kOK2TXOXQBHBm3tshwKGkAC/2r7Ojmmf+qCqW+DwNjBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:54:39.618850Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.6144","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be6097cfbf2073caf59f7f0fe50beb27ad469b363f03ff7a9fd46a8037f7b43f","sha256:0cf603e1702ace27f4b48eb2d55c5103e166a39ce70807043f34ecfeeb8aabe4"],"state_sha256":"c95ae5da53eff7365de118edb17853bc08773fcf922201623e80508d41432af8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3ZvHxatGfY4rRHPN9+P6NnNLAm3AbYXKLBdnOw5ogZLB1fsWHPVB5sL8EYkqEyM4XhYwnGHtRihhXN9HG7y1CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T05:25:06.485263Z","bundle_sha256":"409be70b7be9d6f8a01b9a291ce64d6eed3e3236d0ddc9353fb93a9ed5611fc8"}}