{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:VJIZJPPTCEJRWMTXC26OY34QUD","short_pith_number":"pith:VJIZJPPT","canonical_record":{"source":{"id":"1102.5105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-24T21:33:20Z","cross_cats_sorted":[],"title_canon_sha256":"0ba154a863802493aa48df93faf04d7bc20a99b4854a9ee902f5eb90fc19849a","abstract_canon_sha256":"96b33c5fe17d48f26658b30ace1ffb5fd7bccad94b45abbb4f13f9609280bdd1"},"schema_version":"1.0"},"canonical_sha256":"aa5194bdf311131b327716bcec6f90a0e60abb560077321f11d47478d7945087","source":{"kind":"arxiv","id":"1102.5105","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.5105","created_at":"2026-05-18T04:27:56Z"},{"alias_kind":"arxiv_version","alias_value":"1102.5105v1","created_at":"2026-05-18T04:27:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5105","created_at":"2026-05-18T04:27:56Z"},{"alias_kind":"pith_short_12","alias_value":"VJIZJPPTCEJR","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"VJIZJPPTCEJRWMTX","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"VJIZJPPT","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:VJIZJPPTCEJRWMTXC26OY34QUD","target":"record","payload":{"canonical_record":{"source":{"id":"1102.5105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-24T21:33:20Z","cross_cats_sorted":[],"title_canon_sha256":"0ba154a863802493aa48df93faf04d7bc20a99b4854a9ee902f5eb90fc19849a","abstract_canon_sha256":"96b33c5fe17d48f26658b30ace1ffb5fd7bccad94b45abbb4f13f9609280bdd1"},"schema_version":"1.0"},"canonical_sha256":"aa5194bdf311131b327716bcec6f90a0e60abb560077321f11d47478d7945087","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:56.244954Z","signature_b64":"hFuaiuSmG04F/Lbp6H/UE2ZroiDU6UYqhvljVKpDClahUTPAy3ApvaIdFVk01P9c21FkgSt0PAffPFowykdACA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa5194bdf311131b327716bcec6f90a0e60abb560077321f11d47478d7945087","last_reissued_at":"2026-05-18T04:27:56.244250Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:56.244250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.5105","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-05-18T04:27:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"szYNopwa+KiQo30sGntsUxSjeleCqGTLSl7XdTret7o1sdJnE5O6pmi/RJRW8buOz1ZrS+hKxRtd43mrm7xzCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:29:17.489708Z"},"content_sha256":"5cab1d07403b45338715cd160c6a93b3f766c5c6f19ed9639f4d1361fdd87d95","schema_version":"1.0","event_id":"sha256:5cab1d07403b45338715cd160c6a93b3f766c5c6f19ed9639f4d1361fdd87d95"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:VJIZJPPTCEJRWMTXC26OY34QUD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation Algorithms for Union and Intersection Covering Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fabrizio Grandoni, Marcin Mucha, Marcin Pilipczuk, Marek Cygan, Piotr Sankowski, Stefano Leonardi","submitted_at":"2011-02-24T21:33:20Z","abstract_excerpt":"In a classical covering problem, we are given a set of requests that we need to satisfy (fully or partially), by buying a subset of items at minimum cost. For example, in the k-MST problem we want to find the cheapest tree spanning at least k nodes of an edge-weighted graph. Here nodes and edges represent requests and items, respectively.\n  In this paper, we initiate the study of a new family of multi-layer covering problems. Each such problem consists of a collection of h distinct instances of a standard covering problem (layers), with the constraint that all layers share the same set of requ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5105","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":""},"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-18T04:27:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bT2FhwK7XleS1oeaM7oYXcxZyKZknL08MmMLo/LFAozpDm2TeYccnrt5tSGmciPdbUt70dOLAjkpc+KSkOE7DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:29:17.490059Z"},"content_sha256":"3ff07b88b77ee38476773021dc3d2e810b90e0e4f6f93839cfca28aabcab4a01","schema_version":"1.0","event_id":"sha256:3ff07b88b77ee38476773021dc3d2e810b90e0e4f6f93839cfca28aabcab4a01"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VJIZJPPTCEJRWMTXC26OY34QUD/bundle.json","state_url":"https://pith.science/pith/VJIZJPPTCEJRWMTXC26OY34QUD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VJIZJPPTCEJRWMTXC26OY34QUD/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-05-30T20:29:17Z","links":{"resolver":"https://pith.science/pith/VJIZJPPTCEJRWMTXC26OY34QUD","bundle":"https://pith.science/pith/VJIZJPPTCEJRWMTXC26OY34QUD/bundle.json","state":"https://pith.science/pith/VJIZJPPTCEJRWMTXC26OY34QUD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VJIZJPPTCEJRWMTXC26OY34QUD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:VJIZJPPTCEJRWMTXC26OY34QUD","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":"96b33c5fe17d48f26658b30ace1ffb5fd7bccad94b45abbb4f13f9609280bdd1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-24T21:33:20Z","title_canon_sha256":"0ba154a863802493aa48df93faf04d7bc20a99b4854a9ee902f5eb90fc19849a"},"schema_version":"1.0","source":{"id":"1102.5105","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.5105","created_at":"2026-05-18T04:27:56Z"},{"alias_kind":"arxiv_version","alias_value":"1102.5105v1","created_at":"2026-05-18T04:27:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5105","created_at":"2026-05-18T04:27:56Z"},{"alias_kind":"pith_short_12","alias_value":"VJIZJPPTCEJR","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"VJIZJPPTCEJRWMTX","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"VJIZJPPT","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:3ff07b88b77ee38476773021dc3d2e810b90e0e4f6f93839cfca28aabcab4a01","target":"graph","created_at":"2026-05-18T04:27:56Z","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":"In a classical covering problem, we are given a set of requests that we need to satisfy (fully or partially), by buying a subset of items at minimum cost. For example, in the k-MST problem we want to find the cheapest tree spanning at least k nodes of an edge-weighted graph. Here nodes and edges represent requests and items, respectively.\n  In this paper, we initiate the study of a new family of multi-layer covering problems. Each such problem consists of a collection of h distinct instances of a standard covering problem (layers), with the constraint that all layers share the same set of requ","authors_text":"Fabrizio Grandoni, Marcin Mucha, Marcin Pilipczuk, Marek Cygan, Piotr Sankowski, Stefano Leonardi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-24T21:33:20Z","title":"Approximation Algorithms for Union and Intersection Covering Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5105","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:5cab1d07403b45338715cd160c6a93b3f766c5c6f19ed9639f4d1361fdd87d95","target":"record","created_at":"2026-05-18T04:27:56Z","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":"96b33c5fe17d48f26658b30ace1ffb5fd7bccad94b45abbb4f13f9609280bdd1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-24T21:33:20Z","title_canon_sha256":"0ba154a863802493aa48df93faf04d7bc20a99b4854a9ee902f5eb90fc19849a"},"schema_version":"1.0","source":{"id":"1102.5105","kind":"arxiv","version":1}},"canonical_sha256":"aa5194bdf311131b327716bcec6f90a0e60abb560077321f11d47478d7945087","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa5194bdf311131b327716bcec6f90a0e60abb560077321f11d47478d7945087","first_computed_at":"2026-05-18T04:27:56.244250Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:27:56.244250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hFuaiuSmG04F/Lbp6H/UE2ZroiDU6UYqhvljVKpDClahUTPAy3ApvaIdFVk01P9c21FkgSt0PAffPFowykdACA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:27:56.244954Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.5105","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5cab1d07403b45338715cd160c6a93b3f766c5c6f19ed9639f4d1361fdd87d95","sha256:3ff07b88b77ee38476773021dc3d2e810b90e0e4f6f93839cfca28aabcab4a01"],"state_sha256":"129fa512103a4649a3b4d2071d90f6ad4a6f9c4f408e813782e341a15965f0ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OWJeVCK4L55+9bYch6K/1ShVC7R09+QS6n0yjuMp5k7lfoGFjjI9jGVseFNZlwiE1OkvJBIaX19i3ajNpqHEAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:29:17.492089Z","bundle_sha256":"9003a71fcd27b1504718e7835f21cae7f46a29d7f69785254f639087e980f1eb"}}