{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GQS3CLJQAOBD5DZSPWJSGL5BNL","short_pith_number":"pith:GQS3CLJQ","schema_version":"1.0","canonical_sha256":"3425b12d3003823e8f327d93232fa16ac4f2f9881f3aa71481ffb542221085a3","source":{"kind":"arxiv","id":"1707.01797","version":1},"attestation_state":"computed","paper":{"title":"Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Bart M. P. Jansen, Marcin Pilipczuk, Marcin Wrochna","submitted_at":"2017-07-06T14:00:17Z","abstract_excerpt":"The notion of Turing kernelization investigates whether a polynomial-time algorithm can solve an NP-hard problem, when it is aided by an oracle that can be queried for the answers to bounded-size subproblems. One of the main open problems in this direction is whether k-Path admits a polynomial Turing kernel: can a polynomial-time algorithm determine whether an undirected graph has a simple path of length k, using an oracle that answers queries of size poly(k)?\n  We show this can be done when the input graph avoids a fixed graph H as a topological minor, thereby significantly generalizing an ea"},"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":"1707.01797","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-06T14:00:17Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"9f0b0669c66aa66686a5617bd282b2a7aff20b7554a9c223ddcaa3c4a5c2a1fd","abstract_canon_sha256":"dce06c97446464e4631afbe554de87c38aa006870ca59d45d33a4e40bd507653"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:47.412837Z","signature_b64":"vtJLGsbZfKwwQ8n9NP8kI2Dgi82hjwcNSxKvsDuDP1a/mALYakm0CkpETxcmkmbFzVKCd+p4gaV4viQgwcO/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3425b12d3003823e8f327d93232fa16ac4f2f9881f3aa71481ffb542221085a3","last_reissued_at":"2026-05-18T00:40:47.412174Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:47.412174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Bart M. P. Jansen, Marcin Pilipczuk, Marcin Wrochna","submitted_at":"2017-07-06T14:00:17Z","abstract_excerpt":"The notion of Turing kernelization investigates whether a polynomial-time algorithm can solve an NP-hard problem, when it is aided by an oracle that can be queried for the answers to bounded-size subproblems. One of the main open problems in this direction is whether k-Path admits a polynomial Turing kernel: can a polynomial-time algorithm determine whether an undirected graph has a simple path of length k, using an oracle that answers queries of size poly(k)?\n  We show this can be done when the input graph avoids a fixed graph H as a topological minor, thereby significantly generalizing an ea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01797","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":"1707.01797","created_at":"2026-05-18T00:40:47.412257+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.01797v1","created_at":"2026-05-18T00:40:47.412257+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01797","created_at":"2026-05-18T00:40:47.412257+00:00"},{"alias_kind":"pith_short_12","alias_value":"GQS3CLJQAOBD","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"GQS3CLJQAOBD5DZS","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"GQS3CLJQ","created_at":"2026-05-18T12:31:18.294218+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/GQS3CLJQAOBD5DZSPWJSGL5BNL","json":"https://pith.science/pith/GQS3CLJQAOBD5DZSPWJSGL5BNL.json","graph_json":"https://pith.science/api/pith-number/GQS3CLJQAOBD5DZSPWJSGL5BNL/graph.json","events_json":"https://pith.science/api/pith-number/GQS3CLJQAOBD5DZSPWJSGL5BNL/events.json","paper":"https://pith.science/paper/GQS3CLJQ"},"agent_actions":{"view_html":"https://pith.science/pith/GQS3CLJQAOBD5DZSPWJSGL5BNL","download_json":"https://pith.science/pith/GQS3CLJQAOBD5DZSPWJSGL5BNL.json","view_paper":"https://pith.science/paper/GQS3CLJQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.01797&json=true","fetch_graph":"https://pith.science/api/pith-number/GQS3CLJQAOBD5DZSPWJSGL5BNL/graph.json","fetch_events":"https://pith.science/api/pith-number/GQS3CLJQAOBD5DZSPWJSGL5BNL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GQS3CLJQAOBD5DZSPWJSGL5BNL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GQS3CLJQAOBD5DZSPWJSGL5BNL/action/storage_attestation","attest_author":"https://pith.science/pith/GQS3CLJQAOBD5DZSPWJSGL5BNL/action/author_attestation","sign_citation":"https://pith.science/pith/GQS3CLJQAOBD5DZSPWJSGL5BNL/action/citation_signature","submit_replication":"https://pith.science/pith/GQS3CLJQAOBD5DZSPWJSGL5BNL/action/replication_record"}},"created_at":"2026-05-18T00:40:47.412257+00:00","updated_at":"2026-05-18T00:40:47.412257+00:00"}