{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WMWBJPK252NGQ4WFTXL5PQC5RB","short_pith_number":"pith:WMWBJPK2","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"},"canonical_sha256":"b32c14bd5aee9a6872c59dd7d7c05d8878a052cf70cf269e11439e24c8401dc4","source":{"kind":"arxiv","id":"1506.06302","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.06302","created_at":"2026-05-18T01:41:45Z"},{"alias_kind":"arxiv_version","alias_value":"1506.06302v1","created_at":"2026-05-18T01:41:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06302","created_at":"2026-05-18T01:41:45Z"},{"alias_kind":"pith_short_12","alias_value":"WMWBJPK252NG","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WMWBJPK252NGQ4WF","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WMWBJPK2","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WMWBJPK252NGQ4WFTXL5PQC5RB","target":"record","payload":{"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"},"canonical_sha256":"b32c14bd5aee9a6872c59dd7d7c05d8878a052cf70cf269e11439e24c8401dc4","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"},"source_kind":"arxiv","source_id":"1506.06302","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-18T01:41:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bwos04cJMlmkm9LsIjy70nyE34UqC6u4hj1HiG2xGmoUmiPmGqlSVY96vuYnsdCbwfreK1SBmaV2ren5/dETDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:28:52.615081Z"},"content_sha256":"4a8260ce415ec7fbdc31130c86b6475e8c586d7d75be778e6bcd41df8cf1652f","schema_version":"1.0","event_id":"sha256:4a8260ce415ec7fbdc31130c86b6475e8c586d7d75be778e6bcd41df8cf1652f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WMWBJPK252NGQ4WFTXL5PQC5RB","target":"graph","payload":{"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"},"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-18T01:41:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WcPnTvwChj2jdASiAYF/hVl15/XFEwCuhyyn9HclJU8qAOuCnlW6unOacr/cc92LH/9JXuCrso8pZpny2K/dAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:28:52.616034Z"},"content_sha256":"97d859e0dbfef0d79b7ae49a3776751c85d5c5676a2204e2429b1dfd1faea47a","schema_version":"1.0","event_id":"sha256:97d859e0dbfef0d79b7ae49a3776751c85d5c5676a2204e2429b1dfd1faea47a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WMWBJPK252NGQ4WFTXL5PQC5RB/bundle.json","state_url":"https://pith.science/pith/WMWBJPK252NGQ4WFTXL5PQC5RB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WMWBJPK252NGQ4WFTXL5PQC5RB/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-09T09:28:52Z","links":{"resolver":"https://pith.science/pith/WMWBJPK252NGQ4WFTXL5PQC5RB","bundle":"https://pith.science/pith/WMWBJPK252NGQ4WFTXL5PQC5RB/bundle.json","state":"https://pith.science/pith/WMWBJPK252NGQ4WFTXL5PQC5RB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WMWBJPK252NGQ4WFTXL5PQC5RB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WMWBJPK252NGQ4WFTXL5PQC5RB","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":"d4edf74ec17b38f2af33d31c602476a4811579a8b135fa38d45dbddc595a02de","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-06-20T22:55:06Z","title_canon_sha256":"6c8382c6d1c74ec32010466740d9ff708d04c0ef0bc6cd62f90d5dca6486b5bc"},"schema_version":"1.0","source":{"id":"1506.06302","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.06302","created_at":"2026-05-18T01:41:45Z"},{"alias_kind":"arxiv_version","alias_value":"1506.06302v1","created_at":"2026-05-18T01:41:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06302","created_at":"2026-05-18T01:41:45Z"},{"alias_kind":"pith_short_12","alias_value":"WMWBJPK252NG","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WMWBJPK252NGQ4WF","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WMWBJPK2","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:97d859e0dbfef0d79b7ae49a3776751c85d5c5676a2204e2429b1dfd1faea47a","target":"graph","created_at":"2026-05-18T01:41:45Z","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":"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 $","authors_text":"Euiwoong Lee, Venkatesan Guruswami","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-06-20T22:55:06Z","title":"Inapproximability of $H$-Transversal/Packing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06302","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:4a8260ce415ec7fbdc31130c86b6475e8c586d7d75be778e6bcd41df8cf1652f","target":"record","created_at":"2026-05-18T01:41:45Z","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":"d4edf74ec17b38f2af33d31c602476a4811579a8b135fa38d45dbddc595a02de","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-06-20T22:55:06Z","title_canon_sha256":"6c8382c6d1c74ec32010466740d9ff708d04c0ef0bc6cd62f90d5dca6486b5bc"},"schema_version":"1.0","source":{"id":"1506.06302","kind":"arxiv","version":1}},"canonical_sha256":"b32c14bd5aee9a6872c59dd7d7c05d8878a052cf70cf269e11439e24c8401dc4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b32c14bd5aee9a6872c59dd7d7c05d8878a052cf70cf269e11439e24c8401dc4","first_computed_at":"2026-05-18T01:41:45.553296Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:41:45.553296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PfJ9GCfygyBVgHipTtIU3xMJBNzCOfbShrq4PymRhnLqwbb9ZvslrjDMlKq9VgOa2fnxX5unRvwBisjcHaUwCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:41:45.553777Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.06302","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a8260ce415ec7fbdc31130c86b6475e8c586d7d75be778e6bcd41df8cf1652f","sha256:97d859e0dbfef0d79b7ae49a3776751c85d5c5676a2204e2429b1dfd1faea47a"],"state_sha256":"4ea7fe7fad2160f6bb54863098ed3f63c51ea66573323ebfa0a5de5abe4db901"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zaIqcw03GHl16zV9pGasxYOyPVS3OYs4i4KQNFVwlOkgTLmvCwBuO3UVD+fNppSY8M25Rr6lQMXj4QcXeX5SBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T09:28:52.620750Z","bundle_sha256":"521cc4a2a5fc5305ca728b73aaac276b52bba4452730fb117538ba664e512140"}}