{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MLXCA7JUMYLIKICGRLMYDJQOQV","short_pith_number":"pith:MLXCA7JU","canonical_record":{"source":{"id":"1601.02415","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-11T12:15:45Z","cross_cats_sorted":[],"title_canon_sha256":"a4bf256338a51633ee9692339ad2d41312d761cf795c962fb5ef499c11aa6894","abstract_canon_sha256":"7a6ed1481d5a5d8f4db755f6829823dc170ccfa1a5062c2cf4fde9f87170aa56"},"schema_version":"1.0"},"canonical_sha256":"62ee207d3466168520468ad981a60e8541244f212aa78dca6cc18256bff5ded1","source":{"kind":"arxiv","id":"1601.02415","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.02415","created_at":"2026-05-18T01:15:38Z"},{"alias_kind":"arxiv_version","alias_value":"1601.02415v2","created_at":"2026-05-18T01:15:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.02415","created_at":"2026-05-18T01:15:38Z"},{"alias_kind":"pith_short_12","alias_value":"MLXCA7JUMYLI","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MLXCA7JUMYLIKICG","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MLXCA7JU","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MLXCA7JUMYLIKICGRLMYDJQOQV","target":"record","payload":{"canonical_record":{"source":{"id":"1601.02415","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-11T12:15:45Z","cross_cats_sorted":[],"title_canon_sha256":"a4bf256338a51633ee9692339ad2d41312d761cf795c962fb5ef499c11aa6894","abstract_canon_sha256":"7a6ed1481d5a5d8f4db755f6829823dc170ccfa1a5062c2cf4fde9f87170aa56"},"schema_version":"1.0"},"canonical_sha256":"62ee207d3466168520468ad981a60e8541244f212aa78dca6cc18256bff5ded1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:38.369190Z","signature_b64":"x1A3xpAvNq0ozhaMvH5tXi+fqcdRVy0H9JpRE6G6D6UAXaCSzCkYOMMgIRN4q8mmqDuzaihY0y/z+0tIXKD3Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62ee207d3466168520468ad981a60e8541244f212aa78dca6cc18256bff5ded1","last_reissued_at":"2026-05-18T01:15:38.368443Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:38.368443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.02415","source_version":2,"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-18T01:15:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3xKi9GsULus1MuEIOZn4o3sQADVrdGCOoJCOcULJ111woTWVdqhdho8sDGmUtti+NNxduHj22JPXr51zcuhGCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:49:30.194035Z"},"content_sha256":"2c6a6036f8ec69d5d5076a460e3f7ea6532cf5d5d1184ba34cdcdbd7f8d7e3ea","schema_version":"1.0","event_id":"sha256:2c6a6036f8ec69d5d5076a460e3f7ea6532cf5d5d1184ba34cdcdbd7f8d7e3ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MLXCA7JUMYLIKICGRLMYDJQOQV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subexponential time algorithms for finding small tree and path decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hans L. Bodlaender, Jesper Nederlof","submitted_at":"2016-01-11T12:15:45Z","abstract_excerpt":"The Minimum Size Tree Decomposition (MSTD) and Minimum Size Path Decomposition (MSPD) problems ask for a given n-vertex graph G and integer k, what is the minimum number of bags of a tree decomposition (respectively, path decomposition) of G of width at most k. The problems are known to be NP-complete for each fixed $k\\geq 4$. We present algorithms that solve both problems for fixed k in $2^{O(n/ \\log n)}$ time and show that they cannot be solved in $2^{o(n / \\log n)}$ time, assuming the Exponential Time Hypothesis."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.02415","kind":"arxiv","version":2},"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-18T01:15:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ErQPAdv74sUqmijUM5fk7WDrrUdL3I/e8kUHFTkk6U3gBU6fmqlo5PMPm2+C+pZlwiJv2D2wjw2MHdx80S94DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:49:30.194725Z"},"content_sha256":"8656fb1cf1e8c9f9214074bdf04616d11331a6f6b756028879b3b2be8d874437","schema_version":"1.0","event_id":"sha256:8656fb1cf1e8c9f9214074bdf04616d11331a6f6b756028879b3b2be8d874437"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MLXCA7JUMYLIKICGRLMYDJQOQV/bundle.json","state_url":"https://pith.science/pith/MLXCA7JUMYLIKICGRLMYDJQOQV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MLXCA7JUMYLIKICGRLMYDJQOQV/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-30T11:49:30Z","links":{"resolver":"https://pith.science/pith/MLXCA7JUMYLIKICGRLMYDJQOQV","bundle":"https://pith.science/pith/MLXCA7JUMYLIKICGRLMYDJQOQV/bundle.json","state":"https://pith.science/pith/MLXCA7JUMYLIKICGRLMYDJQOQV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MLXCA7JUMYLIKICGRLMYDJQOQV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MLXCA7JUMYLIKICGRLMYDJQOQV","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":"7a6ed1481d5a5d8f4db755f6829823dc170ccfa1a5062c2cf4fde9f87170aa56","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-11T12:15:45Z","title_canon_sha256":"a4bf256338a51633ee9692339ad2d41312d761cf795c962fb5ef499c11aa6894"},"schema_version":"1.0","source":{"id":"1601.02415","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.02415","created_at":"2026-05-18T01:15:38Z"},{"alias_kind":"arxiv_version","alias_value":"1601.02415v2","created_at":"2026-05-18T01:15:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.02415","created_at":"2026-05-18T01:15:38Z"},{"alias_kind":"pith_short_12","alias_value":"MLXCA7JUMYLI","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MLXCA7JUMYLIKICG","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MLXCA7JU","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:8656fb1cf1e8c9f9214074bdf04616d11331a6f6b756028879b3b2be8d874437","target":"graph","created_at":"2026-05-18T01:15:38Z","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":"The Minimum Size Tree Decomposition (MSTD) and Minimum Size Path Decomposition (MSPD) problems ask for a given n-vertex graph G and integer k, what is the minimum number of bags of a tree decomposition (respectively, path decomposition) of G of width at most k. The problems are known to be NP-complete for each fixed $k\\geq 4$. We present algorithms that solve both problems for fixed k in $2^{O(n/ \\log n)}$ time and show that they cannot be solved in $2^{o(n / \\log n)}$ time, assuming the Exponential Time Hypothesis.","authors_text":"Hans L. Bodlaender, Jesper Nederlof","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-11T12:15:45Z","title":"Subexponential time algorithms for finding small tree and path decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.02415","kind":"arxiv","version":2},"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:2c6a6036f8ec69d5d5076a460e3f7ea6532cf5d5d1184ba34cdcdbd7f8d7e3ea","target":"record","created_at":"2026-05-18T01:15:38Z","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":"7a6ed1481d5a5d8f4db755f6829823dc170ccfa1a5062c2cf4fde9f87170aa56","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-11T12:15:45Z","title_canon_sha256":"a4bf256338a51633ee9692339ad2d41312d761cf795c962fb5ef499c11aa6894"},"schema_version":"1.0","source":{"id":"1601.02415","kind":"arxiv","version":2}},"canonical_sha256":"62ee207d3466168520468ad981a60e8541244f212aa78dca6cc18256bff5ded1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62ee207d3466168520468ad981a60e8541244f212aa78dca6cc18256bff5ded1","first_computed_at":"2026-05-18T01:15:38.368443Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:38.368443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x1A3xpAvNq0ozhaMvH5tXi+fqcdRVy0H9JpRE6G6D6UAXaCSzCkYOMMgIRN4q8mmqDuzaihY0y/z+0tIXKD3Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:38.369190Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.02415","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c6a6036f8ec69d5d5076a460e3f7ea6532cf5d5d1184ba34cdcdbd7f8d7e3ea","sha256:8656fb1cf1e8c9f9214074bdf04616d11331a6f6b756028879b3b2be8d874437"],"state_sha256":"b86d30b9287b5603660fb9a052a83c2efaea4dd4a11ceeed9d12b3201e2f2079"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dF515t41A/gqiiiU/lQ784x5fStHptd4t0wBBCokjBe9x/nJ+NkXHspVf3hEh0PjTC+Zyu3D3olh7JZO0IDPCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T11:49:30.199278Z","bundle_sha256":"a9a16bfaf8e79c529b972bee924c77cdb39a8ca42dc87511b9eabe5ebc26b2d6"}}