{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:SMGLDU7PEDZETAAML3E4DB2XG3","short_pith_number":"pith:SMGLDU7P","canonical_record":{"source":{"id":"1007.5450","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-07-30T13:49:18Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"4213fd49f67b7c2d7ba3185d3693f1e4820a33a2d1c8e179551f830528517b0e","abstract_canon_sha256":"e0bcc89e551d82419be31262f65ab22613ee9261dbbd98fabee668cfdfa01e09"},"schema_version":"1.0"},"canonical_sha256":"930cb1d3ef20f249800c5ec9c1875736ec059859f464a9244132f5d6950dc815","source":{"kind":"arxiv","id":"1007.5450","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.5450","created_at":"2026-05-18T04:42:45Z"},{"alias_kind":"arxiv_version","alias_value":"1007.5450v1","created_at":"2026-05-18T04:42:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.5450","created_at":"2026-05-18T04:42:45Z"},{"alias_kind":"pith_short_12","alias_value":"SMGLDU7PEDZE","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"SMGLDU7PEDZETAAM","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"SMGLDU7P","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:SMGLDU7PEDZETAAML3E4DB2XG3","target":"record","payload":{"canonical_record":{"source":{"id":"1007.5450","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-07-30T13:49:18Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"4213fd49f67b7c2d7ba3185d3693f1e4820a33a2d1c8e179551f830528517b0e","abstract_canon_sha256":"e0bcc89e551d82419be31262f65ab22613ee9261dbbd98fabee668cfdfa01e09"},"schema_version":"1.0"},"canonical_sha256":"930cb1d3ef20f249800c5ec9c1875736ec059859f464a9244132f5d6950dc815","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:45.200687Z","signature_b64":"FBdYyIe15LHRI/Pym8tuMwbNvMY5OHxulcH13RWA9rxNnXgjjoKd463Kle86VjeVsrqu5KyrZ0kNiWgMcuqcDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"930cb1d3ef20f249800c5ec9c1875736ec059859f464a9244132f5d6950dc815","last_reissued_at":"2026-05-18T04:42:45.200094Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:45.200094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1007.5450","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:42:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EUmWAVcscpbWvXpAVQWONQ1eWex4AP26cc6VWNs3U+jbzTpf90+ilzjonbo9aDDwNT+nwVGy7NuCJCtM77CvCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:19:12.970561Z"},"content_sha256":"57cf7b2104c2da0d0cfcc8d9b5bb75358c082e475caff65c9aa6eee1ab810340","schema_version":"1.0","event_id":"sha256:57cf7b2104c2da0d0cfcc8d9b5bb75358c082e475caff65c9aa6eee1ab810340"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:SMGLDU7PEDZETAAML3E4DB2XG3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, D\\'aniel Marx, Saket Saurabh","submitted_at":"2010-07-30T13:49:18Z","abstract_excerpt":"We obtain a number of lower bounds on the running time of algorithms solving problems on graphs of bounded treewidth. We prove the results under the Strong Exponential Time Hypothesis of Impagliazzo and Paturi. In particular, assuming that SAT cannot be solved in (2-\\epsilon)^{n}m^{O(1)} time, we show that for any e > 0; {\\sc Independent Set} cannot be solved in (2-e)^{tw(G)}|V(G)|^{O(1)} time, {\\sc Dominating Set} cannot be solved in (3-e)^{tw(G)}|V(G)|^{O(1)} time, {\\sc Max Cut} cannot be solved in (2-e)^{tw(G)}|V(G)|^{O(1)} time, {\\sc Odd Cycle Transversal} cannot be solved in (3-e)^{tw(G)}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.5450","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:42:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qHoeK8qUSrptS72jO8p3m3fV+0iUIl1DkKJo+5wxbr8WUEmSsbnhRuvhfixdl/af7THGLdQJv7QwWnchGXEPAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:19:12.970909Z"},"content_sha256":"2fe996e6d61d55cb8dcf703274ad35b9ad50155fae3a5e7f7353bb1551987564","schema_version":"1.0","event_id":"sha256:2fe996e6d61d55cb8dcf703274ad35b9ad50155fae3a5e7f7353bb1551987564"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SMGLDU7PEDZETAAML3E4DB2XG3/bundle.json","state_url":"https://pith.science/pith/SMGLDU7PEDZETAAML3E4DB2XG3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SMGLDU7PEDZETAAML3E4DB2XG3/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-11T09:19:12Z","links":{"resolver":"https://pith.science/pith/SMGLDU7PEDZETAAML3E4DB2XG3","bundle":"https://pith.science/pith/SMGLDU7PEDZETAAML3E4DB2XG3/bundle.json","state":"https://pith.science/pith/SMGLDU7PEDZETAAML3E4DB2XG3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SMGLDU7PEDZETAAML3E4DB2XG3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:SMGLDU7PEDZETAAML3E4DB2XG3","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":"e0bcc89e551d82419be31262f65ab22613ee9261dbbd98fabee668cfdfa01e09","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-07-30T13:49:18Z","title_canon_sha256":"4213fd49f67b7c2d7ba3185d3693f1e4820a33a2d1c8e179551f830528517b0e"},"schema_version":"1.0","source":{"id":"1007.5450","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.5450","created_at":"2026-05-18T04:42:45Z"},{"alias_kind":"arxiv_version","alias_value":"1007.5450v1","created_at":"2026-05-18T04:42:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.5450","created_at":"2026-05-18T04:42:45Z"},{"alias_kind":"pith_short_12","alias_value":"SMGLDU7PEDZE","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"SMGLDU7PEDZETAAM","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"SMGLDU7P","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:2fe996e6d61d55cb8dcf703274ad35b9ad50155fae3a5e7f7353bb1551987564","target":"graph","created_at":"2026-05-18T04:42:45Z","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 obtain a number of lower bounds on the running time of algorithms solving problems on graphs of bounded treewidth. We prove the results under the Strong Exponential Time Hypothesis of Impagliazzo and Paturi. In particular, assuming that SAT cannot be solved in (2-\\epsilon)^{n}m^{O(1)} time, we show that for any e > 0; {\\sc Independent Set} cannot be solved in (2-e)^{tw(G)}|V(G)|^{O(1)} time, {\\sc Dominating Set} cannot be solved in (3-e)^{tw(G)}|V(G)|^{O(1)} time, {\\sc Max Cut} cannot be solved in (2-e)^{tw(G)}|V(G)|^{O(1)} time, {\\sc Odd Cycle Transversal} cannot be solved in (3-e)^{tw(G)}","authors_text":"Daniel Lokshtanov, D\\'aniel Marx, Saket Saurabh","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-07-30T13:49:18Z","title":"Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.5450","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:57cf7b2104c2da0d0cfcc8d9b5bb75358c082e475caff65c9aa6eee1ab810340","target":"record","created_at":"2026-05-18T04:42:45Z","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":"e0bcc89e551d82419be31262f65ab22613ee9261dbbd98fabee668cfdfa01e09","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-07-30T13:49:18Z","title_canon_sha256":"4213fd49f67b7c2d7ba3185d3693f1e4820a33a2d1c8e179551f830528517b0e"},"schema_version":"1.0","source":{"id":"1007.5450","kind":"arxiv","version":1}},"canonical_sha256":"930cb1d3ef20f249800c5ec9c1875736ec059859f464a9244132f5d6950dc815","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"930cb1d3ef20f249800c5ec9c1875736ec059859f464a9244132f5d6950dc815","first_computed_at":"2026-05-18T04:42:45.200094Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:42:45.200094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FBdYyIe15LHRI/Pym8tuMwbNvMY5OHxulcH13RWA9rxNnXgjjoKd463Kle86VjeVsrqu5KyrZ0kNiWgMcuqcDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:42:45.200687Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.5450","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57cf7b2104c2da0d0cfcc8d9b5bb75358c082e475caff65c9aa6eee1ab810340","sha256:2fe996e6d61d55cb8dcf703274ad35b9ad50155fae3a5e7f7353bb1551987564"],"state_sha256":"c167fe436d75202abb8914c1a8508729223797d725b57435c0d46ea919f45d21"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M1fzihCUKze81WDr7uU19arG1YlQBifFwv22WA8w1vwSjwaYTvMODE09A0DqhmjZQX/c+chlwHog0oVza9vjDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T09:19:12.972992Z","bundle_sha256":"b813720aa66fa7faeeeaac0d1ace179eb52f9abf33d5ed357c903f79deeac971"}}