{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:2QDYEPTFMF6DETZ6BCUO3HZHN5","short_pith_number":"pith:2QDYEPTF","schema_version":"1.0","canonical_sha256":"d407823e65617c324f3e08a8ed9f276f6f539aa0f8ec25e1f018de877da8df4a","source":{"kind":"arxiv","id":"2101.09080","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2101.09080","created_at":"2026-07-05T02:08:53.785867+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.09080v1","created_at":"2026-07-05T02:08:53.785867+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.09080","created_at":"2026-07-05T02:08:53.785867+00:00"},{"alias_kind":"pith_short_12","alias_value":"2QDYEPTFMF6D","created_at":"2026-07-05T02:08:53.785867+00:00"},{"alias_kind":"pith_short_16","alias_value":"2QDYEPTFMF6DETZ6","created_at":"2026-07-05T02:08:53.785867+00:00"},{"alias_kind":"pith_short_8","alias_value":"2QDYEPTF","created_at":"2026-07-05T02:08:53.785867+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/2QDYEPTFMF6DETZ6BCUO3HZHN5","json":"https://pith.science/pith/2QDYEPTFMF6DETZ6BCUO3HZHN5.json","graph_json":"https://pith.science/api/pith-number/2QDYEPTFMF6DETZ6BCUO3HZHN5/graph.json","events_json":"https://pith.science/api/pith-number/2QDYEPTFMF6DETZ6BCUO3HZHN5/events.json","paper":"https://pith.science/paper/2QDYEPTF"},"agent_actions":{"view_html":"https://pith.science/pith/2QDYEPTFMF6DETZ6BCUO3HZHN5","download_json":"https://pith.science/pith/2QDYEPTFMF6DETZ6BCUO3HZHN5.json","view_paper":"https://pith.science/paper/2QDYEPTF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.09080&json=true","fetch_graph":"https://pith.science/api/pith-number/2QDYEPTFMF6DETZ6BCUO3HZHN5/graph.json","fetch_events":"https://pith.science/api/pith-number/2QDYEPTFMF6DETZ6BCUO3HZHN5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2QDYEPTFMF6DETZ6BCUO3HZHN5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2QDYEPTFMF6DETZ6BCUO3HZHN5/action/storage_attestation","attest_author":"https://pith.science/pith/2QDYEPTFMF6DETZ6BCUO3HZHN5/action/author_attestation","sign_citation":"https://pith.science/pith/2QDYEPTFMF6DETZ6BCUO3HZHN5/action/citation_signature","submit_replication":"https://pith.science/pith/2QDYEPTFMF6DETZ6BCUO3HZHN5/action/replication_record"}},"created_at":"2026-07-05T02:08:53.785867+00:00","updated_at":"2026-07-05T02:08:53.785867+00:00"}