{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3TZNHHYSHWCLEAI2TVRCOVJJ3H","short_pith_number":"pith:3TZNHHYS","canonical_record":{"source":{"id":"1304.6321","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-23T15:29:55Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"37f65fcdb6ef86b0d1b93f17a2a27b1a267780985434ab9a383c6099b3300bc2","abstract_canon_sha256":"fbe839185908d5f8c2cf8466574283cc0eca033171328eb568bc7bb97c28265a"},"schema_version":"1.0"},"canonical_sha256":"dcf2d39f123d84b2011a9d62275529d9e6212c79c5c25cb5d22305fc3c48fab3","source":{"kind":"arxiv","id":"1304.6321","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6321","created_at":"2026-05-18T03:27:21Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6321v1","created_at":"2026-05-18T03:27:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6321","created_at":"2026-05-18T03:27:21Z"},{"alias_kind":"pith_short_12","alias_value":"3TZNHHYSHWCL","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3TZNHHYSHWCLEAI2","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3TZNHHYS","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3TZNHHYSHWCLEAI2TVRCOVJJ3H","target":"record","payload":{"canonical_record":{"source":{"id":"1304.6321","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-23T15:29:55Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"37f65fcdb6ef86b0d1b93f17a2a27b1a267780985434ab9a383c6099b3300bc2","abstract_canon_sha256":"fbe839185908d5f8c2cf8466574283cc0eca033171328eb568bc7bb97c28265a"},"schema_version":"1.0"},"canonical_sha256":"dcf2d39f123d84b2011a9d62275529d9e6212c79c5c25cb5d22305fc3c48fab3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:21.829632Z","signature_b64":"umfK9q+cA1BjXJJv+TvLDRcFqPnyx3KM7DOcLIAmTxRUWlVYmgtp1GlCbCT7p8eQxMCUTW9U4M3OI/HS23eRDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcf2d39f123d84b2011a9d62275529d9e6212c79c5c25cb5d22305fc3c48fab3","last_reissued_at":"2026-05-18T03:27:21.829030Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:21.829030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.6321","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-18T03:27:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pkKYcaR9NEHi72q2ETMD4azX4sYnSLHcMSiLSmhYFbH2Sj0NipNgHceLB1wDnR6ZcTBEdYLQFKG2nUdItVKiCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:11:52.988703Z"},"content_sha256":"b40b43a289fc04cc3b3e50eda920e76eeb46b3655bfa793fb8766e78e5a0b44e","schema_version":"1.0","event_id":"sha256:b40b43a289fc04cc3b3e50eda920e76eeb46b3655bfa793fb8766e78e5a0b44e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3TZNHHYSHWCLEAI2TVRCOVJJ3H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A O(c^k n) 5-Approximation Algorithm for Treewidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Fedor V. Fomin, Hans Bodlaender, Markus S. Dregi, Micha{\\l} Pilipczuk, P{\\aa}l G. Drange","submitted_at":"2013-04-23T15:29:55Z","abstract_excerpt":"We give an algorithm that for an input n-vertex graph G and integer k>0, in time 2^[O(k)]n either outputs that the treewidth of G is larger than k, or gives a tree decomposition of G of width at most 5k+4. This is the first algorithm providing a constant factor approximation for treewidth which runs in time single-exponential in k and linear in n. Treewidth based computations are subroutines of numerous algorithms. Our algorithm can be used to speed up many such algorithms to work in time which is single-exponential in the treewidth and linear in the input size."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6321","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-18T03:27:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zhmZGE9/6/8fCqfCRs9p9vL7r+5AeHwSAL/J+E5b6GzwWSy4k2pbb4uVWvc7nDiItPHAA7CORMAbQHIE/g5ACw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:11:52.989240Z"},"content_sha256":"f3fa77e0a5c2f9715a4c76c48d694c44752bf3595fd2aae864b166349010d5bc","schema_version":"1.0","event_id":"sha256:f3fa77e0a5c2f9715a4c76c48d694c44752bf3595fd2aae864b166349010d5bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3TZNHHYSHWCLEAI2TVRCOVJJ3H/bundle.json","state_url":"https://pith.science/pith/3TZNHHYSHWCLEAI2TVRCOVJJ3H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3TZNHHYSHWCLEAI2TVRCOVJJ3H/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-05-27T20:11:52Z","links":{"resolver":"https://pith.science/pith/3TZNHHYSHWCLEAI2TVRCOVJJ3H","bundle":"https://pith.science/pith/3TZNHHYSHWCLEAI2TVRCOVJJ3H/bundle.json","state":"https://pith.science/pith/3TZNHHYSHWCLEAI2TVRCOVJJ3H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3TZNHHYSHWCLEAI2TVRCOVJJ3H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3TZNHHYSHWCLEAI2TVRCOVJJ3H","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":"fbe839185908d5f8c2cf8466574283cc0eca033171328eb568bc7bb97c28265a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-23T15:29:55Z","title_canon_sha256":"37f65fcdb6ef86b0d1b93f17a2a27b1a267780985434ab9a383c6099b3300bc2"},"schema_version":"1.0","source":{"id":"1304.6321","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6321","created_at":"2026-05-18T03:27:21Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6321v1","created_at":"2026-05-18T03:27:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6321","created_at":"2026-05-18T03:27:21Z"},{"alias_kind":"pith_short_12","alias_value":"3TZNHHYSHWCL","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3TZNHHYSHWCLEAI2","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3TZNHHYS","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:f3fa77e0a5c2f9715a4c76c48d694c44752bf3595fd2aae864b166349010d5bc","target":"graph","created_at":"2026-05-18T03:27:21Z","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 an algorithm that for an input n-vertex graph G and integer k>0, in time 2^[O(k)]n either outputs that the treewidth of G is larger than k, or gives a tree decomposition of G of width at most 5k+4. This is the first algorithm providing a constant factor approximation for treewidth which runs in time single-exponential in k and linear in n. Treewidth based computations are subroutines of numerous algorithms. Our algorithm can be used to speed up many such algorithms to work in time which is single-exponential in the treewidth and linear in the input size.","authors_text":"Daniel Lokshtanov, Fedor V. Fomin, Hans Bodlaender, Markus S. Dregi, Micha{\\l} Pilipczuk, P{\\aa}l G. Drange","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-23T15:29:55Z","title":"A O(c^k n) 5-Approximation Algorithm for Treewidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6321","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:b40b43a289fc04cc3b3e50eda920e76eeb46b3655bfa793fb8766e78e5a0b44e","target":"record","created_at":"2026-05-18T03:27:21Z","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":"fbe839185908d5f8c2cf8466574283cc0eca033171328eb568bc7bb97c28265a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-23T15:29:55Z","title_canon_sha256":"37f65fcdb6ef86b0d1b93f17a2a27b1a267780985434ab9a383c6099b3300bc2"},"schema_version":"1.0","source":{"id":"1304.6321","kind":"arxiv","version":1}},"canonical_sha256":"dcf2d39f123d84b2011a9d62275529d9e6212c79c5c25cb5d22305fc3c48fab3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dcf2d39f123d84b2011a9d62275529d9e6212c79c5c25cb5d22305fc3c48fab3","first_computed_at":"2026-05-18T03:27:21.829030Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:21.829030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"umfK9q+cA1BjXJJv+TvLDRcFqPnyx3KM7DOcLIAmTxRUWlVYmgtp1GlCbCT7p8eQxMCUTW9U4M3OI/HS23eRDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:21.829632Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.6321","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b40b43a289fc04cc3b3e50eda920e76eeb46b3655bfa793fb8766e78e5a0b44e","sha256:f3fa77e0a5c2f9715a4c76c48d694c44752bf3595fd2aae864b166349010d5bc"],"state_sha256":"4eaf758a2cafb5ef749632f10dda60b9710e6506919bead3c88a775e87d1e29c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5yuyKqlE3koYTCrULQ6aSbpYV9bXApAAOg4yMd0VHi+q77bhpjLLipHmiuzEUNgfzKgrGr1v8LdYMx9pSnGSAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T20:11:52.991712Z","bundle_sha256":"69965af86e874a864272d17e1ba8bb6e215808a6965d1c4bdaa931be0bbe3715"}}