{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EVMMRDTSF742NKSDL4YVWVP2VV","short_pith_number":"pith:EVMMRDTS","schema_version":"1.0","canonical_sha256":"2558c88e722ff9a6aa435f315b55faad6846444370984b54ba49f40188c8af75","source":{"kind":"arxiv","id":"1702.06095","version":3},"attestation_state":"computed","paper":{"title":"An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Benjamin Bergougnoux, Mamadou Moustapha Kant\\'e, O-joung Kwon","submitted_at":"2017-02-20T18:33:11Z","abstract_excerpt":"In this paper, we prove that, given a clique-width $k$-expression of an $n$-vertex graph, \\textsc{Hamiltonian Cycle} can be solved in time $n^{\\mathcal{O}(k)}$. This improves the naive algorithm that runs in time $n^{\\mathcal{O}(k^2)}$ by Espelage et al. (WG 2001), and it also matches with the lower bound result by Fomin et al. that, unless the Exponential Time Hypothesis fails, there is no algorithm running in time $n^{o(k)}$ (SIAM. J. Computing 2014).\n  We present a technique of representative sets using two-edge colored multigraphs on $k$ vertices. The essential idea is that, for a two-edge"},"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":"1702.06095","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-20T18:33:11Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"89f06ff851c3e3cebb93d14c28ae71a7522c972a538f833090482e81bc551ac4","abstract_canon_sha256":"c685d645a74e157cd75a9f10f4ce148cdb541cf86e57c183a650cc9e0e3b9ca0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:54.273809Z","signature_b64":"kIFgnbN7Ot3rPRBwxzOS29OxFWoMSan0/olF1Fdud7o3mejo006/yVIgbHpBAPoHbWHDEeR10av9gEvvvtFeAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2558c88e722ff9a6aa435f315b55faad6846444370984b54ba49f40188c8af75","last_reissued_at":"2026-05-17T23:43:54.273157Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:54.273157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Benjamin Bergougnoux, Mamadou Moustapha Kant\\'e, O-joung Kwon","submitted_at":"2017-02-20T18:33:11Z","abstract_excerpt":"In this paper, we prove that, given a clique-width $k$-expression of an $n$-vertex graph, \\textsc{Hamiltonian Cycle} can be solved in time $n^{\\mathcal{O}(k)}$. This improves the naive algorithm that runs in time $n^{\\mathcal{O}(k^2)}$ by Espelage et al. (WG 2001), and it also matches with the lower bound result by Fomin et al. that, unless the Exponential Time Hypothesis fails, there is no algorithm running in time $n^{o(k)}$ (SIAM. J. Computing 2014).\n  We present a technique of representative sets using two-edge colored multigraphs on $k$ vertices. The essential idea is that, for a two-edge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06095","kind":"arxiv","version":3},"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":"1702.06095","created_at":"2026-05-17T23:43:54.273275+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.06095v3","created_at":"2026-05-17T23:43:54.273275+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06095","created_at":"2026-05-17T23:43:54.273275+00:00"},{"alias_kind":"pith_short_12","alias_value":"EVMMRDTSF742","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EVMMRDTSF742NKSD","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EVMMRDTS","created_at":"2026-05-18T12:31:12.930513+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/EVMMRDTSF742NKSDL4YVWVP2VV","json":"https://pith.science/pith/EVMMRDTSF742NKSDL4YVWVP2VV.json","graph_json":"https://pith.science/api/pith-number/EVMMRDTSF742NKSDL4YVWVP2VV/graph.json","events_json":"https://pith.science/api/pith-number/EVMMRDTSF742NKSDL4YVWVP2VV/events.json","paper":"https://pith.science/paper/EVMMRDTS"},"agent_actions":{"view_html":"https://pith.science/pith/EVMMRDTSF742NKSDL4YVWVP2VV","download_json":"https://pith.science/pith/EVMMRDTSF742NKSDL4YVWVP2VV.json","view_paper":"https://pith.science/paper/EVMMRDTS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.06095&json=true","fetch_graph":"https://pith.science/api/pith-number/EVMMRDTSF742NKSDL4YVWVP2VV/graph.json","fetch_events":"https://pith.science/api/pith-number/EVMMRDTSF742NKSDL4YVWVP2VV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EVMMRDTSF742NKSDL4YVWVP2VV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EVMMRDTSF742NKSDL4YVWVP2VV/action/storage_attestation","attest_author":"https://pith.science/pith/EVMMRDTSF742NKSDL4YVWVP2VV/action/author_attestation","sign_citation":"https://pith.science/pith/EVMMRDTSF742NKSDL4YVWVP2VV/action/citation_signature","submit_replication":"https://pith.science/pith/EVMMRDTSF742NKSDL4YVWVP2VV/action/replication_record"}},"created_at":"2026-05-17T23:43:54.273275+00:00","updated_at":"2026-05-17T23:43:54.273275+00:00"}