{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4IUYDU5E7MGFPKGNWGYJV6LIQZ","short_pith_number":"pith:4IUYDU5E","schema_version":"1.0","canonical_sha256":"e22981d3a4fb0c57a8cdb1b09af96886595388b509abdedeeb326046903d100c","source":{"kind":"arxiv","id":"1803.06858","version":1},"attestation_state":"computed","paper":{"title":"An improved isomorphism test for bounded-tree-width graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Daniel Neuen, Daniel Wiebking, Martin Grohe, Pascal Schweitzer","submitted_at":"2018-03-19T10:28:48Z","abstract_excerpt":"We give a new fpt algorithm testing isomorphism of $n$-vertex graphs of tree width $k$ in time $2^{k\\operatorname{polylog} (k)}\\operatorname{poly} (n)$, improving the fpt algorithm due to Lokshtanov, Pilipczuk, Pilipczuk, and Saurabh (FOCS 2014), which runs in time $2^{\\mathcal{O}(k^5\\log k)}\\operatorname{poly} (n)$. Based on an improved version of the isomorphism-invariant graph decomposition technique introduced by Lokshtanov et al., we prove restrictions on the structure of the automorphism groups of graphs of tree width $k$. Our algorithm then makes heavy use of the group theoretic techniq"},"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":"1803.06858","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-19T10:28:48Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"0c730aceb88000c35431c9e261421a4e9a79245516ab8d15d25dd18ca49e3471","abstract_canon_sha256":"0c1c17069ea5ef8f52b70564c9f53809065fddd984e3bd772839099d09e27379"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:41.129899Z","signature_b64":"olU9KpO4D9VDWjudKQufa3ESaP1PjAMqEMoxNUeVl0u4T4W5RJAl94csGZVFJxdj4jVk7pN+1ImI2EpS63SWBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e22981d3a4fb0c57a8cdb1b09af96886595388b509abdedeeb326046903d100c","last_reissued_at":"2026-05-18T00:20:41.129217Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:41.129217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An improved isomorphism test for bounded-tree-width graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Daniel Neuen, Daniel Wiebking, Martin Grohe, Pascal Schweitzer","submitted_at":"2018-03-19T10:28:48Z","abstract_excerpt":"We give a new fpt algorithm testing isomorphism of $n$-vertex graphs of tree width $k$ in time $2^{k\\operatorname{polylog} (k)}\\operatorname{poly} (n)$, improving the fpt algorithm due to Lokshtanov, Pilipczuk, Pilipczuk, and Saurabh (FOCS 2014), which runs in time $2^{\\mathcal{O}(k^5\\log k)}\\operatorname{poly} (n)$. Based on an improved version of the isomorphism-invariant graph decomposition technique introduced by Lokshtanov et al., we prove restrictions on the structure of the automorphism groups of graphs of tree width $k$. Our algorithm then makes heavy use of the group theoretic techniq"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06858","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":"1803.06858","created_at":"2026-05-18T00:20:41.129310+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.06858v1","created_at":"2026-05-18T00:20:41.129310+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06858","created_at":"2026-05-18T00:20:41.129310+00:00"},{"alias_kind":"pith_short_12","alias_value":"4IUYDU5E7MGF","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4IUYDU5E7MGFPKGN","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4IUYDU5E","created_at":"2026-05-18T12:32:05.422762+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/4IUYDU5E7MGFPKGNWGYJV6LIQZ","json":"https://pith.science/pith/4IUYDU5E7MGFPKGNWGYJV6LIQZ.json","graph_json":"https://pith.science/api/pith-number/4IUYDU5E7MGFPKGNWGYJV6LIQZ/graph.json","events_json":"https://pith.science/api/pith-number/4IUYDU5E7MGFPKGNWGYJV6LIQZ/events.json","paper":"https://pith.science/paper/4IUYDU5E"},"agent_actions":{"view_html":"https://pith.science/pith/4IUYDU5E7MGFPKGNWGYJV6LIQZ","download_json":"https://pith.science/pith/4IUYDU5E7MGFPKGNWGYJV6LIQZ.json","view_paper":"https://pith.science/paper/4IUYDU5E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.06858&json=true","fetch_graph":"https://pith.science/api/pith-number/4IUYDU5E7MGFPKGNWGYJV6LIQZ/graph.json","fetch_events":"https://pith.science/api/pith-number/4IUYDU5E7MGFPKGNWGYJV6LIQZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4IUYDU5E7MGFPKGNWGYJV6LIQZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4IUYDU5E7MGFPKGNWGYJV6LIQZ/action/storage_attestation","attest_author":"https://pith.science/pith/4IUYDU5E7MGFPKGNWGYJV6LIQZ/action/author_attestation","sign_citation":"https://pith.science/pith/4IUYDU5E7MGFPKGNWGYJV6LIQZ/action/citation_signature","submit_replication":"https://pith.science/pith/4IUYDU5E7MGFPKGNWGYJV6LIQZ/action/replication_record"}},"created_at":"2026-05-18T00:20:41.129310+00:00","updated_at":"2026-05-18T00:20:41.129310+00:00"}