{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:FPPG75DJMPRBLRKVRUYVOMP4WY","short_pith_number":"pith:FPPG75DJ","canonical_record":{"source":{"id":"1105.4175","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-05-20T20:57:51Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"acef458a99af8419c0f992036324927290dfe9b23ca43fad1128da6b26f3b051","abstract_canon_sha256":"3f7bde33cbaf2ef2e58d570a2f7829c89bfb018da9a62dfc69f4640c21fe61da"},"schema_version":"1.0"},"canonical_sha256":"2bde6ff46963e215c5558d315731fcb60f1385d1c1b754701bb99b0232dac6b0","source":{"kind":"arxiv","id":"1105.4175","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.4175","created_at":"2026-05-18T04:21:29Z"},{"alias_kind":"arxiv_version","alias_value":"1105.4175v1","created_at":"2026-05-18T04:21:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.4175","created_at":"2026-05-18T04:21:29Z"},{"alias_kind":"pith_short_12","alias_value":"FPPG75DJMPRB","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FPPG75DJMPRBLRKV","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FPPG75DJ","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:FPPG75DJMPRBLRKVRUYVOMP4WY","target":"record","payload":{"canonical_record":{"source":{"id":"1105.4175","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-05-20T20:57:51Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"acef458a99af8419c0f992036324927290dfe9b23ca43fad1128da6b26f3b051","abstract_canon_sha256":"3f7bde33cbaf2ef2e58d570a2f7829c89bfb018da9a62dfc69f4640c21fe61da"},"schema_version":"1.0"},"canonical_sha256":"2bde6ff46963e215c5558d315731fcb60f1385d1c1b754701bb99b0232dac6b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:21:29.632032Z","signature_b64":"LmQfGV0ez50CwfGCAvEdN0zKdjoLg76EX38H6aW2KawR7VZcW9wdTeBEdHDcgLq4rFB3x4qXObe7aasLwZO6DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bde6ff46963e215c5558d315731fcb60f1385d1c1b754701bb99b0232dac6b0","last_reissued_at":"2026-05-18T04:21:29.631600Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:21:29.631600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.4175","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:21:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CAQsyw8pPejyIPw1bHrT5l965nm9Jnut1lNLXb+TP+XG4ZxKS9KZvDFb+GP/dd4KROVS/MoC8hNvKOIC+VXFBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:49:38.128763Z"},"content_sha256":"f32f796e48ddc06d21db418c33a01d520987976bf3180809a8e3c36b44df9d4b","schema_version":"1.0","event_id":"sha256:f32f796e48ddc06d21db418c33a01d520987976bf3180809a8e3c36b44df9d4b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:FPPG75DJMPRBLRKVRUYVOMP4WY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Rishi Saket, Sushant Sachdeva","submitted_at":"2011-05-20T20:57:51Z","abstract_excerpt":"We study the problem of computing the minimum vertex cover on k-uniform k-partite hypergraphs when the k-partition is given. On bipartite graphs (k = 2), the minimum vertex cover can be computed in polynomial time. For general k, the problem was studied by Lov\\'asz, who gave a k/2 -approximation based on the standard LP relaxation. Subsequent work by Aharoni, Holzman and Krivelevich showed a tight integrality gap of (k/2 - o(1)) for the LP relaxation. While this problem was known to be NP-hard for k >= 3, the first non-trivial NP-hardness of approximation factor of k/4- \\eps was shown in a rec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.4175","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:21:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"msaY4iJHoTrGML4SbC0w7BtEL55LhmsVtYUwxwwlJsO5ihPJ75dVLYGf/6U0TH1809KUcinVS1yEoJDM9uyvBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:49:38.129367Z"},"content_sha256":"4e70039e4565c94f1ec25389aeb93b85c6abfa383a41facdb465d27aac5cda10","schema_version":"1.0","event_id":"sha256:4e70039e4565c94f1ec25389aeb93b85c6abfa383a41facdb465d27aac5cda10"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FPPG75DJMPRBLRKVRUYVOMP4WY/bundle.json","state_url":"https://pith.science/pith/FPPG75DJMPRBLRKVRUYVOMP4WY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FPPG75DJMPRBLRKVRUYVOMP4WY/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-26T11:49:38Z","links":{"resolver":"https://pith.science/pith/FPPG75DJMPRBLRKVRUYVOMP4WY","bundle":"https://pith.science/pith/FPPG75DJMPRBLRKVRUYVOMP4WY/bundle.json","state":"https://pith.science/pith/FPPG75DJMPRBLRKVRUYVOMP4WY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FPPG75DJMPRBLRKVRUYVOMP4WY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:FPPG75DJMPRBLRKVRUYVOMP4WY","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":"3f7bde33cbaf2ef2e58d570a2f7829c89bfb018da9a62dfc69f4640c21fe61da","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-05-20T20:57:51Z","title_canon_sha256":"acef458a99af8419c0f992036324927290dfe9b23ca43fad1128da6b26f3b051"},"schema_version":"1.0","source":{"id":"1105.4175","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.4175","created_at":"2026-05-18T04:21:29Z"},{"alias_kind":"arxiv_version","alias_value":"1105.4175v1","created_at":"2026-05-18T04:21:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.4175","created_at":"2026-05-18T04:21:29Z"},{"alias_kind":"pith_short_12","alias_value":"FPPG75DJMPRB","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FPPG75DJMPRBLRKV","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FPPG75DJ","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:4e70039e4565c94f1ec25389aeb93b85c6abfa383a41facdb465d27aac5cda10","target":"graph","created_at":"2026-05-18T04:21:29Z","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":"We study the problem of computing the minimum vertex cover on k-uniform k-partite hypergraphs when the k-partition is given. On bipartite graphs (k = 2), the minimum vertex cover can be computed in polynomial time. For general k, the problem was studied by Lov\\'asz, who gave a k/2 -approximation based on the standard LP relaxation. Subsequent work by Aharoni, Holzman and Krivelevich showed a tight integrality gap of (k/2 - o(1)) for the LP relaxation. While this problem was known to be NP-hard for k >= 3, the first non-trivial NP-hardness of approximation factor of k/4- \\eps was shown in a rec","authors_text":"Rishi Saket, Sushant Sachdeva","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-05-20T20:57:51Z","title":"Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.4175","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:f32f796e48ddc06d21db418c33a01d520987976bf3180809a8e3c36b44df9d4b","target":"record","created_at":"2026-05-18T04:21:29Z","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":"3f7bde33cbaf2ef2e58d570a2f7829c89bfb018da9a62dfc69f4640c21fe61da","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-05-20T20:57:51Z","title_canon_sha256":"acef458a99af8419c0f992036324927290dfe9b23ca43fad1128da6b26f3b051"},"schema_version":"1.0","source":{"id":"1105.4175","kind":"arxiv","version":1}},"canonical_sha256":"2bde6ff46963e215c5558d315731fcb60f1385d1c1b754701bb99b0232dac6b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2bde6ff46963e215c5558d315731fcb60f1385d1c1b754701bb99b0232dac6b0","first_computed_at":"2026-05-18T04:21:29.631600Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:21:29.631600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LmQfGV0ez50CwfGCAvEdN0zKdjoLg76EX38H6aW2KawR7VZcW9wdTeBEdHDcgLq4rFB3x4qXObe7aasLwZO6DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:21:29.632032Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.4175","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f32f796e48ddc06d21db418c33a01d520987976bf3180809a8e3c36b44df9d4b","sha256:4e70039e4565c94f1ec25389aeb93b85c6abfa383a41facdb465d27aac5cda10"],"state_sha256":"79fb8434d99033bef315557d0d9a50b66bec83f460b92b553bbf3ad9edd23ad3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r3K9FKQ9DGMJ2efqH8WjPL5NqOsG+x9XXgEzpmtUO5W4i9lrLfCLkuHVlPJ8CR/xnumndHCU7uYn5nQfHjfgDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:49:38.132555Z","bundle_sha256":"9899b4e2121ff80b660cb124a34523e3358c282f087b12885393421ca5c6f36f"}}