{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:VJIZJPPTCEJRWMTXC26OY34QUD","short_pith_number":"pith:VJIZJPPT","schema_version":"1.0","canonical_sha256":"aa5194bdf311131b327716bcec6f90a0e60abb560077321f11d47478d7945087","source":{"kind":"arxiv","id":"1102.5105","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1102.5105","created_at":"2026-05-18T04:27:56.244350+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.5105v1","created_at":"2026-05-18T04:27:56.244350+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5105","created_at":"2026-05-18T04:27:56.244350+00:00"},{"alias_kind":"pith_short_12","alias_value":"VJIZJPPTCEJR","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"VJIZJPPTCEJRWMTX","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"VJIZJPPT","created_at":"2026-05-18T12:26:44.992195+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/VJIZJPPTCEJRWMTXC26OY34QUD","json":"https://pith.science/pith/VJIZJPPTCEJRWMTXC26OY34QUD.json","graph_json":"https://pith.science/api/pith-number/VJIZJPPTCEJRWMTXC26OY34QUD/graph.json","events_json":"https://pith.science/api/pith-number/VJIZJPPTCEJRWMTXC26OY34QUD/events.json","paper":"https://pith.science/paper/VJIZJPPT"},"agent_actions":{"view_html":"https://pith.science/pith/VJIZJPPTCEJRWMTXC26OY34QUD","download_json":"https://pith.science/pith/VJIZJPPTCEJRWMTXC26OY34QUD.json","view_paper":"https://pith.science/paper/VJIZJPPT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.5105&json=true","fetch_graph":"https://pith.science/api/pith-number/VJIZJPPTCEJRWMTXC26OY34QUD/graph.json","fetch_events":"https://pith.science/api/pith-number/VJIZJPPTCEJRWMTXC26OY34QUD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VJIZJPPTCEJRWMTXC26OY34QUD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VJIZJPPTCEJRWMTXC26OY34QUD/action/storage_attestation","attest_author":"https://pith.science/pith/VJIZJPPTCEJRWMTXC26OY34QUD/action/author_attestation","sign_citation":"https://pith.science/pith/VJIZJPPTCEJRWMTXC26OY34QUD/action/citation_signature","submit_replication":"https://pith.science/pith/VJIZJPPTCEJRWMTXC26OY34QUD/action/replication_record"}},"created_at":"2026-05-18T04:27:56.244350+00:00","updated_at":"2026-05-18T04:27:56.244350+00:00"}