{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:SECQ2XPT3PHQAAO46LLIXICVC6","short_pith_number":"pith:SECQ2XPT","schema_version":"1.0","canonical_sha256":"91050d5df3dbcf0001dcf2d68ba055179f39c688553c9628beca53ae7337202f","source":{"kind":"arxiv","id":"1402.4718","version":2},"attestation_state":"computed","paper":{"title":"Turing Kernelization for Finding Long Paths and Cycles in Restricted Graph Classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Bart M. P. Jansen","submitted_at":"2014-02-19T16:26:30Z","abstract_excerpt":"The NP-complete $k$-Path problem asks whether a given undirected graph has a (simple) path of length at least $k$. We prove that $k$-Path has polynomial-size Turing kernels when restricted to planar graphs, graphs of bounded degree, claw-free graphs, or to $K_{3,t}$-minor-free graphs for some constant $t$. This means that there is an algorithm that, given a $k$-Path instance $(G,k)$ belonging to one of these graph classes, computes its answer in polynomial time when given access to an oracle that solves $k$-Path instances of size polynomial in $k$ in a single step. The difficulty of $k$-Path c"},"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":"1402.4718","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-19T16:26:30Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"a84bc0849a1b86547a69fa1a308488e0be1244b4e94583f705726b7e261a8dc9","abstract_canon_sha256":"1ec12e354aafae57ae022e811da3850dd421b8b8fa65c8392d6026d67650c5fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:04.791399Z","signature_b64":"3ZWmEbeuanwj87WVKpTARRRrOSUjEiyITXS6pFJTK2/AwBGIjRTGKkpYDgmm34B9mDuqUKeO3BJFozwxOTcGCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91050d5df3dbcf0001dcf2d68ba055179f39c688553c9628beca53ae7337202f","last_reissued_at":"2026-05-18T00:46:04.790927Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:04.790927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Turing Kernelization for Finding Long Paths and Cycles in Restricted Graph Classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Bart M. P. Jansen","submitted_at":"2014-02-19T16:26:30Z","abstract_excerpt":"The NP-complete $k$-Path problem asks whether a given undirected graph has a (simple) path of length at least $k$. We prove that $k$-Path has polynomial-size Turing kernels when restricted to planar graphs, graphs of bounded degree, claw-free graphs, or to $K_{3,t}$-minor-free graphs for some constant $t$. This means that there is an algorithm that, given a $k$-Path instance $(G,k)$ belonging to one of these graph classes, computes its answer in polynomial time when given access to an oracle that solves $k$-Path instances of size polynomial in $k$ in a single step. The difficulty of $k$-Path c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4718","kind":"arxiv","version":2},"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":"1402.4718","created_at":"2026-05-18T00:46:04.791011+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.4718v2","created_at":"2026-05-18T00:46:04.791011+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4718","created_at":"2026-05-18T00:46:04.791011+00:00"},{"alias_kind":"pith_short_12","alias_value":"SECQ2XPT3PHQ","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"SECQ2XPT3PHQAAO4","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"SECQ2XPT","created_at":"2026-05-18T12:28:49.207871+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/SECQ2XPT3PHQAAO46LLIXICVC6","json":"https://pith.science/pith/SECQ2XPT3PHQAAO46LLIXICVC6.json","graph_json":"https://pith.science/api/pith-number/SECQ2XPT3PHQAAO46LLIXICVC6/graph.json","events_json":"https://pith.science/api/pith-number/SECQ2XPT3PHQAAO46LLIXICVC6/events.json","paper":"https://pith.science/paper/SECQ2XPT"},"agent_actions":{"view_html":"https://pith.science/pith/SECQ2XPT3PHQAAO46LLIXICVC6","download_json":"https://pith.science/pith/SECQ2XPT3PHQAAO46LLIXICVC6.json","view_paper":"https://pith.science/paper/SECQ2XPT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.4718&json=true","fetch_graph":"https://pith.science/api/pith-number/SECQ2XPT3PHQAAO46LLIXICVC6/graph.json","fetch_events":"https://pith.science/api/pith-number/SECQ2XPT3PHQAAO46LLIXICVC6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SECQ2XPT3PHQAAO46LLIXICVC6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SECQ2XPT3PHQAAO46LLIXICVC6/action/storage_attestation","attest_author":"https://pith.science/pith/SECQ2XPT3PHQAAO46LLIXICVC6/action/author_attestation","sign_citation":"https://pith.science/pith/SECQ2XPT3PHQAAO46LLIXICVC6/action/citation_signature","submit_replication":"https://pith.science/pith/SECQ2XPT3PHQAAO46LLIXICVC6/action/replication_record"}},"created_at":"2026-05-18T00:46:04.791011+00:00","updated_at":"2026-05-18T00:46:04.791011+00:00"}