{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:PEYDOEYXRMS4ECBPFBI65UQXFA","short_pith_number":"pith:PEYDOEYX","schema_version":"1.0","canonical_sha256":"79303713178b25c2082f2851eed2172809b90b4b5f4d23975ca80b33709386a0","source":{"kind":"arxiv","id":"1403.2041","version":1},"attestation_state":"computed","paper":{"title":"Parameterized Edge Hamiltonicity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kazuhisa Makino, Michael Lampis, Valia Mitsou, Yushi Uno","submitted_at":"2014-03-09T09:53:39Z","abstract_excerpt":"We study the parameterized complexity of the classical Edge Hamiltonian Path problem and give several fixed-parameter tractability results. First, we settle an open question of Demaine et al. by showing that Edge Hamiltonian Path is FPT parameterized by vertex cover, and that it also admits a cubic kernel. We then show fixed-parameter tractability even for a generalization of the problem to arbitrary hypergraphs, parameterized by the size of a (supplied) hitting set. We also consider the problem parameterized by treewidth or clique-width. Surprisingly, we show that the problem is FPT for both "},"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":"1403.2041","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-09T09:53:39Z","cross_cats_sorted":[],"title_canon_sha256":"5ab31f716853e02c72b858c80f1064a6cd847c27bc99c293ba03729d599dd0db","abstract_canon_sha256":"5473ceadb1eb5a3e3a3f947dcc6341d02d682ecba6d17da11aaa170d750e6154"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:51.001749Z","signature_b64":"fL6jZCz/hclr/DGMWGyAbSTXEiBnht6Zy1TVzvXf+AQPuj7dDykB4MLj5pf4seroR3XqDsfBeXisQ0tOp587AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79303713178b25c2082f2851eed2172809b90b4b5f4d23975ca80b33709386a0","last_reissued_at":"2026-05-18T02:56:51.001299Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:51.001299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Edge Hamiltonicity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kazuhisa Makino, Michael Lampis, Valia Mitsou, Yushi Uno","submitted_at":"2014-03-09T09:53:39Z","abstract_excerpt":"We study the parameterized complexity of the classical Edge Hamiltonian Path problem and give several fixed-parameter tractability results. First, we settle an open question of Demaine et al. by showing that Edge Hamiltonian Path is FPT parameterized by vertex cover, and that it also admits a cubic kernel. We then show fixed-parameter tractability even for a generalization of the problem to arbitrary hypergraphs, parameterized by the size of a (supplied) hitting set. We also consider the problem parameterized by treewidth or clique-width. Surprisingly, we show that the problem is FPT for both "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.2041","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":"1403.2041","created_at":"2026-05-18T02:56:51.001378+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.2041v1","created_at":"2026-05-18T02:56:51.001378+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.2041","created_at":"2026-05-18T02:56:51.001378+00:00"},{"alias_kind":"pith_short_12","alias_value":"PEYDOEYXRMS4","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PEYDOEYXRMS4ECBP","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PEYDOEYX","created_at":"2026-05-18T12:28:43.426989+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/PEYDOEYXRMS4ECBPFBI65UQXFA","json":"https://pith.science/pith/PEYDOEYXRMS4ECBPFBI65UQXFA.json","graph_json":"https://pith.science/api/pith-number/PEYDOEYXRMS4ECBPFBI65UQXFA/graph.json","events_json":"https://pith.science/api/pith-number/PEYDOEYXRMS4ECBPFBI65UQXFA/events.json","paper":"https://pith.science/paper/PEYDOEYX"},"agent_actions":{"view_html":"https://pith.science/pith/PEYDOEYXRMS4ECBPFBI65UQXFA","download_json":"https://pith.science/pith/PEYDOEYXRMS4ECBPFBI65UQXFA.json","view_paper":"https://pith.science/paper/PEYDOEYX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.2041&json=true","fetch_graph":"https://pith.science/api/pith-number/PEYDOEYXRMS4ECBPFBI65UQXFA/graph.json","fetch_events":"https://pith.science/api/pith-number/PEYDOEYXRMS4ECBPFBI65UQXFA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PEYDOEYXRMS4ECBPFBI65UQXFA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PEYDOEYXRMS4ECBPFBI65UQXFA/action/storage_attestation","attest_author":"https://pith.science/pith/PEYDOEYXRMS4ECBPFBI65UQXFA/action/author_attestation","sign_citation":"https://pith.science/pith/PEYDOEYXRMS4ECBPFBI65UQXFA/action/citation_signature","submit_replication":"https://pith.science/pith/PEYDOEYXRMS4ECBPFBI65UQXFA/action/replication_record"}},"created_at":"2026-05-18T02:56:51.001378+00:00","updated_at":"2026-05-18T02:56:51.001378+00:00"}