{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:3YHGSRVZT2EV4QA3JUTE7JLJJP","short_pith_number":"pith:3YHGSRVZ","canonical_record":{"source":{"id":"1211.1505","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-07T10:38:52Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"8a040e5fc7520a0b56f1cfabe6e08b4cca8cfc709dc4975a304df60dfbff2962","abstract_canon_sha256":"a23a7efb7b17fdccbc22ad0ce3b89a4fe407946fe44eaf36f26a3fd508c9f531"},"schema_version":"1.0"},"canonical_sha256":"de0e6946b99e895e401b4d264fa5694bcbd5b0159729e0e3d2c7ccdbf14948da","source":{"kind":"arxiv","id":"1211.1505","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.1505","created_at":"2026-05-18T03:41:20Z"},{"alias_kind":"arxiv_version","alias_value":"1211.1505v1","created_at":"2026-05-18T03:41:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1505","created_at":"2026-05-18T03:41:20Z"},{"alias_kind":"pith_short_12","alias_value":"3YHGSRVZT2EV","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"3YHGSRVZT2EV4QA3","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"3YHGSRVZ","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:3YHGSRVZT2EV4QA3JUTE7JLJJP","target":"record","payload":{"canonical_record":{"source":{"id":"1211.1505","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-07T10:38:52Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"8a040e5fc7520a0b56f1cfabe6e08b4cca8cfc709dc4975a304df60dfbff2962","abstract_canon_sha256":"a23a7efb7b17fdccbc22ad0ce3b89a4fe407946fe44eaf36f26a3fd508c9f531"},"schema_version":"1.0"},"canonical_sha256":"de0e6946b99e895e401b4d264fa5694bcbd5b0159729e0e3d2c7ccdbf14948da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:20.837153Z","signature_b64":"qQ3kjOqO2IqQjyoUhA4GkFKMS6UBCmcKgAmJgtw9OBK+3XHN8YbjlSxFmLf8hpJJjluWA89C4iXejoEbmBnCDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de0e6946b99e895e401b4d264fa5694bcbd5b0159729e0e3d2c7ccdbf14948da","last_reissued_at":"2026-05-18T03:41:20.836802Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:20.836802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.1505","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:41:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"47zq2wSkpRYVsbbROVWlGxhyJkZm1ONWGchw2WyJrIdUT/kFmQMx40Nh1ayvH1JqZBKzYWFjMQDsNKX9L4QuCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:41:09.288482Z"},"content_sha256":"bbfdf460041c17e6cf0c2e10c0d43a69bee040ebe7f75103d6d9c5ba409ce0d3","schema_version":"1.0","event_id":"sha256:bbfdf460041c17e6cf0c2e10c0d43a69bee040ebe7f75103d6d9c5ba409ce0d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:3YHGSRVZT2EV4QA3JUTE7JLJJP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Hans L. Bodlaender, Jesper Nederlof, Marek Cygan, Stefan Kratsch","submitted_at":"2012-11-07T10:38:52Z","abstract_excerpt":"It is well known that many local graph problems, like Vertex Cover and Dominating Set, can be solved in 2^{O(tw)}|V|^{O(1)} time for graphs G=(V,E) with a given tree decomposition of width tw. However, for nonlocal problems, like the fundamental class of connectivity problems, for a long time we did not know how to do this faster than tw^{O(tw)}|V|^{O(1)}. Recently, Cygan et al. (FOCS 2011) presented Monte Carlo algorithms for a wide range of connectivity problems running in time $c^{tw}|V|^{O(1)} for a small constant c, e.g., for Hamiltonian Cycle and Steiner tree. Naturally, this raises the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1505","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:41:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OosO0eTPUVkKLRaHNt8CtWM7eWdNWCyRuGI4Zc1w7jVEVWQo+jABT4PwtC3GYHlXIg3Xn9X56QYl+igD0EYfDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:41:09.289135Z"},"content_sha256":"b193d5604d9da1352078e11d35a4d25abfdf81ba8fb6c3f5296d18b26fee9543","schema_version":"1.0","event_id":"sha256:b193d5604d9da1352078e11d35a4d25abfdf81ba8fb6c3f5296d18b26fee9543"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3YHGSRVZT2EV4QA3JUTE7JLJJP/bundle.json","state_url":"https://pith.science/pith/3YHGSRVZT2EV4QA3JUTE7JLJJP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3YHGSRVZT2EV4QA3JUTE7JLJJP/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-30T21:41:09Z","links":{"resolver":"https://pith.science/pith/3YHGSRVZT2EV4QA3JUTE7JLJJP","bundle":"https://pith.science/pith/3YHGSRVZT2EV4QA3JUTE7JLJJP/bundle.json","state":"https://pith.science/pith/3YHGSRVZT2EV4QA3JUTE7JLJJP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3YHGSRVZT2EV4QA3JUTE7JLJJP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3YHGSRVZT2EV4QA3JUTE7JLJJP","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":"a23a7efb7b17fdccbc22ad0ce3b89a4fe407946fe44eaf36f26a3fd508c9f531","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-07T10:38:52Z","title_canon_sha256":"8a040e5fc7520a0b56f1cfabe6e08b4cca8cfc709dc4975a304df60dfbff2962"},"schema_version":"1.0","source":{"id":"1211.1505","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.1505","created_at":"2026-05-18T03:41:20Z"},{"alias_kind":"arxiv_version","alias_value":"1211.1505v1","created_at":"2026-05-18T03:41:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1505","created_at":"2026-05-18T03:41:20Z"},{"alias_kind":"pith_short_12","alias_value":"3YHGSRVZT2EV","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"3YHGSRVZT2EV4QA3","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"3YHGSRVZ","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:b193d5604d9da1352078e11d35a4d25abfdf81ba8fb6c3f5296d18b26fee9543","target":"graph","created_at":"2026-05-18T03:41:20Z","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":"It is well known that many local graph problems, like Vertex Cover and Dominating Set, can be solved in 2^{O(tw)}|V|^{O(1)} time for graphs G=(V,E) with a given tree decomposition of width tw. However, for nonlocal problems, like the fundamental class of connectivity problems, for a long time we did not know how to do this faster than tw^{O(tw)}|V|^{O(1)}. Recently, Cygan et al. (FOCS 2011) presented Monte Carlo algorithms for a wide range of connectivity problems running in time $c^{tw}|V|^{O(1)} for a small constant c, e.g., for Hamiltonian Cycle and Steiner tree. Naturally, this raises the ","authors_text":"Hans L. Bodlaender, Jesper Nederlof, Marek Cygan, Stefan Kratsch","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-07T10:38:52Z","title":"Solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1505","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:bbfdf460041c17e6cf0c2e10c0d43a69bee040ebe7f75103d6d9c5ba409ce0d3","target":"record","created_at":"2026-05-18T03:41:20Z","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":"a23a7efb7b17fdccbc22ad0ce3b89a4fe407946fe44eaf36f26a3fd508c9f531","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-07T10:38:52Z","title_canon_sha256":"8a040e5fc7520a0b56f1cfabe6e08b4cca8cfc709dc4975a304df60dfbff2962"},"schema_version":"1.0","source":{"id":"1211.1505","kind":"arxiv","version":1}},"canonical_sha256":"de0e6946b99e895e401b4d264fa5694bcbd5b0159729e0e3d2c7ccdbf14948da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de0e6946b99e895e401b4d264fa5694bcbd5b0159729e0e3d2c7ccdbf14948da","first_computed_at":"2026-05-18T03:41:20.836802Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:20.836802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qQ3kjOqO2IqQjyoUhA4GkFKMS6UBCmcKgAmJgtw9OBK+3XHN8YbjlSxFmLf8hpJJjluWA89C4iXejoEbmBnCDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:20.837153Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.1505","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbfdf460041c17e6cf0c2e10c0d43a69bee040ebe7f75103d6d9c5ba409ce0d3","sha256:b193d5604d9da1352078e11d35a4d25abfdf81ba8fb6c3f5296d18b26fee9543"],"state_sha256":"6af8a277e0d246c05b49cdc612ee50ff95b2763b46a11fb1248556b041cd421f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HqmH89nkQpcVFFpcO5lBt6WjGL6RGdpEO9LaxhHD6cXjQ3od3npKMIcUNJdgtkI9xAj+F3GcEPSdfxBvhF48BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T21:41:09.292414Z","bundle_sha256":"1c7114e28584c35f27cfbd595df6cac1027400c34361162a10480b1f4daf5648"}}