{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MNVE727KRAAAJFXUIZUD4M6HMB","short_pith_number":"pith:MNVE727K","schema_version":"1.0","canonical_sha256":"636a4febea88000496f446683e33c7607e5838df1c0de8c7681a8d39f3fbfbdb","source":{"kind":"arxiv","id":"1404.0818","version":2},"attestation_state":"computed","paper":{"title":"Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Marcin Pilipczuk, Micha{\\l} Pilipczuk, Saket Saurabh","submitted_at":"2014-04-03T09:49:54Z","abstract_excerpt":"We give a fixed-parameter tractable algorithm that, given a parameter $k$ and two graphs $G_1,G_2$, either concludes that one of these graphs has treewidth at least $k$, or determines whether $G_1$ and $G_2$ are isomorphic. The running time of the algorithm on an $n$-vertex graph is $2^{O(k^5\\log k)}\\cdot n^5$, and this is the first fixed-parameter algorithm for Graph Isomorphism parameterized by treewidth.\n  Our algorithm in fact solves the more general canonization problem. We namely design a procedure working in $2^{O(k^5\\log k)}\\cdot n^5$ time that, for a given graph $G$ on $n$ vertices, e"},"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":"1404.0818","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-03T09:49:54Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"6c0fea61f7f815931e7cff48e5b624a6f0a665a9ee9d62f03a0fd3c4e09dd998","abstract_canon_sha256":"ceac64199e680bac3f16b7e856c162f1bf8f10508076d8a9a849f7537dc60502"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:38.217227Z","signature_b64":"A7/Lp/PpT1kSj23Dy0oOc5+npzpGrpJkU2BprbCiIATnyL7spQygEpee3Jxk7hCCjzFmxz1DRivmojYZvi2gBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"636a4febea88000496f446683e33c7607e5838df1c0de8c7681a8d39f3fbfbdb","last_reissued_at":"2026-05-18T02:31:38.216715Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:38.216715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Marcin Pilipczuk, Micha{\\l} Pilipczuk, Saket Saurabh","submitted_at":"2014-04-03T09:49:54Z","abstract_excerpt":"We give a fixed-parameter tractable algorithm that, given a parameter $k$ and two graphs $G_1,G_2$, either concludes that one of these graphs has treewidth at least $k$, or determines whether $G_1$ and $G_2$ are isomorphic. The running time of the algorithm on an $n$-vertex graph is $2^{O(k^5\\log k)}\\cdot n^5$, and this is the first fixed-parameter algorithm for Graph Isomorphism parameterized by treewidth.\n  Our algorithm in fact solves the more general canonization problem. We namely design a procedure working in $2^{O(k^5\\log k)}\\cdot n^5$ time that, for a given graph $G$ on $n$ vertices, e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0818","kind":"arxiv","version":2},"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":"1404.0818","created_at":"2026-05-18T02:31:38.216782+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.0818v2","created_at":"2026-05-18T02:31:38.216782+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0818","created_at":"2026-05-18T02:31:38.216782+00:00"},{"alias_kind":"pith_short_12","alias_value":"MNVE727KRAAA","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MNVE727KRAAAJFXU","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MNVE727K","created_at":"2026-05-18T12:28:38.356838+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/MNVE727KRAAAJFXUIZUD4M6HMB","json":"https://pith.science/pith/MNVE727KRAAAJFXUIZUD4M6HMB.json","graph_json":"https://pith.science/api/pith-number/MNVE727KRAAAJFXUIZUD4M6HMB/graph.json","events_json":"https://pith.science/api/pith-number/MNVE727KRAAAJFXUIZUD4M6HMB/events.json","paper":"https://pith.science/paper/MNVE727K"},"agent_actions":{"view_html":"https://pith.science/pith/MNVE727KRAAAJFXUIZUD4M6HMB","download_json":"https://pith.science/pith/MNVE727KRAAAJFXUIZUD4M6HMB.json","view_paper":"https://pith.science/paper/MNVE727K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.0818&json=true","fetch_graph":"https://pith.science/api/pith-number/MNVE727KRAAAJFXUIZUD4M6HMB/graph.json","fetch_events":"https://pith.science/api/pith-number/MNVE727KRAAAJFXUIZUD4M6HMB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MNVE727KRAAAJFXUIZUD4M6HMB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MNVE727KRAAAJFXUIZUD4M6HMB/action/storage_attestation","attest_author":"https://pith.science/pith/MNVE727KRAAAJFXUIZUD4M6HMB/action/author_attestation","sign_citation":"https://pith.science/pith/MNVE727KRAAAJFXUIZUD4M6HMB/action/citation_signature","submit_replication":"https://pith.science/pith/MNVE727KRAAAJFXUIZUD4M6HMB/action/replication_record"}},"created_at":"2026-05-18T02:31:38.216782+00:00","updated_at":"2026-05-18T02:31:38.216782+00:00"}