{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:4566PQZ6Y57EFAOMEYM74YXZ3S","short_pith_number":"pith:4566PQZ6","schema_version":"1.0","canonical_sha256":"e77de7c33ec77e4281cc2619fe62f9dc99fd35c133e7e1d7af21a015492850b1","source":{"kind":"arxiv","id":"0911.4162","version":1},"attestation_state":"computed","paper":{"title":"On the book thickness of $k$-trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David R. Wood, Vida Dujmovi\\'c","submitted_at":"2009-11-21T05:39:48Z","abstract_excerpt":"Every $k$-tree has book thickness at most $k+1$, and this bound is best possible for all $k\\geq3$. Vandenbussche et al. (2009) proved that every $k$-tree that has a smooth degree-3 tree decomposition with width $k$ has book thickness at most $k$. We prove this result is best possible for $k\\geq 4$, by constructing a $k$-tree with book thickness $k+1$ that has a smooth degree-4 tree decomposition with width $k$. This solves an open problem of Vandenbussche et al. (2009)"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"0911.4162","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-11-21T05:39:48Z","cross_cats_sorted":[],"title_canon_sha256":"da23104bdf92ba391b06a0b6f65e1c148f4c2a0fe60d23398a713fdb48840f0f","abstract_canon_sha256":"3873e6b76915de5bce227a70149e0588ad61570dc4a0847b8ee4fac91596028a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:23.750095Z","signature_b64":"/hjVL8KX1pwkm4zmcIZWynoXVdUJplkD8J8Af7cpwo2zz0sY/TfzWvpq8Ow+CJ3tMRcwQ3hTELhizJwFqLUyAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e77de7c33ec77e4281cc2619fe62f9dc99fd35c133e7e1d7af21a015492850b1","last_reissued_at":"2026-05-18T03:55:23.749327Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:23.749327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the book thickness of $k$-trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David R. Wood, Vida Dujmovi\\'c","submitted_at":"2009-11-21T05:39:48Z","abstract_excerpt":"Every $k$-tree has book thickness at most $k+1$, and this bound is best possible for all $k\\geq3$. Vandenbussche et al. (2009) proved that every $k$-tree that has a smooth degree-3 tree decomposition with width $k$ has book thickness at most $k$. We prove this result is best possible for $k\\geq 4$, by constructing a $k$-tree with book thickness $k+1$ that has a smooth degree-4 tree decomposition with width $k$. This solves an open problem of Vandenbussche et al. (2009)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.4162","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0911.4162","created_at":"2026-05-18T03:55:23.749463+00:00"},{"alias_kind":"arxiv_version","alias_value":"0911.4162v1","created_at":"2026-05-18T03:55:23.749463+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.4162","created_at":"2026-05-18T03:55:23.749463+00:00"},{"alias_kind":"pith_short_12","alias_value":"4566PQZ6Y57E","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"4566PQZ6Y57EFAOM","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"4566PQZ6","created_at":"2026-05-18T12:25:58.018023+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4566PQZ6Y57EFAOMEYM74YXZ3S","json":"https://pith.science/pith/4566PQZ6Y57EFAOMEYM74YXZ3S.json","graph_json":"https://pith.science/api/pith-number/4566PQZ6Y57EFAOMEYM74YXZ3S/graph.json","events_json":"https://pith.science/api/pith-number/4566PQZ6Y57EFAOMEYM74YXZ3S/events.json","paper":"https://pith.science/paper/4566PQZ6"},"agent_actions":{"view_html":"https://pith.science/pith/4566PQZ6Y57EFAOMEYM74YXZ3S","download_json":"https://pith.science/pith/4566PQZ6Y57EFAOMEYM74YXZ3S.json","view_paper":"https://pith.science/paper/4566PQZ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0911.4162&json=true","fetch_graph":"https://pith.science/api/pith-number/4566PQZ6Y57EFAOMEYM74YXZ3S/graph.json","fetch_events":"https://pith.science/api/pith-number/4566PQZ6Y57EFAOMEYM74YXZ3S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4566PQZ6Y57EFAOMEYM74YXZ3S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4566PQZ6Y57EFAOMEYM74YXZ3S/action/storage_attestation","attest_author":"https://pith.science/pith/4566PQZ6Y57EFAOMEYM74YXZ3S/action/author_attestation","sign_citation":"https://pith.science/pith/4566PQZ6Y57EFAOMEYM74YXZ3S/action/citation_signature","submit_replication":"https://pith.science/pith/4566PQZ6Y57EFAOMEYM74YXZ3S/action/replication_record"}},"created_at":"2026-05-18T03:55:23.749463+00:00","updated_at":"2026-05-18T03:55:23.749463+00:00"}