{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:H2O35G6ZRMSFXMMCUSBVLD2OHP","short_pith_number":"pith:H2O35G6Z","canonical_record":{"source":{"id":"1511.01137","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-03T22:09:46Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c359c5df42675f2b6ff1f784559122c8322477e216a9fb15dcc4154cbaf8ff40","abstract_canon_sha256":"79e1a53fefe4b0179a792eaf5563d77f0f7bf7895e4b44dc9758cf64e0011455"},"schema_version":"1.0"},"canonical_sha256":"3e9dbe9bd98b245bb182a483558f4e3bcffa5b30d68fc5396d610ba8ca650483","source":{"kind":"arxiv","id":"1511.01137","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01137","created_at":"2026-05-18T01:27:47Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01137v1","created_at":"2026-05-18T01:27:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01137","created_at":"2026-05-18T01:27:47Z"},{"alias_kind":"pith_short_12","alias_value":"H2O35G6ZRMSF","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"H2O35G6ZRMSFXMMC","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"H2O35G6Z","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:H2O35G6ZRMSFXMMCUSBVLD2OHP","target":"record","payload":{"canonical_record":{"source":{"id":"1511.01137","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-03T22:09:46Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c359c5df42675f2b6ff1f784559122c8322477e216a9fb15dcc4154cbaf8ff40","abstract_canon_sha256":"79e1a53fefe4b0179a792eaf5563d77f0f7bf7895e4b44dc9758cf64e0011455"},"schema_version":"1.0"},"canonical_sha256":"3e9dbe9bd98b245bb182a483558f4e3bcffa5b30d68fc5396d610ba8ca650483","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:47.986476Z","signature_b64":"fb5fK9Fc6Jx01PO8V/c7TKMbD4wKoA5XSWMJgr9mQ1qUUg+TGlAmvOeIsZlyiC4KIQ5fsV9xWHZMbJnOPv4gDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e9dbe9bd98b245bb182a483558f4e3bcffa5b30d68fc5396d610ba8ca650483","last_reissued_at":"2026-05-18T01:27:47.985844Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:47.985844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.01137","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:27:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uH61sRGMEv1cUiKuNBbp7BNtBYPsvcTRQk1iz7Fp1UvMRLLZ9NONqiJzbqqI3OOQDS+xg3BJlRT+z2kmkrFnBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:08:47.323150Z"},"content_sha256":"bd9f776c727d0d8deef661cb0fb3de631d7bfc110ca39f7c3cd330d9a412cdeb","schema_version":"1.0","event_id":"sha256:bd9f776c727d0d8deef661cb0fb3de631d7bfc110ca39f7c3cd330d9a412cdeb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:H2O35G6ZRMSFXMMCUSBVLD2OHP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A 7/3-Approximation for Feedback Vertex Sets in Tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"L\\'aszl\\'o A. V\\'egh, Matthias Mnich, Virginia Vassilevska Williams","submitted_at":"2015-11-03T22:09:46Z","abstract_excerpt":"We consider the minimum-weight feedback vertex set problem in tournaments: given a tournament with non-negative vertex weights, remove a minimum-weight set of vertices that intersects all cycles. This problem is $\\mathsf{NP}$-hard to solve exactly, and Unique Games-hard to approximate by a factor better than 2. We present the first $7/3$ approximation algorithm for this problem, improving on the previously best known ratio $5/2$ given by Cai et al. [FOCS 1998, SICOMP 2001]."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01137","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:27:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TBWrSGOlmBiTUox1sb3R2ChsSk9JqPFuxMBrcAfzVC0ljoZSDrcmYOhJKQ8t710IHQMA/gzxkdu6ptn3mN+cCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:08:47.323791Z"},"content_sha256":"695aeaab2743a32a9917631265685722384eef7c7b2af6ff39e3ccbd3d692dcf","schema_version":"1.0","event_id":"sha256:695aeaab2743a32a9917631265685722384eef7c7b2af6ff39e3ccbd3d692dcf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H2O35G6ZRMSFXMMCUSBVLD2OHP/bundle.json","state_url":"https://pith.science/pith/H2O35G6ZRMSFXMMCUSBVLD2OHP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H2O35G6ZRMSFXMMCUSBVLD2OHP/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-29T21:08:47Z","links":{"resolver":"https://pith.science/pith/H2O35G6ZRMSFXMMCUSBVLD2OHP","bundle":"https://pith.science/pith/H2O35G6ZRMSFXMMCUSBVLD2OHP/bundle.json","state":"https://pith.science/pith/H2O35G6ZRMSFXMMCUSBVLD2OHP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H2O35G6ZRMSFXMMCUSBVLD2OHP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:H2O35G6ZRMSFXMMCUSBVLD2OHP","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":"79e1a53fefe4b0179a792eaf5563d77f0f7bf7895e4b44dc9758cf64e0011455","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-03T22:09:46Z","title_canon_sha256":"c359c5df42675f2b6ff1f784559122c8322477e216a9fb15dcc4154cbaf8ff40"},"schema_version":"1.0","source":{"id":"1511.01137","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01137","created_at":"2026-05-18T01:27:47Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01137v1","created_at":"2026-05-18T01:27:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01137","created_at":"2026-05-18T01:27:47Z"},{"alias_kind":"pith_short_12","alias_value":"H2O35G6ZRMSF","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"H2O35G6ZRMSFXMMC","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"H2O35G6Z","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:695aeaab2743a32a9917631265685722384eef7c7b2af6ff39e3ccbd3d692dcf","target":"graph","created_at":"2026-05-18T01:27:47Z","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 consider the minimum-weight feedback vertex set problem in tournaments: given a tournament with non-negative vertex weights, remove a minimum-weight set of vertices that intersects all cycles. This problem is $\\mathsf{NP}$-hard to solve exactly, and Unique Games-hard to approximate by a factor better than 2. We present the first $7/3$ approximation algorithm for this problem, improving on the previously best known ratio $5/2$ given by Cai et al. [FOCS 1998, SICOMP 2001].","authors_text":"L\\'aszl\\'o A. V\\'egh, Matthias Mnich, Virginia Vassilevska Williams","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-03T22:09:46Z","title":"A 7/3-Approximation for Feedback Vertex Sets in Tournaments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01137","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:bd9f776c727d0d8deef661cb0fb3de631d7bfc110ca39f7c3cd330d9a412cdeb","target":"record","created_at":"2026-05-18T01:27:47Z","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":"79e1a53fefe4b0179a792eaf5563d77f0f7bf7895e4b44dc9758cf64e0011455","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-03T22:09:46Z","title_canon_sha256":"c359c5df42675f2b6ff1f784559122c8322477e216a9fb15dcc4154cbaf8ff40"},"schema_version":"1.0","source":{"id":"1511.01137","kind":"arxiv","version":1}},"canonical_sha256":"3e9dbe9bd98b245bb182a483558f4e3bcffa5b30d68fc5396d610ba8ca650483","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e9dbe9bd98b245bb182a483558f4e3bcffa5b30d68fc5396d610ba8ca650483","first_computed_at":"2026-05-18T01:27:47.985844Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:47.985844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fb5fK9Fc6Jx01PO8V/c7TKMbD4wKoA5XSWMJgr9mQ1qUUg+TGlAmvOeIsZlyiC4KIQ5fsV9xWHZMbJnOPv4gDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:47.986476Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.01137","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd9f776c727d0d8deef661cb0fb3de631d7bfc110ca39f7c3cd330d9a412cdeb","sha256:695aeaab2743a32a9917631265685722384eef7c7b2af6ff39e3ccbd3d692dcf"],"state_sha256":"6f56a9897c321a331d1d7119feae90c93b434c6ccd07762ca8b5a9747e07c8c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xO5gegCuX9IGo7YiYbiu03+1XtF2AQnleVgrBwoiS7jjiF7Gp2vwm4pRrD0pzJDhQ9FlXWAsIlstaU1ewY6jAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T21:08:47.326978Z","bundle_sha256":"a111d8d35779b33df1f5c754e010735fab8ec32ef55c05bbfc71c7f444914491"}}