{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:42M33IRV2KDTAL3ECD7PBEC5WK","short_pith_number":"pith:42M33IRV","canonical_record":{"source":{"id":"1609.04347","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-14T17:03:19Z","cross_cats_sorted":[],"title_canon_sha256":"c30f3bb086d96597208e69500305f86f6f2b6b113565f48a291c7205d0c34378","abstract_canon_sha256":"fd12bd8d6596c617ceabbaec456812b8fb569a1bb81a554b932dec9a2654c996"},"schema_version":"1.0"},"canonical_sha256":"e699bda235d287302f6410fef0905db2bd02edfcdccb41122c427ebcd7858c47","source":{"kind":"arxiv","id":"1609.04347","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.04347","created_at":"2026-05-18T01:04:38Z"},{"alias_kind":"arxiv_version","alias_value":"1609.04347v1","created_at":"2026-05-18T01:04:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.04347","created_at":"2026-05-18T01:04:38Z"},{"alias_kind":"pith_short_12","alias_value":"42M33IRV2KDT","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"42M33IRV2KDTAL3E","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"42M33IRV","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:42M33IRV2KDTAL3ECD7PBEC5WK","target":"record","payload":{"canonical_record":{"source":{"id":"1609.04347","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-14T17:03:19Z","cross_cats_sorted":[],"title_canon_sha256":"c30f3bb086d96597208e69500305f86f6f2b6b113565f48a291c7205d0c34378","abstract_canon_sha256":"fd12bd8d6596c617ceabbaec456812b8fb569a1bb81a554b932dec9a2654c996"},"schema_version":"1.0"},"canonical_sha256":"e699bda235d287302f6410fef0905db2bd02edfcdccb41122c427ebcd7858c47","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:38.190163Z","signature_b64":"c5m3pi1a7h8hpKTLn5Dlhsf3Mnq0D6H9EmGOGx0ZYMGmmZLtfMYFB3EUICYps9vxtc9nG9zbdDNZvVrgFAqLDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e699bda235d287302f6410fef0905db2bd02edfcdccb41122c427ebcd7858c47","last_reissued_at":"2026-05-18T01:04:38.189472Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:38.189472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.04347","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:04:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VFvNlJkZX5BLBj6Oa7G6FPMYBE4uB4iC4HH2AHCTF0kyywONYPR2VTvvaWqDvAvCTyXajo+LSQ543/HTgUCCDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T18:39:34.883127Z"},"content_sha256":"debef1ed4fbffefdfd213cd357a4a3ad3e697d03baceede471f46ed3c562b2f4","schema_version":"1.0","event_id":"sha256:debef1ed4fbffefdfd213cd357a4a3ad3e697d03baceede471f46ed3c562b2f4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:42M33IRV2KDTAL3ECD7PBEC5WK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Linear Time Parameterized Algorithm for Directed Feedback Vertex Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh","submitted_at":"2016-09-14T17:03:19Z","abstract_excerpt":"In the Directed Feedback Vertex Set (DFVS) problem, the input is a directed graph $D$ on $n$ vertices and $m$ edges, and an integer $k$. The objective is to determine whether there exists a set of at most $k$ vertices intersecting every directed cycle of $D$. Whether or not DFVS admits a fixed parameter tractable (FPT) algorithm was considered the most important open problem in parameterized complexity until Chen, Liu, Lu, O'Sullivan and Razgon [JACM 2008] answered the question in the affirmative. They gave an algorithm for the problem with running time $O(k!4^kk^4nm)$. Since then, no faster a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.04347","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:04:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WUrVQU9QWTJexcfBY435V4Kvw32FxC2o0s5/wZppvdr74sa8VmFWQV7vusakkzMvVk4FWhCKEZhZSFPReR3cDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T18:39:34.883482Z"},"content_sha256":"4de1f4f7e87ad31d1fe9c3de06cd87582ec9a39e7c28c95e59e857c16f84556c","schema_version":"1.0","event_id":"sha256:4de1f4f7e87ad31d1fe9c3de06cd87582ec9a39e7c28c95e59e857c16f84556c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/42M33IRV2KDTAL3ECD7PBEC5WK/bundle.json","state_url":"https://pith.science/pith/42M33IRV2KDTAL3ECD7PBEC5WK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/42M33IRV2KDTAL3ECD7PBEC5WK/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-20T18:39:34Z","links":{"resolver":"https://pith.science/pith/42M33IRV2KDTAL3ECD7PBEC5WK","bundle":"https://pith.science/pith/42M33IRV2KDTAL3ECD7PBEC5WK/bundle.json","state":"https://pith.science/pith/42M33IRV2KDTAL3ECD7PBEC5WK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/42M33IRV2KDTAL3ECD7PBEC5WK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:42M33IRV2KDTAL3ECD7PBEC5WK","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":"fd12bd8d6596c617ceabbaec456812b8fb569a1bb81a554b932dec9a2654c996","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-14T17:03:19Z","title_canon_sha256":"c30f3bb086d96597208e69500305f86f6f2b6b113565f48a291c7205d0c34378"},"schema_version":"1.0","source":{"id":"1609.04347","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.04347","created_at":"2026-05-18T01:04:38Z"},{"alias_kind":"arxiv_version","alias_value":"1609.04347v1","created_at":"2026-05-18T01:04:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.04347","created_at":"2026-05-18T01:04:38Z"},{"alias_kind":"pith_short_12","alias_value":"42M33IRV2KDT","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"42M33IRV2KDTAL3E","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"42M33IRV","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:4de1f4f7e87ad31d1fe9c3de06cd87582ec9a39e7c28c95e59e857c16f84556c","target":"graph","created_at":"2026-05-18T01:04:38Z","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":"In the Directed Feedback Vertex Set (DFVS) problem, the input is a directed graph $D$ on $n$ vertices and $m$ edges, and an integer $k$. The objective is to determine whether there exists a set of at most $k$ vertices intersecting every directed cycle of $D$. Whether or not DFVS admits a fixed parameter tractable (FPT) algorithm was considered the most important open problem in parameterized complexity until Chen, Liu, Lu, O'Sullivan and Razgon [JACM 2008] answered the question in the affirmative. They gave an algorithm for the problem with running time $O(k!4^kk^4nm)$. Since then, no faster a","authors_text":"Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-14T17:03:19Z","title":"A Linear Time Parameterized Algorithm for Directed Feedback Vertex Set"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.04347","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:debef1ed4fbffefdfd213cd357a4a3ad3e697d03baceede471f46ed3c562b2f4","target":"record","created_at":"2026-05-18T01:04:38Z","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":"fd12bd8d6596c617ceabbaec456812b8fb569a1bb81a554b932dec9a2654c996","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-14T17:03:19Z","title_canon_sha256":"c30f3bb086d96597208e69500305f86f6f2b6b113565f48a291c7205d0c34378"},"schema_version":"1.0","source":{"id":"1609.04347","kind":"arxiv","version":1}},"canonical_sha256":"e699bda235d287302f6410fef0905db2bd02edfcdccb41122c427ebcd7858c47","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e699bda235d287302f6410fef0905db2bd02edfcdccb41122c427ebcd7858c47","first_computed_at":"2026-05-18T01:04:38.189472Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:38.189472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c5m3pi1a7h8hpKTLn5Dlhsf3Mnq0D6H9EmGOGx0ZYMGmmZLtfMYFB3EUICYps9vxtc9nG9zbdDNZvVrgFAqLDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:38.190163Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.04347","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:debef1ed4fbffefdfd213cd357a4a3ad3e697d03baceede471f46ed3c562b2f4","sha256:4de1f4f7e87ad31d1fe9c3de06cd87582ec9a39e7c28c95e59e857c16f84556c"],"state_sha256":"773eeeb7687ecd1d0066db0500bb07dea7bd7ad7ee7679d7ac890fb39764bdf4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LXp3ZfoTiS323ygFS1vUh/VdW5ZibHy5UYV/s2joaX9dY4C9F2Ffh6JvOXQ627XBleXz+GE3MicMMRf0WP+VDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T18:39:34.885386Z","bundle_sha256":"54c985201c3192c398c02424157c5bf92b773c17b4d0522414309a5e41ba2987"}}