{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:BELSCZXESJ25UQW5JX6ZF4GROO","short_pith_number":"pith:BELSCZXE","canonical_record":{"source":{"id":"1107.1177","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-06T16:28:54Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"77a48870f43e130163f47f8cf4f3da3a055f503b65d7d5c7aaf4f8fd5a29c1ea","abstract_canon_sha256":"e1503c3bfbe84d2d04357c311a9ae9fad477c2b5c4a96f14bde6433c76b5c63a"},"schema_version":"1.0"},"canonical_sha256":"09172166e49275da42dd4dfd92f0d173a9547a260dae6ca50161e4086377dc04","source":{"kind":"arxiv","id":"1107.1177","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.1177","created_at":"2026-05-18T02:21:43Z"},{"alias_kind":"arxiv_version","alias_value":"1107.1177v1","created_at":"2026-05-18T02:21:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1177","created_at":"2026-05-18T02:21:43Z"},{"alias_kind":"pith_short_12","alias_value":"BELSCZXESJ25","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BELSCZXESJ25UQW5","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BELSCZXE","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:BELSCZXESJ25UQW5JX6ZF4GROO","target":"record","payload":{"canonical_record":{"source":{"id":"1107.1177","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-06T16:28:54Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"77a48870f43e130163f47f8cf4f3da3a055f503b65d7d5c7aaf4f8fd5a29c1ea","abstract_canon_sha256":"e1503c3bfbe84d2d04357c311a9ae9fad477c2b5c4a96f14bde6433c76b5c63a"},"schema_version":"1.0"},"canonical_sha256":"09172166e49275da42dd4dfd92f0d173a9547a260dae6ca50161e4086377dc04","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:43.454282Z","signature_b64":"Pp1/jWJR3zQzZ5soDnCEOIdRsX8qC2LdLrAvWwwrxUyMDWKj37nnus12sGsftVrxFmKOKlVZgJ2XNcereP3qAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09172166e49275da42dd4dfd92f0d173a9547a260dae6ca50161e4086377dc04","last_reissued_at":"2026-05-18T02:21:43.453868Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:43.453868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.1177","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-18T02:21:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FXYLwnYDou22B5MupyE8LGVrnePv675l6zm52pXzJHj02xUbh5EJQcwycAGGvgUWCWBNbjM92oVX9Md8+bLlCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:52:31.713740Z"},"content_sha256":"fa2aef1399e53b4f024c1d67dc45baacde08126467540253cdf4921064c57587","schema_version":"1.0","event_id":"sha256:fa2aef1399e53b4f024c1d67dc45baacde08126467540253cdf4921064c57587"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:BELSCZXESJ25UQW5JX6ZF4GROO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Not So Easy Problems for Tree Decomposable Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Stefan Szeider","submitted_at":"2011-07-06T16:28:54Z","abstract_excerpt":"We consider combinatorial problems that can be solved in polynomial time for graphs of bounded treewidth but where the order of the polynomial that bounds the running time is expected to depend on the treewidth bound. First we review some recent results for problems regarding list and equitable colorings, general factors, and generalized satisfiability. Second we establish a new hardness result for the problem of minimizing the maximum weighted outdegree for orientations of edge-weighted graphs of bounded treewidth."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1177","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-18T02:21:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5xCI1cko7Zhd2AG8G+E3g9C31vki0SZx5DQDv8HJX8JBlt27N5GaTcpOwOVry1lrLDyPidEN5YRwjlnw+NmEDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:52:31.714285Z"},"content_sha256":"88a636c7ddf27c571e5fed8e82b62a842a6a5d2a464c823d3d6ea8fd10ca67f5","schema_version":"1.0","event_id":"sha256:88a636c7ddf27c571e5fed8e82b62a842a6a5d2a464c823d3d6ea8fd10ca67f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BELSCZXESJ25UQW5JX6ZF4GROO/bundle.json","state_url":"https://pith.science/pith/BELSCZXESJ25UQW5JX6ZF4GROO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BELSCZXESJ25UQW5JX6ZF4GROO/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-29T16:52:31Z","links":{"resolver":"https://pith.science/pith/BELSCZXESJ25UQW5JX6ZF4GROO","bundle":"https://pith.science/pith/BELSCZXESJ25UQW5JX6ZF4GROO/bundle.json","state":"https://pith.science/pith/BELSCZXESJ25UQW5JX6ZF4GROO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BELSCZXESJ25UQW5JX6ZF4GROO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:BELSCZXESJ25UQW5JX6ZF4GROO","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":"e1503c3bfbe84d2d04357c311a9ae9fad477c2b5c4a96f14bde6433c76b5c63a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-06T16:28:54Z","title_canon_sha256":"77a48870f43e130163f47f8cf4f3da3a055f503b65d7d5c7aaf4f8fd5a29c1ea"},"schema_version":"1.0","source":{"id":"1107.1177","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.1177","created_at":"2026-05-18T02:21:43Z"},{"alias_kind":"arxiv_version","alias_value":"1107.1177v1","created_at":"2026-05-18T02:21:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1177","created_at":"2026-05-18T02:21:43Z"},{"alias_kind":"pith_short_12","alias_value":"BELSCZXESJ25","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BELSCZXESJ25UQW5","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BELSCZXE","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:88a636c7ddf27c571e5fed8e82b62a842a6a5d2a464c823d3d6ea8fd10ca67f5","target":"graph","created_at":"2026-05-18T02:21:43Z","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 consider combinatorial problems that can be solved in polynomial time for graphs of bounded treewidth but where the order of the polynomial that bounds the running time is expected to depend on the treewidth bound. First we review some recent results for problems regarding list and equitable colorings, general factors, and generalized satisfiability. Second we establish a new hardness result for the problem of minimizing the maximum weighted outdegree for orientations of edge-weighted graphs of bounded treewidth.","authors_text":"Stefan Szeider","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-06T16:28:54Z","title":"Not So Easy Problems for Tree Decomposable Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1177","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:fa2aef1399e53b4f024c1d67dc45baacde08126467540253cdf4921064c57587","target":"record","created_at":"2026-05-18T02:21:43Z","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":"e1503c3bfbe84d2d04357c311a9ae9fad477c2b5c4a96f14bde6433c76b5c63a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-06T16:28:54Z","title_canon_sha256":"77a48870f43e130163f47f8cf4f3da3a055f503b65d7d5c7aaf4f8fd5a29c1ea"},"schema_version":"1.0","source":{"id":"1107.1177","kind":"arxiv","version":1}},"canonical_sha256":"09172166e49275da42dd4dfd92f0d173a9547a260dae6ca50161e4086377dc04","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"09172166e49275da42dd4dfd92f0d173a9547a260dae6ca50161e4086377dc04","first_computed_at":"2026-05-18T02:21:43.453868Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:43.453868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Pp1/jWJR3zQzZ5soDnCEOIdRsX8qC2LdLrAvWwwrxUyMDWKj37nnus12sGsftVrxFmKOKlVZgJ2XNcereP3qAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:43.454282Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.1177","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa2aef1399e53b4f024c1d67dc45baacde08126467540253cdf4921064c57587","sha256:88a636c7ddf27c571e5fed8e82b62a842a6a5d2a464c823d3d6ea8fd10ca67f5"],"state_sha256":"0063fa195d415df8d07ed5a6464898210a568c050a9e4f085c89909cabb1d790"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VAMO9LTe8ZyycZv/LxvpUQryMUurgr7Nq2NA3eTwrzdjwvKlRVvRpjuF5EEyRACY5pNcvHaQ7cVGz+SUtYlwCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T16:52:31.716473Z","bundle_sha256":"e5a8aaca126fe8855b72edaa29096f999a484d2c88284ae6974b42987fdcbcf2"}}