{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:EL5INSIGUF7QL7CSHOJLO7KXPW","short_pith_number":"pith:EL5INSIG","canonical_record":{"source":{"id":"1103.0534","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-02T20:36:20Z","cross_cats_sorted":[],"title_canon_sha256":"512ef096c2e81c6e0a0a212676d97ba61f2099fd0b64a48c93088fdf1767bb2d","abstract_canon_sha256":"4bf2d978a2a0bc6cf0901c05f8c1c5ff9bde2cb9d17eb85ecfe7dfa8fe16b8d2"},"schema_version":"1.0"},"canonical_sha256":"22fa86c906a17f05fc523b92b77d577d91c2e98606467f3f9be87b8242727036","source":{"kind":"arxiv","id":"1103.0534","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.0534","created_at":"2026-05-18T04:27:34Z"},{"alias_kind":"arxiv_version","alias_value":"1103.0534v1","created_at":"2026-05-18T04:27:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0534","created_at":"2026-05-18T04:27:34Z"},{"alias_kind":"pith_short_12","alias_value":"EL5INSIGUF7Q","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"EL5INSIGUF7QL7CS","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"EL5INSIG","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:EL5INSIGUF7QL7CSHOJLO7KXPW","target":"record","payload":{"canonical_record":{"source":{"id":"1103.0534","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-02T20:36:20Z","cross_cats_sorted":[],"title_canon_sha256":"512ef096c2e81c6e0a0a212676d97ba61f2099fd0b64a48c93088fdf1767bb2d","abstract_canon_sha256":"4bf2d978a2a0bc6cf0901c05f8c1c5ff9bde2cb9d17eb85ecfe7dfa8fe16b8d2"},"schema_version":"1.0"},"canonical_sha256":"22fa86c906a17f05fc523b92b77d577d91c2e98606467f3f9be87b8242727036","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:34.669489Z","signature_b64":"4Do4AqFMqosgGyQXQc/ZDgkaXx+brg2h0uCtZoelrjZpjZW+nNHsNaA3z+poNVQlejCDkWDOHnBUuY6CvtAHAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22fa86c906a17f05fc523b92b77d577d91c2e98606467f3f9be87b8242727036","last_reissued_at":"2026-05-18T04:27:34.669011Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:34.669011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.0534","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-18T04:27:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hFxS07b2Pq2Sp7YxOS0rcXogsQPk5LnXVmNpNBHqy9rFmBNubId4xZSd/9awk+5Asrgb3IuG8mZe1t2AWmY7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T02:42:01.151813Z"},"content_sha256":"51ea1cb73635d9eb73a1a158fb2bd752dbd47845460db83cbd625fa226eb79ca","schema_version":"1.0","event_id":"sha256:51ea1cb73635d9eb73a1a158fb2bd752dbd47845460db83cbd625fa226eb79ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:EL5INSIGUF7QL7CSHOJLO7KXPW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving connectivity problems parameterized by treewidth in single exponential time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jakub Onufry Wojtaszczyk, Jesper Nederlof, Johan van Rooij, Marcin Pilipczuk, Marek Cygan, Micha{\\l} Pilipczuk","submitted_at":"2011-03-02T20:36:20Z","abstract_excerpt":"For the vast majority of local graph problems standard dynamic programming techniques give c^tw V^O(1) algorithms, where tw is the treewidth of the input graph. On the other hand, for problems with a global requirement (usually connectivity) the best-known algorithms were naive dynamic programming schemes running in tw^O(tw) V^O(1) time.\n  We breach this gap by introducing a technique we dubbed Cut&Count that allows to produce c^tw V^O(1) Monte Carlo algorithms for most connectivity-type problems, including Hamiltonian Path, Feedback Vertex Set and Connected Dominating Set, consequently answer"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0534","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-18T04:27:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BNRN/dZ4TgL5wYdvmWEueCElK6zxrT5jAFX8yewtwZXWDXIl8/CX0JBER0R0ZHe561H09lDvr4f/xogk6dq/BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T02:42:01.152451Z"},"content_sha256":"4088524d727669171020354e2cad3aaa70f11a29f8e76d045d59b894b899699f","schema_version":"1.0","event_id":"sha256:4088524d727669171020354e2cad3aaa70f11a29f8e76d045d59b894b899699f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EL5INSIGUF7QL7CSHOJLO7KXPW/bundle.json","state_url":"https://pith.science/pith/EL5INSIGUF7QL7CSHOJLO7KXPW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EL5INSIGUF7QL7CSHOJLO7KXPW/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-19T02:42:01Z","links":{"resolver":"https://pith.science/pith/EL5INSIGUF7QL7CSHOJLO7KXPW","bundle":"https://pith.science/pith/EL5INSIGUF7QL7CSHOJLO7KXPW/bundle.json","state":"https://pith.science/pith/EL5INSIGUF7QL7CSHOJLO7KXPW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EL5INSIGUF7QL7CSHOJLO7KXPW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:EL5INSIGUF7QL7CSHOJLO7KXPW","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":"4bf2d978a2a0bc6cf0901c05f8c1c5ff9bde2cb9d17eb85ecfe7dfa8fe16b8d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-02T20:36:20Z","title_canon_sha256":"512ef096c2e81c6e0a0a212676d97ba61f2099fd0b64a48c93088fdf1767bb2d"},"schema_version":"1.0","source":{"id":"1103.0534","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.0534","created_at":"2026-05-18T04:27:34Z"},{"alias_kind":"arxiv_version","alias_value":"1103.0534v1","created_at":"2026-05-18T04:27:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0534","created_at":"2026-05-18T04:27:34Z"},{"alias_kind":"pith_short_12","alias_value":"EL5INSIGUF7Q","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"EL5INSIGUF7QL7CS","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"EL5INSIG","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:4088524d727669171020354e2cad3aaa70f11a29f8e76d045d59b894b899699f","target":"graph","created_at":"2026-05-18T04:27:34Z","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":"For the vast majority of local graph problems standard dynamic programming techniques give c^tw V^O(1) algorithms, where tw is the treewidth of the input graph. On the other hand, for problems with a global requirement (usually connectivity) the best-known algorithms were naive dynamic programming schemes running in tw^O(tw) V^O(1) time.\n  We breach this gap by introducing a technique we dubbed Cut&Count that allows to produce c^tw V^O(1) Monte Carlo algorithms for most connectivity-type problems, including Hamiltonian Path, Feedback Vertex Set and Connected Dominating Set, consequently answer","authors_text":"Jakub Onufry Wojtaszczyk, Jesper Nederlof, Johan van Rooij, Marcin Pilipczuk, Marek Cygan, Micha{\\l} Pilipczuk","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-02T20:36:20Z","title":"Solving connectivity problems parameterized by treewidth in single exponential time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0534","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:51ea1cb73635d9eb73a1a158fb2bd752dbd47845460db83cbd625fa226eb79ca","target":"record","created_at":"2026-05-18T04:27:34Z","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":"4bf2d978a2a0bc6cf0901c05f8c1c5ff9bde2cb9d17eb85ecfe7dfa8fe16b8d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-02T20:36:20Z","title_canon_sha256":"512ef096c2e81c6e0a0a212676d97ba61f2099fd0b64a48c93088fdf1767bb2d"},"schema_version":"1.0","source":{"id":"1103.0534","kind":"arxiv","version":1}},"canonical_sha256":"22fa86c906a17f05fc523b92b77d577d91c2e98606467f3f9be87b8242727036","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22fa86c906a17f05fc523b92b77d577d91c2e98606467f3f9be87b8242727036","first_computed_at":"2026-05-18T04:27:34.669011Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:27:34.669011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4Do4AqFMqosgGyQXQc/ZDgkaXx+brg2h0uCtZoelrjZpjZW+nNHsNaA3z+poNVQlejCDkWDOHnBUuY6CvtAHAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:27:34.669489Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.0534","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51ea1cb73635d9eb73a1a158fb2bd752dbd47845460db83cbd625fa226eb79ca","sha256:4088524d727669171020354e2cad3aaa70f11a29f8e76d045d59b894b899699f"],"state_sha256":"1e13289653a4a10a66ad0aaa5d27d24686a0d29c162ef330281b651e79b68b8d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qhhVhjExXqbENFdovqv+aKLQ4xUFIYUpmGoL3wB+PIenygmVIYHFginbCZgqF9+qksqcqvuEqJY+Q+050rAoBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T02:42:01.154073Z","bundle_sha256":"5870375e3d06fb93241377db027b2b13f61effaf6d855554343c92e195e35fc4"}}