{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2RO774ZLMP5DDYB5H4ERLAR7JA","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":"f875bded360758b5c04bceb69bde4d8a430ae29b6a47e3f76e55d4c1e14a490d","cross_cats_sorted":["cs.CG","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-08-22T09:03:37Z","title_canon_sha256":"75acfeec6b937a01d59448e25a66bc0c5f2d2e99b4947a2e4e8958c3da97bbeb"},"schema_version":"1.0","source":{"id":"1608.06091","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.06091","created_at":"2026-05-18T01:08:22Z"},{"alias_kind":"arxiv_version","alias_value":"1608.06091v1","created_at":"2026-05-18T01:08:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06091","created_at":"2026-05-18T01:08:22Z"},{"alias_kind":"pith_short_12","alias_value":"2RO774ZLMP5D","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2RO774ZLMP5DDYB5","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2RO774ZL","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:93757eb7bd6d1944da06f8eda1f4f5921cd7bfe763aa4c1aabc21afbb9979bff","target":"graph","created_at":"2026-05-18T01:08:22Z","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":"A queue layout of a graph consists of a linear order on the vertices and an assignment of the edges to queues, such that no two edges in a single queue are nested. The minimum number of queues needed in a queue layout of a graph is called its queue-number.\n  We show that for each $k\\geq1$, graphs with tree-width at most $k$ have queue-number at most $2^k-1$. This improves upon double exponential upper bounds due to Dujmovi\\'c et al. and Giacomo et al. As a consequence we obtain that these graphs have track-number at most $2^{O(k^2)}$.\n  We complement these results by a construction of $k$-tree","authors_text":"Veit Wiechert","cross_cats":["cs.CG","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-08-22T09:03:37Z","title":"On the queue-number of graphs with bounded tree-width"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06091","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:31df75920f301ce0ed739b19ead41ac975292cc551ee01daa9d9149d08206dd5","target":"record","created_at":"2026-05-18T01:08:22Z","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":"f875bded360758b5c04bceb69bde4d8a430ae29b6a47e3f76e55d4c1e14a490d","cross_cats_sorted":["cs.CG","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-08-22T09:03:37Z","title_canon_sha256":"75acfeec6b937a01d59448e25a66bc0c5f2d2e99b4947a2e4e8958c3da97bbeb"},"schema_version":"1.0","source":{"id":"1608.06091","kind":"arxiv","version":1}},"canonical_sha256":"d45dfff32b63fa31e03d3f0915823f4805a3decb66c7e272c5744bb8e91987d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d45dfff32b63fa31e03d3f0915823f4805a3decb66c7e272c5744bb8e91987d6","first_computed_at":"2026-05-18T01:08:22.320754Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:22.320754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"btWv9Xbul9n4ZLAK4p3rJbt9Lf1abbtYmRvL9TMcFuuDpPJrTwk9wmE2bg8ELLt7SlPP3vo3F1S4qwswLSJCDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:22.321407Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.06091","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31df75920f301ce0ed739b19ead41ac975292cc551ee01daa9d9149d08206dd5","sha256:93757eb7bd6d1944da06f8eda1f4f5921cd7bfe763aa4c1aabc21afbb9979bff"],"state_sha256":"4b2a1b7a9f78cbf866fc0e4e8025780c3874fe62cecf5c16e4e73efb7fa0820d"}