{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:O3RITRNAPPIYNKB5LJG5ZOFPXW","short_pith_number":"pith:O3RITRNA","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"},"canonical_sha256":"76e289c5a07bd186a83d5a4ddcb8afbd8c11597061a8a7b0360dec3bb5b948ca","source":{"kind":"arxiv","id":"1812.04622","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.04622","created_at":"2026-05-17T23:58:24Z"},{"alias_kind":"arxiv_version","alias_value":"1812.04622v2","created_at":"2026-05-17T23:58:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.04622","created_at":"2026-05-17T23:58:24Z"},{"alias_kind":"pith_short_12","alias_value":"O3RITRNAPPIY","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"O3RITRNAPPIYNKB5","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"O3RITRNA","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:O3RITRNAPPIYNKB5LJG5ZOFPXW","target":"record","payload":{"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"},"canonical_sha256":"76e289c5a07bd186a83d5a4ddcb8afbd8c11597061a8a7b0360dec3bb5b948ca","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"},"source_kind":"arxiv","source_id":"1812.04622","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-17T23:58:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3X9BMKUKUCZXWiWAaHtOPT2bmhlRs34Ud943FSpNmEoQZxDnjLgyunpNSRgwe4UJOtkleWSj6sezf61Gg3NlAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:01:48.103148Z"},"content_sha256":"10a8fc66b2e8d4f0a2ab3ac95a4d429119b75da7be060634362474048dccd7ce","schema_version":"1.0","event_id":"sha256:10a8fc66b2e8d4f0a2ab3ac95a4d429119b75da7be060634362474048dccd7ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:O3RITRNAPPIYNKB5LJG5ZOFPXW","target":"graph","payload":{"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"},"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-17T23:58:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Ni+XORYjN9FZRjd4GMiOcMY4TtcOKJUkY37+3RawdDeiwYLQeWiHrHSVgSXnzP0nVVlfWnrWWs8ELQzROsDDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:01:48.103518Z"},"content_sha256":"682d2ff8bae63516924f831398f34648c8e220c822bcc54bf85a9a79d926a15c","schema_version":"1.0","event_id":"sha256:682d2ff8bae63516924f831398f34648c8e220c822bcc54bf85a9a79d926a15c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O3RITRNAPPIYNKB5LJG5ZOFPXW/bundle.json","state_url":"https://pith.science/pith/O3RITRNAPPIYNKB5LJG5ZOFPXW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O3RITRNAPPIYNKB5LJG5ZOFPXW/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-25T20:01:48Z","links":{"resolver":"https://pith.science/pith/O3RITRNAPPIYNKB5LJG5ZOFPXW","bundle":"https://pith.science/pith/O3RITRNAPPIYNKB5LJG5ZOFPXW/bundle.json","state":"https://pith.science/pith/O3RITRNAPPIYNKB5LJG5ZOFPXW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O3RITRNAPPIYNKB5LJG5ZOFPXW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:O3RITRNAPPIYNKB5LJG5ZOFPXW","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":"d869f7bfea7501a00c519e7759c208da90cc3bef17753e9f20151e4ff9d6504e","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-11T14:06:09Z","title_canon_sha256":"1a5b65afa728d4c914035434e2afcf6f77773c4a601bb4be73458c4f0b3fb72a"},"schema_version":"1.0","source":{"id":"1812.04622","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.04622","created_at":"2026-05-17T23:58:24Z"},{"alias_kind":"arxiv_version","alias_value":"1812.04622v2","created_at":"2026-05-17T23:58:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.04622","created_at":"2026-05-17T23:58:24Z"},{"alias_kind":"pith_short_12","alias_value":"O3RITRNAPPIY","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"O3RITRNAPPIYNKB5","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"O3RITRNA","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:682d2ff8bae63516924f831398f34648c8e220c822bcc54bf85a9a79d926a15c","target":"graph","created_at":"2026-05-17T23:58:24Z","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":"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","authors_text":"Eva Schmidt, Manuel Streicher, Sven O. Krumke","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-11T14:06:09Z","title":"Robust Multicovers with Budgeted Uncertainty"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.04622","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:10a8fc66b2e8d4f0a2ab3ac95a4d429119b75da7be060634362474048dccd7ce","target":"record","created_at":"2026-05-17T23:58:24Z","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":"d869f7bfea7501a00c519e7759c208da90cc3bef17753e9f20151e4ff9d6504e","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-11T14:06:09Z","title_canon_sha256":"1a5b65afa728d4c914035434e2afcf6f77773c4a601bb4be73458c4f0b3fb72a"},"schema_version":"1.0","source":{"id":"1812.04622","kind":"arxiv","version":2}},"canonical_sha256":"76e289c5a07bd186a83d5a4ddcb8afbd8c11597061a8a7b0360dec3bb5b948ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76e289c5a07bd186a83d5a4ddcb8afbd8c11597061a8a7b0360dec3bb5b948ca","first_computed_at":"2026-05-17T23:58:24.550415Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:24.550415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"36MRJBPTLMwGuVn0J4lF6BB3KlsVKmR0g1bcMJ6Ki2fFedoRenF8jtm5SadD82PKwDkMTbx12kj0YehYe6jiBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:24.550938Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.04622","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10a8fc66b2e8d4f0a2ab3ac95a4d429119b75da7be060634362474048dccd7ce","sha256:682d2ff8bae63516924f831398f34648c8e220c822bcc54bf85a9a79d926a15c"],"state_sha256":"fc8c1432ddedc30637b7d10371cd55a9b823b3cc07381bb5ca41f108cce5dfc6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pgMJSdvyU2cXll1ZL2mK0tn65jRTt1afWyjIZYwBf+Te/oUwJ2GXkzp8yPOlns9KRZTsUNEGTEcrMP1vg3zaCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T20:01:48.105706Z","bundle_sha256":"80df9458a76e350c0e5be12cda8ee44378e906e50e36ae89934a485c34be373d"}}