{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:2QDYEPTFMF6DETZ6BCUO3HZHN5","short_pith_number":"pith:2QDYEPTF","canonical_record":{"source":{"id":"2101.09080","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-01-22T12:29:00Z","cross_cats_sorted":[],"title_canon_sha256":"d5e766fca87aed3c5cf5ba9c3ee53fc8fb42645b2386fa1e9c8063d12baa30a0","abstract_canon_sha256":"2b0e7ea85ee6412272ef5d188f6c87f4012d897ec35fb5512a1584a7da288972"},"schema_version":"1.0"},"canonical_sha256":"d407823e65617c324f3e08a8ed9f276f6f539aa0f8ec25e1f018de877da8df4a","source":{"kind":"arxiv","id":"2101.09080","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.09080","created_at":"2026-07-05T02:08:53Z"},{"alias_kind":"arxiv_version","alias_value":"2101.09080v1","created_at":"2026-07-05T02:08:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.09080","created_at":"2026-07-05T02:08:53Z"},{"alias_kind":"pith_short_12","alias_value":"2QDYEPTFMF6D","created_at":"2026-07-05T02:08:53Z"},{"alias_kind":"pith_short_16","alias_value":"2QDYEPTFMF6DETZ6","created_at":"2026-07-05T02:08:53Z"},{"alias_kind":"pith_short_8","alias_value":"2QDYEPTF","created_at":"2026-07-05T02:08:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:2QDYEPTFMF6DETZ6BCUO3HZHN5","target":"record","payload":{"canonical_record":{"source":{"id":"2101.09080","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-01-22T12:29:00Z","cross_cats_sorted":[],"title_canon_sha256":"d5e766fca87aed3c5cf5ba9c3ee53fc8fb42645b2386fa1e9c8063d12baa30a0","abstract_canon_sha256":"2b0e7ea85ee6412272ef5d188f6c87f4012d897ec35fb5512a1584a7da288972"},"schema_version":"1.0"},"canonical_sha256":"d407823e65617c324f3e08a8ed9f276f6f539aa0f8ec25e1f018de877da8df4a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:08:53.786186Z","signature_b64":"fa+bhPUTsx45TLKbkyUWbPznpP/sNm5vcWfLPehsW5SocMsWCu2s2gEEvvCEoJAxMl0k2sQCIlFIvjeJgWmvCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d407823e65617c324f3e08a8ed9f276f6f539aa0f8ec25e1f018de877da8df4a","last_reissued_at":"2026-07-05T02:08:53.785801Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:08:53.785801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2101.09080","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-07-05T02:08:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n1j8YIrDNITQS9JDsQcTZ/lFc7XoG3RimpzDQ5uS38kx3PBJkQ9FoV/tf56dUSbWFPkE0jVNtRCmSTOjogQ4DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T23:05:03.628086Z"},"content_sha256":"50eb91ded72d81c22889086dc75c779f72896c1c6cdb719b768841c29ef294ab","schema_version":"1.0","event_id":"sha256:50eb91ded72d81c22889086dc75c779f72896c1c6cdb719b768841c29ef294ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:2QDYEPTFMF6DETZ6BCUO3HZHN5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Repeated randomized algorithm for the Multicovering Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abbass Gorgi, Anand Srivastav, Mohamed Hachimi, Mourad El Ouali","submitted_at":"2021-01-22T12:29:00Z","abstract_excerpt":"Let $\\mathcal{H}=(V,\\mathcal{E})$ be a hypergraph with maximum edge size $\\ell$ and maximum degree $\\Delta$. For given numbers $b_v\\in \\mathbb{N}_{\\geq 2}$, $v\\in V$, a set multicover in $\\mathcal{H}$ is a set of edges $C \\subseteq \\mathcal{E}$ such that every vertex $v$ in $V$ belongs to at least $b_v$ edges in $C$. Set multicover is the problem of finding a minimum-cardinality set multicover. Peleg, Schechtman and Wool conjectured that unless $\\cal{P} =\\cal{NP}$, for any fixed $\\Delta$ and $b:=\\min_{v\\in V}b_{v}$, no polynomial-time approximation algorithm for the Set multicover problem has "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.09080","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2101.09080/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"},"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-07-05T02:08:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"stw9tAsH2+N5uLSq4HgLkNJwFnL30UMDX0TQ3VtbO/+0tG91dhxSXJ0YerL52lGZGEdBOQ2UrkEexI+u6prsBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T23:05:03.628687Z"},"content_sha256":"881357e37e16e766246828ec9a14760cf713bcd536763b5abca3031f0a35a1db","schema_version":"1.0","event_id":"sha256:881357e37e16e766246828ec9a14760cf713bcd536763b5abca3031f0a35a1db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2QDYEPTFMF6DETZ6BCUO3HZHN5/bundle.json","state_url":"https://pith.science/pith/2QDYEPTFMF6DETZ6BCUO3HZHN5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2QDYEPTFMF6DETZ6BCUO3HZHN5/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-08-21T23:05:03Z","links":{"resolver":"https://pith.science/pith/2QDYEPTFMF6DETZ6BCUO3HZHN5","bundle":"https://pith.science/pith/2QDYEPTFMF6DETZ6BCUO3HZHN5/bundle.json","state":"https://pith.science/pith/2QDYEPTFMF6DETZ6BCUO3HZHN5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2QDYEPTFMF6DETZ6BCUO3HZHN5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:2QDYEPTFMF6DETZ6BCUO3HZHN5","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":"2b0e7ea85ee6412272ef5d188f6c87f4012d897ec35fb5512a1584a7da288972","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-01-22T12:29:00Z","title_canon_sha256":"d5e766fca87aed3c5cf5ba9c3ee53fc8fb42645b2386fa1e9c8063d12baa30a0"},"schema_version":"1.0","source":{"id":"2101.09080","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.09080","created_at":"2026-07-05T02:08:53Z"},{"alias_kind":"arxiv_version","alias_value":"2101.09080v1","created_at":"2026-07-05T02:08:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.09080","created_at":"2026-07-05T02:08:53Z"},{"alias_kind":"pith_short_12","alias_value":"2QDYEPTFMF6D","created_at":"2026-07-05T02:08:53Z"},{"alias_kind":"pith_short_16","alias_value":"2QDYEPTFMF6DETZ6","created_at":"2026-07-05T02:08:53Z"},{"alias_kind":"pith_short_8","alias_value":"2QDYEPTF","created_at":"2026-07-05T02:08:53Z"}],"graph_snapshots":[{"event_id":"sha256:881357e37e16e766246828ec9a14760cf713bcd536763b5abca3031f0a35a1db","target":"graph","created_at":"2026-07-05T02:08:53Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2101.09080/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $\\mathcal{H}=(V,\\mathcal{E})$ be a hypergraph with maximum edge size $\\ell$ and maximum degree $\\Delta$. For given numbers $b_v\\in \\mathbb{N}_{\\geq 2}$, $v\\in V$, a set multicover in $\\mathcal{H}$ is a set of edges $C \\subseteq \\mathcal{E}$ such that every vertex $v$ in $V$ belongs to at least $b_v$ edges in $C$. Set multicover is the problem of finding a minimum-cardinality set multicover. Peleg, Schechtman and Wool conjectured that unless $\\cal{P} =\\cal{NP}$, for any fixed $\\Delta$ and $b:=\\min_{v\\in V}b_{v}$, no polynomial-time approximation algorithm for the Set multicover problem has ","authors_text":"Abbass Gorgi, Anand Srivastav, Mohamed Hachimi, Mourad El Ouali","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-01-22T12:29:00Z","title":"Repeated randomized algorithm for the Multicovering Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.09080","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:50eb91ded72d81c22889086dc75c779f72896c1c6cdb719b768841c29ef294ab","target":"record","created_at":"2026-07-05T02:08:53Z","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":"2b0e7ea85ee6412272ef5d188f6c87f4012d897ec35fb5512a1584a7da288972","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-01-22T12:29:00Z","title_canon_sha256":"d5e766fca87aed3c5cf5ba9c3ee53fc8fb42645b2386fa1e9c8063d12baa30a0"},"schema_version":"1.0","source":{"id":"2101.09080","kind":"arxiv","version":1}},"canonical_sha256":"d407823e65617c324f3e08a8ed9f276f6f539aa0f8ec25e1f018de877da8df4a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d407823e65617c324f3e08a8ed9f276f6f539aa0f8ec25e1f018de877da8df4a","first_computed_at":"2026-07-05T02:08:53.785801Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:08:53.785801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fa+bhPUTsx45TLKbkyUWbPznpP/sNm5vcWfLPehsW5SocMsWCu2s2gEEvvCEoJAxMl0k2sQCIlFIvjeJgWmvCg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:08:53.786186Z","signed_message":"canonical_sha256_bytes"},"source_id":"2101.09080","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50eb91ded72d81c22889086dc75c779f72896c1c6cdb719b768841c29ef294ab","sha256:881357e37e16e766246828ec9a14760cf713bcd536763b5abca3031f0a35a1db"],"state_sha256":"7332997193f5b51cbb9d74c8c416425ae2957da140416813aa3be2a116ecdc35"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i+pjt9e3r8GHzBSJKzMOJloYCqtK6cOimNfqm3n9X8Uf3iLCXmNsRG/Zb/JDlKAiVRrVZ/j2Fn8t0pRpciznBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T23:05:03.632574Z","bundle_sha256":"3bb4a7e7c212756473ae76c8a690471c78ae3df87f95e952367c1291ea4a91ea"}}