{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GQS3CLJQAOBD5DZSPWJSGL5BNL","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":"dce06c97446464e4631afbe554de87c38aa006870ca59d45d33a4e40bd507653","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-06T14:00:17Z","title_canon_sha256":"9f0b0669c66aa66686a5617bd282b2a7aff20b7554a9c223ddcaa3c4a5c2a1fd"},"schema_version":"1.0","source":{"id":"1707.01797","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01797","created_at":"2026-05-18T00:40:47Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01797v1","created_at":"2026-05-18T00:40:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01797","created_at":"2026-05-18T00:40:47Z"},{"alias_kind":"pith_short_12","alias_value":"GQS3CLJQAOBD","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GQS3CLJQAOBD5DZS","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GQS3CLJQ","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:c46fb43ebd4c55781f47b846d95e5328b7fea568b3b4a3fb8690945b2eaf7f94","target":"graph","created_at":"2026-05-18T00:40:47Z","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":"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","authors_text":"Bart M. P. Jansen, Marcin Pilipczuk, Marcin Wrochna","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-06T14:00:17Z","title":"Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01797","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:45e459b78112f9a35d3f8448356093104a01c5e53fd85d78c28f87486218acab","target":"record","created_at":"2026-05-18T00:40:47Z","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":"dce06c97446464e4631afbe554de87c38aa006870ca59d45d33a4e40bd507653","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-06T14:00:17Z","title_canon_sha256":"9f0b0669c66aa66686a5617bd282b2a7aff20b7554a9c223ddcaa3c4a5c2a1fd"},"schema_version":"1.0","source":{"id":"1707.01797","kind":"arxiv","version":1}},"canonical_sha256":"3425b12d3003823e8f327d93232fa16ac4f2f9881f3aa71481ffb542221085a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3425b12d3003823e8f327d93232fa16ac4f2f9881f3aa71481ffb542221085a3","first_computed_at":"2026-05-18T00:40:47.412174Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:47.412174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vtJLGsbZfKwwQ8n9NP8kI2Dgi82hjwcNSxKvsDuDP1a/mALYakm0CkpETxcmkmbFzVKCd+p4gaV4viQgwcO/BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:47.412837Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.01797","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45e459b78112f9a35d3f8448356093104a01c5e53fd85d78c28f87486218acab","sha256:c46fb43ebd4c55781f47b846d95e5328b7fea568b3b4a3fb8690945b2eaf7f94"],"state_sha256":"db028526057df62352966d9d58130e6b3bf1f48d9c1e1a97fa38c5fd74e5d76f"}