{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:MNVE727KRAAAJFXUIZUD4M6HMB","short_pith_number":"pith:MNVE727K","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"},"canonical_sha256":"636a4febea88000496f446683e33c7607e5838df1c0de8c7681a8d39f3fbfbdb","source":{"kind":"arxiv","id":"1404.0818","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.0818","created_at":"2026-05-18T02:31:38Z"},{"alias_kind":"arxiv_version","alias_value":"1404.0818v2","created_at":"2026-05-18T02:31:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0818","created_at":"2026-05-18T02:31:38Z"},{"alias_kind":"pith_short_12","alias_value":"MNVE727KRAAA","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MNVE727KRAAAJFXU","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MNVE727K","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:MNVE727KRAAAJFXUIZUD4M6HMB","target":"record","payload":{"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"},"canonical_sha256":"636a4febea88000496f446683e33c7607e5838df1c0de8c7681a8d39f3fbfbdb","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"},"source_kind":"arxiv","source_id":"1404.0818","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:31:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pPuW+KQJKEdNC34iXGzbU2OwgQw3LqY8DKa/HXG79rSLC2r5Kqkt5tqNVQje4NFMwdQgf0qsk0gnrR9ZIn+dAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:37:32.119410Z"},"content_sha256":"0165a91908fd15afdafe8c531446f0329f5e335de86154b912683b8b7047aa2b","schema_version":"1.0","event_id":"sha256:0165a91908fd15afdafe8c531446f0329f5e335de86154b912683b8b7047aa2b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:MNVE727KRAAAJFXUIZUD4M6HMB","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:31:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0NK2VbPpXwOY8ll82NjQn1gn5iXCdVA51B8wZBz+yMCC+FXa1OF730hhrO3qyB1IGehkPtu6NVM+/9UhjfipBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:37:32.120189Z"},"content_sha256":"d81f4c2f7310bb7d2e71df4798b5d429827a6407db3a2e1b2973ad8c9a176799","schema_version":"1.0","event_id":"sha256:d81f4c2f7310bb7d2e71df4798b5d429827a6407db3a2e1b2973ad8c9a176799"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MNVE727KRAAAJFXUIZUD4M6HMB/bundle.json","state_url":"https://pith.science/pith/MNVE727KRAAAJFXUIZUD4M6HMB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MNVE727KRAAAJFXUIZUD4M6HMB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T02:37:32Z","links":{"resolver":"https://pith.science/pith/MNVE727KRAAAJFXUIZUD4M6HMB","bundle":"https://pith.science/pith/MNVE727KRAAAJFXUIZUD4M6HMB/bundle.json","state":"https://pith.science/pith/MNVE727KRAAAJFXUIZUD4M6HMB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MNVE727KRAAAJFXUIZUD4M6HMB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:MNVE727KRAAAJFXUIZUD4M6HMB","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":"ceac64199e680bac3f16b7e856c162f1bf8f10508076d8a9a849f7537dc60502","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-03T09:49:54Z","title_canon_sha256":"6c0fea61f7f815931e7cff48e5b624a6f0a665a9ee9d62f03a0fd3c4e09dd998"},"schema_version":"1.0","source":{"id":"1404.0818","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.0818","created_at":"2026-05-18T02:31:38Z"},{"alias_kind":"arxiv_version","alias_value":"1404.0818v2","created_at":"2026-05-18T02:31:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0818","created_at":"2026-05-18T02:31:38Z"},{"alias_kind":"pith_short_12","alias_value":"MNVE727KRAAA","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MNVE727KRAAAJFXU","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MNVE727K","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:d81f4c2f7310bb7d2e71df4798b5d429827a6407db3a2e1b2973ad8c9a176799","target":"graph","created_at":"2026-05-18T02:31:38Z","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":"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","authors_text":"Daniel Lokshtanov, Marcin Pilipczuk, Micha{\\l} Pilipczuk, Saket Saurabh","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-03T09:49:54Z","title":"Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0818","kind":"arxiv","version":2},"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:0165a91908fd15afdafe8c531446f0329f5e335de86154b912683b8b7047aa2b","target":"record","created_at":"2026-05-18T02:31:38Z","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":"ceac64199e680bac3f16b7e856c162f1bf8f10508076d8a9a849f7537dc60502","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-03T09:49:54Z","title_canon_sha256":"6c0fea61f7f815931e7cff48e5b624a6f0a665a9ee9d62f03a0fd3c4e09dd998"},"schema_version":"1.0","source":{"id":"1404.0818","kind":"arxiv","version":2}},"canonical_sha256":"636a4febea88000496f446683e33c7607e5838df1c0de8c7681a8d39f3fbfbdb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"636a4febea88000496f446683e33c7607e5838df1c0de8c7681a8d39f3fbfbdb","first_computed_at":"2026-05-18T02:31:38.216715Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:38.216715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A7/Lp/PpT1kSj23Dy0oOc5+npzpGrpJkU2BprbCiIATnyL7spQygEpee3Jxk7hCCjzFmxz1DRivmojYZvi2gBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:38.217227Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.0818","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0165a91908fd15afdafe8c531446f0329f5e335de86154b912683b8b7047aa2b","sha256:d81f4c2f7310bb7d2e71df4798b5d429827a6407db3a2e1b2973ad8c9a176799"],"state_sha256":"32352cf5407ce7b3857dd61e2df9595a53d35fe0b90501d1fb751ecb1f6d6b6f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sJVF0Qd5LSslndM8PDCI/Ucra4gV1H0FLW+N0vYR88z41WoXkOnSYPszwXEzYLbAE8MmikwT3hdeVKaq2WawDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T02:37:32.123961Z","bundle_sha256":"0aa056ee2146f7fbc6c4ac62c1848eafbfcc5c9628d16c130b663fb15be23153"}}