{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4IUYDU5E7MGFPKGNWGYJV6LIQZ","short_pith_number":"pith:4IUYDU5E","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"},"canonical_sha256":"e22981d3a4fb0c57a8cdb1b09af96886595388b509abdedeeb326046903d100c","source":{"kind":"arxiv","id":"1803.06858","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06858","created_at":"2026-05-18T00:20:41Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06858v1","created_at":"2026-05-18T00:20:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06858","created_at":"2026-05-18T00:20:41Z"},{"alias_kind":"pith_short_12","alias_value":"4IUYDU5E7MGF","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4IUYDU5E7MGFPKGN","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4IUYDU5E","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4IUYDU5E7MGFPKGNWGYJV6LIQZ","target":"record","payload":{"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"},"canonical_sha256":"e22981d3a4fb0c57a8cdb1b09af96886595388b509abdedeeb326046903d100c","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"},"source_kind":"arxiv","source_id":"1803.06858","source_version":1,"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-18T00:20:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tBA9lukP8PK2I9hrDeLuhgXQ7Q7pVol5J7pb9Lh/JSPepztu7T2aR7tZ/VDe9SJimBRdmeYigX8Y1Ng+1FTiAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:06:39.440858Z"},"content_sha256":"4f93aea4a3fa0e341196342fc415eb211745cfa24371ed06deec34fe047377d1","schema_version":"1.0","event_id":"sha256:4f93aea4a3fa0e341196342fc415eb211745cfa24371ed06deec34fe047377d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4IUYDU5E7MGFPKGNWGYJV6LIQZ","target":"graph","payload":{"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"},"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-18T00:20:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TstIK0q0UCU4TYutF1NozjkJlCgYiiV6jvtoLqC8ApPaDS09GQT56zRAGjNUl3Hg0Uff2pvvrUcwxgV/Vt+DCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:06:39.441206Z"},"content_sha256":"4b7884486354695973a47b1f72c3b5e53f64c38690240db878d7f2a574a7e319","schema_version":"1.0","event_id":"sha256:4b7884486354695973a47b1f72c3b5e53f64c38690240db878d7f2a574a7e319"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4IUYDU5E7MGFPKGNWGYJV6LIQZ/bundle.json","state_url":"https://pith.science/pith/4IUYDU5E7MGFPKGNWGYJV6LIQZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4IUYDU5E7MGFPKGNWGYJV6LIQZ/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-01T10:06:39Z","links":{"resolver":"https://pith.science/pith/4IUYDU5E7MGFPKGNWGYJV6LIQZ","bundle":"https://pith.science/pith/4IUYDU5E7MGFPKGNWGYJV6LIQZ/bundle.json","state":"https://pith.science/pith/4IUYDU5E7MGFPKGNWGYJV6LIQZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4IUYDU5E7MGFPKGNWGYJV6LIQZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4IUYDU5E7MGFPKGNWGYJV6LIQZ","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":"0c1c17069ea5ef8f52b70564c9f53809065fddd984e3bd772839099d09e27379","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-19T10:28:48Z","title_canon_sha256":"0c730aceb88000c35431c9e261421a4e9a79245516ab8d15d25dd18ca49e3471"},"schema_version":"1.0","source":{"id":"1803.06858","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06858","created_at":"2026-05-18T00:20:41Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06858v1","created_at":"2026-05-18T00:20:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06858","created_at":"2026-05-18T00:20:41Z"},{"alias_kind":"pith_short_12","alias_value":"4IUYDU5E7MGF","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4IUYDU5E7MGFPKGN","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4IUYDU5E","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:4b7884486354695973a47b1f72c3b5e53f64c38690240db878d7f2a574a7e319","target":"graph","created_at":"2026-05-18T00:20:41Z","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 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","authors_text":"Daniel Neuen, Daniel Wiebking, Martin Grohe, Pascal Schweitzer","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-19T10:28:48Z","title":"An improved isomorphism test for bounded-tree-width graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06858","kind":"arxiv","version":1},"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:4f93aea4a3fa0e341196342fc415eb211745cfa24371ed06deec34fe047377d1","target":"record","created_at":"2026-05-18T00:20:41Z","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":"0c1c17069ea5ef8f52b70564c9f53809065fddd984e3bd772839099d09e27379","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-19T10:28:48Z","title_canon_sha256":"0c730aceb88000c35431c9e261421a4e9a79245516ab8d15d25dd18ca49e3471"},"schema_version":"1.0","source":{"id":"1803.06858","kind":"arxiv","version":1}},"canonical_sha256":"e22981d3a4fb0c57a8cdb1b09af96886595388b509abdedeeb326046903d100c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e22981d3a4fb0c57a8cdb1b09af96886595388b509abdedeeb326046903d100c","first_computed_at":"2026-05-18T00:20:41.129217Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:41.129217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"olU9KpO4D9VDWjudKQufa3ESaP1PjAMqEMoxNUeVl0u4T4W5RJAl94csGZVFJxdj4jVk7pN+1ImI2EpS63SWBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:41.129899Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.06858","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f93aea4a3fa0e341196342fc415eb211745cfa24371ed06deec34fe047377d1","sha256:4b7884486354695973a47b1f72c3b5e53f64c38690240db878d7f2a574a7e319"],"state_sha256":"d21dd0adb1c9a0962e607d70f2919ca64f089cb382a9e246e56c2869981394bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xM8/ULE+Xd6tmUwtOUBxbCdBMj1ufT970nJXXyMTlYTYAl+vJQy3nSvuH2b4yB+QKcEV1akwN0AF7pYzCH6uCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:06:39.443214Z","bundle_sha256":"6c0e2f04aee17afa32e64517c16dede14d487088f2df8741cf5a081059526cda"}}