{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YUCRDLGC53FFI2SB25NI6G2FTD","short_pith_number":"pith:YUCRDLGC","schema_version":"1.0","canonical_sha256":"c50511acc2eeca546a41d75a8f1b4598e83946b02bd2114959793f945cdba56a","source":{"kind":"arxiv","id":"1311.0713","version":1},"attestation_state":"computed","paper":{"title":"Edge covering with budget constrains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"G. Kortsarz, Rajiv Gandhi","submitted_at":"2013-11-04T14:36:54Z","abstract_excerpt":"We study two related problems: finding a set of k vertices and minimum number of edges (kmin) and finding a graph with at least m' edges and minimum number of vertices (mvms).\n  Goldschmidt and Hochbaum \\cite{GH97} show that the mvms problem is NP-hard and they give a 3-approximation algorithm for the problem. We improve \\cite{GH97} by giving a ratio of 2. A 2(1+\\epsilon)-approximation for the problem follows from the work of Carnes and Shmoys \\cite{CS08}. We improve the approximation ratio to 2. algorithm for the problem. We show that the natural LP for \\kmin has an integrality gap of 2-o(1)."},"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":"1311.0713","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-04T14:36:54Z","cross_cats_sorted":[],"title_canon_sha256":"832ac2323404ed96fbcd6efa31902a557984a3a00bdf1016fdc7ff3281e21abf","abstract_canon_sha256":"82443dafabe596dd646e9e36271796fb735ea99bbf7f2bc7a9ca4fb4c18be509"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:05.072180Z","signature_b64":"e9UyDD3LDkKMeMUfvW1GNkdXU3vGdAp+mMSjMG+z7A0ZCy5KAU1J4wn5DrzPUHMSXj7cTrxmOtXGmaqyBz3YCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c50511acc2eeca546a41d75a8f1b4598e83946b02bd2114959793f945cdba56a","last_reissued_at":"2026-05-18T03:08:05.071520Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:05.071520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Edge covering with budget constrains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"G. Kortsarz, Rajiv Gandhi","submitted_at":"2013-11-04T14:36:54Z","abstract_excerpt":"We study two related problems: finding a set of k vertices and minimum number of edges (kmin) and finding a graph with at least m' edges and minimum number of vertices (mvms).\n  Goldschmidt and Hochbaum \\cite{GH97} show that the mvms problem is NP-hard and they give a 3-approximation algorithm for the problem. We improve \\cite{GH97} by giving a ratio of 2. A 2(1+\\epsilon)-approximation for the problem follows from the work of Carnes and Shmoys \\cite{CS08}. We improve the approximation ratio to 2. algorithm for the problem. We show that the natural LP for \\kmin has an integrality gap of 2-o(1)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.0713","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":"1311.0713","created_at":"2026-05-18T03:08:05.071627+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.0713v1","created_at":"2026-05-18T03:08:05.071627+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0713","created_at":"2026-05-18T03:08:05.071627+00:00"},{"alias_kind":"pith_short_12","alias_value":"YUCRDLGC53FF","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"YUCRDLGC53FFI2SB","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"YUCRDLGC","created_at":"2026-05-18T12:28:09.283467+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/YUCRDLGC53FFI2SB25NI6G2FTD","json":"https://pith.science/pith/YUCRDLGC53FFI2SB25NI6G2FTD.json","graph_json":"https://pith.science/api/pith-number/YUCRDLGC53FFI2SB25NI6G2FTD/graph.json","events_json":"https://pith.science/api/pith-number/YUCRDLGC53FFI2SB25NI6G2FTD/events.json","paper":"https://pith.science/paper/YUCRDLGC"},"agent_actions":{"view_html":"https://pith.science/pith/YUCRDLGC53FFI2SB25NI6G2FTD","download_json":"https://pith.science/pith/YUCRDLGC53FFI2SB25NI6G2FTD.json","view_paper":"https://pith.science/paper/YUCRDLGC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.0713&json=true","fetch_graph":"https://pith.science/api/pith-number/YUCRDLGC53FFI2SB25NI6G2FTD/graph.json","fetch_events":"https://pith.science/api/pith-number/YUCRDLGC53FFI2SB25NI6G2FTD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YUCRDLGC53FFI2SB25NI6G2FTD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YUCRDLGC53FFI2SB25NI6G2FTD/action/storage_attestation","attest_author":"https://pith.science/pith/YUCRDLGC53FFI2SB25NI6G2FTD/action/author_attestation","sign_citation":"https://pith.science/pith/YUCRDLGC53FFI2SB25NI6G2FTD/action/citation_signature","submit_replication":"https://pith.science/pith/YUCRDLGC53FFI2SB25NI6G2FTD/action/replication_record"}},"created_at":"2026-05-18T03:08:05.071627+00:00","updated_at":"2026-05-18T03:08:05.071627+00:00"}