{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:GPESQJ6VQ36FWALKNDQCMXB5SE","short_pith_number":"pith:GPESQJ6V","canonical_record":{"source":{"id":"2003.06936","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-03-15T22:07:13Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"318486ea9055c731ddc959eeae7354d6b3ed60c625e948c6f5b4b1e128ed11fd","abstract_canon_sha256":"322cab93810a049b2bd5ff68bd77c02d77f87e2645a81827cf9b7d1146bac792"},"schema_version":"1.0"},"canonical_sha256":"33c92827d586fc5b016a68e0265c3d911a821205248a5b7a8b5e68ae48da4e3a","source":{"kind":"arxiv","id":"2003.06936","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.06936","created_at":"2026-07-05T00:48:07Z"},{"alias_kind":"arxiv_version","alias_value":"2003.06936v1","created_at":"2026-07-05T00:48:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.06936","created_at":"2026-07-05T00:48:07Z"},{"alias_kind":"pith_short_12","alias_value":"GPESQJ6VQ36F","created_at":"2026-07-05T00:48:07Z"},{"alias_kind":"pith_short_16","alias_value":"GPESQJ6VQ36FWALK","created_at":"2026-07-05T00:48:07Z"},{"alias_kind":"pith_short_8","alias_value":"GPESQJ6V","created_at":"2026-07-05T00:48:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:GPESQJ6VQ36FWALKNDQCMXB5SE","target":"record","payload":{"canonical_record":{"source":{"id":"2003.06936","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-03-15T22:07:13Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"318486ea9055c731ddc959eeae7354d6b3ed60c625e948c6f5b4b1e128ed11fd","abstract_canon_sha256":"322cab93810a049b2bd5ff68bd77c02d77f87e2645a81827cf9b7d1146bac792"},"schema_version":"1.0"},"canonical_sha256":"33c92827d586fc5b016a68e0265c3d911a821205248a5b7a8b5e68ae48da4e3a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:48:07.866473Z","signature_b64":"TlspNtesJMFRQoIE9nww1G8EWys91VoYqq9iW/g1HdjNduHa4ZPyvDdpYfw4yrrngFyGDYWI/3sTEDQO1a+5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33c92827d586fc5b016a68e0265c3d911a821205248a5b7a8b5e68ae48da4e3a","last_reissued_at":"2026-07-05T00:48:07.865992Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:48:07.865992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2003.06936","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-05T00:48:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MqwrNIM0ZSgj77wEi7tPGiaabB4jG1JjXIYiJvdw/CCctFIY0fI+aAK0THH9nf+gezxdFhSeOQdw1taKAlNFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T20:42:19.198335Z"},"content_sha256":"1833ce7078225448c86ac800c053e2b2125f552950be5c0eed49eb6e6b05eff2","schema_version":"1.0","event_id":"sha256:1833ce7078225448c86ac800c053e2b2125f552950be5c0eed49eb6e6b05eff2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:GPESQJ6VQ36FWALKNDQCMXB5SE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation algorithm for the Multicovering Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Abbass Gorgi, Anand Srivastav, Mohamed Hachimi, Mourad El Ouali","submitted_at":"2020-03-15T22:07:13Z","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 for any fixed $\\Delta$ and $b:=\\min_{v\\in V}b_{v}$, the problem of \\sbmultcov is not approximable within a ratio less than $\\delta:=\\Delta-b+1$, unless $\\math"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.06936","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/2003.06936/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-05T00:48:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Aeo+Goxl6gs9/9/9xf+7ULPZQ8B1/Q01VvZHC77OL0110j5MThF4hDPptjiOxXzDjzRafoGkj4oAIpfNcdNECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T20:42:19.199264Z"},"content_sha256":"de7dd870d5aab53300330b892c3b38e07679ed3b4ca2a2ac5ac2bcb73b973046","schema_version":"1.0","event_id":"sha256:de7dd870d5aab53300330b892c3b38e07679ed3b4ca2a2ac5ac2bcb73b973046"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GPESQJ6VQ36FWALKNDQCMXB5SE/bundle.json","state_url":"https://pith.science/pith/GPESQJ6VQ36FWALKNDQCMXB5SE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GPESQJ6VQ36FWALKNDQCMXB5SE/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-21T20:42:19Z","links":{"resolver":"https://pith.science/pith/GPESQJ6VQ36FWALKNDQCMXB5SE","bundle":"https://pith.science/pith/GPESQJ6VQ36FWALKNDQCMXB5SE/bundle.json","state":"https://pith.science/pith/GPESQJ6VQ36FWALKNDQCMXB5SE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GPESQJ6VQ36FWALKNDQCMXB5SE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:GPESQJ6VQ36FWALKNDQCMXB5SE","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":"322cab93810a049b2bd5ff68bd77c02d77f87e2645a81827cf9b7d1146bac792","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-03-15T22:07:13Z","title_canon_sha256":"318486ea9055c731ddc959eeae7354d6b3ed60c625e948c6f5b4b1e128ed11fd"},"schema_version":"1.0","source":{"id":"2003.06936","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.06936","created_at":"2026-07-05T00:48:07Z"},{"alias_kind":"arxiv_version","alias_value":"2003.06936v1","created_at":"2026-07-05T00:48:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.06936","created_at":"2026-07-05T00:48:07Z"},{"alias_kind":"pith_short_12","alias_value":"GPESQJ6VQ36F","created_at":"2026-07-05T00:48:07Z"},{"alias_kind":"pith_short_16","alias_value":"GPESQJ6VQ36FWALK","created_at":"2026-07-05T00:48:07Z"},{"alias_kind":"pith_short_8","alias_value":"GPESQJ6V","created_at":"2026-07-05T00:48:07Z"}],"graph_snapshots":[{"event_id":"sha256:de7dd870d5aab53300330b892c3b38e07679ed3b4ca2a2ac5ac2bcb73b973046","target":"graph","created_at":"2026-07-05T00:48:07Z","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/2003.06936/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 for any fixed $\\Delta$ and $b:=\\min_{v\\in V}b_{v}$, the problem of \\sbmultcov is not approximable within a ratio less than $\\delta:=\\Delta-b+1$, unless $\\math","authors_text":"Abbass Gorgi, Anand Srivastav, Mohamed Hachimi, Mourad El Ouali","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-03-15T22:07:13Z","title":"Approximation algorithm for the Multicovering Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.06936","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:1833ce7078225448c86ac800c053e2b2125f552950be5c0eed49eb6e6b05eff2","target":"record","created_at":"2026-07-05T00:48:07Z","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":"322cab93810a049b2bd5ff68bd77c02d77f87e2645a81827cf9b7d1146bac792","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-03-15T22:07:13Z","title_canon_sha256":"318486ea9055c731ddc959eeae7354d6b3ed60c625e948c6f5b4b1e128ed11fd"},"schema_version":"1.0","source":{"id":"2003.06936","kind":"arxiv","version":1}},"canonical_sha256":"33c92827d586fc5b016a68e0265c3d911a821205248a5b7a8b5e68ae48da4e3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33c92827d586fc5b016a68e0265c3d911a821205248a5b7a8b5e68ae48da4e3a","first_computed_at":"2026-07-05T00:48:07.865992Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:48:07.865992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TlspNtesJMFRQoIE9nww1G8EWys91VoYqq9iW/g1HdjNduHa4ZPyvDdpYfw4yrrngFyGDYWI/3sTEDQO1a+5Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T00:48:07.866473Z","signed_message":"canonical_sha256_bytes"},"source_id":"2003.06936","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1833ce7078225448c86ac800c053e2b2125f552950be5c0eed49eb6e6b05eff2","sha256:de7dd870d5aab53300330b892c3b38e07679ed3b4ca2a2ac5ac2bcb73b973046"],"state_sha256":"b4c2a444fe899019aeb8cd56759798fcb62fcc3064100d4fc771c600fd889922"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C+N8IzyBzKzO3iWsYeDiQC2SlyONseYlorGqFXUW+5ER73W+BbU7ydC9AXZZQY6xNAj0xy4G938Eb0YzW8FKAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T20:42:19.203840Z","bundle_sha256":"130df64f131857fbe1547cc77523620e08a79dfe213a5e6c91d592f82b738e67"}}