{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VT45FJ4P5KUY3TLCUV6UH7BRTH","short_pith_number":"pith:VT45FJ4P","schema_version":"1.0","canonical_sha256":"acf9d2a78feaa98dcd62a57d43fc3199d5bca931ce40d278d3467a7044a1dd67","source":{"kind":"arxiv","id":"1808.10841","version":2},"attestation_state":"computed","paper":{"title":"Queue Layouts of Planar 3-Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jawaherul Md. Alam, Martin Gronemann, Michael A. Bekos, Michael Kaufmann, Sergey Pupyrev","submitted_at":"2018-08-31T16:59:06Z","abstract_excerpt":"A queue layout of a graph G consists of a linear order of the vertices of G and a partition of the edges of G into queues, so that no two independent edges of the same queue are nested. The queue number of G is the minimum number of queues required by any queue layout of G.\n  In this paper, we continue the study of the queue number of planar 3-trees. As opposed to general planar graphs, whose queue number is not known to be bounded by a constant, the queue number of planar 3-trees has been shown to be at most seven. In this work, we improve the upper bound to five. We also show that there exis"},"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":"1808.10841","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-31T16:59:06Z","cross_cats_sorted":[],"title_canon_sha256":"b55c71a08affb6cab48ca6751eabcfd87f0e1a49988b5dfc74f4d9aa99a31bc1","abstract_canon_sha256":"93f9f5b3d27536647e2a14f3b13d510572388fcc59fa5919960a9d9d2115ea65"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:19.947045Z","signature_b64":"E2DWgIoM0Z7lNaYK9NnbGh5z/wVbtq3WorsdWbI03cYka9kO2+5ieMpqZPSpWfFKvC4Ak2JDZxnRsncd3YCECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acf9d2a78feaa98dcd62a57d43fc3199d5bca931ce40d278d3467a7044a1dd67","last_reissued_at":"2026-05-18T00:06:19.946439Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:19.946439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Queue Layouts of Planar 3-Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jawaherul Md. Alam, Martin Gronemann, Michael A. Bekos, Michael Kaufmann, Sergey Pupyrev","submitted_at":"2018-08-31T16:59:06Z","abstract_excerpt":"A queue layout of a graph G consists of a linear order of the vertices of G and a partition of the edges of G into queues, so that no two independent edges of the same queue are nested. The queue number of G is the minimum number of queues required by any queue layout of G.\n  In this paper, we continue the study of the queue number of planar 3-trees. As opposed to general planar graphs, whose queue number is not known to be bounded by a constant, the queue number of planar 3-trees has been shown to be at most seven. In this work, we improve the upper bound to five. We also show that there exis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10841","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1808.10841","created_at":"2026-05-18T00:06:19.946529+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.10841v2","created_at":"2026-05-18T00:06:19.946529+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10841","created_at":"2026-05-18T00:06:19.946529+00:00"},{"alias_kind":"pith_short_12","alias_value":"VT45FJ4P5KUY","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VT45FJ4P5KUY3TLC","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VT45FJ4P","created_at":"2026-05-18T12:32:59.047623+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/VT45FJ4P5KUY3TLCUV6UH7BRTH","json":"https://pith.science/pith/VT45FJ4P5KUY3TLCUV6UH7BRTH.json","graph_json":"https://pith.science/api/pith-number/VT45FJ4P5KUY3TLCUV6UH7BRTH/graph.json","events_json":"https://pith.science/api/pith-number/VT45FJ4P5KUY3TLCUV6UH7BRTH/events.json","paper":"https://pith.science/paper/VT45FJ4P"},"agent_actions":{"view_html":"https://pith.science/pith/VT45FJ4P5KUY3TLCUV6UH7BRTH","download_json":"https://pith.science/pith/VT45FJ4P5KUY3TLCUV6UH7BRTH.json","view_paper":"https://pith.science/paper/VT45FJ4P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.10841&json=true","fetch_graph":"https://pith.science/api/pith-number/VT45FJ4P5KUY3TLCUV6UH7BRTH/graph.json","fetch_events":"https://pith.science/api/pith-number/VT45FJ4P5KUY3TLCUV6UH7BRTH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VT45FJ4P5KUY3TLCUV6UH7BRTH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VT45FJ4P5KUY3TLCUV6UH7BRTH/action/storage_attestation","attest_author":"https://pith.science/pith/VT45FJ4P5KUY3TLCUV6UH7BRTH/action/author_attestation","sign_citation":"https://pith.science/pith/VT45FJ4P5KUY3TLCUV6UH7BRTH/action/citation_signature","submit_replication":"https://pith.science/pith/VT45FJ4P5KUY3TLCUV6UH7BRTH/action/replication_record"}},"created_at":"2026-05-18T00:06:19.946529+00:00","updated_at":"2026-05-18T00:06:19.946529+00:00"}