{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:RTKZTPKXY37OOSSJI7RFJJU42C","short_pith_number":"pith:RTKZTPKX","canonical_record":{"source":{"id":"1510.07676","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-26T20:54:31Z","cross_cats_sorted":[],"title_canon_sha256":"77756e87acb6701332c3dd08dad04c311d6371d97b0a4c3b0c8891ff7aeae626","abstract_canon_sha256":"426e836f1d6b82149d79b9f3eb400a131e98a7c102b5b2cdb9f08020cf72cf37"},"schema_version":"1.0"},"canonical_sha256":"8cd599bd57c6fee74a4947e254a69cd0858659256e60a2949eaa00397bb175bd","source":{"kind":"arxiv","id":"1510.07676","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.07676","created_at":"2026-05-18T01:29:12Z"},{"alias_kind":"arxiv_version","alias_value":"1510.07676v1","created_at":"2026-05-18T01:29:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07676","created_at":"2026-05-18T01:29:12Z"},{"alias_kind":"pith_short_12","alias_value":"RTKZTPKXY37O","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RTKZTPKXY37OOSSJ","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RTKZTPKX","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:RTKZTPKXY37OOSSJI7RFJJU42C","target":"record","payload":{"canonical_record":{"source":{"id":"1510.07676","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-26T20:54:31Z","cross_cats_sorted":[],"title_canon_sha256":"77756e87acb6701332c3dd08dad04c311d6371d97b0a4c3b0c8891ff7aeae626","abstract_canon_sha256":"426e836f1d6b82149d79b9f3eb400a131e98a7c102b5b2cdb9f08020cf72cf37"},"schema_version":"1.0"},"canonical_sha256":"8cd599bd57c6fee74a4947e254a69cd0858659256e60a2949eaa00397bb175bd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:12.906295Z","signature_b64":"kZzIv/NJr/ykYUpEpdYs7ItAR0nfxjp7zphCRI24BWn1T+DygRnu2YFUf+woqLOi1HB3th6ixiegtcbZQi8VAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cd599bd57c6fee74a4947e254a69cd0858659256e60a2949eaa00397bb175bd","last_reissued_at":"2026-05-18T01:29:12.905621Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:12.905621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.07676","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:29:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0tISH7tVnWZCFj2pGk3C0+ITGoVjZKZQrFQNXfkKfAzJPnjD+mmpx8e0N1IPOA/EzyqnZpLb8n9f8XN8wBTLCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T05:13:08.340551Z"},"content_sha256":"67c3ff4a33962d2bb8eaf2dedc62d4fa829ccff0cadfc7ead0a11d782517cf07","schema_version":"1.0","event_id":"sha256:67c3ff4a33962d2bb8eaf2dedc62d4fa829ccff0cadfc7ead0a11d782517cf07"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:RTKZTPKXY37OOSSJI7RFJJU42C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Mithilesh Kumar","submitted_at":"2015-10-26T20:54:31Z","abstract_excerpt":"A tournament is a directed graph T such that every pair of vertices are connected by an arc. A feedback vertex set is a set S of vertices in T such that T - S is acyclic. In this article we consider the Feedback Vertex Set problem in tournaments. Here input is a tournament T and integer k, and the task is to determine whether T has a feedback vertex set of size at most k. We give a new algorithm for Feedback Vertex Set in Tournaments. The running time of our algorithm is upper bounded by O(1.618^k + n^{O(1)}) and by O(1.46^n). Thus our algorithm simultaneously improves over the fastest known p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07676","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:29:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A8n4bZFLZqbL8A/WoFx/XJ9FmhgWs/eYWtkXvnOJZ6pp4Dmanpi3ROovlywVaDqokRhuP0sI9SIzZk0Cf5fmAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T05:13:08.341270Z"},"content_sha256":"1317966c98891a7f5958aa94bcba3676c41e4d486d78bf0c4a508ce759b0d01c","schema_version":"1.0","event_id":"sha256:1317966c98891a7f5958aa94bcba3676c41e4d486d78bf0c4a508ce759b0d01c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RTKZTPKXY37OOSSJI7RFJJU42C/bundle.json","state_url":"https://pith.science/pith/RTKZTPKXY37OOSSJI7RFJJU42C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RTKZTPKXY37OOSSJI7RFJJU42C/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-08T05:13:08Z","links":{"resolver":"https://pith.science/pith/RTKZTPKXY37OOSSJI7RFJJU42C","bundle":"https://pith.science/pith/RTKZTPKXY37OOSSJI7RFJJU42C/bundle.json","state":"https://pith.science/pith/RTKZTPKXY37OOSSJI7RFJJU42C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RTKZTPKXY37OOSSJI7RFJJU42C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RTKZTPKXY37OOSSJI7RFJJU42C","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":"426e836f1d6b82149d79b9f3eb400a131e98a7c102b5b2cdb9f08020cf72cf37","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-26T20:54:31Z","title_canon_sha256":"77756e87acb6701332c3dd08dad04c311d6371d97b0a4c3b0c8891ff7aeae626"},"schema_version":"1.0","source":{"id":"1510.07676","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.07676","created_at":"2026-05-18T01:29:12Z"},{"alias_kind":"arxiv_version","alias_value":"1510.07676v1","created_at":"2026-05-18T01:29:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07676","created_at":"2026-05-18T01:29:12Z"},{"alias_kind":"pith_short_12","alias_value":"RTKZTPKXY37O","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RTKZTPKXY37OOSSJ","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RTKZTPKX","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:1317966c98891a7f5958aa94bcba3676c41e4d486d78bf0c4a508ce759b0d01c","target":"graph","created_at":"2026-05-18T01:29:12Z","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":"A tournament is a directed graph T such that every pair of vertices are connected by an arc. A feedback vertex set is a set S of vertices in T such that T - S is acyclic. In this article we consider the Feedback Vertex Set problem in tournaments. Here input is a tournament T and integer k, and the task is to determine whether T has a feedback vertex set of size at most k. We give a new algorithm for Feedback Vertex Set in Tournaments. The running time of our algorithm is upper bounded by O(1.618^k + n^{O(1)}) and by O(1.46^n). Thus our algorithm simultaneously improves over the fastest known p","authors_text":"Daniel Lokshtanov, Mithilesh Kumar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-26T20:54:31Z","title":"Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07676","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:67c3ff4a33962d2bb8eaf2dedc62d4fa829ccff0cadfc7ead0a11d782517cf07","target":"record","created_at":"2026-05-18T01:29:12Z","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":"426e836f1d6b82149d79b9f3eb400a131e98a7c102b5b2cdb9f08020cf72cf37","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-26T20:54:31Z","title_canon_sha256":"77756e87acb6701332c3dd08dad04c311d6371d97b0a4c3b0c8891ff7aeae626"},"schema_version":"1.0","source":{"id":"1510.07676","kind":"arxiv","version":1}},"canonical_sha256":"8cd599bd57c6fee74a4947e254a69cd0858659256e60a2949eaa00397bb175bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8cd599bd57c6fee74a4947e254a69cd0858659256e60a2949eaa00397bb175bd","first_computed_at":"2026-05-18T01:29:12.905621Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:12.905621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kZzIv/NJr/ykYUpEpdYs7ItAR0nfxjp7zphCRI24BWn1T+DygRnu2YFUf+woqLOi1HB3th6ixiegtcbZQi8VAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:12.906295Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.07676","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67c3ff4a33962d2bb8eaf2dedc62d4fa829ccff0cadfc7ead0a11d782517cf07","sha256:1317966c98891a7f5958aa94bcba3676c41e4d486d78bf0c4a508ce759b0d01c"],"state_sha256":"a4f8053c1f3980e57eb3d37cd16649996b9c82575fd3aa5e0fe1900708c93ab8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ElOe7N2MOFWS4rrHlAt4amGZoUW82cv3leZ+dFxIjsEaF3+avy/YBZSFxLbvx+VhCPDuG05XbbQtWJmsTvl7Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T05:13:08.344979Z","bundle_sha256":"39d43d374680dbffa1339bcfc3c8ec807a23a5fc9358bd5a66537709a0fbe6cb"}}