{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2PJ5YX75PYKAROBNFASER265V7","short_pith_number":"pith:2PJ5YX75","canonical_record":{"source":{"id":"1608.01292","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-03T19:12:23Z","cross_cats_sorted":["cs.CC","math.MG"],"title_canon_sha256":"17dcbab201745737011c7876ee96966064ff93c986eb4b4226444c30082a995a","abstract_canon_sha256":"ba423449e6de9827dbbc1227e9f4461d07e8426eaddb78165964bd5928ecaa76"},"schema_version":"1.0"},"canonical_sha256":"d3d3dc5ffd7e1408b82d282448ebddaff6fd8c0aebf3c79f918adb966f3aaf41","source":{"kind":"arxiv","id":"1608.01292","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01292","created_at":"2026-05-18T00:35:46Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01292v2","created_at":"2026-05-18T00:35:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01292","created_at":"2026-05-18T00:35:46Z"},{"alias_kind":"pith_short_12","alias_value":"2PJ5YX75PYKA","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2PJ5YX75PYKAROBN","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2PJ5YX75","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2PJ5YX75PYKAROBNFASER265V7","target":"record","payload":{"canonical_record":{"source":{"id":"1608.01292","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-03T19:12:23Z","cross_cats_sorted":["cs.CC","math.MG"],"title_canon_sha256":"17dcbab201745737011c7876ee96966064ff93c986eb4b4226444c30082a995a","abstract_canon_sha256":"ba423449e6de9827dbbc1227e9f4461d07e8426eaddb78165964bd5928ecaa76"},"schema_version":"1.0"},"canonical_sha256":"d3d3dc5ffd7e1408b82d282448ebddaff6fd8c0aebf3c79f918adb966f3aaf41","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:46.763094Z","signature_b64":"ISPmv8/wvKt+8X8Fm0LOcnVx5RAsQnl9dnuDSi2pa+b38XMcY5j1p1Iy1d0qsxJY5m1iwpxn0pOWjFRcI3GoCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3d3dc5ffd7e1408b82d282448ebddaff6fd8c0aebf3c79f918adb966f3aaf41","last_reissued_at":"2026-05-18T00:35:46.762561Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:46.762561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.01292","source_version":2,"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-18T00:35:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f+KPFy+84z73KohEgr+cF/H6rebq0kKuL21cuMq/LlovuR3hrK8ijgjYo+CKpC0dFM9CpQavfoRmKr3KvwMcDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:13:36.705995Z"},"content_sha256":"1af3ccb84e52377a9d5dab74220748c5e5374f1f060b750efd441d28669adffa","schema_version":"1.0","event_id":"sha256:1af3ccb84e52377a9d5dab74220748c5e5374f1f060b750efd441d28669adffa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2PJ5YX75PYKAROBNFASER265V7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating set multi-covers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.MG"],"primary_cat":"math.CO","authors_text":"Alexandr Polyanskii, M\\'arton Nasz\\'odi","submitted_at":"2016-08-03T19:12:23Z","abstract_excerpt":"Johnson and Lov\\'asz and Stein proved independently that any hypergraph satisfies $\\tau\\leq (1+\\ln \\Delta)\\tau^{\\ast}$, where $\\tau$ is the transversal number, $\\tau^{\\ast}$ is its fractional version, and $\\Delta$ denotes the maximum degree. We prove $\\tau_f\\leq c \\tau^{\\ast}\\max\\{\\ln \\Delta, f\\}$ for the $f$-fold transversal number $\\tau_f$. Similarly to Johnson, Lov\\'asz and Stein, we also show that this bound can be achieved non-probabilistically, using a greedy algorithm.\n  As a combinatorial application, we prove an estimate on how fast $\\tau_f/f$ converges to $\\tau^{\\ast}$. As a geometri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01292","kind":"arxiv","version":2},"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-18T00:35:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4P0iwRIrKsY0Wa0WUtU1q8Jo9KudB9NbHlA5fFvWS39d4y4rjtkSYFakSJg9DYwVWo06h2KFpf8eTpfNpeD6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:13:36.706672Z"},"content_sha256":"653073429bc16b304f5aeee0da346e04a77afd9413189aa61bacf31b1529349e","schema_version":"1.0","event_id":"sha256:653073429bc16b304f5aeee0da346e04a77afd9413189aa61bacf31b1529349e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2PJ5YX75PYKAROBNFASER265V7/bundle.json","state_url":"https://pith.science/pith/2PJ5YX75PYKAROBNFASER265V7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2PJ5YX75PYKAROBNFASER265V7/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-07T09:13:36Z","links":{"resolver":"https://pith.science/pith/2PJ5YX75PYKAROBNFASER265V7","bundle":"https://pith.science/pith/2PJ5YX75PYKAROBNFASER265V7/bundle.json","state":"https://pith.science/pith/2PJ5YX75PYKAROBNFASER265V7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2PJ5YX75PYKAROBNFASER265V7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2PJ5YX75PYKAROBNFASER265V7","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":"ba423449e6de9827dbbc1227e9f4461d07e8426eaddb78165964bd5928ecaa76","cross_cats_sorted":["cs.CC","math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-03T19:12:23Z","title_canon_sha256":"17dcbab201745737011c7876ee96966064ff93c986eb4b4226444c30082a995a"},"schema_version":"1.0","source":{"id":"1608.01292","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01292","created_at":"2026-05-18T00:35:46Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01292v2","created_at":"2026-05-18T00:35:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01292","created_at":"2026-05-18T00:35:46Z"},{"alias_kind":"pith_short_12","alias_value":"2PJ5YX75PYKA","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2PJ5YX75PYKAROBN","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2PJ5YX75","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:653073429bc16b304f5aeee0da346e04a77afd9413189aa61bacf31b1529349e","target":"graph","created_at":"2026-05-18T00:35:46Z","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":"Johnson and Lov\\'asz and Stein proved independently that any hypergraph satisfies $\\tau\\leq (1+\\ln \\Delta)\\tau^{\\ast}$, where $\\tau$ is the transversal number, $\\tau^{\\ast}$ is its fractional version, and $\\Delta$ denotes the maximum degree. We prove $\\tau_f\\leq c \\tau^{\\ast}\\max\\{\\ln \\Delta, f\\}$ for the $f$-fold transversal number $\\tau_f$. Similarly to Johnson, Lov\\'asz and Stein, we also show that this bound can be achieved non-probabilistically, using a greedy algorithm.\n  As a combinatorial application, we prove an estimate on how fast $\\tau_f/f$ converges to $\\tau^{\\ast}$. As a geometri","authors_text":"Alexandr Polyanskii, M\\'arton Nasz\\'odi","cross_cats":["cs.CC","math.MG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-03T19:12:23Z","title":"Approximating set multi-covers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01292","kind":"arxiv","version":2},"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:1af3ccb84e52377a9d5dab74220748c5e5374f1f060b750efd441d28669adffa","target":"record","created_at":"2026-05-18T00:35:46Z","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":"ba423449e6de9827dbbc1227e9f4461d07e8426eaddb78165964bd5928ecaa76","cross_cats_sorted":["cs.CC","math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-03T19:12:23Z","title_canon_sha256":"17dcbab201745737011c7876ee96966064ff93c986eb4b4226444c30082a995a"},"schema_version":"1.0","source":{"id":"1608.01292","kind":"arxiv","version":2}},"canonical_sha256":"d3d3dc5ffd7e1408b82d282448ebddaff6fd8c0aebf3c79f918adb966f3aaf41","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d3d3dc5ffd7e1408b82d282448ebddaff6fd8c0aebf3c79f918adb966f3aaf41","first_computed_at":"2026-05-18T00:35:46.762561Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:46.762561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ISPmv8/wvKt+8X8Fm0LOcnVx5RAsQnl9dnuDSi2pa+b38XMcY5j1p1Iy1d0qsxJY5m1iwpxn0pOWjFRcI3GoCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:46.763094Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.01292","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1af3ccb84e52377a9d5dab74220748c5e5374f1f060b750efd441d28669adffa","sha256:653073429bc16b304f5aeee0da346e04a77afd9413189aa61bacf31b1529349e"],"state_sha256":"5c3e65d8e84d29535e21b6e2479716a2bde23f83183319f7e2401b920f612c81"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WPZGGJGVkld1GlSidY+Qvr5dpoYFj4l8Z0pcXrGQDFmIlFa6FZLFDoA0gQi0IpdNPsdleMzUJfWj/4ZrtWqIAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T09:13:36.709931Z","bundle_sha256":"eb17acd0bc60c13361f3c0d28d1c0df5271fff360fc0759fc7db2b93bf17e7f0"}}