{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:LCL3YBA2RHHS7ULUV7A6XQVKUI","short_pith_number":"pith:LCL3YBA2","canonical_record":{"source":{"id":"math/0503553","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2005-03-24T15:31:55Z","cross_cats_sorted":[],"title_canon_sha256":"e6dd8943ce9936d5046733f323a6cf4f72c64b50328021300243518ba104484a","abstract_canon_sha256":"f365128ab27e51bed572907e89adb31c00e99f6801c57746e19b8cd91036baf9"},"schema_version":"1.0"},"canonical_sha256":"5897bc041a89cf2fd174afc1ebc2aaa234aad3a0e5222616d1dc1fb44fa33449","source":{"kind":"arxiv","id":"math/0503553","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0503553","created_at":"2026-05-18T01:48:05Z"},{"alias_kind":"arxiv_version","alias_value":"math/0503553v4","created_at":"2026-05-18T01:48:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0503553","created_at":"2026-05-18T01:48:05Z"},{"alias_kind":"pith_short_12","alias_value":"LCL3YBA2RHHS","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"LCL3YBA2RHHS7ULU","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"LCL3YBA2","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:LCL3YBA2RHHS7ULUV7A6XQVKUI","target":"record","payload":{"canonical_record":{"source":{"id":"math/0503553","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2005-03-24T15:31:55Z","cross_cats_sorted":[],"title_canon_sha256":"e6dd8943ce9936d5046733f323a6cf4f72c64b50328021300243518ba104484a","abstract_canon_sha256":"f365128ab27e51bed572907e89adb31c00e99f6801c57746e19b8cd91036baf9"},"schema_version":"1.0"},"canonical_sha256":"5897bc041a89cf2fd174afc1ebc2aaa234aad3a0e5222616d1dc1fb44fa33449","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:48:05.028811Z","signature_b64":"l1SR136os32wSHqN883UYPQT+p6udnBdXcyUJDSiC1CgRwwkUlkqmSYpH3dVjJ5fkQT12a3yYFMmSgPfgjTCBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5897bc041a89cf2fd174afc1ebc2aaa234aad3a0e5222616d1dc1fb44fa33449","last_reissued_at":"2026-05-18T01:48:05.028341Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:48:05.028341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0503553","source_version":4,"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:48:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vdmks9lTbjfQd3+QRf0Q5GLQ9pV0f112pZRLALNosT8QPkBGdFPKZtwkZ0DvHQWbUDVhRjUuCbhJ02q3IhZwCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:05:01.220490Z"},"content_sha256":"e6e9fd488b091b3651113d41a17e1f923dca662e2bcc955a1221822717a26621","schema_version":"1.0","event_id":"sha256:e6e9fd488b091b3651113d41a17e1f923dca662e2bcc955a1221822717a26621"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:LCL3YBA2RHHS7ULUV7A6XQVKUI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Treewidth and Geometric Thickness Parameters","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":"2005-03-24T15:31:55Z","abstract_excerpt":"Consider a drawing of a graph $G$ in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of $G$, is the classical graph parameter \"thickness\". By restricting the edges to be straight, we obtain the \"geometric thickness\". By further restricting the vertices to be in convex position, we obtain the \"book thickness\". This paper studies the relationship between these parameters and treewidth.\n  Our first main result states that for graphs of treewidth $k$, the maximum thickness and the maximum geometric thickness both equal $\\lceil{k/2"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0503553","kind":"arxiv","version":4},"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:48:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2mLV+DxOcinOMX33ptfir5LaaC9PB0EG0RjFhKb2/s2IMU+lSsSheOnwxbLVAdIpg61kj6RkqPZfIVfXVB7MDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:05:01.220846Z"},"content_sha256":"418609aa5a77cc73987d7c797545c311370973b26e39292ed3eae6454986b099","schema_version":"1.0","event_id":"sha256:418609aa5a77cc73987d7c797545c311370973b26e39292ed3eae6454986b099"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LCL3YBA2RHHS7ULUV7A6XQVKUI/bundle.json","state_url":"https://pith.science/pith/LCL3YBA2RHHS7ULUV7A6XQVKUI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LCL3YBA2RHHS7ULUV7A6XQVKUI/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-25T12:05:01Z","links":{"resolver":"https://pith.science/pith/LCL3YBA2RHHS7ULUV7A6XQVKUI","bundle":"https://pith.science/pith/LCL3YBA2RHHS7ULUV7A6XQVKUI/bundle.json","state":"https://pith.science/pith/LCL3YBA2RHHS7ULUV7A6XQVKUI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LCL3YBA2RHHS7ULUV7A6XQVKUI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:LCL3YBA2RHHS7ULUV7A6XQVKUI","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":"f365128ab27e51bed572907e89adb31c00e99f6801c57746e19b8cd91036baf9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2005-03-24T15:31:55Z","title_canon_sha256":"e6dd8943ce9936d5046733f323a6cf4f72c64b50328021300243518ba104484a"},"schema_version":"1.0","source":{"id":"math/0503553","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0503553","created_at":"2026-05-18T01:48:05Z"},{"alias_kind":"arxiv_version","alias_value":"math/0503553v4","created_at":"2026-05-18T01:48:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0503553","created_at":"2026-05-18T01:48:05Z"},{"alias_kind":"pith_short_12","alias_value":"LCL3YBA2RHHS","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"LCL3YBA2RHHS7ULU","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"LCL3YBA2","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:418609aa5a77cc73987d7c797545c311370973b26e39292ed3eae6454986b099","target":"graph","created_at":"2026-05-18T01:48:05Z","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":"Consider a drawing of a graph $G$ in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of $G$, is the classical graph parameter \"thickness\". By restricting the edges to be straight, we obtain the \"geometric thickness\". By further restricting the vertices to be in convex position, we obtain the \"book thickness\". This paper studies the relationship between these parameters and treewidth.\n  Our first main result states that for graphs of treewidth $k$, the maximum thickness and the maximum geometric thickness both equal $\\lceil{k/2","authors_text":"David R. Wood, Vida Dujmovi\\'c","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2005-03-24T15:31:55Z","title":"Graph Treewidth and Geometric Thickness Parameters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0503553","kind":"arxiv","version":4},"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:e6e9fd488b091b3651113d41a17e1f923dca662e2bcc955a1221822717a26621","target":"record","created_at":"2026-05-18T01:48:05Z","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":"f365128ab27e51bed572907e89adb31c00e99f6801c57746e19b8cd91036baf9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2005-03-24T15:31:55Z","title_canon_sha256":"e6dd8943ce9936d5046733f323a6cf4f72c64b50328021300243518ba104484a"},"schema_version":"1.0","source":{"id":"math/0503553","kind":"arxiv","version":4}},"canonical_sha256":"5897bc041a89cf2fd174afc1ebc2aaa234aad3a0e5222616d1dc1fb44fa33449","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5897bc041a89cf2fd174afc1ebc2aaa234aad3a0e5222616d1dc1fb44fa33449","first_computed_at":"2026-05-18T01:48:05.028341Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:48:05.028341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l1SR136os32wSHqN883UYPQT+p6udnBdXcyUJDSiC1CgRwwkUlkqmSYpH3dVjJ5fkQT12a3yYFMmSgPfgjTCBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:48:05.028811Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0503553","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6e9fd488b091b3651113d41a17e1f923dca662e2bcc955a1221822717a26621","sha256:418609aa5a77cc73987d7c797545c311370973b26e39292ed3eae6454986b099"],"state_sha256":"c72af812cb537efafbfa59496260cba796de5b23f2d69d8d0b31a56686f6e318"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3X0/NVZfEPfSAYOKSmW3+1AZlLR+DXOzNH8NjZsD+Xpw1i4r09jP0kjff3FrQn16lcbwfznlt/fyVrsPfmE7Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T12:05:01.223109Z","bundle_sha256":"52b5181f849b72833cf0d4f7b441034e20f61b942a4a163a9fbeb98027bd79a4"}}