{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:O3RITRNAPPIYNKB5LJG5ZOFPXW","short_pith_number":"pith:O3RITRNA","schema_version":"1.0","canonical_sha256":"76e289c5a07bd186a83d5a4ddcb8afbd8c11597061a8a7b0360dec3bb5b948ca","source":{"kind":"arxiv","id":"1812.04622","version":2},"attestation_state":"computed","paper":{"title":"Robust Multicovers with Budgeted Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.OC","authors_text":"Eva Schmidt, Manuel Streicher, Sven O. Krumke","submitted_at":"2018-12-11T14:06:09Z","abstract_excerpt":"The Min-$q$-Multiset Multicover problem presented in this paper is a special version of the Multiset Multicover problem. For a fixed positive integer $q$, we are given a finite ground set $J$, an integral demand for each element in $J$ and a collection of subsets of $J$. The task is to choose sets of the collection (multiple choices are allowed) such that each element in $J$ is covered at least as many times as specified by the demand of the element. In contrast to Multiset Multicover, in Min-$q$-Multiset Multicover each of the chosen subsets may only cover up to $q$ of its elements with multi"},"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":"1812.04622","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-11T14:06:09Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"1a5b65afa728d4c914035434e2afcf6f77773c4a601bb4be73458c4f0b3fb72a","abstract_canon_sha256":"d869f7bfea7501a00c519e7759c208da90cc3bef17753e9f20151e4ff9d6504e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:24.550938Z","signature_b64":"36MRJBPTLMwGuVn0J4lF6BB3KlsVKmR0g1bcMJ6Ki2fFedoRenF8jtm5SadD82PKwDkMTbx12kj0YehYe6jiBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76e289c5a07bd186a83d5a4ddcb8afbd8c11597061a8a7b0360dec3bb5b948ca","last_reissued_at":"2026-05-17T23:58:24.550415Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:24.550415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Multicovers with Budgeted Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.OC","authors_text":"Eva Schmidt, Manuel Streicher, Sven O. Krumke","submitted_at":"2018-12-11T14:06:09Z","abstract_excerpt":"The Min-$q$-Multiset Multicover problem presented in this paper is a special version of the Multiset Multicover problem. For a fixed positive integer $q$, we are given a finite ground set $J$, an integral demand for each element in $J$ and a collection of subsets of $J$. The task is to choose sets of the collection (multiple choices are allowed) such that each element in $J$ is covered at least as many times as specified by the demand of the element. In contrast to Multiset Multicover, in Min-$q$-Multiset Multicover each of the chosen subsets may only cover up to $q$ of its elements with multi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.04622","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1812.04622","created_at":"2026-05-17T23:58:24.550493+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.04622v2","created_at":"2026-05-17T23:58:24.550493+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.04622","created_at":"2026-05-17T23:58:24.550493+00:00"},{"alias_kind":"pith_short_12","alias_value":"O3RITRNAPPIY","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"O3RITRNAPPIYNKB5","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"O3RITRNA","created_at":"2026-05-18T12:32:40.477152+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/O3RITRNAPPIYNKB5LJG5ZOFPXW","json":"https://pith.science/pith/O3RITRNAPPIYNKB5LJG5ZOFPXW.json","graph_json":"https://pith.science/api/pith-number/O3RITRNAPPIYNKB5LJG5ZOFPXW/graph.json","events_json":"https://pith.science/api/pith-number/O3RITRNAPPIYNKB5LJG5ZOFPXW/events.json","paper":"https://pith.science/paper/O3RITRNA"},"agent_actions":{"view_html":"https://pith.science/pith/O3RITRNAPPIYNKB5LJG5ZOFPXW","download_json":"https://pith.science/pith/O3RITRNAPPIYNKB5LJG5ZOFPXW.json","view_paper":"https://pith.science/paper/O3RITRNA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.04622&json=true","fetch_graph":"https://pith.science/api/pith-number/O3RITRNAPPIYNKB5LJG5ZOFPXW/graph.json","fetch_events":"https://pith.science/api/pith-number/O3RITRNAPPIYNKB5LJG5ZOFPXW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O3RITRNAPPIYNKB5LJG5ZOFPXW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O3RITRNAPPIYNKB5LJG5ZOFPXW/action/storage_attestation","attest_author":"https://pith.science/pith/O3RITRNAPPIYNKB5LJG5ZOFPXW/action/author_attestation","sign_citation":"https://pith.science/pith/O3RITRNAPPIYNKB5LJG5ZOFPXW/action/citation_signature","submit_replication":"https://pith.science/pith/O3RITRNAPPIYNKB5LJG5ZOFPXW/action/replication_record"}},"created_at":"2026-05-17T23:58:24.550493+00:00","updated_at":"2026-05-17T23:58:24.550493+00:00"}