{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:R7WNXHMM57N4QECW226LHVM7QR","short_pith_number":"pith:R7WNXHMM","schema_version":"1.0","canonical_sha256":"8fecdb9d8cefdbc81056d6bcb3d59f844bd0ee17c07e1e4b616be948c3f7bc63","source":{"kind":"arxiv","id":"1411.5849","version":1},"attestation_state":"computed","paper":{"title":"Solving Hamiltonian Cycle by an EPT Algorithm for a Non-sparse Parameter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sigve Hortemo S{\\ae}ther","submitted_at":"2014-11-21T12:50:23Z","abstract_excerpt":"Many hard graph problems, such as Hamiltonian Cycle, become FPT when parameterized by treewidth, a parameter that is bounded only on sparse graphs. When parameterized by the more general parameter clique-width, Hamiltonian Cycle becomes W[1]-hard, as shown by Fomin et al. [5]. S{\\ae}ther and Telle address this problem in their paper [13] by introducing a new parameter, split-matching-width, which lies between treewidth and clique-width in terms of generality. They show that even though graphs of restricted split-matching-width might be dense, solving problems such as Hamiltonian Cycle can be d"},"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":"1411.5849","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-21T12:50:23Z","cross_cats_sorted":[],"title_canon_sha256":"b33369f55d5dccaa032e6bb6dcf3bc5d2f05e77e493bd4af72ca5b97f55a9916","abstract_canon_sha256":"3ed4e1119df5ef2b462fb075f29a77abbf743ee2c7a083002b6427901153d325"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:33:02.092353Z","signature_b64":"Gy4u+DghPld9E6e3jXVfC/rz4bC0tnPO+Nw/5lPe+Fo7srUZpEf5zj6EUbONal1H2J1wc+8jYtOMtSQORlAhAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fecdb9d8cefdbc81056d6bcb3d59f844bd0ee17c07e1e4b616be948c3f7bc63","last_reissued_at":"2026-05-18T02:33:02.091788Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:33:02.091788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Hamiltonian Cycle by an EPT Algorithm for a Non-sparse Parameter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sigve Hortemo S{\\ae}ther","submitted_at":"2014-11-21T12:50:23Z","abstract_excerpt":"Many hard graph problems, such as Hamiltonian Cycle, become FPT when parameterized by treewidth, a parameter that is bounded only on sparse graphs. When parameterized by the more general parameter clique-width, Hamiltonian Cycle becomes W[1]-hard, as shown by Fomin et al. [5]. S{\\ae}ther and Telle address this problem in their paper [13] by introducing a new parameter, split-matching-width, which lies between treewidth and clique-width in terms of generality. They show that even though graphs of restricted split-matching-width might be dense, solving problems such as Hamiltonian Cycle can be d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.5849","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":"1411.5849","created_at":"2026-05-18T02:33:02.091859+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.5849v1","created_at":"2026-05-18T02:33:02.091859+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.5849","created_at":"2026-05-18T02:33:02.091859+00:00"},{"alias_kind":"pith_short_12","alias_value":"R7WNXHMM57N4","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"R7WNXHMM57N4QECW","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"R7WNXHMM","created_at":"2026-05-18T12:28:46.137349+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/R7WNXHMM57N4QECW226LHVM7QR","json":"https://pith.science/pith/R7WNXHMM57N4QECW226LHVM7QR.json","graph_json":"https://pith.science/api/pith-number/R7WNXHMM57N4QECW226LHVM7QR/graph.json","events_json":"https://pith.science/api/pith-number/R7WNXHMM57N4QECW226LHVM7QR/events.json","paper":"https://pith.science/paper/R7WNXHMM"},"agent_actions":{"view_html":"https://pith.science/pith/R7WNXHMM57N4QECW226LHVM7QR","download_json":"https://pith.science/pith/R7WNXHMM57N4QECW226LHVM7QR.json","view_paper":"https://pith.science/paper/R7WNXHMM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.5849&json=true","fetch_graph":"https://pith.science/api/pith-number/R7WNXHMM57N4QECW226LHVM7QR/graph.json","fetch_events":"https://pith.science/api/pith-number/R7WNXHMM57N4QECW226LHVM7QR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R7WNXHMM57N4QECW226LHVM7QR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R7WNXHMM57N4QECW226LHVM7QR/action/storage_attestation","attest_author":"https://pith.science/pith/R7WNXHMM57N4QECW226LHVM7QR/action/author_attestation","sign_citation":"https://pith.science/pith/R7WNXHMM57N4QECW226LHVM7QR/action/citation_signature","submit_replication":"https://pith.science/pith/R7WNXHMM57N4QECW226LHVM7QR/action/replication_record"}},"created_at":"2026-05-18T02:33:02.091859+00:00","updated_at":"2026-05-18T02:33:02.091859+00:00"}