{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:T377UTBVLGHUFUV6ROWYZ2M6HD","short_pith_number":"pith:T377UTBV","schema_version":"1.0","canonical_sha256":"9efffa4c35598f42d2be8bad8ce99e38cbf2f9fbfd8036a98660b3ee7ede7fc7","source":{"kind":"arxiv","id":"1305.3102","version":1},"attestation_state":"computed","paper":{"title":"FPT is Characterized by Useful Obstruction Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Bart M. P. Jansen, Michael R. Fellows","submitted_at":"2013-05-14T10:43:00Z","abstract_excerpt":"Many graph problems were first shown to be fixed-parameter tractable using the results of Robertson and Seymour on graph minors. We show that the combination of finite, computable, obstruction sets and efficient order tests is not just one way of obtaining strongly uniform FPT algorithms, but that all of FPT may be captured in this way. Our new characterization of FPT has a strong connection to the theory of kernelization, as we prove that problems with polynomial kernels can be characterized by obstruction sets whose elements have polynomial size. Consequently we investigate the interplay bet"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1305.3102","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-05-14T10:43:00Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"92f51e973831d8d68e1c5807561a0b365680eb02a61ab1f5fd0a01af368f6724","abstract_canon_sha256":"c3bd4b042e32daf138d6a093e6fd9110937bc3b55b85e2869678d548c4cba9f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:44.847797Z","signature_b64":"JbE9qOyHPq/bXXRImZNwmF207p5kA/C9Xt0m3aShIrKRZ5aQzauwci7PWkb9jHu0gigp0+v1sukl2WKsPA+KBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9efffa4c35598f42d2be8bad8ce99e38cbf2f9fbfd8036a98660b3ee7ede7fc7","last_reissued_at":"2026-05-18T03:25:44.847028Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:44.847028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FPT is Characterized by Useful Obstruction Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Bart M. P. Jansen, Michael R. Fellows","submitted_at":"2013-05-14T10:43:00Z","abstract_excerpt":"Many graph problems were first shown to be fixed-parameter tractable using the results of Robertson and Seymour on graph minors. We show that the combination of finite, computable, obstruction sets and efficient order tests is not just one way of obtaining strongly uniform FPT algorithms, but that all of FPT may be captured in this way. Our new characterization of FPT has a strong connection to the theory of kernelization, as we prove that problems with polynomial kernels can be characterized by obstruction sets whose elements have polynomial size. Consequently we investigate the interplay bet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3102","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1305.3102","created_at":"2026-05-18T03:25:44.847161+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.3102v1","created_at":"2026-05-18T03:25:44.847161+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3102","created_at":"2026-05-18T03:25:44.847161+00:00"},{"alias_kind":"pith_short_12","alias_value":"T377UTBVLGHU","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"T377UTBVLGHUFUV6","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"T377UTBV","created_at":"2026-05-18T12:27:59.945178+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T377UTBVLGHUFUV6ROWYZ2M6HD","json":"https://pith.science/pith/T377UTBVLGHUFUV6ROWYZ2M6HD.json","graph_json":"https://pith.science/api/pith-number/T377UTBVLGHUFUV6ROWYZ2M6HD/graph.json","events_json":"https://pith.science/api/pith-number/T377UTBVLGHUFUV6ROWYZ2M6HD/events.json","paper":"https://pith.science/paper/T377UTBV"},"agent_actions":{"view_html":"https://pith.science/pith/T377UTBVLGHUFUV6ROWYZ2M6HD","download_json":"https://pith.science/pith/T377UTBVLGHUFUV6ROWYZ2M6HD.json","view_paper":"https://pith.science/paper/T377UTBV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.3102&json=true","fetch_graph":"https://pith.science/api/pith-number/T377UTBVLGHUFUV6ROWYZ2M6HD/graph.json","fetch_events":"https://pith.science/api/pith-number/T377UTBVLGHUFUV6ROWYZ2M6HD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T377UTBVLGHUFUV6ROWYZ2M6HD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T377UTBVLGHUFUV6ROWYZ2M6HD/action/storage_attestation","attest_author":"https://pith.science/pith/T377UTBVLGHUFUV6ROWYZ2M6HD/action/author_attestation","sign_citation":"https://pith.science/pith/T377UTBVLGHUFUV6ROWYZ2M6HD/action/citation_signature","submit_replication":"https://pith.science/pith/T377UTBVLGHUFUV6ROWYZ2M6HD/action/replication_record"}},"created_at":"2026-05-18T03:25:44.847161+00:00","updated_at":"2026-05-18T03:25:44.847161+00:00"}