{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:LYXFULRGQJFWQVUGMZ6RNCGBXI","short_pith_number":"pith:LYXFULRG","canonical_record":{"source":{"id":"1307.4927","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-18T12:58:15Z","cross_cats_sorted":[],"title_canon_sha256":"3a779977d81202e64ec2492254399f59afab33a90b975e38379a83628561fdfd","abstract_canon_sha256":"ebd09f75735cacf68b3612e4c474f677f635d21c2b3b9ce82e052db436da11aa"},"schema_version":"1.0"},"canonical_sha256":"5e2e5a2e26824b685686667d1688c1ba14edabc3c12f0b855feefab568a08fbe","source":{"kind":"arxiv","id":"1307.4927","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.4927","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"arxiv_version","alias_value":"1307.4927v1","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4927","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"pith_short_12","alias_value":"LYXFULRGQJFW","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LYXFULRGQJFWQVUG","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LYXFULRG","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:LYXFULRGQJFWQVUGMZ6RNCGBXI","target":"record","payload":{"canonical_record":{"source":{"id":"1307.4927","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-18T12:58:15Z","cross_cats_sorted":[],"title_canon_sha256":"3a779977d81202e64ec2492254399f59afab33a90b975e38379a83628561fdfd","abstract_canon_sha256":"ebd09f75735cacf68b3612e4c474f677f635d21c2b3b9ce82e052db436da11aa"},"schema_version":"1.0"},"canonical_sha256":"5e2e5a2e26824b685686667d1688c1ba14edabc3c12f0b855feefab568a08fbe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:07.196215Z","signature_b64":"2i0RZH+mAc9TuDsp9iLL9OKG2r5GX7WnkM7UfK4KONGI/Kj7zC61wSd0ylu0zHdDDh5XmyB3u4oK71gt9KEeDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e2e5a2e26824b685686667d1688c1ba14edabc3c12f0b855feefab568a08fbe","last_reissued_at":"2026-05-18T03:18:07.195593Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:07.195593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.4927","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-18T03:18:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6y6Y3OTIufVj8krnAd39GmHqDZrmqdxu+gYYOmFr+3htGREImI6Z5MUhVXDlTxfEhmxKNG0aFi99yuvc5DP4BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:50:56.216195Z"},"content_sha256":"5acec02c74892a04a977ca0b51c7b7981982c48bbe8f60020d6ed61e8714fc1b","schema_version":"1.0","event_id":"sha256:5acec02c74892a04a977ca0b51c7b7981982c48bbe8f60020d6ed61e8714fc1b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:LYXFULRGQJFWQVUGMZ6RNCGBXI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear-Time FPT Algorithms via Network Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Keigo Oka, Yoichi Iwata, Yuichi Yoshida","submitted_at":"2013-07-18T12:58:15Z","abstract_excerpt":"In the area of parameterized complexity, to cope with NP-Hard problems, we introduce a parameter k besides the input size n, and we aim to design algorithms (called FPT algorithms) that run in O(f(k)n^d) time for some function f(k) and constant d. Though FPT algorithms have been successfully designed for many problems, typically they are not sufficiently fast because of huge f(k) and d. In this paper, we give FPT algorithms with small f(k) and d for many important problems including Odd Cycle Transversal and Almost 2-SAT. More specifically, we can choose f(k) as a single exponential (4^k) and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4927","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-18T03:18:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sEXdIvtdRh+GjH3BRXu2opFH0CqfbBnoJu0DX1xTDXegeUBuxKTVH3OrLaLJ2d4IHhPcdfqkTdjG/seqZ8qMDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:50:56.216860Z"},"content_sha256":"084b77e0219b3946abd73fe780802280e65d7067671c20df26c7fc9a9dd9aed3","schema_version":"1.0","event_id":"sha256:084b77e0219b3946abd73fe780802280e65d7067671c20df26c7fc9a9dd9aed3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LYXFULRGQJFWQVUGMZ6RNCGBXI/bundle.json","state_url":"https://pith.science/pith/LYXFULRGQJFWQVUGMZ6RNCGBXI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LYXFULRGQJFWQVUGMZ6RNCGBXI/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-30T13:50:56Z","links":{"resolver":"https://pith.science/pith/LYXFULRGQJFWQVUGMZ6RNCGBXI","bundle":"https://pith.science/pith/LYXFULRGQJFWQVUGMZ6RNCGBXI/bundle.json","state":"https://pith.science/pith/LYXFULRGQJFWQVUGMZ6RNCGBXI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LYXFULRGQJFWQVUGMZ6RNCGBXI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LYXFULRGQJFWQVUGMZ6RNCGBXI","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":"ebd09f75735cacf68b3612e4c474f677f635d21c2b3b9ce82e052db436da11aa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-18T12:58:15Z","title_canon_sha256":"3a779977d81202e64ec2492254399f59afab33a90b975e38379a83628561fdfd"},"schema_version":"1.0","source":{"id":"1307.4927","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.4927","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"arxiv_version","alias_value":"1307.4927v1","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4927","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"pith_short_12","alias_value":"LYXFULRGQJFW","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LYXFULRGQJFWQVUG","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LYXFULRG","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:084b77e0219b3946abd73fe780802280e65d7067671c20df26c7fc9a9dd9aed3","target":"graph","created_at":"2026-05-18T03:18:07Z","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 area of parameterized complexity, to cope with NP-Hard problems, we introduce a parameter k besides the input size n, and we aim to design algorithms (called FPT algorithms) that run in O(f(k)n^d) time for some function f(k) and constant d. Though FPT algorithms have been successfully designed for many problems, typically they are not sufficiently fast because of huge f(k) and d. In this paper, we give FPT algorithms with small f(k) and d for many important problems including Odd Cycle Transversal and Almost 2-SAT. More specifically, we can choose f(k) as a single exponential (4^k) and ","authors_text":"Keigo Oka, Yoichi Iwata, Yuichi Yoshida","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-18T12:58:15Z","title":"Linear-Time FPT Algorithms via Network Flow"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4927","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:5acec02c74892a04a977ca0b51c7b7981982c48bbe8f60020d6ed61e8714fc1b","target":"record","created_at":"2026-05-18T03:18:07Z","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":"ebd09f75735cacf68b3612e4c474f677f635d21c2b3b9ce82e052db436da11aa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-18T12:58:15Z","title_canon_sha256":"3a779977d81202e64ec2492254399f59afab33a90b975e38379a83628561fdfd"},"schema_version":"1.0","source":{"id":"1307.4927","kind":"arxiv","version":1}},"canonical_sha256":"5e2e5a2e26824b685686667d1688c1ba14edabc3c12f0b855feefab568a08fbe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e2e5a2e26824b685686667d1688c1ba14edabc3c12f0b855feefab568a08fbe","first_computed_at":"2026-05-18T03:18:07.195593Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:18:07.195593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2i0RZH+mAc9TuDsp9iLL9OKG2r5GX7WnkM7UfK4KONGI/Kj7zC61wSd0ylu0zHdDDh5XmyB3u4oK71gt9KEeDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:18:07.196215Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.4927","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5acec02c74892a04a977ca0b51c7b7981982c48bbe8f60020d6ed61e8714fc1b","sha256:084b77e0219b3946abd73fe780802280e65d7067671c20df26c7fc9a9dd9aed3"],"state_sha256":"39b1b1157c0693b6b77e8c7749616b2467ef278f0889104d3c72b3f6f4441bd5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R6mIIf+C8bDN2Y1eiBotN+3o7uzpAtApVbswKM4j2orFHfL/5LJBKCnzdVb1+uJt//9mxBU1OtLauAf6abe+AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T13:50:56.220095Z","bundle_sha256":"6a21e257a2f126ef553027571ea9a11e1fdda0bcea49ca6c10d1718d9ff098e1"}}