{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ZCGE7SHGB3FR34BDPFNK4QIQ5E","short_pith_number":"pith:ZCGE7SHG","canonical_record":{"source":{"id":"1901.05594","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-17T02:49:30Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d07bbb1209bdc77cd368641aa74d606b767c71fc013ad57b70daf577967f362e","abstract_canon_sha256":"3bc5753852eaf13fb9d35beced4ee4fb1082f0351ef96d6bd44552aada6b484f"},"schema_version":"1.0"},"canonical_sha256":"c88c4fc8e60ecb1df023795aae4110e9398e3e7dde5d83f8df8eea9471befdc7","source":{"kind":"arxiv","id":"1901.05594","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.05594","created_at":"2026-05-17T23:44:42Z"},{"alias_kind":"arxiv_version","alias_value":"1901.05594v2","created_at":"2026-05-17T23:44:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05594","created_at":"2026-05-17T23:44:42Z"},{"alias_kind":"pith_short_12","alias_value":"ZCGE7SHGB3FR","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZCGE7SHGB3FR34BD","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZCGE7SHG","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ZCGE7SHGB3FR34BDPFNK4QIQ5E","target":"record","payload":{"canonical_record":{"source":{"id":"1901.05594","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-17T02:49:30Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d07bbb1209bdc77cd368641aa74d606b767c71fc013ad57b70daf577967f362e","abstract_canon_sha256":"3bc5753852eaf13fb9d35beced4ee4fb1082f0351ef96d6bd44552aada6b484f"},"schema_version":"1.0"},"canonical_sha256":"c88c4fc8e60ecb1df023795aae4110e9398e3e7dde5d83f8df8eea9471befdc7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:42.651128Z","signature_b64":"puBDfQ5PdHePkSIn8wBfTODf19Oe1ZdO9YYx2UVe5xCDm6YnyRWHWKlxHHNggGdsdVg3C8Ih+gam3tdJt+3KBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c88c4fc8e60ecb1df023795aae4110e9398e3e7dde5d83f8df8eea9471befdc7","last_reissued_at":"2026-05-17T23:44:42.650492Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:42.650492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.05594","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-17T23:44:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q6A1p9MKRMxrySJz6/hHaLFUB75VoPc+O4WMx1qyV8X7hU7RK2gN4CQ0aulL33A9Jyy+sUkSPbZKZevtleAWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:25:22.652929Z"},"content_sha256":"e8c0c6dda6e8edd44877e0ee67e044409a12e70fbbad795bec94207c465d4b60","schema_version":"1.0","event_id":"sha256:e8c0c6dda6e8edd44877e0ee67e044409a12e70fbbad795bec94207c465d4b60"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ZCGE7SHGB3FR34BDPFNK4QIQ5E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Queue Layouts of Graphs with Bounded Degree and Bounded Genus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"David R. Wood, Pat Morin, Vida Dujmovi\\'c","submitted_at":"2019-01-17T02:49:30Z","abstract_excerpt":"Motivated by the question of whether planar graphs have bounded queue-number, we prove that planar graphs with maximum degree $\\Delta$ have queue-number $O(\\Delta^{2})$, which improves upon the best previous bound of $O(\\Delta^6)$. More generally, we prove that graphs with bounded degree and bounded Euler genus have bounded queue-number. In particular graphs with Euler genus $g$ and maximum degree $\\Delta$ have queue-number $O(g+\\Delta^{2})$. As a byproduct we prove that if planar graphs have bounded queue-number, then graphs of Euler genus $g$ have queue-number $O(g)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05594","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-17T23:44:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BowIxhekWCwknb9LUqECiBo3CmWWqj+M4+/I8FxBg3Lx2kyBSto2ZkhmOFwtyNuDE1xC2UIZX97B1S5sZf9LCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:25:22.653276Z"},"content_sha256":"fc97c78e67258e0142fab0f6109c32bda616030d7505a09f49ee135c5054cab7","schema_version":"1.0","event_id":"sha256:fc97c78e67258e0142fab0f6109c32bda616030d7505a09f49ee135c5054cab7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZCGE7SHGB3FR34BDPFNK4QIQ5E/bundle.json","state_url":"https://pith.science/pith/ZCGE7SHGB3FR34BDPFNK4QIQ5E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZCGE7SHGB3FR34BDPFNK4QIQ5E/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-26T01:25:22Z","links":{"resolver":"https://pith.science/pith/ZCGE7SHGB3FR34BDPFNK4QIQ5E","bundle":"https://pith.science/pith/ZCGE7SHGB3FR34BDPFNK4QIQ5E/bundle.json","state":"https://pith.science/pith/ZCGE7SHGB3FR34BDPFNK4QIQ5E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZCGE7SHGB3FR34BDPFNK4QIQ5E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZCGE7SHGB3FR34BDPFNK4QIQ5E","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":"3bc5753852eaf13fb9d35beced4ee4fb1082f0351ef96d6bd44552aada6b484f","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-17T02:49:30Z","title_canon_sha256":"d07bbb1209bdc77cd368641aa74d606b767c71fc013ad57b70daf577967f362e"},"schema_version":"1.0","source":{"id":"1901.05594","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.05594","created_at":"2026-05-17T23:44:42Z"},{"alias_kind":"arxiv_version","alias_value":"1901.05594v2","created_at":"2026-05-17T23:44:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05594","created_at":"2026-05-17T23:44:42Z"},{"alias_kind":"pith_short_12","alias_value":"ZCGE7SHGB3FR","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZCGE7SHGB3FR34BD","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZCGE7SHG","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:fc97c78e67258e0142fab0f6109c32bda616030d7505a09f49ee135c5054cab7","target":"graph","created_at":"2026-05-17T23:44:42Z","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":"Motivated by the question of whether planar graphs have bounded queue-number, we prove that planar graphs with maximum degree $\\Delta$ have queue-number $O(\\Delta^{2})$, which improves upon the best previous bound of $O(\\Delta^6)$. More generally, we prove that graphs with bounded degree and bounded Euler genus have bounded queue-number. In particular graphs with Euler genus $g$ and maximum degree $\\Delta$ have queue-number $O(g+\\Delta^{2})$. As a byproduct we prove that if planar graphs have bounded queue-number, then graphs of Euler genus $g$ have queue-number $O(g)$.","authors_text":"David R. Wood, Pat Morin, Vida Dujmovi\\'c","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-17T02:49:30Z","title":"Queue Layouts of Graphs with Bounded Degree and Bounded Genus"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05594","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:e8c0c6dda6e8edd44877e0ee67e044409a12e70fbbad795bec94207c465d4b60","target":"record","created_at":"2026-05-17T23:44:42Z","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":"3bc5753852eaf13fb9d35beced4ee4fb1082f0351ef96d6bd44552aada6b484f","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-17T02:49:30Z","title_canon_sha256":"d07bbb1209bdc77cd368641aa74d606b767c71fc013ad57b70daf577967f362e"},"schema_version":"1.0","source":{"id":"1901.05594","kind":"arxiv","version":2}},"canonical_sha256":"c88c4fc8e60ecb1df023795aae4110e9398e3e7dde5d83f8df8eea9471befdc7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c88c4fc8e60ecb1df023795aae4110e9398e3e7dde5d83f8df8eea9471befdc7","first_computed_at":"2026-05-17T23:44:42.650492Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:42.650492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"puBDfQ5PdHePkSIn8wBfTODf19Oe1ZdO9YYx2UVe5xCDm6YnyRWHWKlxHHNggGdsdVg3C8Ih+gam3tdJt+3KBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:42.651128Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.05594","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8c0c6dda6e8edd44877e0ee67e044409a12e70fbbad795bec94207c465d4b60","sha256:fc97c78e67258e0142fab0f6109c32bda616030d7505a09f49ee135c5054cab7"],"state_sha256":"08c0e6a356d68e7cfcd923c7fa88911d76cd6cf4878a6a5b7f202507143386b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UMGhpltGzVsCgiYfs/BV0jFQzYBLap0hg/VWKrNJVXpPxoz1XoEMoe46vJhkBijuxo8n0LDCvOq3yQdKGgCXCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T01:25:22.655612Z","bundle_sha256":"4207d4a3dab506bb36513d7fb6c9a4721493226354ab687d7bbc83837e438f49"}}