{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:WMWBJPK252NGQ4WFTXL5PQC5RB","short_pith_number":"pith:WMWBJPK2","schema_version":"1.0","canonical_sha256":"b32c14bd5aee9a6872c59dd7d7c05d8878a052cf70cf269e11439e24c8401dc4","source":{"kind":"arxiv","id":"1506.06302","version":1},"attestation_state":"computed","paper":{"title":"Inapproximability of $H$-Transversal/Packing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Euiwoong Lee, Venkatesan Guruswami","submitted_at":"2015-06-20T22:55:06Z","abstract_excerpt":"Given an undirected graph $G = (V_G, E_G)$ and a fixed \"pattern\" graph $H = (V_H, E_H)$ with $k$ vertices, we consider the $H$-Transversal and $H$-Packing problems. The former asks to find the smallest $S \\subseteq V_G$ such that the subgraph induced by $V_G \\setminus S$ does not have $H$ as a subgraph, and the latter asks to find the maximum number of pairwise disjoint $k$-subsets $S_1, ..., S_m \\subseteq V_G$ such that the subgraph induced by each $S_i$ has $H$ as a subgraph.\n  We prove that if $H$ is 2-connected, $H$-Transversal and $H$-Packing are almost as hard to approximate as general $"},"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":"1506.06302","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-06-20T22:55:06Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"6c8382c6d1c74ec32010466740d9ff708d04c0ef0bc6cd62f90d5dca6486b5bc","abstract_canon_sha256":"d4edf74ec17b38f2af33d31c602476a4811579a8b135fa38d45dbddc595a02de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:41:45.553777Z","signature_b64":"PfJ9GCfygyBVgHipTtIU3xMJBNzCOfbShrq4PymRhnLqwbb9ZvslrjDMlKq9VgOa2fnxX5unRvwBisjcHaUwCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b32c14bd5aee9a6872c59dd7d7c05d8878a052cf70cf269e11439e24c8401dc4","last_reissued_at":"2026-05-18T01:41:45.553296Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:41:45.553296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inapproximability of $H$-Transversal/Packing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Euiwoong Lee, Venkatesan Guruswami","submitted_at":"2015-06-20T22:55:06Z","abstract_excerpt":"Given an undirected graph $G = (V_G, E_G)$ and a fixed \"pattern\" graph $H = (V_H, E_H)$ with $k$ vertices, we consider the $H$-Transversal and $H$-Packing problems. The former asks to find the smallest $S \\subseteq V_G$ such that the subgraph induced by $V_G \\setminus S$ does not have $H$ as a subgraph, and the latter asks to find the maximum number of pairwise disjoint $k$-subsets $S_1, ..., S_m \\subseteq V_G$ such that the subgraph induced by each $S_i$ has $H$ as a subgraph.\n  We prove that if $H$ is 2-connected, $H$-Transversal and $H$-Packing are almost as hard to approximate as general $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06302","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":"1506.06302","created_at":"2026-05-18T01:41:45.553377+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.06302v1","created_at":"2026-05-18T01:41:45.553377+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06302","created_at":"2026-05-18T01:41:45.553377+00:00"},{"alias_kind":"pith_short_12","alias_value":"WMWBJPK252NG","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"WMWBJPK252NGQ4WF","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"WMWBJPK2","created_at":"2026-05-18T12:29:47.479230+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/WMWBJPK252NGQ4WFTXL5PQC5RB","json":"https://pith.science/pith/WMWBJPK252NGQ4WFTXL5PQC5RB.json","graph_json":"https://pith.science/api/pith-number/WMWBJPK252NGQ4WFTXL5PQC5RB/graph.json","events_json":"https://pith.science/api/pith-number/WMWBJPK252NGQ4WFTXL5PQC5RB/events.json","paper":"https://pith.science/paper/WMWBJPK2"},"agent_actions":{"view_html":"https://pith.science/pith/WMWBJPK252NGQ4WFTXL5PQC5RB","download_json":"https://pith.science/pith/WMWBJPK252NGQ4WFTXL5PQC5RB.json","view_paper":"https://pith.science/paper/WMWBJPK2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.06302&json=true","fetch_graph":"https://pith.science/api/pith-number/WMWBJPK252NGQ4WFTXL5PQC5RB/graph.json","fetch_events":"https://pith.science/api/pith-number/WMWBJPK252NGQ4WFTXL5PQC5RB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WMWBJPK252NGQ4WFTXL5PQC5RB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WMWBJPK252NGQ4WFTXL5PQC5RB/action/storage_attestation","attest_author":"https://pith.science/pith/WMWBJPK252NGQ4WFTXL5PQC5RB/action/author_attestation","sign_citation":"https://pith.science/pith/WMWBJPK252NGQ4WFTXL5PQC5RB/action/citation_signature","submit_replication":"https://pith.science/pith/WMWBJPK252NGQ4WFTXL5PQC5RB/action/replication_record"}},"created_at":"2026-05-18T01:41:45.553377+00:00","updated_at":"2026-05-18T01:41:45.553377+00:00"}